当前位置: X-MOL 学术arXiv.cs.LO › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Formalisation of Action with Durations in Answer Set Programming
arXiv - CS - Logic in Computer Science Pub Date : 2021-09-17 , DOI: arxiv-2109.08305
Etienne Tignon

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.

中文翻译:

答案集编程中具有持续时间的动作形式化

在本文中,我将讨论我目前作为博士所做的工作。波茨坦大学的学生,在 T. Schaub 的指导下。我目前正在研究 ASP 中的动作描述。更准确地说,我的目标是探索如何在 ASP 中在不同的上下文中表示具有持续时间的动作。现在,我专注于多代理路径查找 (MAPF),研究如何表示不同代理和上下文的速度。在处理持续时间之前,我想探索和比较 ASP 中采取的行动的不同表示。为此,我开始比较解决 MAPF 问题的不同简单编码。即使在简单的代码中,他们的创作中也做出了选择和假设。我的工作目标是在性能和​​知识表示方面呈现这些设计决策的后果。据我所知,目前没有关于这个主题的研究。除此之外,我也在探索不同的方式来表示持续时间和解决相关问题。我打算用我之前描述的相同方式比较它们。我也希望这能帮助我找到解决持续时间问题的创新和有效方法。
更新日期:2021-09-20
down
wechat
bug