Share Email Print

Proceedings Paper

Algorithmic approaches to optimal route planning
Author(s): Joseph S. B. Mitchell
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 March 1991
PDF: 12 pages
Proc. SPIE 1388, Mobile Robots V, (1 March 1991); doi: 10.1117/12.25506
Show Author Affiliations
Joseph S. B. Mitchell, Cornell Univ. (United States)

Published in SPIE Proceedings Vol. 1388:
Mobile Robots V
Wendell H. Chun; William J. Wolfe, Editor(s)

© SPIE. Terms of Use
Back to Top