Anytime search in dynamic graphs
- 30 September 2008
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 172 (14), 1613-1643
- https://doi.org/10.1016/j.artint.2007.11.009
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A dynamization of the All Pairs Least Cost Path ProblemPublished by Springer Nature ,2005
- Fully dynamic shortest paths in digraphs with arbitrary arc weightsJournal of Algorithms, 2003
- Dynamic shortest paths minimizing travel times and costsNetworks, 2003
- A new solution for path planning in partially known or unknown environment for nonholonomic mobile robotsRobotics and Autonomous Systems, 2001
- Pattern DatabasesComputational Intelligence, 1998
- An Incremental Algorithm for a Generalization of the Shortest-Path ProblemJournal of Algorithms, 1996
- A validation-structure-based theory of plan modification and reuseArtificial Intelligence, 1992
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Weighted heuristic search in networksJournal of Algorithms, 1985
- A note on two problems in connexion with graphsNumerische Mathematik, 1959