Autonomous Route Optimizer
You know which stops to hit. This tries every order and finds the one that fits the 15 second period, using the same timing model as the estimator.
Inputs
The first row is where the robot starts and stays fixed. Every other stop gets reordered. Coordinates measured from one corner, X across and Y up the field.
Same meaning as on the Autonomous Time Estimator. Keep them matched.
Use when the route has to finish somewhere specific, like a parking zone.
Results
Best order takes
—sec
Fits 15 seconds?
—
Your order takes
—sec
Reordering saves
—sec
Worst possible order
—sec
Orders checked
—
Best order distance
—in
Best order turning
—°
The best order
| # | Stop | Turn | Drive | Action | Leg time | Elapsed |
|---|
How this is calculated
Which stops to visit is a strategy decision. What order to visit them in is arithmetic, and the difference between a good order and a bad one is routinely several seconds out of fifteen.
Every order, not a clever guess
With a handful of stops there are few enough orderings to simply try them all: seven stops after the start is 720 orders, which a browser evaluates instantly. Each one is timed with the same acceleration and turning model as the Autonomous Time Estimator, so the two agree.
Trying everything means the answer is genuinely the best available order, not a heuristic's best effort. Past eight stops the count grows faster than is sensible to enumerate, and the tool says so rather than quietly sampling.
With your numbers
Turning is usually what decides it
Two orders can cover almost identical distance and differ substantially in time, because one of them keeps the robot roughly pointed the right way and the other spins it at every stop. Since turning covers no ground, it is pure overhead, and reordering is the cheapest way to remove it.
This is also why the saving is often larger than it looks: the time you win is time that was buying nothing.
What it does not know
Nothing here understands the game. It does not know that a goal must be scored before it can be defended, that a preload has to go first, or that an opponent will be somewhere inconvenient. It also drives straight through obstacles, since it has no idea where they are.
So use it to find candidate orders, then apply the constraints yourself. If the fastest order is illegal or impossible, the second fastest is right there.
Sources & assumptions
The 15 second autonomous period is from theOverride 2026-27 game manual. The field is 144" square. Speeds and accelerations are your own figures.
Uses the same trapezoidal timing model as the Autonomous Time Estimator: a full stop at every stop, point turns, and no blending between moves. Real routines that curve through waypoints are faster than any figure here, and the ranking between orders is more trustworthy than the absolute times.
- V5RC Override Game Manual v1.1 (2026-27) — checked 2026-08-17
Save this run, and compare
Keeps what is on screen so you can change something and see both sides of the change. Saved in this browser only, never uploaded.
Save this as evidence
Collects what you entered, what came out, how it was worked out, and anything the tool flagged, with a timestamp and a version so someone else can reproduce it.
This is evidence, not a notebook entry. It deliberately does not write your problem statement, your reasoning, or your conclusion, because under RECF rules an Engineering Notebook has to be the students' own work and no tool may generate or organise its content. Take the numbers, decide what matters, and write it yourself.