Gait generation via intrinsically stable MPC for a multi-mass humanoid model

We consider the problem of generating a gait with no a priori assigned footsteps while taking into account the contribution of the swinging leg to the total Zero Moment Point (ZMP). This is achieved by considering a multi-mass model of the humanoid and distinguishing between secondary masses with known pre-defined motion and the remaining, primary, masses. In the case of a single primary mass with constant height, it is possible to transform the original gait generation problem for the multi-mass system into a single LIP-like problem. We can then take full advantage of an intrinsically stable MPC framework to generate a gait that takes into account the swinging leg motion

Humanoid gait generation for walk-to locomotion using single-stage MPC

We consider the problem of gait generation for a humanoid robot that must walk to an assigned Cartesian goal. As a first solution, we consider a rather straightforward adaptation of our previous work: An external block produces high-level velocities, which are then tracked by a double-stage intrinsically stable MPC scheme where the orientation of the footsteps is chosen before determining their location and the CoM trajectory. The second solution, which represents the main contribution of the paper, is conceptually different: no high-level velocity is generated, and footstep orientations are chosen at the same time of the other decision variables in a singlestage MPC. This is made possible by carefully redesigning the motion constraints so as to preserve linearity. Preliminary results on a simulated NAO confirm that the single-stage method outperforms the conventional double-stage scheme

MPC-based humanoid pursuit-evasion in the presence of obstacles

We consider a pursuit-evasion problem between humanoids in the presence of obstacles. In our scenario, the pursuer enters the safety area of the evader headed for collision, while the latter executes a fast evasive motion. Control schemes are designed for both the pursuer and the evader. They are structurally identical, although the objectives are different: the pursuer tries to align its direction of motion with the line- of-sight to the evader, whereas the evader tries to move in a direction orthogonal to the line-of-sight to the pursuer. At the core of the control architecture is a Model Predictive Control scheme for generating a stable gait. This allows for the inclusion of workspace obstacles, which we take into account at two levels: during the determination of the footsteps orientation and as an explicit MPC constraint. We illustrate the results with simulations on NAO humanoids

Walking Stabilization Using Step Timing and Location Adjustment on the Humanoid Robot, Atlas

While humans are highly capable of recovering from external disturbances and uncertainties that result in large tracking errors, humanoid robots have yet to reliably mimic this level of robustness. Essential to this is the ability to combine traditional "ankle strategy" balancing with step timing and location adjustment techniques. In doing so, the robot is able to step quickly to the necessary location to continue walking. In this work, we present both a new swing speed up algorithm to adjust the step timing, allowing the robot to set the foot down more quickly to recover from errors in the direction of the current capture point dynamics, and a new algorithm to adjust the desired footstep, expanding the base of support to utilize the center of pressure (CoP)-based ankle strategy for balance. We then utilize the desired centroidal moment pivot (CMP) to calculate the momentum rate of change for our inverse-dynamics based whole-body controller. We present simulation and experimental results using this work, and discuss performance limitations and potential improvements

A Benchmarking of DCM Based Architectures for Position and Velocity Controlled Walking of Humanoid Robots

This paper contributes towards the development and comparison of Divergent-Component-of-Motion (DCM) based control architectures for humanoid robot locomotion. More precisely, we present and compare several DCM based implementations of a three layer control architecture. From top to bottom, these three layers are here called: trajectory optimization, simplified model control, and whole-body QP control. All layers use the DCM concept to generate references for the layer below. For the simplified model control layer, we present and compare both instantaneous and Receding Horizon Control controllers. For the whole-body QP control layer, we present and compare controllers for position and velocity control robots. Experimental results are carried out on the one-meter tall iCub humanoid robot. We show which implementation of the above control architecture allows the robot to achieve a walking velocity of 0.41 meters per second.Comment: Submitted to Humanoids201

Solving Footstep Planning as a Feasibility Problem Using L1-Norm Minimization

Extended version of the paper to be published in IEEE Robotics and Automation LettersInternational audienceOne 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 l1-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