10 papers
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…
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…
A Multi-Worker Assembly Line Rebalancing with Spatial and Ergonomic Considerations
Martina Vinetti, Sabino Francesco Roselli, Martin Fabian
This work addresses the Assembly Line Rebalancing Problem driven by cycle-time changes in manual assembly systems where multiple workers operate in parallel within the same station…
Optimal Multi-Agent Path Finding in Continuous Time
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
Continuous-time Conflict Based Search (CCBS) has been widely used as an exact baseline for Continuous-time Multi-Agent Path Finding (MAPFR), and its correctness guarantees underpin…
A Comparative Study of SMT and MILP for the Nurse Rostering Problem
Alvin Combrink, Stephie Do, Kristofer Bengtsson +2
The effects of personnel scheduling on the quality of care and working conditions for healthcare personnel have been thoroughly documented. However, the ever-present demand and lar…
Identification of Minimally Restrictive Assembly Sequences using Supervisory Control Theory
Martina Vinetti, Martin Fabian
Modern assembly processes require flexibility and adaptability to handle increasing product variety and customization. Traditional assembly planning methods often prioritize findin…
Prioritized Planning for Continuous-time Lifelong Multi-agent Pathfinding
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
Multi-agent Path Finding (MAPF) is the problem of planning collision-free movements of agents so that they get from where they are to where they need to be. Commonly, agents are lo…
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem
Sabino Francesco Roselli, Per-Lage Götvall, Martin Fabian +1
The Conflict-Free Electric Vehicle Routing Problem (CF-EVRP) is an extension of the Vehicle Routing Problem (VRP), a combinatorial optimization problem of designing routes for vehi…