Skip to Main content Skip to Navigation
Conference papers

SL1M: Sparse L1-norm Minimization for contact planning on uneven terrain

Abstract : One of the main challenges of planning legged locomotion in complex environments is the combinatorial contact selection problem. Recent contributions propose to use integer variables to represent which contact surface is selected, and then to rely on modern mixed-integer (MI) optimization solvers to handle this combinatorial issue. To reduce the computational cost of MI, we exploit the sparsity properties of L1 norm minimization techniques to relax the contact planning problem into a feasibility linear program. Our approach accounts for kinematic reachability of the center of mass (COM) and of the contact effectors. We ensure the existence of a quasi-static COM trajectory by restricting our plan to quasi-flat contacts. For planning 10 steps with less than 10 potential contact surfaces for each phase, our approach is 50 to 100 times faster that its MI counterpart, which suggests potential applications for online contact re-planning. The method is demonstrated in simulation with the humanoid robots HRP-2 and Talos over various scenarios.
Document type :
Conference papers
Complete list of metadata
Contributor : Nicolas Mansard <>
Submitted on : Friday, September 20, 2019 - 4:35:39 PM
Last modification on : Thursday, June 10, 2021 - 3:05:43 AM

Links full text



Steve Tonneau, Daeun Song, Pierre Fernbach, Nicolas Mansard, Michel Taïx, et al.. SL1M: Sparse L1-norm Minimization for contact planning on uneven terrain. IEEE International Conference on Robotics and Automation (ICRA 2020), May 2020, Paris, France. ⟨10.1109/ICRA40945.2020.9197371⟩. ⟨hal-02293234⟩



Record views