On Computing Plans with Uniform Action Costs

Alberto Pozanco, Daniel Borrajo, Manuela Veloso
2/15/2024
cs.AI

No confident code implementation found for this paper.

Abstract

In many real-world planning applications, agents might be interested in finding plans whose actions have costs that are as uniform as possible. Such plans provide agents with a sense of stability and predictability, which are key features when humans are the agents executing plans suggested by planning tools. This paper adapts three uniformity metrics to automated planning, and introduce planning-based compilations that allow to lexicographically optimize sum of action costs and action costs uniformity. Experimental results both in well-known and novel planning benchmarks show that the reformulated tasks can be effectively solved in practice to generate uniform plans.

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{pozanco2024computing,
  title  = {On Computing Plans with Uniform Action Costs},
  author = {Alberto Pozanco and Daniel Borrajo and Manuela Veloso},
  year   = {2024},
  eprint = {2402.09877},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.09877v3}
}

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/2402.09877.svg)](https://codeofpaper.com/paper/2402.09877)

Discussion