Pierre Fernbach

Pierre Fernbach

Auto-generated profile, based on publicly available information

Pierre Fernbach

CNRS, LAAS, Universit de Toulouse, Toulouse, France

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 January 2020 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
PFPierre Fernbach
Pierre Fernbach
STSteve Tonneau
Steve Tonneau
OSOlivier Stasse
Olivier Stasse
JCJustin Carpentier
Justin Carpentier
MTMichel Taix
Michel Taix
Synthesizing legged locomotion requires planning one or several steps ahead (literally): when and where, and with which effector should the next contact(s) be created between the robot and the environment? Validating a contact candidate implies a minima the resolution of a slow, nonlinear optimization problem, to demonstrate that a center of mass (CoM) trajectory, compatible with the contact transition constraints, exists. We propose a conservative reformulation of this trajectory generation problem as a convex 3-D linear program, named convex resolution of centroidal dynamic trajectories (CROC). It results from the observation that if the CoM trajectory is a polynomial with only one free variable coefficient, the nonlinearity of the problem disappears. This has two consequences. On the positive side, in terms of computation times, CROC outperforms the state of the art by at least one order of magnitude, and allows to consider interactive applications (with a planning time roughly equal to the motion time). On the negative side, in our experiments, our approach finds a majority of the feasible trajectories found by a nonlinear solver, but not all of them. Still, we demonstrate that the solution space covered by CROC is large enough to achieve the automated planning of a large variety of locomotion tasks for different robots, demonstrated in simulation and on the real HRP-2 robot, several of which were rarely seen before. Another significant contribution is the introduction of a Bezier curve representation of the problem, which guarantees that the constraints of the CoM trajectory are verified continuously, and not only at discrete points as traditionally done. This formulation is lossless, and results in more robust trajectories. It is not restricted to CROC, but could rather be integrated with any method from the state of the art.

14 June 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
DSDaeun Song
Daeun Song
PFPierre Fernbach
Pierre Fernbach
TFThomas Flayols
Thomas Flayols
APAndrea Del Prete
Andrea Del Prete
NMNicolas Mansard
Nicolas Mansard
YKYoung J. Kim
Young J. Kim
One challenge of legged locomotion on uneven terrains is to deal with both the discrete problem of selecting a contact surface for each footstep and the continuous problem of placing each footstep on the selected surface. Consequently, footstep planning can be addressed with a Mixed Integer Program (MIP), an elegant but computationally demanding method, which can make it unsuitable for online planning. We reformulate the MIP into a cardinality problem, then approximate it as a computationally efficient l 1-norm minimisation, called SL1M. Moreover, we improve the performance and convergence of SL1M by combining it with a sampling-based root trajectory planner to prune irrelevant surface candidates. Our tests on the humanoid Talos in four representative scenarios show that SL1M always converges faster than MIP. For scenarios when the combinatorial complexity is small ($<; 10$ surfaces per step), SL1M converges at least two times faster than MIP with no need for pruning. In more complex cases, SL1M converges up to 100 times faster than MIP with the help of pruning. Moreover, pruning can also improve the MIP computation time. The versatility of the framework is shown with additional tests on the quadruped robot ANYmal.

23 October 2018 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PDF file
STSteve Tonneau
Steve Tonneau
PFPierre Fernbach
Pierre Fernbach
APAndrea Del Prete
Andrea Del Prete
JPJulien Pettré
Julien Pettré
NMNicolas Mansard
Nicolas Mansard
Synthesizing motions for legged characters in arbitrary environments is a long-standing problem that has recently received a lot of attention from the computer graphics community. We tackle this problem with a procedural approach that is generic, fully automatic, and independent from motion capture data. The main contribution of this article is a point-mass-model-based method to synthesize Center Of Mass trajectories. These trajectories are then used to generate the whole-body motion of the character. The use of a point mass model results in physically inconsistent motions and joint limit violations when mapped back to a full- body motion. We mitigate these issues through the use of a novel formulation of the kinematic constraints that allows us to generate a quasi-static Center Of Mass trajectory in a way that is both user-friendly and computationally efficient. We also show that the quasi-static constraint can be relaxed to generate motions usable for computer animation at the cost of a moderate violation of the dynamic constraints. Our method was integrated in our open-source contact planner and tested with different scenarios—some never addressed before—featuring legged characters performing non-gaited motions in cluttered environments. The computational efficiency of our trajectory generation algorithm (under one ms to compute one second of trajectory) enables us to synthesize motions in a few seconds, one order of magnitude faster than state-of-the-art methods. Although our method is empirically able to synthesize collision-free motions, the formal handling of environmental constraints is not part of the proposed method and left for future work.

30 September 2019 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
OROlivier Roussel
Olivier Roussel
PFPierre Fernbach
Pierre Fernbach
MTMichel Taix
Michel Taix
The contribution of this article is to propose an approach that solves the motion planning problem for an extensible elastic rod using contacts with the environment. We first show how motion planning for a deformable rod can be done by coupling both quasi-static and dynamic rod models with sampling-based methods. Sampling directly in the submanifold of static equilibrium and contact-free configurations allows to take advantage of the dynamic model to improve the exploration of the state space. Then, thanks to the contact information (point, forces, direction, and the number of contacts), the exploration of the rapidly exploring random tree (RRT) approach can be improved. We present a new RRT-SLIDE algorithm, which guides the roadmap extension with a sliding contact mode based on some principles of human reasoning. We show that our approach is probabilistically complete. We also demonstrate the necessity of considering contacts on complex scenarios with several simulation experiments. Besides its performances, our algorithm does not require further tuning phase for a new scenario.

1 January 2015 in IFAC-PapersOnLine
Verified
Journal Article
Closed access
YPYannick Pencóle
Yannick Pencóle
RPRomain Pichard
Romain Pichard
PFPierre Fernbach
Pierre Fernbach

4 April 2026
Verified
Thesis
Closed access
PFPierre Fernbach
Pierre Fernbach
La synthèse automatique du mouvement de robots à pattes est un enjeu majeur de la robotique: sa résolution permettrait le déploiement des robots hors de leurs laboratoire. Pour y parvenir, cette thèse suit l'approche "diviser pour régner", où le problème est décomposé en plusieurs sous-problèmes résolus séquentiellement. Cette décomposition amène alors la question nouvelle de la faisabilité: comment garantir que la solution d'un sous-problème, permet la résolution des suivants (dont elle sert d'entrée)? Pour y répondre, cette thèse définit des critères de faisabilités efficaces, qui s'appuient sur la définition des contraintes qui s'appliquent au centre de masse du robot. En parallèle, et de manière plus générale, elle propose une nouvelle formulation du problème du calcul d'une trajectoire valide pour le centre de masse du robot. Cette formulation, continue, présente le double avantage (par rapport aux méthodes discrètes classiques) de garantir la validité de la solution en tous points, tout en améliorant, grâce à une réduction de la dimensionnalité du problème, les performances des algorithmes de l'état de l'art. L'architecture de planification de mouvement résultante a été validée en simulation, ainsi que sur le robot HRP-2, démontrant ainsi sa supériorité en termes de temps de calcul et de taux de succès par rapport à l'existant.