Planning with Minimal Disruption

Alberto Pozanco, Marianela Morales, Daniel Borrajo, Manuela Veloso
8/21/2025
cs.AI

No confident code implementation found for this paper.

Abstract

In many planning applications, we might be interested in finding plans that minimally modify the initial state to achieve the goals. We refer to this concept as plan disruption. In this paper, we formally introduce it, and define various planning-based compilations that aim to jointly optimize both the sum of action costs and plan disruption. Experimental results in different benchmarks show that the reformulated task can be effectively solved in practice to generate plans that balance both objectives.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{pozanco2025planning,
  title  = {Planning with Minimal Disruption},
  author = {Alberto Pozanco and Marianela Morales and Daniel Borrajo and Manuela Veloso},
  year   = {2025},
  eprint = {2508.15358},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.15358v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.15358.svg)](https://codeofpaper.com/paper/2508.15358)

Discussion