Share Email Print

Proceedings Paper

Hierarchic Path Generation
Author(s): Thomas Sudkamp; Carl Lizza; Charles Wagner
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Historically, dynamic graph searching techniques have been used to construct minimal cost paths through a defended environment. In small search spaces, heuristic techniques are shown to produce near optimal solutions while effecting a forty percent reduction in the effort required to generate the path. A hybrid strategy combining heuristic search and hierarchic decomposition is developed to inhibit the combinatorial problems inherent in constructing paths in large a search space.

Paper Details

Date Published: 29 March 1988
PDF: 10 pages
Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); doi: 10.1117/12.947005
Show Author Affiliations
Thomas Sudkamp, Wright State University (United States)
Carl Lizza, Air Force Wright Aeronautical Laboratories (United States)
Charles Wagner, Air Force Wright Aeronautical Laboratories (United States)

Published in SPIE Proceedings Vol. 0937:
Applications of Artificial Intelligence VI
Mohan M. Trivedi, 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?