Abstract
The state of the art in bidirectional search has changed significantly a very short time period; we now can answer questions about unidirectional and bidirectional search that until very recently we were unable to answer. This paper is designed to provide an accessible overview of the recent research in bidirectional search in the context of the broader efforts over the last 50 years. We give particular attention to new theoretical results and the algorithms they inspire for optimal and near-optimal node expansions when finding a shortest path.
| Original language | English |
|---|---|
| Title of host publication | 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 |
| Publisher | AAAI press |
| Pages | 8000-8006 |
| Number of pages | 7 |
| ISBN (Electronic) | 9781577358008 |
| State | Published - 2018 |
| Externally published | Yes |
| Event | 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 - New Orleans, United States Duration: 2 Feb 2018 → 7 Feb 2018 |
Publication series
| Name | 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 |
|---|
Conference
| Conference | 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 |
|---|---|
| Country/Territory | United States |
| City | New Orleans |
| Period | 2/02/18 → 7/02/18 |
Bibliographical note
Publisher Copyright:Copyright © 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
This material is based upon work supported by the National Science Foundation under Grant No. 1551406. The work was sponsored by Israel Science Foundation (ISF) under grant #844/17.
| Funders | Funder number |
|---|---|
| National Science Foundation | 1551406 |
| Israel Science Foundation | 844/17 |