The BDD-Based Dynamic A* Algorithm for Real-Time Replanning

DOI10.1007/978-3-642-02270-8_28MaRDI QIDQ5321719zbMATH OpenOpenAlexFDO

Authors Yanyan Xu, Weiya Yue, Kaile Su

Publication date 14 July 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02270-8_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• BDD-Based Incremental Heuristic Search
• Performance bounds for planning in unknown terrain
• D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
• Truncated incremental search
• Lifelong planning \(\text{A}^*\)

Cites work

• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Lifelong planning \(\text{A}^*\)
• State-set branching: leveraging BDDs for heuristic search

Cited in

(3)

• D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
• scientific article; zbMATH DE number 1947498 (Why is no real title available?)
• Performance bounds for planning in unknown terrain

This page was built for publication: The BDD-Based Dynamic A* Algorithm for Real-Time Replanning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321719)