Humanoid Loco-manipulation Planning based on Graph Search and Reachability Maps
Masaki Murooka, Iori Kumagai, Mitsuharu Morisawa, Fumio Kanehiro, Abderrahmane Kheddar
TL;DR
The paper tackles autonomous loco-manipulation planning for humanoid robots moving large objects in cluttered environments. It introduces a three-process framework (OP-planning, FR-planning, WBM-planning) that combines RRT*-based object path planning with a graph-search-based FR-planning driven by a novel transition model that relabels reachability maps as the object moves. Key contributions include automatic generation of rolling motions with regrasping via reachability-map switching, and a unified planning approach that handles obstacle avoidance, regrasping, and multi-contact dynamics, demonstrated on bobbin rolling, door opening, and cart pushing tasks with dynamic feasibility validated by ZMP analysis. The approach yields fast initial solutions and scalable final plans within seconds, enabling practical real-time-like loco-manipulation planning for humanoids in industrial-like settings. Overall, this work advances humanoid loco-manipulation by integrating object motion, grasp changes, and environment constraints within a single, efficient planning framework, with potential for real-time replanning and extension to more complex interactions.
Abstract
In this letter, we propose an efficient and highly versatile loco-manipulation planning for humanoid robots. Loco-manipulation planning is a key technological brick enabling humanoid robots to autonomously perform object transportation by manipulating them. We formulate planning of the alternation and sequencing of footsteps and grasps as a graph search problem with a new transition model that allows for a flexible representation of loco-manipulation. Our transition model is quickly evaluated by relocating and switching the reachability maps depending on the motion of both the robot and object. We evaluate our approach by applying it to loco-manipulation use-cases, such as a bobbin rolling operation with regrasping, where the motion is automatically planned by our framework.
