Skip to main content

Solving the Find-Path Problem by Good Representation of Free Space

  • Chapter
Autonomous Robot Vehicles

Abstract

Free space is represented as a union of (possibly overlapping) generalized cones. An algorithm is presented which efficiently finds good collision-free paths for convex polygonal bodies through space littered with obstacle polygons. The paths are good in the sense that the distance of closest approach to an obstacle over the path is usually far from minimal over the class of topologically equivalent collision-free paths. The algorithm is based on characterizing the volume swept by a body as it is translated and rotated as a generalized cone, and determining under what conditions one generalized cone is a subset of another.

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 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Russell V. Benson, Euclidean Geometry and Convexity. New York: McGraw-Hill, 1966.

    Google Scholar 

  2. Thomas O. Binford, “Visual perception by computer,” presented at IEEE Systems, Science, and Cybernetics Conf., Miami, FL, Dec. 1971.

    Google Scholar 

  3. Rodney A. Brooks and Tomás Lozano-Pérez, “A subdivision algorithm in configuration space for findpath with rotation,” M.I.T. Tech Rep. AIM-684, in preparation, 1982.

    Google Scholar 

  4. R. L. (Scot) Drysdale, “Generalized Voronoi diagrams and geometric searching,” Stanford, CS Rep. STAN-CS-79-705, Stanford, CA, Jan. 1979.

    Google Scholar 

  5. Tomás Lozano-Pérez, Automatic planning of manipulator transfer movements, IEEE Trans. Syst., Man, Cybern., vol. SMC-11, pp. 681–698, 1981.

    Google Scholar 

  6. Hans P. Moravec, “Obstacle avoidance and navigation in the real world by a seeing robot rover,” Stanford, Univ. Tech Rep., AIM-340, Sep. 1980.

    Google Scholar 

  7. Nils J. Nilsson, Problem-Solving Methods in Artificial Intelligence. New York: McGraw-Hill, 1971.

    Google Scholar 

  8. Shriram M. Udupa, “Collision detection and avoidance in computer controlled manipulators,” Proc. IJCAI-5, MIT, Cambridge, MA, Aug. 1977, pp. 737–748.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 AT&T

About this chapter

Cite this chapter

Brooks, R.A. (1990). Solving the Find-Path Problem by Good Representation of Free Space. In: Cox, I.J., Wilfong, G.T. (eds) Autonomous Robot Vehicles. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8997-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-8997-2_22

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-8999-6

  • Online ISBN: 978-1-4613-8997-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics