Lifelong planning \(\text{A}^*\)
From MaRDI portal
Publication:814587
DOI10.1016/j.artint.2003.12.001zbMath1085.68674OpenAlexW1982809790MaRDI QIDQ814587
David Furcy, Sven Koenig, Maxim Likhachev
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
Heuristic search\(\text{A}^*\)Continual planningHeuristic search-based planningIncremental searchLifelong planningPlan reuseReplanningSymbolic STRIPS-style planning
Related Items (13)
An evidential approach to SLAM, path planning, and active exploration ⋮ Heuristic search for one-to-many shortest path queries ⋮ COStar: A D-star Lite-based dynamic search algorithm for codon optimization ⋮ The BDD-Based Dynamic A* Algorithm for Real-Time Replanning ⋮ Robot path planning based on concept lattice ⋮ Sparse reconstruction for bioluminescence tomography based on the semigreedy method ⋮ Incremental construction of generalized Voronoi diagrams on pointerless quadtrees ⋮ D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ Lifelong learning in costly feature spaces ⋮ Collective motion planning for a group of robots using intermittent diffusion ⋮ A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm ⋮ Truncated incremental search
Uses Software
Cites Work
- Dynamic algorithms for shortest paths in planar graphs
- Finding paths and deleting edges in directed acyclic graphs
- Semidynamic algorithms for maintaining single-source shortest path trees
- Planning and learning by analogical reasoning
- On the computational complexity of dynamic graph problems
- Semi-dynamic breadth-first search in digraphs
- An On-Line Edge-Deletion Problem
- Incremental algorithms for minimal length paths
- On Finding and Updating Spanning Trees and Shortest Paths
- A new shortest path updating algorithm
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lifelong planning \(\text{A}^*\)
