Hotel Delivery Robot: Multi-Floor A* Routing

A room-service robot has to reach a handful of guest rooms scattered across two hotel floors, and the two costs it juggles are physical distance and elevator wait time. This simulator grids out each floor as a graph, finds every walking route with A* search (Manhattan-heuristic, provably shortest on a 4-connected grid), and sequences the day's deliveries with a greedy nearest-neighbor heuristic that treats an elevator ride as a fixed extra cost — the same trade-off real hotel and hospital delivery robots (Savioke Relay, Aethon TUG) solve every shift. Toggle route optimization off to watch an unsorted delivery order burn extra battery and time hopping needlessly between floors, and watch the battery gauge drain with real walking and waiting costs until the robot needs to redock.