Abstract
We describe how a set of mobile robots can arrange themselves on any specified curve on the plane in the presence of dynamic changes both in the underlying ad hoc network and in the set of participating robots. Our strategy is for the mobile robots to implement a self-stabilizing virtual layer consisting of mobile client nodes, stationary Virtual Nodes (VNs), and local broadcast communication. The VNs are associated with predetermined regions in the plane and coordinate among themselves to distribute the client nodes relatively uniformly among the VNs' regions. Each VN directs its local client nodes to align themselves on the local portion of the target curve. The resulting motion coordination protocol is self-stabilizing, in that each robot can begin the execution in any arbitrary state and at any arbitrary location in the plane. In addition, self-stabilization ensures that the robots can adapt to changes in the desired target formation.
Supplemental Material
Available for Download
Online appendix to self-stabilizing robot formations over unreliable networks. The appendix supports the information on article 17.
- ]]Ando, H., Oasa, Y., Suzuki, I., and Yamashita, M. 1999. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robotics Autom. 15, 5, 818--828.Google Scholar
Cross Ref
- ]]Blondel, V., Hendrickx, J., Olshevsky, A., and Tsitsiklis, J. 2005. Convergence in multi-agent coordination consensus and flocking. In Proceedings of the Joint 44th IEEE Conference on Decision and Control and European Control Conference. 2996--3000.Google Scholar
- ]]Brown, M. D. 2007. Air traffic control using virtual stationary automata. M.S. thesis, Massachusetts Institute of Technology.Google Scholar
- ]]Chandy, K. M., Mitra, S., and Pilotto, C. 2008. Convergence verification: From shared memory to partially synchronous systems. In Proceedings of the Formal Modeling and Analysis of Timed Systems (FORMATS'08). Lecture Notes in Computer Science, vol. 5215. Springer Verlag, 217--231. Google Scholar
Digital Library
- ]]Chockler, G., Gilbert, S., and Lynch, N. 2008. Virtual infrastructure for collision-prone wireless networks. In Proceedings of the Annual ACM SIGOPS Symposium on Principles of Distributed Computing (PODC). Google Scholar
Digital Library
- ]]Clavaski, S., Chaves, M., Day, R., Nag, P., Williams, A., and Zhang, W. 2003. Vehicle networks: Achieving regular formation. In Proceedings of the American Control Conference.Google Scholar
- ]]Cortes, J., Martinez, S., Karatas, T., and Bullo, F. 2004. Coverage control for mobile sensing networks. IEEE Trans. Robotics Autom. 20, 2, 243--255.Google Scholar
Cross Ref
- ]]Défago, X. and Konagaya, A. 2002. Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In Proceedings of the 2nd International Workshop on Principles of Mobile Computing (POMC'02). ACM, 97--104. Google Scholar
Digital Library
- ]]Défago, X. and Souissi, S. 2008. Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theor. Comput. Sci. 396, 1-3, 97--112. Google Scholar
Digital Library
- ]]Dolev, S. 2000. Self-Stabilization. MIT Press, Cambridge. Google Scholar
Digital Library
- ]]Dolev, S., Gilbert, S., Lahiani, L., Lynch, N., and Nolte, T. 2005a. Virtual stationary automata for mobile networks. In Proceedings of the International Conference on Principles of Distributed Systems (OPODIS). Google Scholar
Digital Library
- ]]Dolev, S., Gilbert, S., Lahiani, L., Lynch, N. A., and Nolte, T. A. 2005b. Virtual stationary automata for mobile networks. Tech. rep. MIT-LCS-TR-979.Google Scholar
- ]]Dolev, S., Gilbert, S., Lynch, N., Shvartsman, A., and Welch, J. 2003. Geoquorums: Implementing atomic memory in ad hoc networks. In Distributed Algorithms, F. E. Fich, Ed. Lecture Notes in Computer Science, vol. 2848. 306--320.Google Scholar
Cross Ref
- ]]Dolev, S., Gilbert, S., Lynch, N. A., Schiller, E., Shvartsman, A. A., and Welch, J. L. 2004. Virtual mobile nodes for mobile ad hoc networks. In Proceedings of the 18th International Symposium on Distributed Computing (DISC). 230--244. Google Scholar
Digital Library
- ]]Dolev, S., Gilbert, S., Lynch, N. A., Shvartsman, A. A., and Welch, J. 2005. Geoquorums: Implementing atomic memory in mobile ad hoc networks. Distrib. Comput. Google Scholar
Digital Library
- ]]Efrima, A. and Peleg, D. 2007. Distributed models and algorithms for mobile robot systems. In Proceedings of SOFSEM (1). Lecture Notes in Computer Science, vol. 4362. Springer, 70--87. Google Scholar
Digital Library
- ]]Fax, J. and Murray, R. 2004. Information flow and cooperative control of vehicle formations. IEEE Trans. Autom. Control 49, 1465--1476.Google Scholar
Cross Ref
- ]]Flocchini, P., Prencipe, G., Santoro, N., and Widmayer, P. 2001. Pattern formation by autonomous robots without chirality. In Proceedings of the Colloquium on Structural Information and Communication Complexity (SIROCCO). 147--162.Google Scholar
- ]]Gazi, V. and Passino, K. M. 2003. Stability analysis of swarms. IEEE Trans. Autom. Control 48, 4, 692--697.Google Scholar
Cross Ref
- ]]Goldenberg, D. K., Lin, J., and Morse, A. S. 2004. Towards mobility as a network control primitive. In Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'04). ACM Press, 163--174. Google Scholar
Digital Library
- ]]Herman, T. 1996. Self-stabilization bibliography: Access guide. Theoretical Comput. Sci.Google Scholar
- ]]Jadbabaie, A., Lin, J., and Morse, A. S. 2003. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48, 6, 988--1001.Google Scholar
Cross Ref
- ]]Kaynar, D. K., Lynch, N., Segala, R., and Vaandrager, F. 2005. The Theory of Timed I/O Automata. Synthesis Lectures on Computer Science. Morgan Claypool. Also available as Tech. rep. MIT-LCS-TR-917. Google Scholar
Digital Library
- ]]Lin, J., Morse, A., and Anderson., B. 2003. Multi-agent rendezvous problem. In Proceedings of the 42nd IEEE Conference on Decision and Control.Google Scholar
Cross Ref
- ]]Lynch, N., Mitra, S., and Nolte, T. 2005. Motion coordination using virtual nodes. In Proceedings of the 44th IEEE Conference on Decision and Control (CDC'05).Google Scholar
- ]]Martinez, S., Cortes, J., and Bullo, F. 2005. On robust rendezvous for mobile autonomous agents. In Proceedings of the IFAC World Congress.Google Scholar
- ]]Nolte, T. and Lynch, N. A. 2007a. Self-stabilization and virtual node layer emulations. In Proceedings of the International Symposium on Self-Stablizing Systems (SSS). 394--408. Google Scholar
Digital Library
- ]]Nolte, T. and Lynch, N. A. 2007b. A virtual node-based tracking algorithm for mobile networks. In IEEE International Conference on Distributed Computing Systems (ICDCS). Google Scholar
Digital Library
- ]]Nolte, T. A. 2008. Virtual stationary timed automata for mobile networks. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge. Google Scholar
Digital Library
- ]]Olfati-Saber, R., Fax, J., and Murray, R. 2007. Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95, 1, 215--233.Google Scholar
Cross Ref
- ]]Prencipe, G. 2000. Achievable patterns by an even number of autonomous mobile robots. Tech. rep. TR-00-11. 17.Google Scholar
- ]]Prencipe, G. 2001. Corda: Distributed coordination of a set of autonomous mobile robots. In Proceedings of the European Research Seminar on Advances in Distributed Systems (ERSADS). 185--190.Google Scholar
- ]]Suzuki, I. and Yamashita, M. 1999. Distributed autonomous mobile robots: Formation of geometric patterns. SIAM J. Comput. 28, 4, 1347--1363. Google Scholar
Digital Library
Index Terms
Self-stabilizing robot formations over unreliable networks
Recommendations
Self-Stabilizing Clustering Algorithm for Ad Hoc Networks
ICWMC '09: Proceedings of the 2009 Fifth International Conference on Wireless and Mobile CommunicationsAn ad hoc network is a local network that is built spontaneously as devices connect. Instead of relying on a base station or the centralized device, to coordinate the flow of messages to each node in the network, the individual network nodes forward ...
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Special issue on wireless and mobile ad hoc networking and computingSpanning trees help removing cycles and establishing short paths between a given node and the rest of the nodes in a network. In ad hoc mobile computing networks, however, transient node failures occur due to being out of range or powered off. Therefore,...
Self-stabilizing and self-orgenizing mobile networks
DIALM-POMC '08: Proceedings of the fifth international workshop on Foundations of mobile computingSelf-stabilization ([Dij74], [Dolev00] is an important property of any dynamic long-lived system. Self-stabilizing systems may start operating in any arbitrary state, and can therefore recover following a temporary violation of the assumption made by ...






Comments