Abstract
A variant of A* search designed to run on the massively parallel SIMD (single-instruction-stream, multiple-data-steam) Connection Machine is described. The algorithm is designed to run in a limited memory; a retraction technique allows nodes with poor heuristic values to be removed from the open list until such time as they may need reexpansion if more promising paths fail. The algorithm, called PRA* (for parallel retraction A*), takes maximum advantage of the SIMD design of the Connection Machine and is guaranteed to return an optimal path when an admissible heuristic is used. Results comparing PRA* to R. Korf's IDA* (see Artif. Intell. J., vol.27, 1985) for the 15 puzzle show significantly fewer node expansions for PRA*. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
