Decomposition of fundamental problems for cooperative autonomous mobile systems

Mobile computing can be seen as a natural extension of distributed computing, with the difference that hosts can be physically mobile. This results in many interesting new challenges. The most original aspect of mobile computing with respect to traditional distributed computing is when one considers problems whereby the movements of the host must be controlled. In particular, this is a central issue for cooperating autonomous mobile systems. We outline a specification framework to define recurrent problems for cooperative autonomous mobile systems. The framework consists of four generic properties (two liveness and two safety properties) that can be combined to define many different problems, including those surveyed in the literature. We regard this as a necessary step toward a better understanding of the relationships between problems.

[1]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[2]  Paul G. Spirakis,et al.  Smart dust protocols for local detection and propagation , 2002, POMC '02.

[3]  Vinny Cahill,et al.  Towards group communication for mobile participants. , 2001 .

[4]  Alex Fukunaga,et al.  Cooperative mobile robotics: antecedents and directions , 1995 .

[5]  Maria Gradinariu Potop-Butucaru,et al.  Looking for a common view for mobile worlds , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[6]  Vincenzo Gervasi,et al.  Need a Fleet? Use the Force! , 2001 .

[7]  Andrew B. Kahng,et al.  Cooperative Mobile Robotics: Antecedents and Directions , 1997, Auton. Robots.

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

[9]  Mark Cieliebak,et al.  Gathering Autonomous Mobile Robots , 2002, SIROCCO.

[10]  Nicola Santoro,et al.  Gathering of Asynchronous Oblivious Robots with Limited Visibility , 2001, STACS.

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

[12]  Dit-Yan Yeung,et al.  A decentralized approach to the motion planning problem for multiple mobile robots , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

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

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

[15]  Nicola Santoro,et al.  Pattern Formation by Anonymous Robots Without Chirality , 2001, SIROCCO.

[16]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[17]  Giuseppe Prencipe,et al.  CORDA : distributed coordination of a set of autonomous mobile robots , 2001 .

[18]  Nitin H. Vaidya,et al.  A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks , 2001, Wirel. Networks.

[19]  J. Ota,et al.  Transferring and regrasping a large object by cooperation of multiple mobile robots , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[20]  and G Vincenzo Gervasi.  Flocking by a Set of Autonomous Mobile Robots , 2001 .

[21]  Vladimir J. Lumelsky,et al.  Moving multiple tethered robots between arbitrary configurations , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.