Towards dynamically consistent real-time gait pattern generation for full-size humanoid robots

We propose a two-stage gait pattern generation scheme for the full-scale humanoid robots, that considers the dynamics of the system throughout the process. The fist stage is responsible for generating semi-dynamically consistent step position and step time information, while the second stage incorporated with multi-body dynamics system is responsible for generation of gait pattern that is feasible and stable on the full-scale multi-degree-of-freedom humanoid robot. The approach allows for very rapid gait pattern regeneration during the swing phase of motion and includes information about present dynamic state when regenerating the new pattern. The paper contains description of a developed method, as well as experimental results proving its effectiveness

A Reactive and Efficient Walking Pattern Generator for Robust Bipedal Locomotion

Available possibilities to prevent a biped robot from falling down in the presence of severe disturbances are mainly Center of Pressure (CoP) modulation, step location and timing adjustment, and angular momentum regulation. In this paper, we aim at designing a walking pattern generator which employs an optimal combination of these tools to generate robust gaits. In this approach, first, the next step location and timing are decided consistent with the commanded walking velocity and based on the Divergent Component of Motion (DCM) measurement. This stage which is done by a very small-size Quadratic Program (QP) uses the Linear Inverted Pendulum Model (LIPM) dynamics to adapt the switching contact location and time. Then, consistent with the first stage, the LIPM with flywheel dynamics is used to regenerate the DCM and angular momentum trajectories at each control cycle. This is done by modulating the CoP and Centroidal Momentum Pivot (CMP) to realize a desired DCM at the end of current step. Simulation results show the merit of this reactive approach in generating robust and dynamically consistent walking patterns

Multi-contact Walking Pattern Generation based on Model Preview Control of 3D COM Accelerations

We present a multi-contact walking pattern generator based on preview-control of the 3D acceleration of the center of mass (COM). A key point in the design of our algorithm is the calculation of contact-stability constraints. Thanks to a mathematical observation on the algebraic nature of the frictional wrench cone, we show that the 3D volume of feasible COM accelerations is a always a downward-pointing cone. We reduce its computation to a convex hull of (dual) 2D points, for which optimal O(n log n) algorithms are readily available. This reformulation brings a significant speedup compared to previous methods, which allows us to compute time-varying contact-stability criteria fast enough for the control loop. Next, we propose a conservative trajectory-wide contact-stability criterion, which can be derived from COM-acceleration volumes at marginal cost and directly applied in a model-predictive controller. We finally implement this pipeline and exemplify it with the HRP-4 humanoid model in multi-contact dynamically walking scenarios

Efficient Humanoid Contact Planning using Learned Centroidal Dynamics Prediction

Humanoid robots dynamically navigate an environment by interacting with it via contact wrenches exerted at intermittent contact poses. Therefore, it is important to consider dynamics when planning a contact sequence. Traditional contact planning approaches assume a quasi-static balance criterion to reduce the computational challenges of selecting a contact sequence over a rough terrain. This however limits the applicability of the approach when dynamic motions are required, such as when walking down a steep slope or crossing a wide gap. Recent methods overcome this limitation with the help of efficient mixed integer convex programming solvers capable of synthesizing dynamic contact sequences. Nevertheless, its exponential-time complexity limits its applicability to short time horizon contact sequences within small environments. In this paper, we go beyond current approaches by learning a prediction of the dynamic evolution of the robot centroidal momenta, which can then be used for quickly generating dynamically robust contact sequences for robots with arms and legs using a search-based contact planner. We demonstrate the efficiency and quality of the results of the proposed approach in a set of dynamically challenging scenarios

On Time Optimization of Centroidal Momentum Dynamics

Recently, the centroidal momentum dynamics has received substantial attention to plan dynamically consistent motions for robots with arms and legs in multi-contact scenarios. However, it is also non convex which renders any optimization approach difficult and timing is usually kept fixed in most trajectory optimization techniques to not introduce additional non convexities to the problem. But this can limit the versatility of the algorithms. In our previous work, we proposed a convex relaxation of the problem that allowed to efficiently compute momentum trajectories and contact forces. However, our approach could not minimize a desired angular momentum objective which seriously limited its applicability. Noticing that the non-convexity introduced by the time variables is of similar nature as the centroidal dynamics one, we propose two convex relaxations to the problem based on trust regions and soft constraints. The resulting approaches can compute time-optimized dynamically consistent trajectories sufficiently fast to make the approach realtime capable. The performance of the algorithm is demonstrated in several multi-contact scenarios for a humanoid robot. In particular, we show that the proposed convex relaxation of the original problem finds solutions that are consistent with the original non-convex problem and illustrate how timing optimization allows to find motion plans that would be difficult to plan with fixed timing.Comment: 7 pages, 4 figures, ICRA 201