3 papers
cs.MA2024
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…
eess.SY2024
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…
cs.MA2023
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…