6 papers · 1 filter
The Cost of Executability: Temporal Margins for Continuous-Time Multi-Agent Path Finding under Closed-Loop Control
Sabino Roselli, Alvin Combrink, Ze Zhang
Multi-agent path finding (MAPF) solvers are evaluated on the schedules they produce, not on how well those schedules can be executed. Specifically, continuous-time optimal solvers…
The Cost of Classical Multi-Agent Path Finding
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
Multi-Agent Path Finding (MAPF) is the problem of planning conflict-free paths for multiple agents in a shared space, each from its start to its goal. Classical MAPF has been the d…
AOC-CBS: Anytime-Optimal Continuous-time Conflict-Based Search for Generalised Multi-Agent Path Finding
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
Many research fields share a common structure: a set of agents, each pursuing its own goal, whose actions must be coordinated so that no two of them conflict. Multi-Agent Path Find…
Multi-Worker Assembly Line Rebalancing with Relevance-Guided Configuration Preservation
Martina Vinetti, Sabino Roselli, Martin Fabian
In assembly line balancing, tasks are assigned to stations in order to satisfy a required cycle time. When production conditions change, the line must be rebalanced by modifying th…
Machine Learning-Based Analysis of Critical Process Parameters Influencing Product Quality Defects: A Real-World Case Study in Manufacturing
Sukumaran Rajasekaran, Ebru Turanoglu Bekar, Kanika Gandhi +2
Quality control is an essential operation in manufacturing, ensuring products meet the necessary standards of quality, safety, and reliability. Traditional methods, such as visual…
A General Formulation for the Teaching Assignment Problem: Computational Analysis Over a Real-World Dataset
Moa Johannesson, Lina Brink, Alvin Combrink +2
The Teacher Assignment Problem is a combinatorial optimization problem that involves assigning teachers to courses while guaranteeing that all courses are covered, teachers do not…