Understanding planning tasks. Domain complexity and heuristic decomposition
From MaRDI portal
Publication:2473931
DOI10.1007/978-3-540-77723-6zbMath1130.68092OpenAlexW4249768103MaRDI QIDQ2473931
Publication date: 5 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77723-6
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Epistemic planning with attention as a bounded resource ⋮ DEL-based epistemic planning: decidability and complexity ⋮ Landmark-enhanced abstraction heuristics ⋮ Conflict-based search for optimal multi-agent pathfinding
Uses Software
This page was built for publication: Understanding planning tasks. Domain complexity and heuristic decomposition