6 papers
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…
Zero-Shot Generalization from Motion Demonstrations to New Tasks
Kilian Freitag, Alvin Combrink, Nadia Figueroa
Learning motion policies from expert demonstrations is an essential paradigm in modern robotics. While end-to-end models aim for broad generalization, they require large datasets a…
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…
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…
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…