mlsanityData to 14 Oct 2026

On Computing Plans with Uniform Action Costs

arXiv 2402.09877 ↗First posted 15 Feb 2024cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 0 of its 23 references that are in the map. First posted on arXiv 15 Feb 2024.

Builds on

0 of 23 references.

No references here yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.