Formalisation of Action with Durations in Answer Set Programming
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds
SIGMA: Sheaf-Informed Geometric Multi-Agent Pathfinding
Simultaneous Computation with Multiple Prioritizations in Multi-Agent Motion Planning
Graph Coloring to Reduce Computation Time in Prioritized Planning
Multi-Agent Motion Planning For Differential Drive Robots Through Stationary State Search
Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.