Research
Planning Task Shielding: Detecting and Repairing Flaws in Planning Tasks through Turning them Unsolvable
arXiv:2604.07042v1 Announce Type: new Abstract: Most research in planning focuses on generating a plan to achieve a desired set of goals. However, a goal specification can also be used to encode a pro
arXiv:2604.07042v1 Announce Type: new Abstract: Most research in planning focuses on generating a plan to achieve a desired set of goals. However, a goal specification can also be used to encode a property that should never hold, allowing a planner to identify a trace that would reach a flawed state. In such cases, the objective may shift to modifying the planning task to ensure that the flawed state is never reached-in other words, to make the planning task unsolvable. In this paper we introduce planning task shielding: the problem of detecting and repairing flaws in planning tasks. We propose $allmin$, an optimal algorithm that solves these tasks by minimally modifying the original actions to render the planning task unsolvable. We empirically evaluate the performance of $allmin$ in shielding planning tasks of increasing size, showing how it can effectively shield the system by turning the planning task unsolvable.
Related
- Planning with Minimal Disruption
- Faithful-First Reasoning, Planning, and Acting for Multimodal LLMs
- Resource-constrained Amazons chess decision framework integrating large language models and graph attention
- Thinking in Graphs with CoMAP: A Shared Visual Workspace for Designing Project-Based Learning
- Once4All: Skeleton-Guided SMT Solver Fuzzing with LLM-Synthesized Generators
Source: arXiv cs.AI | 2026-04-10