Lifelong planning A^*

DOI10.1016/J.ARTINT.2003.12.001MaRDI QIDQ814587zbMATH OpenOpenAlexFDO

Authors Sven Koenig, Maxim Likhachev, David Furcy

Publication date 7 February 2006

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2003.12.001

zbMATH Keywords

\(\text{A}^*\)Continual planningHeuristic searchHeuristic search-based planningIncremental searchLifelong planningPlan reuseReplanningSymbolic STRIPS-style planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Truncated incremental search
• D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
• scientific article; zbMATH DE number 1947498
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Anytime search in dynamic graphs

Cites work

• scientific article; zbMATH DE number 3126094 (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 1113195 (Why is no real title available?)
• scientific article; zbMATH DE number 871917 (Why is no real title available?)
• A new shortest path updating algorithm
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• An On-Line Edge-Deletion Problem
• Dynamic algorithms for shortest paths in planar graphs
• Finding paths and deleting edges in directed acyclic graphs
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Incremental algorithms for minimal length paths
• On Finding and Updating Spanning Trees and Shortest Paths
• On the computational complexity of dynamic graph problems
• Planning and learning by analogical reasoning
• Semi-dynamic breadth-first search in digraphs
• Semidynamic algorithms for maintaining single-source shortest path trees

Cited in

(16)

• Heuristic search for one-to-many shortest path queries
• Truncated incremental search
• An evidential approach to SLAM, path planning, and active exploration
• scientific article; zbMATH DE number 1947498 (Why is no real title available?)
• COStar: A D-star Lite-based dynamic search algorithm for codon optimization
• Sparse reconstruction for bioluminescence tomography based on the semigreedy method
• Anytime search in dynamic graphs
• Collective motion planning for a group of robots using intermittent diffusion
• An auction-based approach for the re-optimization shortest path tree problem
• A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm
• Lifelong learning in costly feature spaces
• scientific article; zbMATH DE number 2243364 (Why is no real title available?)
• Robot path planning based on concept lattice
• The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
• Incremental construction of generalized Voronoi diagrams on pointerless quadtrees
• D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing

Describes a project that uses

Uses Software

• D*Lite
• AltAlt

This page was built for publication: Lifelong planning \(\text{A}^*\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814587)