Share Email Print

Proceedings Paper

Hierarchical system for automated path planning and scheduling
Author(s): Kelly A. Korzeniowski; Charles B. McVey
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper describes a hierarchial system for dynamic planning and scheduling among a field of moving obstacles. The solution is directly applicable to many autonomous scenarios, such as movement on a manufacturing floor, navigation of surface/subsurface ships or coordination of air traffic. The overall system is discussed in terms of global/local perception and generative planning/reactive control. The development and implementation of the generative planner portion of the existing system are described in detail. In terms of real-time system performance, the multi-dimensional search problem is made tractable by applying two dependent 2D techniques in series. First, the shortest distance, obstacle-avoiding path to the goal is calculated, then for that path, the time to the goal is optimized. In this space-time representation of the domain, time requirements can be imposed upon the goal(s) and therefore scheduling can also be accomplished.

Paper Details

Date Published: 8 January 1999
PDF: 8 pages
Proc. SPIE 3525, Mobile Robots XIII and Intelligent Transportation Systems, (8 January 1999); doi: 10.1117/12.335699
Show Author Affiliations
Kelly A. Korzeniowski, U.S. Naval Academy (United States)
Charles B. McVey, Johns Hopkins Univ. (United States)

Published in SPIE Proceedings Vol. 3525:
Mobile Robots XIII and Intelligent Transportation Systems
Howie M. Choset; Pushkin Kachroo; Mikhail A. Kourjanski; Douglas W. Gage; Pushkin Kachroo; Marten J. de Vries; Mikhail A. Kourjanski; Marten J. de Vries, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?