Algorithmic approaches to optimal route planning

Joseph S. B. Mitchell

doi:10.1117/12.25506

1 March 1991 Algorithmic approaches to optimal route planning

Joseph S. B. Mitchell

Proceedings Volume 1388, Mobile Robots V; (1991) https://doi.org/10.1117/12.25506
Event: Advances in Intelligent Robotics Systems, 1990, Boston, MA, United States

Abstract

The field of computational geometry has addressed many problems that are of direct relevance in route planning problems for mobile robots. Examples include the computation of visibility graphs shortest paths among obstacles minimal time paths through varied terrain and various other mission planning problems. In this paper we survey some recent results and show some applications to computing optimal paths. Our goal is to provide precise geometric models and to analyze algorithms according to their worst-case asymptotic complexities. Our hope is that many of the techniques can be applied as " black boxes" within the framework of a more complex hueristic-based system to solve the real-world problem.

Citation Download Citation

Joseph S. B. Mitchell "Algorithmic approaches to optimal route planning", Proc. SPIE 1388, Mobile Robots V, (1 March 1991); https://doi.org/10.1117/12.25506

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