Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alexandre Goldsztejn

dblp:g/AlexandreGoldsztejn · DBLP profile ↗
← Back
25ranked-venue papers
8as first author
3since 2021 · last 2024
0000-0002-6561-5888ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 16 · 7 first-authorSoftware engineering, systems software and programming languages · 11 · 6 first-authorSystems, architecture and hardware · 3 · 1 since 2021Theory of computation · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
Robot manipulation · 41% Motion planning and robot control · 37% 3D vision · 11%
Theoretical computer science
4 papers
Mathematical optimization · 47% Computational complexity · 21% Computational geometry · 21%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%

Topics — the 14 heaviest of 19, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
continuum robot
0.612022
Singularity Conditions for Continuum Parallel Robots · IEEE Trans. Robotics 2022
Robotics › Robot manipulation › continuum robot
parallel continuum robot
0.612022
Singularity Conditions for Continuum Parallel Robots · IEEE Trans. Robotics 2022
Robotics › Motion planning and robot control
singularity analysis
0.612022
Singularity Conditions for Continuum Parallel Robots · IEEE Trans. Robotics 2022
Robotics › Robot manipulation › parallel manipulator
parallel manipulator design
0.412020
R-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations · ICRA 2020
Computer vision › 3D vision › pose estimation
pose tracking
0.412020
Dynamics-Based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots · IEEE Trans. Robotics 2020
Robotics › Motion planning and robot control
robot control
0.412020
Dynamics-Based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots · IEEE Trans. Robotics 2020
Human-robot interaction
physical human-robot interaction
0.412020
R-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations · ICRA 2020
Human-robot interaction › physical human-robot interaction
safe robot design
0.412020
R-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations · ICRA 2020
Robotics › Motion planning and robot control › robot control
parallel robot control
0.312017
Certified detection of parallel robot assembly mode under Type 2 singularity crossing trajectories · ICRA 2017
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint satisfaction
symmetry breaking
0.212015
Variable symmetry breaking in numerical constraint problems · Artif. Intell. 2015
Mathematical optimization
branch-and-prune
0.212014
A branch and prune algorithm for the computation of generalized aspects of parallel robots · Artif. Intell. 2014
Computational complexity
constraint satisfaction
0.212014
A branch and prune algorithm for the computation of generalized aspects of parallel robots · Artif. Intell. 2014
Robotics › Motion planning and robot control › robot kinematics
parallel manipulator kinematics
0.112020
Dynamics-Based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots · IEEE Trans. Robotics 2020
Algorithms and data structures
anytime algorithms
0.112009
Search Strategies for an Anytime Usage of the Branch and Prune Algorithm · IJCAI 2009

Methods — techniques the papers use, named apart from their topics

