9 citations · 20 across the 6 of their papers we have counts for
6 papers
Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs
Irene Saccani, Stefano Ardizzoni, Luca Consolini +1
Among sub-optimal Multi-Agent Path Finding (MAPF) solvers, rule-based algorithms are particularly appealing since they are complete. Even in crowded scenarios, they allow finding a…
A Dynamic Programming Approach for Road Traffic Estimation
Mattia Laurini, Irene Saccani, Stefano Ardizzoni +2
We consider a road network represented by a directed graph. We assume to collect many measurements of traffic flows on all the network arcs, or on a subset of them. We assume that…
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees
Stefano Ardizzoni, Irene Saccani, Luca Consolini +2
The pebble motion on trees (PMT) problem consists in finding a feasible sequence of moves that repositions a set of pebbles to assigned target vertices. This problem has been widel…
Local Optimization of MAPF solutions on Directed Graphs
S. Ardizzoni, I. Saccani, L. Consolini +1
Among sub-optimal MAPF solvers, rule-based algorithms are particularly appealing since they are complete. Even in crowded scenarios, they allow finding a feasible solution that bri…
Constrained Multi-Agent Path Finding on Directed Graphs
Stefano Ardizzoni, Luca Consolini, Marco Locatelli +1
We discuss C-MP and C-MAPF, generalizations of the classical Motion Planning (MP) and Multi-Agent Path Finding (MAPF) problems on a directed graph G. Namely, we enforce an upper bo…
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms
Stefano Ardizzoni, Irene Saccani, Luca Consolini +1
On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known…