no code implementations • 26 Dec 2020 • YuAn Wang, Hideaki Ishii, François Bonnet, Xavier Défago
Such a problem setting serves as a model of opinion dynamics in social networks where consensus is to be formed at the time of pandemic and infected individuals may deviate from their true opinions.
1 code implementation • 27 May 2020 • Keisuke Okumura, Yasumasa Tamura, Xavier Défago
Typical Multi-agent Path Finding (MAPF) solvers assume that agents move synchronously, thus neglecting the reality gap in timing assumptions, e. g., delays caused by an imperfect execution of asynchronous moves.
Multiagent Systems Robotics
1 code implementation • 24 May 2019 • Keisuke Okumura, Yasumasa Tamura, Xavier Défago
The problem of Multi-agent Path Finding (MAPF) consists in providing agents with efficient paths while preventing collisions.
Multiagent Systems Distributed, Parallel, and Cluster Computing Robotics
2 code implementations • 31 Jan 2019 • Keisuke Okumura, Manao Machida, Xavier Défago, Yasumasa Tamura
In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must reach their own respective destinations without inter-agent collisions.
Multiagent Systems Distributed, Parallel, and Cluster Computing Robotics 68W99
