Skip to main content

Collision Avoidance for Cooperating Cleaning Robots

  • Conference paper
  • 154 Accesses

Part of the book series: Informatik aktuell ((INFORMAT))

Abstract

If multiple robots are used to cooperatively clean a larger room, a variety of new problems occur. These problems are shortly presented and for the collision avoidance problem a possible solution is suggested.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.D. Schraft and G. Schmierer, Serviceroboter: Produkte, Szenarien, Visionen, Springer, 1998

    Google Scholar 

  2. H. Endres, W. Feiten, and G. Lawitzky, Field Test of a Navigation System: Autonomous Cleaning in Supermarkets, Int. Conf. on Robotics and Automation (ICRA), pp. 1779–1781, 19

    Google Scholar 

  3. M. Jäger and B. Nebel, Decentralized Collision Avoidance, Deadlock Detection, and Deadlock Resolution for Multiple Mobile Robots, Int. Conf. on Intelligent Robots and Systems (IROS), to appear, 20

    Google Scholar 

  4. M. Bennewitz and W. Burgard, Coordinating the Motions of Multiple Mobile Robots Using a Probabilistic Model. 8th International Symposium on Intelligent Robotic Systems (SIRS), 200

    Google Scholar 

  5. H. Bast and S. Hert, The Area Partitioning Problem, 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, 2

    Google Scholar 

  6. C. Hofner and G. Schmidt, Path Planning And Guidance Techniques For An Autonomous Mobile Cleaning Robot, Intelligent Robots and Systems, Vol. 1, pp. 610–617, München, 1

    Google Scholar 

  7. J. Barraquand, B. Langlois, and J.-C. Latombe, Numerical Potential Field Techniques for Robot Path Planning, IEEE Trans. on System, Man, and Cybernetics, vol. 22(2), pp. 224–241, 1992

    Article  MathSciNet  Google Scholar 

  8. L. Aguilar, R. Alimi, S. Fleury, M. Herrb, F. Ingrand, and F. Robert, Ten Autonomous Mobile Robots (and even more) in a Route Network Like Environment, Int. Conf. on Intelligent Robots and Systems (IROS), Vol. 2, pp. 260–267, 1995

    Google Scholar 

  9. S. Kato, S. Nishiyama, and J. Takeno, Coordinating Mobile Robots by Applying Traffic Rules, International Conference on Intelligent Robots and Systems (IROS), pp. 1535–1541, 1992

    Google Scholar 

  10. K. Kant and S.W. Zucker, Towards Efficient Trajectory Planning: The Path-Velocity-Decomposition, The International Journal of Robotics Research, no. 5, pp. 72–89, 1

    Google Scholar 

  11. P.A. O’Donnell and T. Lozano-Periz, Deadlock-Free and Collision-Free Coordination of Two Robot Manipulators, Int. Conf on Robotics and Automation (ICRA), pp. 484–489, 19

    Google Scholar 

  12. J. Wang and V.Premvuti, Distributed traffic regulation and control for multiple autonomous mobile robots operating in discrete space, Int. Conf. on Robotics and Automation (ICRA), pp. 1619–1624, 19

    Google Scholar 

  13. K.M. Chandy, J. Misra, and L.M. Haas, Distributed Deadlock Detection, ACM Trans. on Computer Systems, May 19

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jäger, M. (2001). Collision Avoidance for Cooperating Cleaning Robots. In: Levi, P., Schanz, M. (eds) Autonome Mobile Systeme 2001. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56787-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56787-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42552-6

  • Online ISBN: 978-3-642-56787-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics