Parallel iterative A* search: an admissible distributed heuristic search algorithm

Authors:
Shie-Rei Huang;Larry S. Davis
Affiliations:
Artificial Intelligence Department, FMC Corporate Technology Center, Santa Clara, CA;Computer Vision Laboratory, Center for Automation Research, University of Maryland, College Park, College Park, MD
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Year:
1989

Citing 8
Cited 0

A heuristic search algorithm with modifiable estimate

Artificial Intelligence
The butterfly barrier

International Journal of Parallel Programming
Concurrent Access of Priority Queues

IEEE Transactions on Computers
The connection machine

The connection machine
Anomalies in parallel branch-and-bound algorithms

Communications of the ACM
Fundamentals of Computer Alori

Fundamentals of Computer Alori
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.