Bidirectional Heuristic Search is a heuristic search algorithm that simultaneously conducts forward search from the initial state and backward search from the goal state, using heuristic estimates to prune the search space and meet in the middle to improve search efficiency compared to unidirectional approaches.
102
Publications
4.7K
Citations
254
Authors
128
Institutions
Publications per year
2017–2026
43
Parents
Publications
102
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Gushu Li, Yufei Ding, Yuan Xie · 2019 · 564 citations · Full text
RRT*-Connect: Faster, asymptotically optimal motion planning
Sebastian Klemm, Jan Oberlander, A. M. Hermann et al. · 2015 · 201 citations
1–5 of 102
Authors
254
- NS
12
h-index
- AF
11
h-index
- RC
6
h-index
- JC
4
h-index
- HK
4
h-index
1–5 of 254
Institutions
128
University of Alberta
Edmonton, Canada
11 h-index
16 publications
419 citations
Ben-Gurion University of the Negev
Beersheba, Israel
11 h-index
24 publications
498 citations
University of Denver
Denver, United States
8 h-index
13 publications
386 citations
University of Oxford
Oxford, United Kingdom
4 h-index
6 publications
448 citations
Southern University of Science and Technology
Shenzhen, China
3 h-index
5 publications
202 citations
University of New Hampshire at Manchester
Manchester, United States
3 h-index
7 publications
133 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
4 publications
159 citations
Xi'an High Tech University
Xi'an, China
2 h-index
5 publications
71 citations
1–8 of 128
Venues
- Proceedings of the International Symposium on Combinatorial Search
9 publications · 162 citations
9
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 7 publications · 162 citations
7
h-index
- Networks
3 publications · 158 citations
3
h-index
- European Journal of Operational Research
2 publications · 126 citations
2
h-index
- Journal of the ACM
JACM · 2 publications · 192 citations
2
h-index
1–5