Robust Route Planning for Sidewalk Delivery Robots
Xing Tong, Michele D. Simoni

TL;DR
This paper develops robust route planning methods for sidewalk delivery robots operating in uncertain, dynamic environments, improving reliability by explicitly modeling travel time variability due to pedestrians and obstacles.
Contribution
It introduces novel robust optimization approaches, including ellipsoidal and distributionally robust methods, tailored for sidewalk robot routing under real-world uncertainties.
Findings
Robust routing significantly reduces delays compared to shortest path methods.
Ellipsoidal and DRSP approaches outperform others in worst-case delay scenarios.
Robust methods are more beneficial for wider, slower, and more conservative robots in adverse conditions.
Abstract
Sidewalk delivery robots are a promising solution for last-mile freight distribution. Yet, they operate in dynamic environments characterized by pedestrian flows and potential obstacles, which make travel times highly uncertain and can significantly affect their efficiency. This study addresses the robust route planning problem for sidewalk robots by explicitly accounting for travel time uncertainty generated through simulated interactions between robots, pedestrians, and obstacles. Robust optimization is integrated with simulation to reproduce the effect of obstacles and pedestrian flows and generate realistic travel times. Three different approaches to derive uncertainty sets are investigated, including budgeted, ellipsoidal, and support vector clustering (SVC)-based methods, together with a distributionally robust shortest path (DRSP) method based on ambiguity sets that model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
