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

Offline and Online Planning and Control Strategies for the Multi-Contact and Biped Locomotion of Humanoid Robots

In the past decades, the Research on humanoid robots made progress forward accomplishing exceptionally dynamic and agile motions. Starting from the DARPA Robotic Challenge in 2015, humanoid platforms have been successfully employed to perform more and more challenging tasks with the eventual aim of assisting or replacing humans in hazardous and stressful working situations. However, the deployment of these complex machines in realistic domestic and working environments still represents a high-level challenge for robotics. Such environments are characterized by unstructured and cluttered settings with continuously varying conditions due to the dynamic presence of humans and other mobile entities, which cannot only compromise the operation of the robotic system but can also pose severe risks both to the people and the robot itself due to unexpected interactions and impacts. The ability to react to these unexpected interactions is therefore a paramount requirement for enabling the robot to adapt its behavior to the task needs and the characteristics of the environment. Further, the capability to move in a complex and varying environment is an essential skill for a humanoid robot for the execution of any task. Indeed, human instructions may often require the robot to move and reach a desired location, e.g., for bringing an object or for inspecting a specific place of an infrastructure. In this context, a flexible and autonomous walking behavior is an essential skill, study of which represents one of the main topics of this Thesis, considering disturbances and unfeasibilities coming both from the environment and dynamic obstacles that populate realistic scenarios.  Locomotion planning strategies are still an open theme in the humanoids and legged robots research and can be classified in sample-based and optimization-based planning algorithms. The first, explore the configuration space, finding a feasible path between the start and goal robot’s configuration with different logic depending on the algorithm. They suffer of a high computational cost that often makes difficult, if not impossible, their online implementations but, compared to their counterparts, they do not need any environment or robot simplification to find a solution and they are probabilistic complete, meaning that a feasible solution can be certainly found if at least one exists. The goal of this thesis is to merge the two algorithms in a coupled offline-online planning framework to generate an offline global trajectory with a sample-based approach to cope with any kind of cluttered and complex environment, and online locally refine it during the execution, using a faster optimization-based algorithm that more suits an online implementation. The offline planner performances are improved by planning in the robot contact space instead of the whole-body robot configuration space, requiring an algorithm that maps the two state spaces.   The framework proposes a methodology to generate whole-body trajectories for the motion of humanoid and legged robots in realistic and dynamically changing environments.  This thesis focuses on the design and test of each component of this planning framework, whose validation is carried out on the real robotic platforms CENTAURO and COMAN+ in various loco-manipulation tasks scenarios. &nbsp

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

International audienceOne 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

Combined Sampling and Optimization Based Planning for Legged-Wheeled Robots

Planning for legged-wheeled machines is typically done using trajectory optimization because of many degrees of freedom, thus rendering legged-wheeled planners prone to falling prey to bad local minima. We present a combined sampling and optimization-based planning approach that can cope with challenging terrain. The sampling-based stage computes whole-body configurations and contact schedule, which speeds up the optimization convergence. The optimization-based stage ensures that all the system constraints, such as non-holonomic rolling constraints, are satisfied. The evaluations show the importance of good initial guesses for optimization. Furthermore, they suggest that terrain/collision (avoidance) constraints are more challenging than the robot model's constraints. Lastly, we extend the optimization to handle general terrain representations in the form of elevation maps

Motion Planning for Multi-Contact Visual Servoing on Humanoid Robots

International audienceThis paper describes the implementation of a canonical motion generation pipeline guided by vision for a TALOS humanoid robot. The proposed system is using a mul-ticontact planner, a Differential Dynamic Programming (DDP) algorithm, and a stabilizer. The multicontact planner provides a set of contacts and dynamically consistent trajectories for the Center-Of-Mass (CoM) and the Center-Of-Pressure (CoP). It provides a structure to initialize a DDP algorithm which, in turn, provides a dynamically consistent trajectory for all the joints as it integrates all the dynamics of the robot, together with rigid contact models and the visual task. Tested on Gazebo the resulting trajectory had to be stabilized with a state-of-the-art algorithm to be successful. In addition to testing motion generated from high specifications to the stabilized motion in simulation, we express visual features at Whole Body Generator level which is a DDP formulated solver. It handles non-linearities as the ones introduced by the projections of visual features expressed and minimized in the image plan of the camera