Skip to main content
Book cover

Understanding Planning Tasks

Domain Complexity and Heuristic Decomposition

  • Book
  • © 2008

Overview

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4929)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Planning Benchmarks

  2. Fast Downward

Keywords

About this 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.

This monograph is a revised version of Malte Helmert's doctoral thesis, Solving Planning Tasks in Theory and Practice, written under the supervision of Professor Bernhard Nebel as thesis advisor at Albert-Ludwigs-Universität Freiburg, Germany, in 2006. 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.

All in all, this book will contribute significantly to advancing the state of the art in automatic planning.

Bibliographic Information

Publish with us