Yoann Dieudonné
ABSTRACT
We introduce the use of movement-signals (analogously to flight signals and bees waggle) as a mean to transfer messages, enabling the use of distributed algorithms among the robots. We propose one-to-one deterministic movement protocols that implement explicit communication.
- F. Aurenhammer. Voronoi diagrams--a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345--405, 1991. Google Scholar
Digital Library
- R. Beckers, O.E Holland, and J.L Deneubourg. From local actions to global tasks: Stigmergy and collective robotics. Artificial Life, 4th Int. Worksh. on the Synth. and Simul. of Living Sys., 4:173--202, 1994.Google Scholar
- C.R. Kube. Task modelling in collective robotics. Auton. Robots, 4(1):53--72, 1997. Google ScholarDigital Library
- P-P Grassé. La reconstruction du nid et les coordinations inter-individuelles chez bellicosi-termes natalensis et cubitermes sp. la theorie de la stigmergie. Insectes Sociaux, 6:41--83, 1959.Google ScholarCross Ref
- M.J. Matarić. Issues and approaches in the design of collective autonomous agents. Robotics and Autonomous Systems, 16(2-4):321--331, 1995.Google ScholarCross Ref
- G Prencipe. Distributed Coordination of a Set of Autonomous Mobile Robots. PhD thesis, Dipartimento di Informatica, University of Pisa, 2002.Google Scholar
- I Suzuki and M Yamashita. Distributed anonymous mobile robots--formation of geometric patterns. SIAM Journal of Computing}, 28(4):1347--1363, 1999. Google ScholarDigital Library
Index Terms
- Brief announcement: deaf, dumb, and chatting robots
Recommendations
The differential ant-stigmergy algorithm
Ant-Colony Optimization (ACO) is a popular swarm intelligence scheme known for its efficiency in solving combinatorial optimization problems. However, despite some extensions of this approach to continuous optimization, high-dimensional problems remain ...
Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe consider the distributed setting of $N$ autonomous mobile robots that operate in Look-Compute-Move cycles following the well-celebrated classic oblivious robots model. We study the fundamental problem where starting from an arbitrary initial ...
Brief announcement: wait-free gathering of mobile robots
DISC'12: Proceedings of the 26th international conference on Distributed ComputingRobot Systems. This paper considers distributed systems of autonomous robots that can move freely on the two-dimensional Euclidean space, have visibility sensors (to see other robots, obstacles etc.) and can perform computations. One of the fundamental ...
Comments