simulation · 1.1potential energy analysis · 1.1interval analysis · 0.9underactuated mechanism design · 0.9impact force analysis · 0.9dynamics-based estimation · 0.4differential inclusion · 0.4forward kinematics · 0.3branch-and-prune · 0.2search strategy · 0.1search strategies · 0.1
YearPublicationVenuePosition
2024 Discrete-Time General Nonlinear Robust Control: Stabilization With Closed-Loop Robust DOA Enlargement Based on Interval Analysis
abstract
For discrete-time nonlinear systems with uncertainty, this paper presents an interval analysis approach to design controller and compute the estimate of the closed-loop robust domain of attraction (RDOA). The dynamics of the system is modelled using difference inclusions. A robust negative-definite and invariant set (RNIS) in the state-control space is proposed. An RNIS is defined by the combination of a robust negative-definite set (RNS) and a robust controlled invariant set (RCIS), which leads to sufficient conditions for Lyapunov stability of the system. The estimate of RDOA can be obtained by projecting an RNIS along the state space. However, the RNIS is hard to obtain by its definition. Drawing inspiration from the RCIS-computation approach, we define a mapping that utilizes the predecessor operator in the state-control space to compute a set limit. Then, the RNIS can be obtained by finding the limit set for an RNS. The computations of RNS and the limit set are based on interval analysis. An algorithm to estimate the RNIS is introduced with rigorous convergence analysis. Finally, we formulate an optimization problem that is solvable, and enlarges the RNIS and the estimate of RDOA. The method is validated on examples of nonlinear systems subject to actuator saturation.
Chaolun Lu, Yongqiang Li 0003, Alexandre Goldsztejn, Zhongsheng Hou, Yu Feng 0002, Yuanjing Feng
IEEE Trans. Circuits Syst. I Regul. Pap.3
2024 Determination of All Stable and Unstable Equilibria for Image-Point-Based Visual Servoing
abstract
Local minima are a well-known drawback of image-based visual servoing systems. Up to now, there were no formal guarantees on their number, or even their existence, according to the considered configuration. In this work, a formal approach is presented for the exhaustive computation of all minima and unstable equilibria for a class of six well-known image-based visual servoing controllers. This approach relies on a new polynomial formulation of the equilibrium condition that avoids using the camera pose. By using modern computational algebraic geometry methods and an ad hoc symmetry breaking strategy, the formal resolution of this new equilibrium condition is rendered computationally feasible. The proposed methodology is applied to compute the equilibria of several classical visual servoing tasks, with planar and nonplanar configurations of four and five points. The effects of local minima and saddle points on the dynamics of the system are finally illustrated through intensive simulation results, as well as the effects of image noise and uncertainties on depths.
Alessandro Colotti, Jorge García Fontán, Alexandre Goldsztejn, Sébastien Briot, François Chaumette, Olivier Kermorgant, Mohab Safey El Din
IEEE Trans. Robotics3
2022 Singularity Conditions for Continuum Parallel Robots
abstract
Research on continuum parallel robots has been essentially devoted to the computation of their geometricostatic models and of their performance in terms of workspace size, accuracy, compliance, force transmission, and manipulability. Their singularity analysis has been limited to the identification of a limited number of singular configurations, without any deep investigation of the physical phenomena occurring in these singularities. In this article, we define the singularity conditions for continuum parallel robots. We provide a straightforward interpretation of the phenomena occurring in singularities. Especially, we prove that some singularities appear when the robot potential energy has a local isovalue. Because of this property, we show that these singularities separate the stable configurations from the unstable ones in the workspace. Moreover, on such singularities, the robot can freely move along a given direction without any constraint under the action of small perturbations. We illustrate the singularity phenomena and their effects by simulations performed with two different continuum parallel robots.
Sébastien Briot, Alexandre Goldsztejn
IEEE Trans. Robotics2
2020 Towards a Generic Interval Solver for Differential-Algebraic CSP
Simon Rohou, Abderahmane Bedouhene, Gilles Chabert, Alexandre Goldsztejn, Luc Jaulin, Bertrand Neveu, Victor Reyes, Gilles Trombettoni
CP4
2020 R-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations
abstract
This paper introduces an intrinsically safe parallel manipulator dedicated to fast pick-and-place operations, called R-Min. It has been designed to reduce the risk of injury during a collision with a human operator, while maintaining high speed and acceleration. The proposed architecture is based on a modification of the well-known planar five-bar mechanism, where additional passive joints are introduced to the distal links in order to create a planar seven-bar mechanism with two degrees of underactuation, so that it can passively reconfigure in case of collision. A supplementary passive leg, in which a tension spring is mounted, is added between the base and the end-effector in order to constrain the additional degrees of freedom. A prototype of this new collaborative parallel robot is designed and its equilibrium configurations under several types of loadings are analyzed. Its dynamics is also studied. We analyze the impact force occurring during a collision between our prototype and the head of an operator and compare these results with those that would have been obtained with a rigid five-bar mechanism. Simulation results of impact during a standard pick-and-place trajectory of duration 0.3 s show that a regular five-bar mechanism would injure a human, while our robot would avoid the trauma.
Guillaume Jeanneau, Vincent Bégoc, Sébastien Briot, Alexandre Goldsztejn
ICRA4
2020 Dynamics-Based Algorithm for Reliable Assembly Mode Tracking in Parallel Robots
abstract
Finding the current pose of the end-effector of a parallel robot is a problem, since its forward geometric model generally has several solutions. Current methods to address this problem operate mainly under the assumption that the robot never changes its assembly mode nor gets close to Type 2 singularities. Nonetheless, recent works proved that a parallel robot can change its assembly mode, thanks to dedicated trajectory generation and control. Such a feature allows increasing the operational workspace of such manipulators. Hence, correctly tracking the end-effector pose while crossing Type 2 singularities is mandatory for a practical usage of this workspace enhancement method. However, on Type 2 singularities, several solutions of the forward geometric model merge, making current tracking methods ineffective. To fill this gap, we propose a two-step pose tracking methodology. First, a differential inclusion based on kinematics and dynamics is solved. Second, joint measurements are used to tighten resulting enclosures. The effectiveness of this method is discussed, thanks to experimental data gathered on a planar parallel robot.
Adrien Koessler, Alexandre Goldsztejn, Sébastien Briot, Nicolas Bouton
IEEE Trans. Robotics2
2017 Certified detection of parallel robot assembly mode under Type 2 singularity crossing trajectories
abstract
Increasing the size of operationnal workspace is one of the main problems parallel robots are faced with. Among all the proposed solutions to that, crossing Type 2 singularities using dedicated trajectory generation and multi-model controller has a great potential. Yet, this approach is not sufficient for the robot to operate autonomously, as assembly mode detection during the motion currently requires additional redundant information. To tackle this problem, we propose an algorithm based on Interval Analysis (IA) that is able to track the end-effector of the robot even under assembly mode change. IA-based solvers for the forward kinematic problem of parallel robots are well known, but they cannot be used under assembly mode change. Compared to those classical approaches, the major modification introduced is the tracking of end-effector velocity in addition to its pose. Using this new information of velocity, the algorithm is capable to monitor the assembly mode change of the robot happening when the singularities are crossed. The behavior and the reliability of this algorithm are analyzed experimentally on a five-bar planar parallel mechanism.
Adrien Koessler, Alexandre Goldsztejn, Sébastien Briot, Nicolas Bouton
ICRA2
2017 HySIA: Tool for Simulating and Monitoring Hybrid Automata Based on Interval Analysis
Daisuke Ishii, Alexandre Goldsztejn
RV2
2017 A branch and bound algorithm for quantified quadratic programming
Ferenc Domes, Alexandre Goldsztejn
J. Glob. Optim.2
2016 On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
Benjamin Martin 0003, Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann
J. Glob. Optim.2
2015 Variable symmetry breaking in numerical constraint problems
Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras
Artif. Intell.1
2014 The Non-overlapping Constraint between Objects Described by Non-linear Inequalities
Ignacio Salas, Gilles Chabert, Alexandre Goldsztejn
CP3
2014 A branch and prune algorithm for the computation of generalized aspects of parallel robots
Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann
Artif. Intell.3
2014 First order rejection tests for multiple-objective optimization
Alexandre Goldsztejn, Ferenc Domes, Brice Chevalier
J. Glob. Optim.1
2013 Constraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems
Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann
CP1
2012 A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots
Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann
CP3
2011 Symmetry Breaking in Numeric Constraint Problems
Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras
CP1
2010 Including Ordinary Differential Equations Based Constraints in the Standard CP Framework
Alexandre Goldsztejn, Olivier Mullier, Damien Eveillard, Hiroshi Hosobe
CP1
2010 Finding the Maximal Pose Error in Robotic Mechanical Systems Using Constraint Programming
Nicolas Berger, Ricardo Soto 0001, Alexandre Goldsztejn, Stéphane Caro, Philippe Cardou
IEA/AIE (1)3
2009 Search Strategies for an Anytime Usage of the Branch and Prune Algorithm
Raphaël Chenouard, Alexandre Goldsztejn, Christophe Jermann
IJCAI2
2008 A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
Alexandre Goldsztejn, Laurent Granvilliers
CP1
2008 Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher
CP1
2008 A Branch and Bound Algorithm for Numerical MAX-CSP
Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou
CP2
2008 A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations
abstract
Numerical methods based on interval arithmetic are efficient means to reliably solve nonlinear systems of equations. Algorithm bc3revise is an interval method that tightens variables' domains by enforcing a property called box consistency. It has been successfully used on difficult problems whose solving eluded traditional numerical methods.We present a new algorithm to enforce box consistency that is simpler than bc3revise, faster, and easily data parallelizable. A parallel implementation with Intel SSE2 SIMD instructions shows that an increase in performance of up to an order of magnitude and more is achievable.
Frédéric Goualard, Alexandre Goldsztejn
PDCAT2
2006 Inner and Outer Approximations of Existentially Quantified Equality Constraints
Alexandre Goldsztejn, Luc Jaulin
CP1