By Malte Helmert

Action making plans has continuously performed a vital function in man made Intelligence. Given an outline of the present scenario, an outline of attainable activities and an outline of the objectives to be completed, the duty is to spot a series of activities, i.e., a plan that transforms the present state of affairs into one who satisfies the target description.

This monograph is a revised model of Malte Helmert's doctoral thesis, fixing making plans initiatives in concept and perform, written lower than the supervision of Professor Bernhard Nebel as thesis consultant at Albert-Ludwigs-Universität Freiburg, Germany, in 2006. The e-book includes an exhaustive research of the computational complexity of the benchmark difficulties which were utilized in the previous decade, specifically the traditional benchmark domain names of the foreign making plans Competitions (IPC). while, it contributes to the perform of fixing making plans projects by means of offering a strong new method of heuristic making plans. the writer additionally offers an in-depth research of so-called routing and transportation problems.

All in all, this booklet will give a contribution considerably to advancing the cutting-edge in computerized making plans.

Show description

Read or Download Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition PDF

Similar structured design books

Java(tm) for S/390® and AS/400® COBOL Programmers

The publication may still specialise in Java on AS400. additionally it makes use of visible Age that's outmoded may still use Websphere as a substitute. the code isn't really transparent because it attempts to match COBOL(structure programing) with Java(Object orientated

Web Work: Information Seeking and Knowledge Work on the World Wide Web

This publication brings jointly 3 nice motifs of the community society: the looking and utilizing of knowledge by way of contributors and teams; the construction and alertness of data in corporations; and the elemental transformation of those actions as they're enacted on the web and the realm extensive internet.

On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops: OTM Confederated International Workshops and Posters, AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007, Vilamoura, Portugal

This two-volume set LNCS 4805/4806 constitutes the refereed complaints of 10 foreign workshops and papers of the OTM Academy Doctoral Consortium held as a part of OTM 2007 in Vilamoura, Portugal, in November 2007. The 126 revised complete papers awarded have been rigorously reviewed and chosen from a complete of 241 submissions to the workshops.

Dynamic Data-Driven Environmental Systems Science: First International Conference, DyDESS 2014, Cambridge, MA, USA, November 5-7, 2014, Revised Selected Papers

This ebook constitutes the refereed lawsuits of the 1st overseas convention on Dynamic Data-Driven Environmental structures technological know-how, DyDESS 2014, held in Cambridge, MA, united states, in November 2014.

Additional resources for Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition

Example text

Let pL be a length bounding polynomial for D, and let pw be a cost bounding polynomial for D. Due to membership in FPTAS, there must be a planning algorithm for D 1 ), which generates c-approximating solutions for tasks T ∈ D in time q(|T |, c−1 where q grows polynomially in both parameters. 1 1 . Then c−1 = 2pL (|T |)pw (|T |) In particular, choose c = 1 + 2pL (|T |)p w (|T |) and hence the running time of the algorithm is polynomial in |T |, pL (|T |) and pw (|T |), which is still polynomial in |T |.

Reasonable Plans A plan for a Transport task is called reasonable if it has the following properties: – No portable is dropped at the same location twice. – All mobiles are empty at the end of plan execution. – The plan does not end with a movement action, and for every movement action in the plan, the next non-movement action affects the same mobile. We first show that we only need to consider planning algorithms which generate reasonable plans: Any plan can be transformed into a reasonable one in polynomial time without increasing its measure.

At each node are vehicles, cargo items, and some amount of fuel. Objects can be loaded onto vehicles (up to their capacity), and the vehicles can move between nodes; but a vehicle can leave a node only if there is a nonzero amount of fuel there, and the amount decreases by one unit. The goal is to get cargo items from various nodes to various new nodes. MysteryPrime: This is the Mystery domain with one extra action, the ability to squirt a unit of fuel from any node to any other node, provided the originating node has at least two units.

Download PDF sample

Rated 4.68 of 5 – based on 7 votes