Computational Complexity of some Optimization Problems in Planning is popular PDF and ePub book, written by Meysam Aghighi in 2017-05-17, it is a fantastic choice for those who relish reading online the Uncategoriezed genre. Let's immerse ourselves in this engaging Uncategoriezed book by exploring the summary and details provided below. Remember, Computational Complexity of some Optimization Problems in Planning can be Read Online from any device for your convenience.
Computational Complexity of some Optimization Problems in Planning Book PDF Summary
Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. One method for analyzing the computational complexity of planning is to study restricted subsets of planning instances, with the aim of differentiating instances with varying complexity. We use this methodology for studying the computational complexity of planning. Finding new tractable (i.e. polynomial-time solvable) problems has been a particularly important goal for researchers in the area. The reason behind this is not only to differentiate between easy and hard planning instances, but also to use polynomial-time solvable instances in order to construct better heuristic functions and improve planners. We identify a new class of tractable cost-optimal planning instances by restricting the causal graph. We study the computational complexity of oversubscription planning (such as the net-benefit problem) under various restrictions and reveal strong connections with classical planning. Inspired by this, we present a method for compiling oversubscription planning problems into the ordinary plan existence problem. We further study the parameterized complexity of cost-optimal and net-benefit planning under the same restrictions and show that the choice of numeric domain for the action costs has a great impact on the parameterized complexity. We finally consider the parameterized complexity of certain problems related to partial-order planning. In some applications, less restricted plans than total-order plans are needed. Therefore, a partial-order plan is being used instead. When dealing with partial-order plans, one important question is how to achieve optimal partial order plans, i.e. having the highest degree of freedom according to some notion of flexibility. We study several optimization problems for partial-order plans, such as finding a minimum deordering or reordering, and finding the minimum parallel execution length.
Detail Book of Computational Complexity of some Optimization Problems in Planning PDF
- Author : Meysam Aghighi
- Release : 17 May 2017
- Publisher : Linköping University Electronic Press
- ISBN : 9789176855195
- Genre : Uncategoriezed
- Total Page : 35 pages
- Language : English
- PDF File Size : 18,6 Mb
If you're still pondering over how to secure a PDF or EPUB version of the book Computational Complexity of some Optimization Problems in Planning by Meysam Aghighi, don't worry! All you have to do is click the 'Get Book' buttons below to kick off your Download or Read Online journey. Just a friendly reminder: we don't upload or host the files ourselves.