Distributed Shortest-Path Finding by a Micro-robot Swarm

Distributed Shortest-Path Finding by a Micro-robot Swarm
复制标题

微型机器人群的分布式最短路径查找

DOI：
--
复制
发表时间：
2006
期刊：
ANTS Workshop
影响因子：
--
通讯作者：
H. Wörn
H. Wörn
中科院分区：
--
文献类型：
--
作者：
Marc Szymanski;Tobias Breitling;J. Seyfried;H. Wörn

文献摘要

被引文献

相似文献

本文介绍了一种分布式算法，解决最短路径问题的JASMINE微型机器人群。每个机器人只能通过红外线与其邻居连接。基于局部信息交换和一些简单的规则，群体设法找到最短路径（路径上的机器人数量的最短路径）在一个迷宫的死胡同和循环。本文给出了完整的算法和仿真结果。
This paper describes a distributed algorithm for solving the shortest path problem with a swarm of JASMINE micro-robots. Each robot is only connected via infra-red communication with its neighbours. Based on local information exchange and some simple rules the swarm manages to find the shortest path (shortest path in the number of robots on the path) in a labyrinth with dead-ends and cycles. The full algorithm and simulation results are presented in this paper.