MM: A bidirectional search algorithm that is guaranteed to meet in the middle-Reference-Cited by-同舟云学术

MM: A bidirectional search algorithm that is guaranteed to meet in the middle

Published:2017-11 Issue: Volume:252 Page:232-266
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Holte Robert C.,Felner Ariel,Sharon Guni,Sturtevant Nathan R.,Chen Jingwei

Funder

National Science Foundation

Natural Sciences and Engineering Research Council of Canada

Israel Science Foundation

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference64 articles.

1. A new approach of iterative deepening bi-directional heuristic front-to-front algorithm (IDBHFFA);Arefin;Int. J. Electr. Comput. Sci. (IJECS-IJENS),2010

2. A case study of revisiting best-first vs. depth-first search;Auer,2004

3. Solving peg solitaire with bidirectional BFIDA*;Barker,2012

4. Limitations of front-to-end bidirectional heuristic search;Barker,2015

5. Programming, Games and Transportation Networks;Berge,1965

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

1. Boosting optimal symbolic planning: Operator-potential heuristics;Artificial Intelligence;2024-09

2. An improved manta ray foraging optimization algorithm;Scientific Reports;2024-05-05

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

4. Focused Bidirectional Search Trees: A Bidirectional Optimal Fast Matching Method for Robot Path Planning;2023 IEEE International Conference on Real-time Computing and Robotics (RCAR);2023-07-17

5. Direction constraints adaptive extended bidirectional A* algorithm based on random two-dimensional map environments;Robotics and Autonomous Systems;2023-07