1 citations · 1 across the 3 of their papers we have counts for
5 papers · 1 filter
NAS: N-step computation of All Solutions to the footstep planning problem
Jiayi Wang, Saeid Samadi, Hefan Wang +4
How many ways are there to climb a staircase in a given number of steps? Infinitely many, if we focus on the continuous aspect of the problem. A finite, possibly large number if we…
Solving Footstep Planning as a Feasibility Problem using L1-norm Minimization (Extended Version)
Daeun Song, Pierre Fernbach, Thomas Flayols +4
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 placi…
Learning How to Walk: Warm-starting Optimal Control Solver with Memory of Motion
Teguh Santoso Lembono, Carlos Mastalli, Pierre Fernbach +2
In this paper, we propose a framework to build a memory of motion for warm-starting an optimal control solver for the locomotion task of a humanoid robot. We use HPP Loco3D, a vers…
SL1M: Sparse L1-norm Minimization for contact planning on uneven terrain
Steve Tonneau, Daeun Song, Pierre Fernbach +3
One of the main challenges of planning legged locomotion in complex environments is the combinatorial contact selection problem. Recent contributions propose to use integer variabl…
Contact Planning for the ANYmal Quadruped Robot using an Acyclic Reachability-Based Planner
Mathieu Geisert, Thomas Yates, Asil Orgen +2
Despite the great progress in quadrupedal robotics during the last decade, selecting good contacts (footholds) in highly uneven and cluttered environments still remains an open cha…