Preference-Based Multi-Objective Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) consists in computing a set of collision-free paths for a team of agents on a given graph while minimizing one objective, such as the sum of paths costs or the makespan. However, real-world applications may require the consideration of multiple objectives. Thus, in th... View More