An analysis of the efficacy and efficiency of hierarchical procedures for computing trajectories over complex surfaces

A set of hierarchically-organized, heuristic path-finding procedures were applied to two subareas of a complex surface. These procedures typically found paths that were very close to optimal in terms of satisfying a minimum integral constraint. The procedures were one to two orders of magnitude less...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1987-06, Vol.30 (3), p.327-338
Main Authors: Smith, Terence R., Parker, Richard E.
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
general transportation
Heuristic
heuristics
Operations research
Optimal
optimization
Path
Problem solving, game playing
Search
Statistical analysis
Systems
Theory
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A set of hierarchically-organized, heuristic path-finding procedures were applied to two subareas of a complex surface. These procedures typically found paths that were very close to optimal in terms of satisfying a minimum integral constraint. The procedures were one to two orders of magnitude less costly to apply than a set of similar, non-hierarchical procedures that found optimal paths. A systematic evaluation of hierarchical procedures having varying topologies and heuristic guidance functions, and employing different surface representations, was made. No procedure examined minimized both path traversal and path computation costs, and the choice of a best procedure was found to depend significantly on the nature of the surface traversed.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(87)90078-6