An Improved Bidirectional Heuristic Search Algorithm-Reference-Cited by-同舟云学术

An Improved Bidirectional Heuristic Search Algorithm

Published:1977-04 Issue:2 Volume:24 Page:177-191
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Sint Lenie¹,de Champeaux Dennis¹

Affiliation:

1. Universiteit van Amsterdam, Jodenbreestr 23 k 3123, Amsterdam-1001, Holland

Abstract

A modification of Pohl's bidirectional heuristic search algorithm is described together with a simplified implementation. Theorems are proved about conditions yielding shortest paths. The results are given of a worst-case analysis of different algorithms, suggesting a rank order of their quality. Results that Pohl had obtained with a unidirectional heuristic search algorithm on the 15-puzzle are compared with the results obtained with the new — simplified — algorithm.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/322003.322004

Reference7 articles.

1. DE CHAMPEAUX D AND SLUT L An optlmahty theorem for a bI-directional heuristic search algorithm Rep of Inst. voor Bedrqfseconomm en Accountancy U van Amsterdam Amsterdam. 1975 DE CHAMPEAUX D AND SLUT L An optlmahty theorem for a bI-directional heuristic search algorithm Rep of Inst. voor Bedrqfseconomm en Accountancy U van Amsterdam Amsterdam. 1975

2. Experiments with the graph traverser program;DORAN J.;Proc. Royal Soc A,1966

3. NILSSON N J Problem-Solwng Methods Ln Artzfictal lntelhgence. McGraw-Hall New York 1971. NILSSON N J Problem-Solwng Methods Ln Artzfictal lntelhgence. McGraw-Hall New York 1971.

4. POHL I Bl-directlonal heunsUc search m path problems. Stanford U Stanford Calif. 1969 POHL I Bl-directlonal heunsUc search m path problems. Stanford U Stanford Calif. 1969

5. POHL I. Bl-directional search. Machine lntelhgence 6 1971 pp 127-140. POHL I. Bl-directional search. Machine lntelhgence 6 1971 pp 127-140.

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hybrid Integrated Computing Algorithm for Sustainable Tourism;Sustainability;2023-11-21

2. Bidirectional Search Strategy for Incremental Search-based Path Planning;2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2023-10-01

3. A D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure Paths;Mathematics;2022-09-13

4. Optimization algorithms in wireless monitoring networks: A survey;Neurocomputing;2022-06

5. Iterative Deepening Dynamically Improved Bounds Bidirectional Search;INFORMS Journal on Computing;2021-11-23