The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots

AbstractOver the past few years, the focus of robotic design has been moving from a scenario where a few specialized (and expensive) units were used to solve a variety of tasks, to a scenario where many general purpose (and cheap) units are used to achieve some common goal. Consequently, part of the focus has been to understand better how to coordinate and control a set of such “simpler” mobile units efficiently. Studies can be found in different disciplines, from engineering to artificial life: a shared feature of the majority of these works has been the design of algorithms based on heuristics, with no main concern on their correctness and termination. Few researchers have focused on trying to model formally an environment constituted by mobile units, analyzing which kind of capabilities they must have in order to achieve their goals; in other words, to study the problem from a computational point of view. In this paper we do a direct comparison between two models, ATOM and CORDA, introduced in two studies leading in this direction. First their main features are described, and then the main differences are highlighted, showing the relationship between the class of problems solvable in the two models.

[1]  Xavier Défago,et al.  Circle formation for oblivious anonymous mobile robots with no common sense of orientation , 2002, POMC '02.

[2]  Nicola Santoro,et al.  Solving the Robots Gathering Problem , 2003, ICALP.

[3]  Nicola Santoro,et al.  Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots , 1999, ISAAC.

[4]  Vincenzo Gervasi,et al.  Robotic cops: the intruder problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[5]  Yoshio Kawauchi,et al.  A principle of distributed decision making of Cellular Robotic System (CEBOT) , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[6]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[7]  Giuseppe Prencipe Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots , 2001, ICTCS.

[8]  Maja J. Mataric,et al.  Interaction and intelligent behavior , 1994 .

[9]  Xavier A. Debest,et al.  Remark About Self-Stabilizing Systems , 1995, Commun. ACM.

[10]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[11]  Giuseppe Prencipe On the Feasibility of Gathering by Autonomous Mobile Robots , 2005, SIROCCO.

[12]  Lynne E. Parker,et al.  On the design of behavior-based multi-robot teams , 1995, Adv. Robotics.

[13]  Edmund H. Durfee,et al.  Blissful Ignorance: Knowing Just Enough to Coordinate Well , 1995, ICMAS.

[14]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[15]  Vincenzo Gervasi,et al.  Coordination without communication: the case of the flocking problem , 2004, Discret. Appl. Math..

[16]  Tucker R. Balch,et al.  Behavior-based formation control for multirobot teams , 1998, IEEE Trans. Robotics Autom..

[17]  Masafumi Yamashita,et al.  A Theory of Distributed Anonymous Mobile Robots Formation and Agreement Problems. , 1994 .

[18]  Ichiro Suzuki,et al.  Distributed algorithms for formation of geometric patterns with many mobile robots , 1996, J. Field Robotics.

[19]  Masafumi Yamashita,et al.  Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 1999, SIAM J. Comput..

[20]  Nicola Santoro,et al.  Distributed coordination of a set of autonomous mobile robots , 2000, Proceedings of the IEEE Intelligent Vehicles Symposium 2000 (Cat. No.00TH8511).

[21]  H. Kurokawa,et al.  Self-assembling machine , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[22]  Noa Agmon,et al.  Fault-tolerant gathering algorithms for autonomous mobile robots , 2004, SODA '04.