Anytime search in dynamic graphs
DOI10.1016/J.ARTINT.2007.11.009zbMATH Open1184.68474OpenAlexW2028945152MaRDI QIDQ2389673FDOQ2389673
Authors: Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz, S. Thrun 
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1017&context=grasp_papers
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Cites Work
- A note on two problems in connexion with graphs
- Anytime search in dynamic graphs
- Real-time heuristic search
- Anytime heuristic search
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Planning as heuristic search
- Title not available (Why is that?)
- Generalized best-first search strategies and the optimality of A*
- Title not available (Why is that?)
- A new shortest path updating algorithm
- Depth-first iterative-deepening: An optimal admissible tree search
- Admissibility of \(AO^ *\) when heuristics overestimate
- Incremental algorithms for minimal length paths
- Title not available (Why is that?)
- Planning and learning by analogical reasoning
- Title not available (Why is that?)
- Linear-space best-first search
- Agent searching in a tree and the optimality of iterative deepening
- Title not available (Why is that?)
- Dynamic shortest paths minimizing travel times and costs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted heuristic search in networks
- A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots
- Fully dynamic shortest paths in digraphs with arbitrary arc weights
Cited In (10)
- Truncated incremental search
- Lifelong planning \(\text{A}^*\)
- Weighted \(A^*\) search - unifying view and application
- Anytime heuristic search
- Development of a collision-avoidance vector based control algorithm for automated in-vivo transportation of biological cells
- Potential-based bounded-cost search and anytime non-parametric A*
- Anytime search in dynamic graphs
- Anticipatory network models of multicriteria decision-making processes
- Collective motion planning for a group of robots using intermittent diffusion
- D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
This page was built for publication: Anytime search in dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389673)
