article

Free access

An Improved Bidirectional Heuristic Search Algorithm

Authors:

Lenie Sint,

Dennis de ChampeauxAuthors Info & Claims

Journal of the ACM (JACM), Volume 24, Issue 2

Pages 177 - 191

https://doi.org/10.1145/322003.322004

Published: 01 April 1977 Publication History

PDF eReader

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.

References

[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

Google Scholar

[2]

DORAN, J., AND MICHIE, D Experiments with the graph traverser program. Proc. Royal Soc A 294 (1966), 253-259

Google Scholar

[3]

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

Crossref

Google Scholar

[4]

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

Crossref

Google Scholar

[5]

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

Google Scholar

[6]

ROSENSERG, R S Look-ahead and one-person games U. of British Columbm, Vancouver, Canada, 1972.

Google Scholar

[7]

SACERDOTI, E. D Planmng m a hierarchy of abstraction spaces. Proc. Third Int. Joint Conf Artlf Intel, Stanford, Cahf, 1973, pp 412-422

Google Scholar

Cited By

View all

Liao YChang PLi H(2023)Hybrid Integrated Computing Algorithm for Sustainable TourismSustainability10.3390/su15231614115:23(16141)Online publication date: 21-Nov-2023
https://doi.org/10.3390/su152316141
Li CMa HWang JMeng M(2023)Bidirectional Search Strategy for Incremental Search-based Path Planning2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS55552.2023.10342039(7311-7317)Online publication date: 1-Oct-2023
https://doi.org/10.1109/IROS55552.2023.10342039
Lai WShieh CYang C(2022)A D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure PathsMathematics10.3390/math1018332110:18(3321)Online publication date: 13-Sep-2022
https://doi.org/10.3390/math10183321
Show More Cited By

Index Terms

An Improved Bidirectional Heuristic Search Algorithm
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies

Recommendations

Bidirectional heuristic search reconsidered

The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major ...
Heuristic Search for the Generalized Minimum Spanning Tree Problem

The generalized minimum spanning tree (GMST) problem occurs in telecommunications network planning, where a network of node clusters needs to be connected via a tree architecture using exactly one node per cluster. The problem is known to be NP-hard, ...
Limitations of front-to-end bidirectional heuristic search
AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence

We present an intuitive explanation for the limited effectiveness of front-to-end bidirectional heuristic search, supported with extensive evidence from many commonly-studied domains. While previous work has proved the limitations of specific algorithms,...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 24, Issue 2

April 1977

174 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322003

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1977

Published in JACM Volume 24, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

72
Total Citations
View Citations
1,576
Total Downloads

Downloads (Last 12 months)165
Downloads (Last 6 weeks)16

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liao YChang PLi H(2023)Hybrid Integrated Computing Algorithm for Sustainable TourismSustainability10.3390/su15231614115:23(16141)Online publication date: 21-Nov-2023
https://doi.org/10.3390/su152316141
Li CMa HWang JMeng M(2023)Bidirectional Search Strategy for Incremental Search-based Path Planning2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)10.1109/IROS55552.2023.10342039(7311-7317)Online publication date: 1-Oct-2023
https://doi.org/10.1109/IROS55552.2023.10342039
Lai WShieh CYang C(2022)A D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure PathsMathematics10.3390/math1018332110:18(3321)Online publication date: 13-Sep-2022
https://doi.org/10.3390/math10183321
Pavlik JSewell EJacobson S(2022)Iterative Deepening Dynamically Improved Bounds Bidirectional SearchINFORMS Journal on Computing10.1287/ijoc.2021.111634:2(974-989)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1287/ijoc.2021.1116
Xia NWang CPeng HZhao ZChen YWang PDu HDing SYu Y(2022)Optimization algorithms in wireless monitoring networks: A surveyNeurocomputing10.1016/j.neucom.2021.12.072489(584-598)Online publication date: Jun-2022
https://doi.org/10.1016/j.neucom.2021.12.072
Li YXu WYiu M(2021)Client-Side Service for Recommending Rewarding Routes to Mobile Crowdsourcing WorkersIEEE Transactions on Services Computing10.1109/TSC.2019.290556414:6(1995-2010)Online publication date: 1-Nov-2021
https://doi.org/10.1109/TSC.2019.2905564
Yijun ZJiadong XChen L(2021)A Fast Bi-Directional A* Algorithm Based on Quad-Tree Decomposition and Hierarchical MapIEEE Access10.1109/ACCESS.2021.30948549(102877-102885)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3094854
Rehman AQureshi S(2021)A review of the medical hyperspectral imaging systems and unmixing algorithms’ in biological tissuesPhotodiagnosis and Photodynamic Therapy10.1016/j.pdpdt.2020.10216533(102165)Online publication date: Mar-2021
https://doi.org/10.1016/j.pdpdt.2020.102165
Yoon SJung CShim D(2021)Shape-Aware and G2 Continuous Path Planning Based on Bidirectional Hybrid A∗ for Car-Like VehiclesJournal of Intelligent and Robotic Systems10.1007/s10846-021-01508-w103:3Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s10846-021-01508-w
Pavlik JSewell EJacobson S(2021)Two new bidirectional search algorithmsComputational Optimization and Applications10.1007/s10589-021-00303-580:2(377-409)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s10589-021-00303-5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Bidirectional heuristic search reconsidered

Heuristic Search for the Generalized Minimum Spanning Tree Problem

Limitations of front-to-end bidirectional heuristic search

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations