More robots do not make a faster night.
A discrete-event model of one cleaning night in a tall building. Change the building, the fleet and the elevator; the planner finds the robot count that finishes first. Every input is an assumption until a pilot measures it.
With 90 robots, staggered starts end the night at 01:00.
Cyberstrata planner v0.1discrete-event modelinputs as set above
Click the chart or use ← → to choose a robot countSimulated
The elevator is a shared queue. The plan decides who rides it, and when.
Two schedules run on the same inputs. All up, then clean is how the worked example is usually told. Staggered starts let each robot clean as soon as it arrives and queue for the ride down when its area is done.
- 01
Robots are split evenly across floors, at least one per floor, and stay on their floor all night.
- 02
A floor's area is split evenly among its robots. Robots with the most area ride up first.
- 03
Each elevator trip takes one round trip and carries up to the set number of robots. Trips up are served before trips down.
- 04
The night ends when the last robot is back at the loading dock.
| Not modelled yet | Effect on the night |
|---|---|
| First-time mapping of each floor | Longer first night; repeats unaffected |
| Charging and battery limits | Caps area per robot per night |
| Transport to the site | Earlier start, favours local fleets |
| Elevators shared with people | Longer and less regular trips |
| Toilets, desks and bins | Done by people in a mixed crew |
| Faults and stops | Needs spare robots in the plan |