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

DOI10.1515/AMCS-2017-0020zbMath1367.93407OpenAlexW2735603972MaRDI QIDQ2011896

Barbara Putz, Maciej Przybylski

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

zbMATH Keywords

mobile robot navigationincremental heuristic searchshortest-path planningvideo games

Mathematics Subject Classification ID

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

Related Items (2)

Multiquery motion planning in uncertain spaces: incremental adaptive randomized roadmaps ⋮ D* Extra Lite

Uses Software

• D*Lite

Cites Work

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

This page was built for publication: D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing