Motion planning for humanoid robot dynamically stepping over consecutive large obstacles

Abstract

Purpose – Humanoid robots should have the ability of walking in complex environment and overcoming large obstacles in rescue mission. Previous research mainly discusses the problem of humanoid robots stepping over or on/off one obstacle statically or dynamically. As an extreme case, this paper aims to demonstrate how the robots can step over two large obstacles continuously. Design/methodology/approach – The robot model uses linear inverted pendulum (LIP) model. The motion planning procedure includes feasibility analysis with constraints, footprints planning, legs trajectory planning with collision-free constraint, foot trajectory adapter and upper body motion planning. Findings – The motion planning with the motion constraints is a key problem, which can be considered as global optimization issue with collision-free constraint, kinematic limits and balance constraint. With the given obstacles, the robot first needs to determine whether it can achieve stepping over, if feasible, and then the robot gets the motion trajectory for the legs, waist and upper body using consecutive obstacles stepping over planning algorithm which is presented in this paper. Originality/value – The consecutive stepping over problem is proposed in this paper. First, the paper defines two consecutive stepping over conditions, sparse stepping over (SSO) and tight stepping over (TSO). Then, a novel feasibility analysis method with condition (SSO/TSO) decision criterion is proposed for consecutive obstacles stepping over. The feasibility analysis method’s output is walking parameters with obstacles’ information. Furthermore, a modified legs trajectory planning method with center of mass trajectory compensation using upper body motion is proposed. Finally, simulations and experiments for SSO and TSO are carried out by using the XT-I humanoid robot platform with the aim to verify the validity and feasibility of the novel methods proposed in this paper.