7 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…
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…
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…
Leveraging Conflicting Constraints in Solving Vehicle Routing Problems
Sabino Francesco Roselli, Remco Vader, Martin Fabian +1
The Conflict-Free Electric Vehicle Routing Problem (CF-EVRP) is a combinatorial optimization problem of designing routes for vehicles to visit customers such that a cost function,…