不可靠的传感器实现可靠高效的机器人
Unreliable Sensors for Reliable Efficient Robots
摘要:
绝大多数现有的分布式计算文献的移动机器人群考虑可计算性问题:表征一组系统假设,使问题的可解决性。相比之下,这项工作的重点是研究复杂性问题:获得关于一个给定的问题,承认解决方案的定量结果。我们的定量测量依赖于一个新开发的模拟框架,以基准笔和纸的设计。首先,我们考虑在给定位置收集机器人时的最大行进距离,在经典的OBLOT模型中,对于FSYNC,SSYNC和ASYNC机器人,事先不知道(在两个机器人和n个机器人设置中)。这个特定的指标似乎是相关的,因为它与现实世界的燃料消耗密切相关。然后,我们介绍了错误的机器人的视觉的可能性,并评估的行为已知的会合(又名两个机器人聚集)和领导人选举协议时,传感器是不可靠的。我们还介绍了两种新的算法,一种是燃油效率的收敛,一种是领导者选举,尽管不可靠的传感器可靠地运行。
英文摘要:
The vast majority of existing Distributed Computing literature about mobile robotic swarms considers computability issues: characterizing the set of system hypotheses that enables problem solvability. By contrast, the focus of this work is to investigate complexity issues: obtaining quantitative results about a given problem that admits solutions. Our quantitative measurements rely on a newly developed simulation framework to benchmark pen and paper designs. First, we consider the maximum traveled distance when gathering robots at a given location, not known beforehand (both in the two robots and in the n robots settings) in the classical OBLOT model, for the FSYNC, SSYNC, and ASYNC schedulers. This particular metric appears relevant as it correlates closely to what would be real world fuel consumption. Then, we introduce the possibility of errors in the vision of robots, and assess the behavior of known rendezvous (aka two robots gathering) and leader election protocols when sensors are unreliable. We also introduce two new algorithms, one for fuel efficient convergence, and one for leader election, that operate reliably despite unreliable sensors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。