aalto1 untyped-item.component.html
Contact Planning for Multi-Legged Robots Under Constraints Through Parallel MCTS
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Authors
Xu, Peng
Ding, Liang
Ye, Lei
Pang, Tengwei
Liu, Tie
Yang, Huaiguang
Gao, Haibo
Deng, Zongquan
Pajarinen, Joni
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
21
Series
IEEE Transactions on Robotics, Volume 41, pp. 6102-6122
Abstract
Contact planning for multilegged robots is a challenging sequential decision-making problem due to the interplay of gaits, footholds, configurations, and physical constraints from both the robot and the environment. Existing multicontact planners often fail to find feasible sequences within a limited time in complex scenarios and to ensure physical possibility. We propose a parallel Monte Carlo tree search-based planner that leverages multiconstraint reachability to efficiently generate physically valid contact sequences. The method accelerates planning through a hash-driven parallel approach, prioritizing promising candidates while pruning trapped nodes via valueless node evaluation. It employs depth-first backup for long-horizon planning and uses virtual loss to balance parallel exploration. To ensure feasible transitions between contact states, we establish comprehensive reachability conditions for multilegged robots, incorporating stability, collision avoidance, kinematics, joint torques, and contact constraints into the planning framework. In experiments in sparse foothold environments, our planner outperforms mainstream contact planning approaches in traversability, solution quality, and physical feasibility, while achieving a competitive planning speed. Furthermore, simulation and hardware validation on hexapod and humanoid robots exhibit successful locomotion across various terrains while satisfying constraints.
Description
Publisher Copyright: © 2004-2012 IEEE.
Other note
Citation
Xu, P, Ding, L, Ye, L, Pang, T, Liu, T, Yang, H, Gao, H, Deng, Z & Pajarinen, J 2025, 'Contact Planning for Multi-Legged Robots Under Constraints Through Parallel MCTS', IEEE Transactions on Robotics, vol. 41, pp. 6102-6122. https://doi.org/10.1109/TRO.2025.3619054