Hotel Delivery Robot: Multi-Floor A* Routing

Route Controls

Robot speed 1.6 cells/s

Elevator wait 4.0 s

Optimize route (nearest-neighbor)

Live Status

Idle at dock.

Deliveries

0 / 0

Battery

100%

Distance

0 cells

Elapsed

0.0 s

Delivery Queue

How it works

Each floor is a grid graph; walls block edges between adjacent cells. The robot finds the shortest route between two points with A* search, which expands the cell minimizing:

f(n) = g(n) + h(n)
g(n) = steps already taken to reach n
h(n) = |dx| + |dy|   (Manhattan distance, admissible on a 4-connected grid)

A* is optimal whenever h never overestimates the true remaining cost — Manhattan distance never does on this grid, so the path it returns is always shortest.

Crossing floors costs a fixed elevator wait added on top of the walking cost, so a same-floor detour can beat a shorter-looking route that needs a floor change. With N pending rooms the visit order is chosen by a greedy nearest-neighbor heuristic: from the robot's current position, always go to whichever remaining room has the lowest total cost (walk + elevator legs), repeated N times — an O(N²) approximation of the NP-hard traveling-salesman problem that real fleet-routing robots use because exact optimization does not scale to a full floor plan.

Robot speed — grid cells crossed per second while walking.
Elevator wait — seconds burned per floor change, added directly into the nearest-neighbor cost so the robot prefers batching same-floor rooms.
Optimize route — toggle it off to run the rooms in creation order instead and compare total distance/time against the optimized run.
Battery — drains 0.6% per cell walked and 0.3%/s while waiting for the elevator; at 0% the robot halts in place until redocked by a new round.

Robot Charging dock Elevator Pending room Delivered

⚠ Couldn't load the 3D engineThree.js failed to load from the CDN. Check your connection and reload.