Three approaches to heuristic search in networks
Journal of the ACM (JACM)
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
An Improved Bidirectional Heuristic Search Algorithm
Journal of the ACM (JACM)
Bidirectional Heuristic Search Again
Journal of the ACM (JACM)
Hi-index | 0.00 |
This paper is a study of the effectiveness of heuristic search algorithms in generating flight paths. Due to the need to generate and revise paths dynamically we are interested in execution speed as well as solution quality (conflict cost plus path length). Extensive tests with three search algorithms were made using a simple threat model. Using straight-forward heuristics, we found that two of the algorithms perform well then their weights are appropriately adjusted. One is A* and the other is a bidirectional search. Our results indicate that heuristic search is effective in flight path generation and provide details about algorithms which were successful.