Zobrazeno 1 - 10
of 4 009
pro vyhledávání: '"A, Ardizzoni"'
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 feasible solution that brings each agent to its target, preventing de
Externí odkaz:
http://arxiv.org/abs/2410.07954
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 the users are divided into different groups. Each group follows a diff
Externí odkaz:
http://arxiv.org/abs/2403.18561
The behavior of cyclists when choosing the path to follow along a road network is not uniform. Some of them are mostly interested in minimizing the travelled distance, but some others may also take into account other features such as safety of the ro
Externí odkaz:
http://arxiv.org/abs/2403.16580
Publikováno v:
Journal of Artificial Intelligence Research 79, 483--514, 2024
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 widely studied because, in many cases, the more general Multi-Agent path fi
Externí odkaz:
http://arxiv.org/abs/2307.12770
In a previous paper we introduced the concept of semiseparable functor. Here we continue our study of these functors in connection with idempotent (Cauchy) completion. To this aim, we introduce and investigate the notions of (co)reflection and birefl
Externí odkaz:
http://arxiv.org/abs/2306.07091
We propose an infinitesimal counterpart to the notion of braided category. The corresponding infinitesimal braidings are natural transformations which are compatible with an underlying braided monoidal structure in the sense that they constitute a fi
Externí odkaz:
http://arxiv.org/abs/2306.00558
Publikováno v:
2023 62nd IEEE Conference on Decision and Control (CDC), 8081-8086
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 brings each agent to its target, preventing deadlock situations. However,
Externí odkaz:
http://arxiv.org/abs/2304.01765
Publikováno v:
Automatica, Volume 165, July 2024, 111593
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 bound on the number of agents that occupy each member of a family of ver
Externí odkaz:
http://arxiv.org/abs/2209.12506
Publikováno v:
2022 IEEE 61st Conference on Decision and Control (CDC), 7194--7199, 2022
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 to be NP-hard, and computation times grows exponentially with the num
Externí odkaz:
http://arxiv.org/abs/2209.04286
Autor:
Cavazzoni, Andrea, Salamon, Irene, Fumarola, Claudia, Gallerani, Giulia, Laprovitera, Noemi, Gelsomino, Francesco, Riefolo, Mattia, Rihawi, Karim, Porcellini, Elisa, Rossi, Tania, Mazzeschi, Martina, Naddeo, Maria, Serravalle, Salvatore, Broseghini, Elisabetta, Agostinis, Federico, Deas, Olivier, Roncarati, Roberta, Durante, Giorgio, Pace, Ilaria, Lauriola, Mattia, Garajova, Ingrid, Calin, George A., Bonafè, Massimiliano, D’Errico, Antonia, Petronini, Pier Giorgio, Cairo, Stefano, Ardizzoni, Andrea, Sales, Gabriele, Ferracin, Manuela
Publikováno v:
In Molecular Therapy 2 October 2024 32(10):3650-3668
