paper-with-me

홈 › Papers

Execution Flexibility in Automated Planning: A Comparative Evaluation of Deordering and Reordering Strategies

2026-09-15 · Md. Monjurul Islam, Sabah Binte Noor, Fazlul Hasan Siddiqui, Gahangir Hossain arxiv

This study covers foundational concepts for enhancing plan-execution flexibility, including partial-order planning, the producer-consumer-threat formalism, and a range of deordering and reordering strategies. Creating a partial-order plan from a sequential one by removing unnecessary ordering constraints is a practical way to improve execution flexibility, and several methods have been proposed for this task. This study analyzes their capabilities across ordering, action handling, parameter handling, plan structure, concurrency, and complexity, and evaluates them against each other on a shared benchmark. The central finding is that block deordering-based approaches, which restructure causal dependencies through block-level grouping and subplan substitution, substantially outperform MaxSAT-based approaches despite the latter's theoretical guarantees of minimum reordering. The reason is structural: minimum reordering optimizes within the causal structure already present in the plan, whereas block deordering-based methods change that structure, exposing orderings that would otherwise appear necessary. A further distinction is practical: block deordering-based methods are anytime algorithms that always return a valid result, while MaxSAT-based methods fail entirely on a substantial portion of plans and offer no partial solution when they do. Block substitution further extends the parallel execution by formalizing non-concurrency constraints, though its impact is limited to domains with resource-based interactions. On efficiency, block deordering-based approaches achieve the highest flex gain per unit of computation time, while MaxSAT-based encodings incur large computational overhead.

📄 PDF Abstract BibTeX arXiv:2609.16822

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Counterfactual Reasoning in Automated Planning

2026-05-04 · Alberto Pozanco, Daniel Borrajo, Manuela Veloso arxiv

Automated planning traditionally assumes that all aspects of a planning task (initial state, goals, and available actions) are fully specified in advance, an approach well-suited to domains with fixed rules and determini…

Improving Plan Execution Flexibility using Block-Substitution

2024-06-05 · Sabah Binte Noor, Fazlul Hasan Siddiqui

Partial-order plans in AI planning facilitate execution flexibility due to their less-constrained nature. Maximizing plan flexibility has been studied through the notions of plan deordering, and plan reordering. Plan deo…

What Automated Planning can do for Business Process Management

2017-09-29 · Andrea Marrella

Business Process Management (BPM) is a central element of today organizations. Despite over the years its main focus has been the support of processes in highly controlled domains, nowadays many domains of interest to th…

Management

Improving Execution Concurrency in Partial-Order Plans via Block-Substitution

2024-06-25 · Sabah Binte Noor, Fazlul Hasan Siddiqui

Partial-order plans in AI planning facilitate execution flexibility and several other tasks, such as plan reuse, modification, and decomposition, due to their less constrained nature. A Partial-Order Plan (POP) allows tw…

SkiROS2: A skill-based Robot Control Platform for ROS

2023-06-29 · Matthias Mayr, Francesco Rovida, Volker Krueger

The need for autonomous robot systems in both the service and the industrial domain is larger than ever. In the latter, the transition to small batches or even "batch size 1" in production created a need for robot contro…

SchedulingTask Planning