Official recipe · Browser tasks
Compare stop order using time-specific travel estimates
Source-backed example. Practical decision guidance is proposed and untested; this is not a full implementation guide.
The problem
The best order for several city stops can change with departure time, making an intuitive route a poor basis for planning.
Agent job
Compare alternative orderings of three stops using travel estimates for the selected departure time.
Expected output
A stop sequence with the lowest estimated travel time among compared options.
Where this framing comes from
- Core problem: Editorial purpose framing
- Agent job: Editorial purpose framing
- Expected output: Editorial purpose framing
- Relevant job roles: Editorial purpose framing
- Benefit type: Editorial purpose framing
Editorial framing and outcome limits
Describes the task’s purpose and intended output; measured benefit, safe unsupervised operation and successful delivery are not established by this framing.
Editorial synthesis based on the linked source. This framing does not add evidence of successful delivery or results.
Case-specific decision guidance · untested
Case-specific decision guidance and first checks are original proposals. The linked source supports the attributed task; this added guidance has not been executed.
Read the attributed source evidence and original caveats below ↓
Why use this
A person arranging several city stops may choose the order that looks shortest on a map, even though travel estimates depend on departure time and direction. Ignoring time spent at each stop can make later legs use the wrong conditions.
A comparison sheet could show which sequences were evaluated and what assumptions produced the preferred option. The result would be the lowest estimate among the compared choices, rather than a guarantee about the actual journey.
Why an agent / simpler alternative
- Useful judgment
Keep stop constraints and time assumptions consistent across alternative orderings.
- Simpler alternative
Use a route planner directly when stop order is fixed or only two destinations are involved.
- Unsuitable when
Required arrival windows or travel-mode constraints are missing.
Proposed inputs
- Name
Trip constraints
- Owner
Traveller
- Minimum scope
Three stops, origin, departure time, travel mode and required windows
- Quality check
Verify exact locations and local time.
- Name
Travel-estimate snapshots
- Owner
Approved routing source
- Minimum scope
Per-leg estimates with query times and stated assumptions
- Quality check
Check whether traffic estimates correspond to each leg’s departure.
Access and setup — proposed or unknown
- Proposed minimum
Supplied or approved read-only route estimates; private comparison.
- Compatibility unknowns
Unknown: exact runtime, routing access, time-dependent estimates and regional coverage.
- External actions requiring approval
Sharing private destinations with routing services or changing bookings and appointments.
Expected deliverable and review checks
- Proposed artifact
Compared-order table with leg estimates, stop durations and a qualified preferred sequence.
- Critical checks
All candidates use the same mandatory constraints.
Uncompared sequences and uncertain travel conditions remain explicit.
- Missing output evidence
No live route query or journey-timing validation occurs in this overlay.
Failure signals and proposed responses
- Signal
Every leg is queried at the initial departure time.
- Why it matters
Later travel conditions may be represented incorrectly.
- Proposed response
Include stop durations and recalculate the intended leg-departure assumptions.
- Signal
The quickest sequence misses a required arrival window.
- Why it matters
The numerically best route may be unusable.
- Proposed response
Exclude infeasible sequences before comparing estimated travel time.
Effort and cost — unknown
- Setup work
Confirm stop identities and timing constraints.
- Ongoing review
Refresh estimates near departure when appropriate.
- Unknowns
Unknown: traffic variability, routing costs and actual stop duration.
First check — proposed, unexecuted
- Status
proposed_unexecuted
- Synthetic fixture
Invented route estimates include a fastest order that misses a required visit window and a feasible slower order.
- Acceptance checks
The infeasible order cannot be recommended.
The preferred option names its estimate assumptions.
- Stop conditions
A private-location disclosure or missing time constraint is unresolved.
Limits
Editorial routing comparison; estimated time is not a promised arrival.
Editorial candidate. This is source-backed reporting or a documented workflow. BotCurrent has not independently tested this task. A proposed Canadian adaptation is not evidence of a Canadian deployment or compliance certification.
Original source
https://browser-use.com/showcase/three-stop-city-route ↗Attributed to: Browser Use
Official recipe- Original action type
- browser_action
- What the source supports
- Test alternative orderings for three city stops and return the quickest sequence at a chosen departure time.
- Source outcome limits
- This official recipe describes a procedure; it does not prove successful execution or independently reproduced results.
- Evidence attribution caveat
- This official recipe describes a procedure; it does not prove successful execution or independently reproduced results.
- Source approval description
- Not specified.
- Named tools
- Browser Use; google.com/maps
- Model or version
- Unknown
- Publication date
- Unknown
- Source last checked
- 2026-10-14
- Demonstrated in Canada
- Unknown
- Canadian availability
- unverified
- Proposed Canadian adaptation
- Use Canadian addresses and local time; assess closures, tolls and winter conditions before travel.
- Recommended approval boundaries
- Approve account access and any personal-data disclosure. Review before purchases, bookings, messages, archive requests, uploads or publication. Keep research read-only where possible.