Skip to main content

Ray-Shooting Algorithms for Robotics

  • Conference paper
Book cover Algorithmic Foundations of Robotics X

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 86))

Abstract

Ray shooting is a well-studied problem in computer graphics. It also occurs in robotics as a collision detection problem in 3-D object space or a contact force optimization problem in 6-D wrench space. However, the ray-shooting algorithms derived in computer graphics are limited to 3-D polyhedra and not suited for general convex sets in high-dimensional space. This paper discusses several general ray-shooting algorithms and their applications to these problems in robotics.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Matoušek, J.: Ray shooting and parametric search. In: Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 517–526 (1992)

    Google Scholar 

  2. Ding, D., Liu, Y.-H., Wang, Y., Wang, S.G.: Automatic selection of fixturing surfaces and fixturing points for polyhedral workpieces. IEEE Transactions on Robotics and Automation 17(6), 833–841 (2001)

    Article  Google Scholar 

  3. Gilbert, E.G., Johnson, D.W., Keerthi, S.S.: A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Transactions on Robotics and Automation 4(2), 193–203 (1988)

    Article  Google Scholar 

  4. Lay, S.R.: Convex Sets and their Applications. John Wiley & Sons, New York (1982)

    MATH  Google Scholar 

  5. Lin, M., Canny, J.: A fast algorithm for incremental distance calculation. In: Proceedings of the IEEE International Conference on Robotics and Automation, Sacramento, CA, pp. 1008–1014 (1991)

    Google Scholar 

  6. Liu, Y.-H.: Qualitative test and force optimization of 3-D frictional form-closure grasps using linear programming. IEEE Transactions on Robotics and Automation 15(1), 163–173 (1999)

    Article  Google Scholar 

  7. Liu, Y.-H., Lam, M.-L., Ding, D.: A complete and efficient algorithm for searching 3-D form-closure grasps in the discrete domain. IEEE Transactions on Robotics 20(5), 805–816 (2004)

    Article  Google Scholar 

  8. Matoušek, J., Schwarzkopf, O.: On ray shooting in convex polytopes. Discrete Computational Geometry 10(1), 215–232 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Murray, R.M., Li, Z.X., Sastry, S.S.: A Mathematical Introduction to Robotic Manipulation. CRC Press, Boca Raton (1994)

    MATH  Google Scholar 

  10. Ong, C.J., Gilbert, E.G.: Growth distance: New measures for object separation and penetration. IEEE Transactions on Robotics and Automation 12(6), 888–903 (1996)

    Article  Google Scholar 

  11. Ong, C.J., Gilbert, E.G.: Robot path planning with penetration growth distance. Jounral of Robotic Systems 15(2), 57–74 (1998)

    Article  MATH  Google Scholar 

  12. Rudin, W.: Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York (1976)

    MATH  Google Scholar 

  13. Szirmay-Kalos, L., Havran, V., Balázs, B., Szécsi, L.: On the efficiency of ray-shooting acceleration schemes. In: Proceedings of the Spring Conference on Computer Graphics, Budmerice, Slovakia, pp. 97–106 (2002)

    Google Scholar 

  14. van den Bergen, G.: Ray casting against general convex objects with application to continuous collision detection (2004), http://www.dtecta.com

  15. Zheng, Y., Chew, C.-M.: Distance between a point and a convex cone in n-dimensional space: computation and applications. IEEE Transactions on Robotics 25(6), 1397–1412 (2009)

    Article  Google Scholar 

  16. Zheng, Y., Chew, C.-M.: A numerical solution to the ray-shooting problem and its applications in robotic grasping. In: Proceedings of the IEEE International Conference on Robotics and Automation, Kobe, Japan, pp. 2080–2085 (May 2009)

    Google Scholar 

  17. Zheng, Y., Chew, C.-M., Adiwahono, A.H.: A GJK-based approach to contact force feasibility and distribution of multi-contact robots. Robotics and Autonomous Systems 59(3-4), 194–207 (2011)

    Article  Google Scholar 

  18. Zheng, Y., Lin, M.C., Manocha, D.: A fast n-dimensional ray-shooting algorithm for grasping force optimization. In: Proceedings of the IEEE International Conference on Robotics and Automation, Anchorage, Alaska, pp. 1300–1305 (May 2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yu Zheng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, Y., Yamane, K. (2013). Ray-Shooting Algorithms for Robotics. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds) Algorithmic Foundations of Robotics X. Springer Tracts in Advanced Robotics, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36279-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36279-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36278-1

  • Online ISBN: 978-3-642-36279-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics