The following pages link to Lifelong planning \(\text{A}^*\) (Q814587):
Displayed 13 items.
- Truncated incremental search (Q253972) (← links)
- An evidential approach to SLAM, path planning, and active exploration (Q274441) (← links)
- Sparse reconstruction for bioluminescence tomography based on the semigreedy method (Q454674) (← links)
- Heuristic search for one-to-many shortest path queries (Q825009) (← links)
- Incremental construction of generalized Voronoi diagrams on pointerless quadtrees (Q1718418) (← links)
- D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing (Q2011896) (← links)
- Collective motion planning for a group of robots using intermittent diffusion (Q2053372) (← links)
- A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm (Q2059483) (← links)
- An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
- Lifelong learning in costly feature spaces (Q2290680) (← links)
- COStar: A D-star Lite-based dynamic search algorithm for codon optimization (Q2632569) (← links)
- Robot path planning based on concept lattice (Q2677852) (← links)
- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning (Q5321719) (← links)