Hierarchic Path Generation

Thomas Sudkamp; Carl Lizza; Charles Wagner

doi:10.1117/12.947005

29 March 1988 Hierarchic Path Generation

Thomas Sudkamp, Carl Lizza, Charles Wagner

Proceedings Volume 0937, Applications of Artificial Intelligence VI; (1988) https://doi.org/10.1117/12.947005
Event: 1988 Technical Symposium on Optics, Electro-Optics, and Sensors, 1988, Orlando, FL, United States

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.

Citation Download Citation

Thomas Sudkamp, Carl Lizza, and Charles Wagner "Hierarchic Path Generation", Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); https://doi.org/10.1117/12.947005

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