Plan Reordering and Parallel Execution -- A Parameterized Complexity View
2017 (English)Conference paper (Refereed)
Bäckström has previously studied a number of optimization problems for partial-order plans, like finding a minimum deordering (MCD) or reordering (MCR), and finding the minimum parallel execution length (PPL), which are all NP-complete. We revisit these problems, but applying parameterized complexity analysis rather than standard complexity analysis. We consider various parameters, including both the original and desired size of the plan order, as well as its width and height. Our findings include that MCD and MCR are W-hard and in W[P] when parameterized with the desired order size, and MCD is fixed-parameter tractable (fpt) when parameterized with the original order size. Problem PPL is fpt if parameterized with the size of the non-concurrency relation, but para-NP-hard in most other cases. We also consider this problem when the number (k) of agents, or processors, is restricted, finding that this number is a crucial parameter; this problem is fixed-parameter tractable with the order size, the parallel execution length and k as parameter, but para-NP-hard without k as parameter.
Place, publisher, year, edition, pages
AAAI Press, 2017.
Partially ordered plan, Parameterized complexity, Complexity of planning, Plan reordering, Parallel plan execution
IdentifiersURN: urn:nbn:se:liu:diva-136279OAI: oai:DiVA.org:liu-136279DiVA: diva2:1087085
Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)