arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.07550cs.RO
收藏

基于蒙特卡洛树的六足机器人容错自由步态与落足点规划

Fault Tolerant Free Gait and Footstep Planning for Hexapod Robot Based on Monte-Carlo Tree

Harbin Institute of Technology(哈尔滨工业大学);Ryerson University(瑞尔森大学)

Liang Ding, Peng Xu, Haibo Gao, Zhikai Wang, Ruyi Zhou, Zhaopei Gong, Guangjun Liu

AI总结:

本文针对六足机器人在稀疏落足点环境中的通过性问题,提出基于蒙特卡洛树搜索的步态与落足点协调规划方法,并结合容错步态策略,显著提升了复杂地形下的通行能力。

摘要:

腿足机器人可以通过仔细选择步态和离散落足点来穿越复杂的野外环境。传统方法将步态和落足点分开规划,并将其视为单步最优过程。然而,这种处理方式导致机器人在稀疏落足点环境中通过性较差。本文新颖地提出了一种六足机器人协调规划方法,将步态和落足点的规划视为一个序列优化问题,并考虑应对腿部故障等环境严酷性。采用蒙特卡洛树搜索算法(MCTS)对整个序列进行优化。针对标准MCTS在腿足机器人规划领域应用中的一些不足,提出了FastMCTS和SlidingMCTS两种方法。所提出的规划算法结合了容错步态方法,以提高算法的通过性。最后,与其他规划方法相比,在不同落足点密度的地形和人工设计的具有挑战性的地形上进行了实验,以验证我们的方法。所有结果表明,所提出的方法显著提高了六足机器人穿越稀疏落足点环境的能力。

英文摘要:

Legged robots can pass through complex field environments by selecting gaits and discrete footholds carefully. Traditional methods plan gait and foothold separately and treat them as the single-step optimal process. However, such processing causes its poor passability in a sparse foothold environment. This paper novelly proposes a coordinative planning method for hexapod robots that regards the planning of gait and foothold as a sequence optimization problem with the consideration of dealing with the harshness of the environment as leg fault. The Monte Carlo tree search algorithm(MCTS) is used to optimize the entire sequence. Two methods, FastMCTS, and SlidingMCTS are proposed to solve some defeats of the standard MCTS applicating in the field of legged robot planning. The proposed planning algorithm combines the fault-tolerant gait method to improve the passability of the algorithm. Finally, compared with other planning methods, experiments on terrains with different densities of footholds and artificially-designed challenging terrain are carried out to verify our methods. All results show that the proposed method dramatically improves the hexapod robot's ability to pass through sparse footholds environment.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