Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm
Abstract
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, and speedup. A flow-shop scheduling problem has been implemented on a BBN Butterfly Multicomputer using up to 80 processors to empirically test this algorithm. From our experiments, this algorithm is capable of achieving almost linear speedup on a large number of processors with a relatively small problem size. 1
Cite
Text
Huang and Davis. "Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm." International Joint Conference on Artificial Intelligence, 1989.Markdown
[Huang and Davis. "Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm." International Joint Conference on Artificial Intelligence, 1989.](https://mlanthology.org/ijcai/1989/huang1989ijcai-parallel/)BibTeX
@inproceedings{huang1989ijcai-parallel,
title = {{Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm}},
author = {Huang, Shie-rei and Davis, Larry S.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1989},
pages = {23-29},
url = {https://mlanthology.org/ijcai/1989/huang1989ijcai-parallel/}
}