Book Details

Understanding Planning Tasks : Domain Complexity and Heuristic Decomposition

Publication year: 2008

ISBN: 978-3-540-77723-6

Internet Resource: Please Login to download book


Action planning has always played a central role in Artificial Intelligence. Given a description of the current situation, a description of possible actions and a description of the goals to be achieved, the task is to identify a sequence of actions, i.e., a plan that transforms the current situation into one that satisfies the goal description. The book contains an exhaustive analysis of the computational complexity of the benchmark problems that have been used in the past decade, namely the standard benchmark domains of the International Planning Competitions (IPC). At the same time, it contributes to the practice of solving planning tasks by presenting a powerful new approach to heuristic planning. The author also provides an in-depth analysis of so-called routing and transportation problems.


Subject: Computer Science, Artificial Intelligence, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Probability and Statistics in Computer Science, Bernhard Nebel, PDDL, algorithmics, approximation algorithms, classification, complexity computational, complexity, graph theory, heuristic search, intelligence knowledge, minimization, optimization, planning domains