New hardware collision checker for robot path planning

Vibeke Libby

doi:10.1117/12.57100

1 February 1992 New hardware collision checker for robot path planning

Vibeke Libby

Proceedings Volume 1607, Intelligent Robots and Computer Vision X: Algorithms and Techniques; (1992) https://doi.org/10.1117/12.57100
Event: Robotics '91, 1991, Boston, MA, United States

Abstract

A new set of collision checking and obstacle avoidance algorithms has been developed and implemented in both hardware and software. The method allows for unlimited vector checks against an unlimited set of objects. Dependent upon the application, the single card hardware performance ranges from 1 million line sorts per second to hundreds of millions. Therefore, due to the high algorithm speed, the overall system performance only becomes limited by the choice of processor and the speed of the interface. The hardware is presently configured to process large blocks of objects and data (8K) at a sorting rate of one point against eight objects at a rate of 200 million points per second. The trade-off between choice of algorithm and performance is discussed.

Citation Download Citation

Vibeke Libby "New hardware collision checker for robot path planning", Proc. SPIE 1607, Intelligent Robots and Computer Vision X: Algorithms and Techniques, (1 February 1992); https://doi.org/10.1117/12.57100

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available