Distributed Multi-Agent Planning

Collision-Free Multi-Agent Routing

Set of algorithms ensuring that paths computed for each agent in a shared environment are free from any spatial and temporal intersection that could lead to physical collision.

← Terug