paper-with-me

Papers

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 deordering removes unnecessary action orderings within a plan, while plan reordering modifies them arbitrarily to minimize action orderings. This study, in contrast with traditional plan deordering and reordering strategies, improves a plan's flexibility by substituting its subplans with actions outside the plan for a planning problem. We exploit block deordering, which eliminates orderings in a POP by encapsulating coherent actions in blocks, to construct action blocks as candidate subplans for substitutions. In addition, this paper introduces a pruning technique for eliminating redundant actions within a BDPO plan. We also evaluate our approach when combined with MaxSAT-based reorderings. Our experimental result demonstrates a significant improvement in plan execution flexibility on the benchmark problems from International Planning Competitions (IPC), maintaining good coverage and execution time.

📄 PDF Abstract BibTeX arXiv:2406.03091

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

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…

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 …

When "Must" Becomes "Maybe": Constraint Weakening in LLM Agent Workflows

2026-08-25 · Yiheng Sun, Huifei Wang, Yancheng Zhu, Zhenyu Li 외 hf

Large language model (LLM) agents coordinate complex tasks through multi-role and multi-stage workflows. Upstream state is repeatedly transformed into intermediate language artifacts, such as summaries, plans, tickets, m…

Information Extraction

RLinf: Flexible and Efficient Large-scale Reinforcement Learning via Macro-to-Micro Flow Transformation

2025-09-19 · Chao Yu, Yuanqing Wang, Zhen Guo, Hao Lin 외 arxiv

Reinforcement learning (RL) has demonstrated immense potential in advancing artificial general intelligence, agentic intelligence, and embodied intelligence. However, the inherent heterogeneity and dynamicity of RL workf…

Reinforcement Learning

XSub: Explanation-Driven Adversarial Attack against Blackbox Classifiers via Feature Substitution

2024-09-13 · Kiana Vu, Phung Lai, Truc Nguyen

Despite its significant benefits in enhancing the transparency and trustworthiness of artificial intelligence (AI) systems, explainable AI (XAI) has yet to reach its full potential in real-world applications. One key cha…

Adversarial Attack