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

安全且稳定的分布式多路径蜂窝流

Safe and Stabilizing Distributed Multi-Path Cellular Flows

Coordinated Science Laboratory, University of Illinois at Urbana-Champaign,Urbana, IL 61801, USA(协调科学实验室,伊利诺伊大学厄巴纳-香槟分校)

Taylor T. Johnson, Sayan Mitra

AI总结:

针对分区平面中的分布式交通控制问题,提出一种保证实体间最小安全距离并能在单目标下自稳定、多目标下避免死锁的协议,通过临时阻塞和局部地理路由实现安全与进展。

摘要:

我们研究了分区平面中的分布式交通控制问题,其中每个分区(单元)内所有实体(机器人、车辆等)的运动是耦合的。在此类系统中建立活性具有挑战性,但这种分析对于将分布式交通控制算法应用于协调机器人群体和智能高速公路系统等场景是必要的。我们提出了一个分布式交通控制协议的正式模型,该模型保证实体之间的最小安全距离,即使某些单元发生故障。一旦新故障停止发生,在单目标情况下,协议保证自稳定,并且具有到目标单元可行路径的实体能够向目标前进。对于多目标情况,故障可能导致系统死锁,因此我们识别了一类非死锁故障,其中所有实体都能向各自目标前进。该算法依赖于两个通用原则:临时阻塞以维护安全性,以及局部地理路由以保证进展。我们的断言式证明可作为其他分布式交通控制协议分析的模板。我们给出了仿真结果,提供了吞吐量作为实体速度、安全距离、单目标路径复杂度、故障恢复率和多目标路径复杂度的函数估计。

英文摘要:

We study the problem of distributed traffic control in the partitioned plane, where the movement of all entities (robots, vehicles, etc.) within each partition (cell) is coupled. Establishing liveness in such systems is challenging, but such analysis will be necessary to apply such distributed traffic control algorithms in applications like coordinating robot swarms and the intelligent highway system. We present a formal model of a distributed traffic control protocol that guarantees minimum separation between entities, even as some cells fail. Once new failures cease occurring, in the case of a single target, the protocol is guaranteed to self-stabilize and the entities with feasible paths to the target cell make progress towards it. For multiple targets, failures may cause deadlocks in the system, so we identify a class of non-deadlocking failures where all entities are able to make progress to their respective targets. The algorithm relies on two general principles: temporary blocking for maintenance of safety and local geographical routing for guaranteeing progress. Our assertional proofs may serve as a template for the analysis of other distributed traffic control protocols. We present simulation results that provide estimates of throughput as a function of entity velocity, safety separation, single-target path complexity, failure-recovery rates, and multi-target path complexity.

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

↑