Anytime search in dynamic graphs

DOI10.1016/J.ARTINT.2007.11.009MaRDI QIDQ2389673zbMATHOpenAlexFDO

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

zbMATH Keywords

planninganytime planninganytime searchheuristic searchincremental searchreplanningsearch\(A^{*}\)

Mathematics Subject Classification ID

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)

Recommendations

• Truncated incremental search
• Anytime heuristic search
• Lifelong planning \(\text{A}^*\)
• Dynamic control in real-time heuristic search
• Potential-based bounded-cost search and anytime non-parametric A*

Cites work

• scientific article; zbMATH DE number 1630025 (Why is no real title available?)
• scientific article; zbMATH DE number 4174360 (Why is no real title available?)
• scientific article; zbMATH DE number 3900809 (Why is no real title available?)
• scientific article; zbMATH DE number 3907787 (Why is no real title available?)
• scientific article; zbMATH DE number 30302 (Why is no real title available?)
• scientific article; zbMATH DE number 1753149 (Why is no real title available?)
• scientific article; zbMATH DE number 871917 (Why is no real title available?)
• scientific article; zbMATH DE number 3351222 (Why is no real title available?)
• A new shortest path updating algorithm
• A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots
• A note on two problems in connexion with graphs
• Admissibility of \(AO^ *\) when heuristics overestimate
• Agent searching in a tree and the optimality of iterative deepening
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Anytime heuristic search
• Anytime search in dynamic graphs
• Depth-first iterative-deepening: An optimal admissible tree search
• Dynamic shortest paths minimizing travel times and costs
• Fully dynamic shortest paths in digraphs with arbitrary arc weights
• Generalized best-first search strategies and the optimality of A*
• Incremental algorithms for minimal length paths
• Linear-space best-first search
• Planning and learning by analogical reasoning
• Planning as heuristic search
• Real-time heuristic search
• Weighted heuristic search in networks

Cited in

(10)

• Anticipatory network models of multicriteria decision-making processes
• Weighted \(A^*\) search - unifying view and application
• Collective motion planning for a group of robots using intermittent diffusion
• Potential-based bounded-cost search and anytime non-parametric A*
• Anytime heuristic search
• D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
• Lifelong planning \(\text{A}^*\)
• Truncated incremental search
• Anytime search in dynamic graphs
• Development of a collision-avoidance vector based control algorithm for automated in-vivo transportation of biological cells

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)