research
∙
07/24/2023
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees
The pebble motion on trees (PMT) problem consists in finding a feasible ...
share
research
∙
09/26/2022
Constrained Multi-Agent Path Finding on Directed Graphs
We discuss C-MP and C-MAPF, generalizations of the classical Motion Plan...
research
∙
09/09/2022
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) cons...
research
∙
03/04/2021
The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
The purpose of this work is to introduce and characterize the Bounded Ac...
research
∙
01/28/2019
Globally Optimal Registration based on Fast Branch and Bound
The problem of planar registration consists in finding the transformatio...
research
∙
02/09/2018
