Access the full text.
Sign up today, get DeepDyve free for 14 days.
Masataro Asai, A. Fukunaga (2017)
Tie-Breaking Strategies for Cost-Optimal Best First SearchJ. Artif. Intell. Res., 58
Meir Goldenberg, Ariel Felner, A. Palombo, Nathan Sturtevant, J. Schaeffer (2011)
The compressed differential heuristicAI Commun., 30
E. Karpas, C. Domshlak (2012)
Optimal Search with Inadmissible HeuristicsProceedings of the International Conference on Automated Planning and Scheduling
R. Zhou, E. Hansen (2004)
Breadth-first heuristic searchArtif. Intell., 170
Tenindra Abeywickrama, M. Cheema, D. Taniar (2016)
k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory ImplementationProc. VLDB Endow., 9
Sven Koenig, M. Likhachev, Xiaoxun Sun (2007)
Speeding up moving-target search
N. Flerova, Radu Marinescu, R. Dechter (2016)
Searching for the M Best Solutions in Graphical ModelsJ. Artif. Intell. Res., 55
E. Shaham, Ariel Felner, Nathan Sturtevant, J. Rosenschein (2018)
Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics
Nathan Sturtevant (2012)
Benchmarks for Grid-Based PathfindingIEEE Transactions on Computational Intelligence and AI in Games, 4
Nathan Sturtevant, Ariel Felner, Max Barer, J. Schaeffer, Neil Burch (2009)
Memory-Based Heuristics for Explicit State Spaces
T. Ng, Hui Zhang (2002)
Predicting Internet network distance with coordinates-based approachesProceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 1
D. Kleitman, Edvard Kramer, J. Conway, Stroughton Bell, Harry Dweighter (1975)
Elementary Problems: E2564-E2569American Mathematical Monthly, 82
Carlos Hernández, T. Uras, Sven Koenig, Jorge Baier, Xiaoxun Sun, P. Meseguer (2015)
Reusing cost-minimal paths for goal-directed navigation in partially known terrainsAutonomous Agents and Multi-Agent Systems, 29
A. Goldberg, Chris Harrelson (2005)
Computing the shortest path: A search meets graph theory
T. Ishida, R. Korf (1995)
Moving-Target Search: A Real-Time Search for Changing GoalsIEEE Trans. Pattern Anal. Mach. Intell., 17
David Tolpin, Tal Beja, S. Shimony, Ariel Felner, E. Karpas (2013)
Toward Rational Deployment of Multiple Heuristics in A
D Eppstein (1998)
Finding the k shortest pathsSIAM J. Comput., 28
Sven Koenig, M. Likhachev, David Furcy (2004)
Lifelong Planning AArtif. Intell., 155
EW Dijkstra (1959)
A note on two problems in connexion with graphsNumer. Math., 1
M. Pollack (1961)
Letter to the Editor—The kth Best Route Through a NetworkOperations Research, 9
C. Domshlak, Vitaly Mirkis (2015)
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and ReformulationsJ. Artif. Intell. Res., 52
R. Holte, Ariel Felner, Guni Sharon, Nathan Sturtevant, Jingwei Chen (2017)
MM: A bidirectional search algorithm that is guaranteed to meet in the middleArtif. Intell., 252
R. Holte, Sandra Zilles (2019)
On the Optimal Efficiency of Cost-Algebraic A
R. Holte, Ariel Felner, Guni Sharon, Nathan Sturtevant (2016)
Bidirectional Search That Is Guaranteed to Meet in the Middle
D. Delling, A. Goldberg, A. Nowatzyk, Renato Werneck (2011)
PHAST: Hardware-Accelerated Shortest Path Trees2011 IEEE International Parallel & Distributed Processing Symposium
A Felner, U Zahavi, R Holte, J Schaeffer, NR Sturtevant, Z Zhang (2011)
Inconsistent heuristics in theory and practiceArtif. Intell., 175
Meir Goldenberg, Ariel Felner, Nathan Sturtevant, R. Holte, J. Schaeffer (2013)
Optimal-Generation Variants of EPEAProceedings of the International Symposium on Combinatorial Search
Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan Sturtevant, R. Holte, J. Schaeffer (2014)
Enhanced Partial Expansion AJ. Artif. Intell. Res., 50
Hans Chalupsky, Yolanda Gil, Craig Knoblock, Kristina Lerman, Jean Oh, D. Pynadath, Thomas Russ, Milind Tambe (2001)
Electric Elves: Applying Agent Technology to Support Human Organizations
Nathan Sturtevant, Ariel Felner (2018)
A Brief History and Recent Achievements in Bidirectional Search
M. Helmert (2010)
Landmark Heuristics for the Pancake ProblemProceedings of the International Symposium on Combinatorial Search
S. Edelkamp (2016)
External-Memory State Space Search
Andrew Dobson, Kostas Bekris (2014)
Improved Heuristic Search for Sparse Motion Planning Data StructuresProceedings of the International Symposium on Combinatorial Search
Karen Myers, P. Berry, J. Blythe, Ken Conley, M. Gervasio, D. McGuinness, David Morley, A. Pfeffer, M. Pollack, Milind Tambe (2007)
An Intelligent Personal Assistant for Task and Time ManagementAI Mag., 28
(2011)
To appear in: Artificial Intelligence
Oded Betzalel, Ariel Felner, S. Shimony (2015)
Type System Based Rational Lazy IDA
J. Suurballe (1974)
Disjoint paths in a networkNetworks, 4
Nathan Sturtevant (2007)
Memory-Efficient Abstractions for Pathfinding
A. Martelli (1977)
On the Complexity of Admissible Search AlgorithmsArtif. Intell., 8
James Marble, Kostas Bekris (2013)
Asymptotically Near-Optimal Planning With Probabilistic Roadmap SpannersIEEE Transactions on Robotics, 29
E. Machuca (2011)
An Analysis of Multiobjective Search Algorithms and Heuristics
D. Delling, A. Goldberg, Renato Werneck (2011)
Faster Batched Shortest Paths in Road Networks
R. Dechter, J. Pearl (1985)
Generalized best-first search strategies and the optimality of A*J. ACM, 32
Sven Koenig, M. Likhachev (2005)
Fast replanning for navigation in unknown terrainIEEE Transactions on Robotics, 21
E. Burns, Matthew Hatem, Michael Leighton, Wheeler Ruml (2012)
Implementing Fast Heuristic Search CodeProceedings of the International Symposium on Combinatorial Search
R. Zhou, E. Hansen (2004)
Structured Duplicate Detection in External-Memory Graph Search
P. Hart, N. Nilsson, B. Raphael (1968)
A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Trans. Syst. Sci. Cybern., 4
D. Eppstein (1994)
Finding the k shortest pathsProceedings 35th Annual Symposium on Foundations of Computer Science
E. Dijkstra (1959)
A note on two problems in connexion with graphsNumerische Mathematik, 1
R. Korf (2004)
Best-First Frontier Search with Delayed Duplicate Detection
Daniel Gilon, Ariel Felner, Roni Stern (2016)
Dynamic Potential Search - A New Bounded Suboptimal Search
Shizhe Zhao, D. Taniar, Daniel Harabor (2021)
Fast k-Nearest Neighbor on a Navigation Mesh
S. Edelkamp (2005)
External Symbolic Heuristic Search with Pattern Databases
Publisher's note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
In this paper we study the One-to-Many Shortest Path Problem (OMSPP), which is the problem of solving k shortest path problems that share the same start node. This problem has been studied in the context of routing in road networks. While past work on routing relied on pre-processing the network, which is assumed to be provided explicitly. We explore how OMSPP can be solved with heuristic search techniques, allowing the searched graph to be given either explicitly or implicitly. Two fundamental heuristic search approaches are analyzed: searching for the k goals one at a time, or searching for all k goals as one compound goal. The former approach, denoted k×A∗, is simpler to implement, but can be computationally inefficient, as it may expand a node multiple times, by the different searches. The latter approach, denoted kA∗, can resolve this potential inefficiency, but implementing it raises fundamental questions such as how to combine k heuristic estimates, one per goal, and what to do after the shortest path to one of the goals has been found. We propose several ways to implement kA∗, and characterize the required and sufficient conditions on the available heuristics and how they are aggregated such that the solution is admissible. Then, we analytically compare the runtime and memory requirements of k×A∗ and kA∗, identifying when each approach should be used. Finally, we compare these approaches experimentally on two representative domains, providing empirical support for our theoretical analysis. These results shed light on when each approach is beneficial.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Dec 1, 2021
Keywords: Heuristic search; Path finding; 68T20
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.