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

基于优先级编码同伦约束的鲁棒多机器人协调

Robust multirobot coordination using priority encoded homotopic constraints

MINES ParisTech(巴黎高等矿业学院);Inria(法国国家信息与自动化研究所)

Jean Gregoire, Silvère Bonnabel, Arnaud de La Fortelle

摘要:

我们研究的问题,协调多个机器人沿固定的几何路径。我们的贡献是三方面的。首先将优先权的直观概念形式化为一个可行协调解所诱导的二元关系,不排除机器人在同一条几何路径上相互跟随的情况,然后证明了协调空间中两条路径连续相互变形的充要条件是它们诱导\emph{same priority graph},即优先权图唯一地编码协调解的同伦类.最后,我们给出了一个简单的控制律,允许安全地导航到同伦类\emph{under kinodynamic constraints},即使在出现意外事件,如突然机器人减速没有通知。看起来同伦类中的自由度允许大大偏离任何预先计划的轨迹,而不会发生冲突,也不必重新计划分配的优先级。

英文摘要:

We study the problem of coordinating multiple robots along fixed geometric paths. Our contribution is threefold. First we formalize the intuitive concept of priorities as a binary relation induced by a feasible coordination solution, without excluding the case of robots following each other on the same geometric path. Then we prove that two paths in the coordination space are continuously deformable into each other if and only if they induce the \emph{same priority graph}, that is, the priority graph uniquely encodes homotopy classes of coordination solutions. Finally, we give a simple control law allowing to safely navigate into homotopy classes \emph{under kinodynamic constraints} even in the presence of unexpected events, such as a sudden robot deceleration without notice. It appears the freedom within homotopy classes allows to much deviate from any pre-planned trajectory without ever colliding nor having to re-plan the assigned priorities.

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

↑