arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.07038cs.MAcs.ROcs.SYeess.SY
收藏

移动机器人网络中的间歇通信控制与路径优化同时进行

Simultaneous Intermittent Communication Control and Path Optimization in Networks of Mobile Robots

Duke University(杜克大学)

Yiannis Kantaros, Michael M. Zavlanos

AI总结:

本文提出了一种间歇通信框架,通过移动机器人在连接移动图的边缘移动并仅在节点相遇时通信,实现网络的间歇连通性和路径优化,同时通过局部LTL公式分解和分布式冲突解决方案保证全局LTL公式的满足。

摘要:

本文提出了一种间歇通信框架用于移动机器人网络。具体而言,我们考虑机器人沿连接移动图的边移动,并仅在该图的节点相遇时通信,从而形成动态通信网络。我们提出的分布式控制器同时确保网络的间歇连通性和路径优化。我们展示间歇连通性需求可以被一个全局线性时间逻辑(LTL)公式封装。然后将其近似分解为局部LTL表达式并分配给机器人。为了避免由于这种近似分解可能产生的冲突行为,我们开发了一种分布式冲突解决方案,该方案基于分配的局部LTL表达式为每个机器人生成非冲突的离散运动计划,其组合满足全局LTL公式。通过适当引入生成运动计划执行中的延迟,我们还证明所提出的控制器可以异步执行。

英文摘要:

In this paper, we propose an intermittent communication framework for mobile robot networks. Specifically, we consider robots that move along the edges of a connected mobility graph and communicate only when they meet at the nodes of that graph giving rise to a dynamic communication network. Our proposed distributed controllers ensure intermittent connectivity of the network and path optimization, simultaneously. We show that the intermittent connectivity requirement can be encapsulated by a global Linear Temporal Logic (LTL) formula. Then we approximately decompose it into local LTL expressions which are then assigned to the robots. To avoid conflicting robot behaviors that can occur due to this approximate decomposition, we develop a distributed conflict resolution scheme that generates non-conflicting discrete motion plans for every robot, based on the assigned local LTL expressions, whose composition satisfies the global LTL formula. By appropriately introducing delays in the execution of the generated motion plans we also show that the proposed controllers can be executed asynchronously.

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

↑