Warehouse Robot Traffic Deconfliction
Two identical fleets of warehouse robots pick items from shelves in real time. One fleet follows each robot's own shortest path blindly and jams at intersections; the other uses a priority-based reservation layer that inserts small waits and reroutes to keep traffic flowing. Compare live deliveries-per-minute as fleet size grows.
Every mobile robot in a warehouse fleet can compute its own individually shortest path to a shelf — but a warehouse full of robots each ignoring everyone else's plan is not the same as a fast warehouse. This simulation runs two identical robot fleets side by side on the same aisle layout: one lets every robot follow its own shortest path blindly, so paths cross and robots jam at intersections; the other adds a lightweight priority-based reservation layer that predicts conflicts ahead of time and inserts small waits or reroutes for the lower-priority robot, keeping the whole fleet moving. Scale the fleet size up and watch how differently the two strategies degrade.
Two identical warehouse robot fleets pick items in real time. One fleet follows each robot's own shortest path blindly and jams at intersections; the other uses a priority-based reservation layer (space-time A*) that inserts small waits and reroutes to keep traffic flowing. Compare live deliveries-per-minute as fleet size grows.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install