Steve Tonneau

Steve Tonneau

Auto-generated profile, based on publicly available information

Steve Tonneau

School of Informatics, University of Edinburgh, UK

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
19 April 2018 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
STSteve Tonneau
Steve Tonneau
APAndrea Del Prete
Andrea Del Prete
JPJulien Pettre
Julien Pettre
CPChonhyon Park
Chonhyon Park
DMDinesh Manocha
Dinesh Manocha
NMNicolas Mansard
Nicolas Mansard
We present a contact planner for complex legged locomotion tasks: standing up, climbing stairs using a handrail, crossing rubble, and getting out of a car. The need for such a planner was shown at the DARPA Robotics Challenge, where such behaviors could not be demonstrated (except for egress). Current planners suffer from their prohibitive algorithmic complexity because they deploy a tree of robot configurations projected in contact with the environment. We tackle this issue by introducing a reduction property: the reachability condition. This condition defines a geometric approximation of the contact manifold, which is of low dimension, presents a Cartesian topology, and can be efficiently sampled and explored. The hard contact planning problem can then be decomposed into two subproblems: first, we plan a path for the root without considering the whole-body configuration, using a sampling-based algorithm; then, we generate a discrete sequence of whole-body configurations in static equilibrium along this path, using a deterministic contact-selection algorithm. The reduction breaks the algorithm complexity encountered in previous works, resulting in the first interactive implementation of a contact planner (open source). While no contact planner has yet been proposed with theoretical completeness, we empirically show the interest of our framework: in a few seconds, with high success rates, we generate complex contact plans for various scenarios and two robots: HRP-2 and HyQ. These plans are validated in dynamic simulations or on the real HRP-2 robot.

12 April 2023 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
CMCarlos Mastalli
Carlos Mastalli
SCSaroj Prasad Chhatoi
Saroj Prasad Chhatoi
TCThomas Corbéres
Thomas Corbéres
STSteve Tonneau
Steve Tonneau
SVSethu Vijayakumar
Sethu Vijayakumar
Optimal control (OC) using inverse dynamics provides numerical benefits, such as coarse optimization, cheaper computation of derivatives, and a high convergence rate. However, to take advantage of these benefits in model predictive control (MPC) for legged robots, it is crucial to handle efficiently its large number of equality constraints. To accomplish this, we first propose a novel approach to handle equality constraints based on nullspace parameterization. Our approach balances optimality, and both dynamics and equality-constraint feasibility appropriately, which increases the basin of attraction to high-quality local minima. To do so, we modify our feasibility-driven search by incorporating a merit function. Furthermore, we introduce a condensed formulation of inverse dynamics that considers arbitrary actuator models. We also propose a novel MPC based on inverse dynamics within a perceptive locomotion framework. Finally, we present a theoretical comparison of OC with forward and inverse dynamics and evaluate both numerically. Our approach enables the first application of inverse-dynamics MPC on hardware, resulting in the state-of-the-art dynamic climbing on the ANYmal robot. We benchmark it over a wide range of robotics problems and generate agile and complex maneuvers. We show the computational reduction of our nullspace resolution and condensed formulation (up to ${47.3}\boldsymbol{\%}$ ). We provide evidence of the benefits of our approach by solving coarse optimization problems with a high convergence rate (up to 10 Hz of discretization). Our algorithm is publicly available inside Crocoddyl .

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.

13 June 2018 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
APAndrea Del Prete
Andrea Del Prete
STSteve Tonneau
Steve Tonneau
NMNicolas Mansard
Nicolas Mansard
The ability to anticipate a fall is fundamental for any robot that has to balance. Currently, fast fall-prediction algorithms only exist for simple models, such as the linear inverted pendulum model (LIPM), whose validity breaks down in multicontact scenarios (i.e., when contacts are not limited to a flat ground). This paper presents a fast fall-prediction algorithm based on the point-mass model, which remains valid in multicontact scenarios. The key assumption of our algorithm is that, in order to come to a stop without changing its contacts, a robot only needs to accelerate its center of mass in the direction opposite to its velocity. This assumption allows us to predict the fall by means of a convex optimal control problem, which we solve with a fast custom algorithm (less than 11 ms of computation time). We validated the approach through extensive simulations with the humanoid robot HRP-2 in randomly-sampled scenarios. Comparisons with standard LIPM-based methods demonstrate the superiority of our algorithm in predicting the fall of the robot, when controlled with a state-of-the-art balance controller. This paper lays the foundations for the solution of the challenging problem of push recovery in multicontact scenarios.

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.