# Formalisation of Action with Durations in Answer Set Programming

arXiv: https://arxiv.org/abs/2109.08305 · HTML: https://mlsanity.com/paper/2109.08305/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 31 references that are in the map.
- First posted on arXiv 17 Sep 2021.

## Builds on (most cited first, 3 of 3)

- [Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks](https://mlsanity.com/paper/1906.08291/) (2019)
- [Time varying networks and the weakness of strong ties](https://mlsanity.com/paper/1303.5966/) (2013)
- [PDDL+ Planning via Constraint Answer Set Programming](https://mlsanity.com/paper/1609.00030/) (2016)

## Abstract (arXiv)

In this paper, I will discuss the work I am currently doing as a Ph.D. student at the University of Potsdam, under the tutoring of T. Schaub. I'm currently looking into action description in ASP. More precisely, my goal is to explore how to represent actions with durations in ASP, in different contexts. Right now, I'm focused on Multi-Agent Path Finding (MAPF), looking at how to represent speeds for different agents and contexts. Before tackling duration, I wanted to explore and compare different representations of action taking in ASP. For this, I started comparing different simple encodings tackling the MAPF problem. Even in simple code, choices and assumptions have been made in their creations. The objective of my work is to present the consequences of those design decisions in terms of performance and knowledge representation. As far as I know, there is no current research on this topic. Besides that, I'm also exploring different ways to represent duration and to solve related problems. I planed to compare them the same way I described before. I also want this to help me find innovative and effective ways to solve problems with duration.