Communication Fault Tolerance in Distributed Robotic Systems

  • Péter Molnár
  • Jens Starke


The task of assigning a team of mobile robotic systems to individual job-locations has many challenges. We use the dynamical systems approach of coupled selection equations to achieve this problem. This intrinsically distributed algorithm has several advantages over traditional integer programs and other distributed approaches: 1) no backtracking is needed, 2) it can be used for NP-hard problems, such as assigning multiple robots with different capabilities to a certain job (three- or higher-index assignment problems), and 3) feasibility of the obtained solutions can be guaranteed.

The key point of the applicability in real distributed environments is a distinctive communication fault tolerance so that the necessary data communication between the different processes does not alter to an Achilles heel of the system. Therefore, the present paper addresses the loss of messages in a distributed robotic system based on coupled selection equations, and demonstrates the remarkable communication fault tolerance of this specific dynamical system approach by computer simulations.


Robotic System Destination Vector Preference Matrix Dynamical System Approach Distribute Control System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Arkin. Behavior-Based Robotics. The MIT Press, Cambridge, London, 1998.Google Scholar
  2. 2.
    George A. Bekey and Arvin Agah. Group behavior of robots. In Shimon J. Nof, editor, Handbook of Industrial Robotics ,chapter 23. John Wiley & Sons, Inc., second edition, 1999.Google Scholar
  3. 3.
    D. Helbing and P. Molnár. Social force model for pedestrian dynamics. Physical Review E ,51:4282–4286, 1995.CrossRefGoogle Scholar
  4. 4.
    P. Molnár and J. Starke. Control of distributed autonomous robotic systems using principles of pattern formation in nature and pedestrian behaviour. submitted, 1999.Google Scholar
  5. 5.
    J. Starke. Kombinatorische Optimierung auf der Basis gekoppelter Selektions-gleichungen. PhD thesis, Universität Stuttgart, Verlag Shaker, Aachen, 1997.Google Scholar
  6. 6.
    J. Starke and M. Schanz. Dynamical system approaches to combinatorial optimization. In D.-Z. Du and P. Pardalos, editors, Handbook of Combinatorial Optimization ,volume 2, pages 471–524. Kluwer Academic Publisher, Dordrecht, Boston, London, 1998.Google Scholar
  7. 7.
    J. Starke, M. Schanz, and H. Haken. Self-organized behaviour of distributed autonomous mobile robotic systems by pattern formation principles. In T. Lueth, R. Dillmann, P. Dario, and H. Wörn, editors, Distributed Autonomous Robotic Systems 3, pages 89–100. Springer Verlag, Heidelberg, Berlin, New York, 1998.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Tokyo 2000

Authors and Affiliations

  • Péter Molnár
    • 1
  • Jens Starke
    • 2
  1. 1.Center for Theoretical Studies of Physical SystemsClark Atlanta UniversityUSA
  2. 2.Institute of Applied MathematicsUniversity of HeidelbergGermany

Personalised recommendations