D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
From MaRDI portal
Publication:2011896
Recommendations
- Depth-first iterative-deepening: An optimal admissible tree search
- Potential-based bounded-cost search and anytime non-parametric A*
- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
- scientific article; zbMATH DE number 67463
- Multi-cut -pruning in game-tree search
- A correction to: ``Agent searching in a tree and the optimality of iterative deepening
- Agent searching in a tree and the optimality of iterative deepening
- Sample-based tree search with fixed and adaptive state abstractions
- Weighted \(A^*\) search - unifying view and application
Cites work
Cited in
(6)- A study of improvement of D\(^*\) algorithms for mobile robot path planning in partial unknown environments
- Multiquery motion planning in uncertain spaces: incremental adaptive randomized roadmaps
- Lifelong planning \(\text{A}^*\)
- Truncated incremental search
- D* Extra Lite
- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
This page was built for publication: D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011896)