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

NAS:脚步步态规划问题所有解的N步计算

NAS: N-step computation of All Solutions to the footstep planning problem

TOWARD S.A.S.(TOWARD S.A.S.公司);LAAS-CNRS(法国国家科学研究中心自动化与系统分析实验室);Université de Toulouse(图卢兹大学);Artificial and Natural Intelligence Toulouse Institute(图卢兹人工与自然智能研究所);University of Edinburgh(爱丁堡大学);The Alan Turing Institute(阿兰·图灵研究所)

Jiayi Wang, Saeid Samadi, Hefan Wang, Pierre Fernbach, Olivier Stasse, Sethu Vijayakumar, Steve Tonneau

AI总结:

NAS算法同时考虑连续与离散方面,计算接触规划问题的所有解,产生全局最优策略,实现实时高效的人形机器人脚步规划。

摘要:

在给定步数内爬楼梯有多少种方式?如果我们关注问题的连续性方面,则有无数种方式。如果考虑离散性方面,即哪些效应器将踩在哪个表面上以及以什么顺序,则是一个有限的、可能很大的数字。我们引入了NAS,这是一种同时考虑这两个方面并计算此类接触规划问题所有可能解的算法,且在标准假设下进行。据我们所知,NAS是第一个产生全局最优策略的算法,可实时高效查询以规划人形机器人的下一步脚步。我们的实证结果(在仿真和Talos平台上)表明,尽管具有理论上的指数复杂度,但优化将NAS的实际复杂度降低到了可管理的双线性形式,保持了完整性保证并实现了高效的GPU并行化。NAS在Talos机器人的多种场景中进行了演示,包括仿真和硬件平台。未来的工作将集中于进一步减少计算时间,并将算法的适用性扩展到步态运动之外。我们的视频可在https://youtu.be/I5yFe0ez0sI 查看。

英文摘要:

How many ways are there to climb a staircase in a given number of steps? Infinitely many, if we focus on the continuous aspect of the problem. A finite, possibly large number if we consider the discrete aspect, \emph{i.e.} on which surface which effectors are going to step and in what order. We introduce NAS, an algorithm that considers both aspects simultaneously and computes \emph{all} the possible solutions to such a contact planning problem, under standard assumptions. To our knowledge NAS is the first algorithm to produce a globally optimal policy, efficiently queried in real time for planning the next footsteps of a humanoid robot. Our empirical results (in simulation and on the Talos platform) demonstrate that, despite the theoretical exponential complexity, optimisations reduce the practical complexity of NAS to a manageable bilinear form, maintaining completeness guarantees and enabling efficient GPU parallelisation. NAS is demonstrated in a variety of scenarios for the Talos robot, both in simulation and on the hardware platform. Future work will focus on further reducing computation times and extending the algorithm's applicability beyond gaited locomotion. Our video is available at \url{https://youtu.be/I5yFe0ez0sI}

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

↑