← Search

Jan Matyáš Křišťan

2 accepted papers

2025

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures

AAAI 2025technical

Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position, and while avoiding collisions. By optimal, we mean as fast as possible, which is evaluated by a measure known as the makespan of the proposed solution. This is the se…

Cited by 0SourcePDFScholar
2025

Solving Multiagent Path Finding on Highly Centralized Networks

AAAI 2025technical

The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each other. We aim to minimize the maximum time any agent takes t…

Cited by 0SourcePDFScholar