21 March 1989 Selection Of Subdomains In Hierarchic Path Generation
Author Affiliations +
Abstract
Hierarchic decomposition has been shown to be an effective technique for efficiently generating near optimal paths through a defended area. The objective is to avoid the combinatorial difficulties associated with searching large graphs by confining the search to specific advantageous subregions. Within the subregions, paths are constructed using the A heuristic search algorithm. The decomposition into subdomains introduces local horizon effects to the path generation process. The local horizon problem arises as a consequence of the required connection of paths generated by independent search procedures in contiguous subdomains. Several techniques are introduced to facilitate the inter-region handoff. The effects of subdomain size and handoff technique on path quality and efficiency are analyzed.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Thomas Sudkamp, Thomas Sudkamp, Jill Courte, Jill Courte, "Selection Of Subdomains In Hierarchic Path Generation", Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); doi: 10.1117/12.969292; https://doi.org/10.1117/12.969292
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

Propagation of variances in belief networks
Proceedings of SPIE (February 28 1991)
An Object To Capture Some Fuzzy Expertise
Proceedings of SPIE (April 05 1987)
SIMD approach to IDA* search
Proceedings of SPIE (February 29 1992)
A Lisp-Based PC Vision Workstation
Proceedings of SPIE (June 05 1987)
Hierarchic Path Generation
Proceedings of SPIE (March 28 1988)
Learning Significant Class Descriptions
Proceedings of SPIE (May 10 1987)
A Scene Interpretation System
Proceedings of SPIE (March 28 1988)

Back to Top