BDD-Based Incremental Heuristic Search

DOI10.3724/SP.J.1001.2009.03563MaRDI QIDQ3054245zbMATH OpenFDO

Authors Yanyan Xu, Weiya Yue

Publication date 5 November 2010

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1001.2009.03563

zbMATH Keywords

binary decision diagramheuristic searchincremental searchreplanning

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• State-set branching: leveraging BDDs for heuristic search
• scientific article; zbMATH DE number 4209573
• BDD ordering heuristics for classical planning
• Solving BDD by enumeration: an update
• Breadth-first heuristic search
• Design of experiments and evaluation of BDD ordering heuristics

Cited in

(3)

• Truncated incremental search
• A multiobjective incremental heuristic search algorithm
• The BDD-Based Dynamic A* Algorithm for Real-Time Replanning

This page was built for publication: BDD-Based Incremental Heuristic Search

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