D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing

DOI10.1515/AMCS-2017-0020zbMATH Open1367.93407OpenAlexW2735603972MaRDI QIDQ2011896FDOQ2011896

Authors: Maciej Przybylski, Barbara Putz 

Publication date: 27 July 2017

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2017-0020

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 \(\alpha \beta\)-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

zbMATH Keywords

mobile robot navigationincremental heuristic searchshortest-path planningvideo games

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of optimal control and differential games (49N90) Automated systems (robots, etc.) in control theory (93C85)

Cites Work

• Anytime search in dynamic graphs
• Truncated incremental search
• Lifelong planning \(\text{A}^*\)
• RGB-D terrain perception and dense mapping for legged robots
• A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots

Cited In (6)

• A study of improvement of D\(^*\) algorithms for mobile robot path planning in partial unknown environments
• Truncated incremental search
• Lifelong planning \(\text{A}^*\)
• D* Extra Lite
• Multiquery motion planning in uncertain spaces: incremental adaptive randomized roadmaps
• The BDD-Based Dynamic A* Algorithm for Real-Time Replanning

Uses Software

• D*Lite

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)