In modern factories, teams of mobile robots are used to transport materials efficiently and autonomously. To operate at scale, these robots require coordinated planning of their movements while avoiding conflicts and delays.
- During your thesis, you will investigate how such multi-robot plans can remain efficient when execution deviates from the original schedule (e.g., due to delays or blocked paths). Instead of recomputing plans from scratch, the goal is to adapt them locally during execution.
- You will develop methods to represent robot actions and their interactions, and design algorithms that incrementally repair ongoing plans while ensuring safety and consistency.
- Your approaches will be implemented in a simulation framework and evaluated on representative industrial scenarios, focusing on robustness, efficiency, and solution quality.
- Finally, you will work closely with a research team and contribute to bridging algorithmic planning methods with real-world robotic systems.