Skip to main content

Efficient Collision Avoidance for Industrial Manipulators with Overlapping Workspaces

  • Chapter
  • First Online:
  • 1502 Accesses

Abstract

This paper introduces an efficient collision watchdog predicting impacts between fast moving industrial robots. The presented approach considers the manipulator states in a three dimensional space. Tailored bounding volumes allow fast collision detection and distance calculations. The watchdog makes use of the internal rotary sensors of each robot to build an integrated world representation. Based on this information it is able to monitor the non-predictable behavior of all involved robots.

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   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. C. Brecher, F. Klocke, R. Schmitt, G. Schuh, Excellence in Production. Apprimus, Aachen, 2007

    Google Scholar 

  2. S. Redon, Y. Kim, M. Lin, D. Manocha, Fast continuous collision detection for articulated models. Journal of Computing and Information Science in Engineering 5 (2), 2005, pp. 126–137

    Google Scholar 

  3. S. Redon, A. Kheddar, S. Coquillart, An Algebraic Solution to the Problem of Collision Detection for Rigid Polyhedral Objects. INRIA - Rocquencourt, San Francisco, 2000

    Google Scholar 

  4. K. Abdel-Malek, J. Yang, D. Blackmore, K. Joy, Swept volumes: Fundation, perspectives, and applications. International Journal of Shape Modeling 12 (1), 2006, pp. 87–127

    Google Scholar 

  5. J. Basch, J. Erickson, L. Guibas, J. Hershberger, L. Zhang, Kinetic Collision Detection Between Two Simple Polygons. SiRF Technology Inc., 2003

    Google Scholar 

  6. F. Schwarzer, M. Saha, J. Latombe, Adaptive Dynamic Collision Checking for Single and Multiple Articulated Robots in Complex Environments. 2005

    Google Scholar 

  7. R. Seidel, ed., Linear programming and convex hulls made easy. ACM, 1990. 211–215

    Google Scholar 

  8. K. Chung, W. Wang, Quick elimination of non-interference polytopes in virtual environments. In: Virtual Environments and Scientific Visualization ’96, Springer, 1996, pp. 64–73

    Google Scholar 

  9. B. Chazelle, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM Journal on Computing 13 (3), 1984, pp. 488–507

    Google Scholar 

  10. P. Hubbard, Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics (TOG) 15 (3), 1996, pp. 179–210

    Google Scholar 

  11. S. Quinlan, ed., Efficient distance computation between non-convex objects. IEEE, 1994

    Google Scholar 

  12. N. Beckmann, H. Kriegel, R. Schneider, B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles. ACM, 1990

    Google Scholar 

  13. M. Held, J. Klosowski, J. Mitchell, eds., Evaluation of collision detection methods for virtual reality fly-throughs. Citeseer, 1995

    Google Scholar 

  14. M. Ponamgi, D. Monacho, M. Lin, eds., Incremental algorithms for collision detection between solid models. ACM, 1995

    Google Scholar 

  15. S. Gottschalk, M. Lin, D. Manocha, eds., OBBTree: A hierarchical structure for rapid interference detection. ACM, 1996. 171–180

    Google Scholar 

  16. G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, A. Tal, eds., Boxtree: A hierarchical representation for surfaces in 3D. Wiley Online Library, 1996. 387–396

    Google Scholar 

  17. S. Gottschalk, Collision queries using oriented bounding boxes. 2000

    Google Scholar 

  18. S. Cameron, R. Culley, eds., Determining the minimum translational distance between two convex polyhedra. IEEE, 1986. 591–596

    Google Scholar 

  19. E. Gilbert, K.S. Johnson, D. W., A fast procedure for computing the distance between complex objects in three-dimensional space. Robotics and Automation 4 (2), 1988, pp. 193–203. IEEE Journal

    Google Scholar 

  20. D. Dobkin, J. Hershberger, D. Kirkpatrick, S. Suri, Computing the intersection-depth of polyhedra. Algorithmica 9 (6), 1993, pp. 518–533

    Google Scholar 

  21. S. Niku, Introduction to robotics: analysis, systems, applications. Prentice Hall New Jersey, 2001

    Google Scholar 

  22. I. Bronshtein, K. Semendyayev, G. Musiol, H. Muehlig, Handbook of mathematics. Springer, 2007

    Google Scholar 

  23. W. Dahmen, A. Reusken, Numerik für Ingenieure und Naturwissenschaftler. Springer, 2008

    Google Scholar 

  24. M. Quigley, B. Gerkey, K. Conley, J. Faust, T. Foote, J. Leibs, E. Berger, R. Wheeler, A. Ng, eds., ROS: an open-source Robot Operating System. 2009

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Philipp Ennen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ennen, P., Ewert, D., Schilberg, D., Jeschke, S. (2016). Efficient Collision Avoidance for Industrial Manipulators with Overlapping Workspaces. In: Jeschke, S., Isenhardt, I., Hees, F., Henning, K. (eds) Automation, Communication and Cybernetics in Science and Engineering 2015/2016. Springer, Cham. https://doi.org/10.1007/978-3-319-42620-4_38

Download citation

Publish with us

Policies and ethics