Continuous-time Multi-Agent Path Finding research
Dnr:
NAISS 2026/4-1495
Type:
NAISS Small
Principal Investigator:
Alvin Combrink
Affiliation:
Chalmers tekniska högskola
Start Date:
2026-08-31
End Date:
2027-09-01
Primary Classification:
20201: Robotics and automation
Webpage:
Allocation
- Arrhenius Disk at NAISS: 250 GiB
- Arrhenius CPU at NAISS: 10 x 1000 core-h/month
Abstract
The goal of the project is to develop and test algorithms for Multi-AGV/AMR/agent path planning, scheduling and collision avoidance.