pith. sign in

arxiv: 2507.12067 · v2 · submitted 2025-07-16 · 💻 cs.RO

Robust Route Planning for Sidewalk Delivery Robots

Xing Tong , Michele D. Simoni This is my paper

Pith reviewed 2026-05-19 04:50 UTC · model grok-4.3

classification 💻 cs.RO
keywords sidewalk delivery robotsrobust route planningtravel time uncertaintyrobust optimizationsimulationlast-mile deliverypedestrian interactionsdistributionally robust optimization
0
0 comments X

The pith

Robust optimization with simulated uncertainty sets improves route reliability for sidewalk delivery robots over shortest paths.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops route planning methods for sidewalk delivery robots that must navigate variable travel times caused by pedestrians and obstacles. It uses simulation to model these interactions and generate data for robust optimization, testing budgeted, ellipsoidal, SVC-based uncertainty sets, and a distributionally robust shortest path approach. In a Stockholm city center case study, robust methods deliver better average and worst-case performance than conventional shortest-path routing, with larger gains for wider or slower robots in congested or poor-weather conditions. This matters for last-mile delivery because unreliable timing can waste robot capacity and increase operational costs in real urban settings.

Core claim

Integrating robust optimization with simulation of robot-pedestrian-obstacle interactions to derive uncertainty sets shows that robust routing significantly enhances operational reliability under variable sidewalk conditions; the ellipsoidal and DRSP methods outperform budgeted and SVC-based alternatives as well as standard shortest-path planning in both average and worst-case delay.

What carries the argument

Robust optimization combined with simulation-generated uncertainty sets for travel times, including ellipsoidal sets and distributionally robust shortest path (DRSP) formulations.

If this is right

  • Wider, slower, and more conservative robots gain the largest reliability improvements from robust planning.
  • Adverse weather and high pedestrian congestion amplify the advantage of ellipsoidal and DRSP methods over conventional approaches.
  • Robust routes maintain better performance across varying environmental conditions than shortest-path routes.
  • Operational reliability increases for last-mile sidewalk delivery tasks when uncertainty is explicitly modeled.
  • Sensitivity analyses indicate that route planning should be tailored to specific robot designs and congestion levels.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same simulation-plus-robust-optimization pattern could transfer to other slow-moving autonomous vehicles sharing space with people.
  • Live sensor data from robots could be used to refresh the uncertainty sets in real time instead of relying on precomputed simulations.
  • Extending the model to include predictive crowd dynamics might further tighten the worst-case delay bounds.
  • City planners could use these reliability metrics when deciding where to allow or restrict sidewalk robot operations.

Load-bearing premise

The travel times produced by simulating interactions between robots, pedestrians, and obstacles accurately represent real-world uncertainty for constructing the uncertainty sets.

What would settle it

Deploying the computed robust routes on actual robots in Stockholm sidewalks and comparing measured delays against the simulation predictions would confirm or refute the uncertainty models.

Figures

Figures reproduced from arXiv: 2507.12067 by Michele D. Simoni, Xing Tong.

Figure 1
Figure 1. Figure 1: Framework for Simulation and Optimization [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Visual examples for four robust methods 3.1.1 Budgeted uncertainty The Budgeted uncertainty approach (Bertsimas and Sim (2003)) for robust discrete optimization in￾volves defining each entry uj , j ∈ [n] within the interval [cj , cj +dj ]. In the case of RSPP, uj represents the robust cost at certain segment j, cj is the minimum observed cost of segment j, and dj denotes the deviation between maximum cost … view at source ↗
Figure 3
Figure 3. Figure 3: Refined Pedestrian network in Norrmalm, Stockholm [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Sources of pedestrian demand data [PITH_FULL_IMAGE:figures/full_fig_p013_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Obstacles (red squares) on the sidewalk network [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Correlation between segments and between hours [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Trade-off between three performance criteria [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Distribution of three types of uncertainty sets for different OD pairs [PITH_FULL_IMAGE:figures/full_fig_p017_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Performance improvement of selected robust methods under various robot design conditions [PITH_FULL_IMAGE:figures/full_fig_p019_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Performance improvement of selected robust methods under various environmental factors [PITH_FULL_IMAGE:figures/full_fig_p020_10.png] view at source ↗
read the original 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 uncertainty in travel-time distributions. A realistic case study reproducing pedestrian patterns in Stockholm's city center is used to evaluate the efficiency of robust routing across various robot designs and environmental conditions. Results show that, when compared to a conventional shortest path (SP) method, robust routing significantly enhances operational reliability under variable sidewalk conditions. The ellipsoidal and DRSP approaches outperform the other methods in terms of average and worst-case delay. Sensitivity analyses reveal that robust approaches are higher for sidewalk delivery robots that are wider, slower, and more conservative in their navigation behaviors, especially in adverse weather and high pedestrian congestion scenarios.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes robust route planning for sidewalk delivery robots by integrating Monte Carlo simulation of robot-pedestrian-obstacle interactions to generate travel-time uncertainty sets on a Stockholm network model. It compares budgeted, ellipsoidal, SVC-based, and distributionally robust shortest-path (DRSP) methods against conventional shortest-path routing, reporting that ellipsoidal and DRSP approaches yield lower average and worst-case delays under variable conditions, with sensitivity analyses on robot width, speed, and navigation behavior.

Significance. If the simulated uncertainty sets prove representative of real sidewalk dynamics, the framework offers a concrete way to improve reliability for last-mile delivery robots without requiring perfect real-time sensing. The explicit coupling of simulation-derived ambiguity sets with robust optimization, together with the Stockholm case study and parameter-sensitivity results, supplies a reproducible template that other researchers can adapt to different urban networks or robot platforms.

major comments (2)
  1. [§4] §4: Travel-time uncertainty sets are generated by Monte Carlo runs of the same robot-pedestrian-obstacle simulator that later supplies the test instances used to compute reported delays. Because no calibration to field measurements or out-of-sample real-robot traces is described, any mismatch between simulated kinematics (e.g., pedestrian avoidance, friction under weather) and actual sidewalk behavior directly undermines the claimed reliability gains.
  2. [Abstract and §5] Abstract and §5: The claim that ellipsoidal and DRSP methods outperform others in average and worst-case delay is presented without quantitative metrics on simulation fidelity, explicit values of the uncertainty-budget parameter, or statistical significance tests (e.g., confidence intervals or p-values across the Monte Carlo replications).
minor comments (2)
  1. [§5] The post-hoc sensitivity analyses on robot width, speed, and conservative navigation would be stronger if they were part of the primary experimental design rather than presented as supplementary checks.
  2. [§3] Notation for the three uncertainty-set constructions (budgeted, ellipsoidal, SVC) and the DRSP ambiguity set could be unified in a single table to improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed feedback. We address each major comment below, clarifying our approach and outlining the revisions we will implement to improve the manuscript's rigor and transparency.

read point-by-point responses

  1. Referee: [§4] §4: Travel-time uncertainty sets are generated by Monte Carlo runs of the same robot-pedestrian-obstacle simulator that later supplies the test instances used to compute reported delays. Because no calibration to field measurements or out-of-sample real-robot traces is described, any mismatch between simulated kinematics (e.g., pedestrian avoidance, friction under weather) and actual sidewalk behavior directly undermines the claimed reliability gains.

    Authors: We acknowledge the validity of this concern. Generating uncertainty sets and evaluation instances from the same simulator introduces a risk of optimistic bias if the model does not perfectly replicate real sidewalk dynamics. This is an inherent limitation of purely simulation-based studies when real-world traces are unavailable. In the revised manuscript we will add an explicit limitations subsection in §4 that details the simulator's kinematic assumptions, discusses potential mismatches (including weather effects on friction and more complex pedestrian interactions), and states that all reported reliability gains are conditional on simulation fidelity. We will also expand the conclusions to recommend future calibration against field measurements or out-of-sample robot data as a necessary next step. Because the current work is a simulation-driven proof-of-concept on the Stockholm network, we cannot supply actual calibration results at this time. revision: partial

  2. Referee: [Abstract and §5] Abstract and §5: The claim that ellipsoidal and DRSP methods outperform others in average and worst-case delay is presented without quantitative metrics on simulation fidelity, explicit values of the uncertainty-budget parameter, or statistical significance tests (e.g., confidence intervals or p-values across the Monte Carlo replications).

    Authors: We agree that additional quantitative detail would strengthen the presentation. The original manuscript reported comparative average and worst-case delays but omitted explicit parameter values and statistical tests for conciseness. In the revision we will: (i) state the concrete uncertainty-budget values (Γ) used for the budgeted and ellipsoidal formulations in §5 and the abstract; (ii) report quantitative simulation-fidelity metrics such as the coefficient of variation of travel times across Monte Carlo runs and the number of replications required for convergence; and (iii) add statistical significance tests, including p-values and 95 % confidence intervals on the performance differences between methods. These additions will be incorporated into the text, tables, and a new supplementary table of replication statistics. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained within simulation framework

full rationale

The paper generates travel-time uncertainty sets (budgeted, ellipsoidal, SVC, and ambiguity sets for DRSP) from Monte Carlo simulation runs modeling robot-pedestrian-obstacle interactions on a Stockholm network. These sets are then input to robust optimization formulations to compute routes, which are evaluated for average and worst-case delay on case-study instances. No equation or step reduces the reported performance gains to the input data by construction, nor are there load-bearing self-citations, fitted parameters renamed as predictions, or ansatzes smuggled via prior work. The approach is a standard integrated simulation-optimization study whose central claims remain independent of the specific fitted values.

Axiom & Free-Parameter Ledger

1 free parameters · 0 axioms · 0 invented entities

Abstract-only review limits visibility; the approach rests on the assumption that simulation faithfully reproduces travel-time distributions and that the chosen uncertainty sets (budgeted, ellipsoidal, SVC) adequately capture the simulated variability without additional free parameters beyond those tuned in the case study.

free parameters (1)
  • uncertainty budget parameter
    Appears in the budgeted uncertainty set approach; value chosen to balance robustness and performance in the Stockholm simulation.

pith-pipeline@v0.9.0 · 5752 in / 1143 out tokens · 49373 ms · 2026-05-19T04:50:18.677986+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

62 extracted references · 62 canonical work pages · 3 internal anchors

  1. [1]

    Alves Pessoa, A., Di Puglia Pugliese, L., Guerriero, F., and Poss, M. (2015). Robust constrained shortest path problems under budgeted uncertainty. Networks , 66(2):98--111

    work page 2015

  2. [2]

    and Wurdemann, H

    Anvari, B. and Wurdemann, H. A. (2020). Modelling social interaction between humans and service robots in large public spaces. In 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages 11189--11196

    work page 2020

  3. [3]

    and Nemirovski, A

    Ben-Tal, A. and Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research , 23(4):769--805

    work page 1998

  4. [4]

    and Nemirovski, A

    Ben-Tal, A. and Nemirovski, A. (1999). Robust solutions of uncertain linear programs. Operations Research Letters , 25(1):1--13

    work page 1999

  5. [5]

    and Brown, D

    Bertsimas, D. and Brown, D. (2009). Constructing uncertainty sets for robust linear optimization. Operations Research , 57:1483--1495

    work page 2009

  6. [6]

    and Sim, M

    Bertsimas, D. and Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming , 98:49--71

    work page 2003

  7. [7]

    Bishop, C. (2016). Swiss post trials robot parcel deliveries in bern. https://www.thelocal.ch/20160823/swiss-post-trials-robot-parcel-deliveries-in-bern

    work page arXiv 2016

  8. [8]

    Bliss, J. (2023). On airport delivery & investor revenue demands. https://www.ottomate.news/p/on-airport-delivery-and-investor

    work page 2023

  9. [9]

    Boysen, N., Fedtke, S., and Schwerdfeger, S. (2021). Last-mile delivery concepts: a survey from an operational research perspective. Or Spectrum , 43(1):1--58

    work page 2021

  10. [10]

    Boysen, N., Schwerdfeger, S., and Weidinger, F. (2018). Scheduling last-mile deliveries with truck-based autonomous robots. European Journal of Operational Research , 271(3):1085--1099

    work page 2018

  11. [11]

    Burns, J. (2016). Domino's pizza robot making deliveries in australia. https://www.forbes.com/sites/janetwburns/2016/03/18/dominos-pizza-robot-is-making-deliveries-in-australia/

    work page 2016

  12. [12]

    Chassein, A., Dokka, T., and Goerigk, M. (2019). Algorithms and uncertainty sets for data-driven robust shortest path problems. European Journal of Operational Research , 274(2):671--686

    work page 2019

  13. [13]

    Chassein, A. B. and Goerigk, M. (2015). A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. European Journal of Operational Research , 244(3):739--747

    work page 2015

  14. [14]

    Chen, C., Demir, E., Huang, Y., and Qiu, R. (2021). The adoption of self-driving delivery robots in last mile logistics. Transportation Research Part E: Logistics and Transportation Review , 146:102214

    work page 2021

  15. [15]

    Cheng, J., Lisser, A., and Letournel, M. (2013). Distributionally robust stochastic shortest path problem. Electronic Notes in Discrete Mathematics , 41:511--518

    work page 2013

  16. [16]

    Coldewey, D. (2019). Kiwi’s food delivery bots are rolling out to 12 more colleges. https://techcrunch.com/2019/04/25/kiwis-food-delivery-bots-are-rolling-out-to-12-new-colleges/

    work page 2019

  17. [17]

    De Maio , A., Ghiani, G., Laganà, D., and Manni, E. (2024). Sustainable last-mile distribution with autonomous delivery robots and public transportation. Transportation Research Part C: Emerging Technologies , 163:104615

    work page 2024

  18. [18]

    An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems

    Dokka, T. and Goerigk, M. (2017). An experimental comparison of uncertainty sets for robust shortest path problems. arXiv preprint arXiv:1704.08470

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  19. [19]

    J., Oon, C

    Du, Y., Hetherington, N. J., Oon, C. L., Chan, W. P., Quintero, C. P., Croft, E., and Machiel Van der Loos, H. (2019). Group surfing: A pedestrian-based approach to sidewalk robot navigation. In 2019 International Conference on Robotics and Automation (ICRA) , pages 6518--6524

    work page 2019

  20. [20]

    G., Glenn Geers , D., Kilby, P., and Li, J

    Ensafian, H., Zare Andaryan , A., Bell, M. G., Glenn Geers , D., Kilby, P., and Li, J. (2023). Cost-optimal deployment of autonomous mobile lockers co-operating with couriers for simultaneous pickup and delivery operations. Transportation Research Part C: Emerging Technologies , 146:103958

    work page 2023

  21. [21]

    Ferrer, G., Garrell, A., and Sanfeliu, A. (2013a). Robot companion: A social-force based approach with human awareness-navigation in crowded environments. In 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems , pages 1688--1694

    work page 2013

  22. [22]

    Ferrer, G., Garrell, A., and Sanfeliu, A. (2013b). Social-aware robot navigation in urban environments. In 2013 European Conference on Mobile Robots , pages 331--336

    work page 2013

  23. [23]

    and Ryeng, E

    Fossum, M. and Ryeng, E. O. (2021). The walking speed of pedestrians on various pavement surface conditions during winter. Transportation Research Part D: Transport and Environment , 97:102934

    work page 2021

  24. [24]

    R., Phair, C

    Gehrke, S. R., Phair, C. D., Russo, B. J., and Smaglik, E. J. (2023). Observed sidewalk autonomous delivery robot interactions with pedestrians and bicyclists. Transportation Research Interdisciplinary Perspectives , 18:100789

    work page 2023

  25. [25]

    Ghiasvand, M. R. and Rahmani, D. (2023). A novel weighted data-driven robust optimization approach for creating adjustable uncertainty sets. Computers & Chemical Engineering , 178:108390

    work page 2023

  26. [26]

    and Christoforou, Z

    Giannoulaki, M. and Christoforou, Z. (2024). Pedestrian walking speed analysis: A systematic review. Sustainability , 16(11)

    work page 2024

  27. [27]

    and Kurtz, J

    Goerigk, M. and Kurtz, J. (2023). Data-driven robust optimization using deep neural networks. Computers & Operations Research , 151:106087

    work page 2023

  28. [28]

    Algorithm Engineering in Robust Optimization

    Goerigk, M. and Sch \"o bel, A. (2015). Algorithm engineering in robust optimization. arXiv preprint arXiv:1505.04901

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  29. [29]

    Gruden, C., I s toka Otkovi \'c , I., S raml, M., et al. (2022). Three-step performance assessment of a pedestrian crossing time prediction model. Transactions on transport sciences , 12(3):13--21

    work page 2022

  30. [30]

    Han, B., Shang, C., and Huang, D. (2021). Multiple kernel learning-aided robust optimization: Learning algorithm, computational tractability, and usage in multi-stage decision-making. European Journal of Operational Research , 292(3):1004--1018

    work page 2021

  31. [31]

    Heimfarth, A., Ostermeier, M., and Hübner, A. (2022). A mixed truck and robot delivery approach for the daily supply of customers. European Journal of Operational Research , 303(1):401--421

    work page 2022

  32. [32]

    and Molnar, P

    Helbing, D. and Molnar, P. (1995). Social force model for pedestrian dynamics. Physical review E , 51(5):4282

    work page 1995

  33. [33]

    Hossain, M. (2022). Self-driving robots: A revolution in the local delivery. https://cmr.berkeley.edu/2022/04/self-driving-robots-a-revolution-in-the-local-delivery/?utm_source=chatgpt.com

    work page 2022

  34. [34]

    and Figliozzi, M

    Jennings, D. and Figliozzi, M. (2019). Study of sidewalk autonomous delivery robots and their potential impacts on freight efficiency and travel. Transportation Research Record , 2673(6):317--326

    work page 2019

  35. [35]

    Johansson, A., Helbing, D., and Shukla, P. (2008). Specification of a microscopic pedestrian mo del by evolutionary adjustment to video tracking data. arXiv preprint arXiv:0810.4587

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  36. [36]

    and Zielinski, P

    Kasperski, A. and Zielinski, P. (2016). Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey , volume 241, pages 113--143. Springer International Publishing

    work page 2016

  37. [37]

    S., Prokopyev, O

    Ketkov, S. S., Prokopyev, O. A., and Burashnikov, E. P. (2021). An approach to the distributionally robust shortest path problem. Computers & Operations Research , 130:105212

    work page 2021

  38. [38]

    Kumawat, S., Dudeja, C., and Kumar, P. (2021). An extensive review of shortest path problem solving algorithms. In 2021 5th International Conference on Intelligent Computing and Control Systems (ICICCS) , pages 176--184

    work page 2021

  39. [39]

    Kwon, C., Lee, T., and Berglund, P. G. (2013). Robust shortest path problems with two uncertain multiplicative cost coefficients. Naval Research Logistics (NRL) , 60

    work page 2013

  40. [40]

    Lemardel \'e , C., Estrada, M., Pag \`e s, L., and Bachofner, M. (2021). Potentialities of drones and ground autonomous delivery devices for last-mile logistics. Transportation Research Part E: Logistics and Transportation Review , 149:102325

    work page 2021

  41. [41]

    G., and Geers, D

    Li, J., Ensafian, H., Bell, M. G., and Geers, D. G. (2021). Deploying autonomous mobile lockers in a two-echelon parcel operation. Transportation Research Part C: Emerging Technologies , 128:103155

    work page 2021

  42. [42]

    Liang, S., Leng, H., Yuan, Q., Wang, B., and Yuan, C. (2020). How does weather and climate affect pedestrian walking speed during cool and cold seasons in severely cold areas? Building and Environment , 175:106811

    work page 2020

  43. [43]

    Liu, D., Yan, P., Pu, Z., Wang, Y., and Kaisar, E. I. (2021). Hybrid artificial immune algorithm for optimizing a van-robot e-grocery delivery system. Transportation Research Part E: Logistics and Transportation Review , 154:102466

    work page 2021

  44. [44]

    Marks, M. (2019). Robots in space: Sharing the sidewalk with autonomous delivery vehicles. Available at SSRN 3347466

    work page 2019

  45. [45]

    Murray, C. C. and Chu, A. G. (2015). The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery. Transportation Research Part C: Emerging Technologies , 54:86--109

    work page 2015

  46. [46]

    and You, F

    Ning, C. and You, F. (2018). Data-driven decision making under uncertainty integrating robust optimization with principal component analysis and kernel smoothing methods. Computers & Chemical Engineering , 112:190--210

    work page 2018

  47. [47]

    PTV VISSIM 2023 User Manual

    PTV (2023). PTV VISSIM 2023 User Manual . PTV group

    work page 2023

  48. [48]

    Roytvand Ghiasvand , M., Rahmani, D., and Moshref-Javadi, M. (2024). Data-driven robust optimization for a multi-trip truck-drone routing problem. Expert Systems with Applications , 241:122485

    work page 2024

  49. [49]

    Shang, C., Huang, X., and You, F. (2017). Data-driven robust optimization based on kernel learning. Computers & Chemical Engineering , 106:464--479. ESCAPE-26

    work page 2017

  50. [50]

    and You, F

    Shang, C. and You, F. (2018). Robust optimization in high-dimensional data space with support vector clustering. IFAC-PapersOnLine , 51(18):19--24. 10th IFAC Symposium on Advanced Control of Chemical Processes ADCHEM 2018

    work page 2018

  51. [51]

    Sharan, S., Surya, R., and Suchithra, R. (2022). Autonomous robot-driven deliveries: A review of recent developments and future directions. Transportation research part E: logistics and transportation review , 165:102834

    work page 2022

  52. [52]

    Shi, X., Xue, S., Feliciani, C., Shiwakoti, N., Lin, J., Li, D., and Ye, Z. (2021). Verifying the applicability of a pedestrian simulation model to reproduce the effect of exit design on egress flow under normal and emergency conditions. Physica A: statistical mechanics and its applications , 562:125347

    work page 2021

  53. [53]

    D., Kutanoglu, E., and Claudel, C

    Simoni, M. D., Kutanoglu, E., and Claudel, C. G. (2020). Optimization and analysis of a robot-assisted last mile delivery system. Transportation Research Part E: Logistics and Transportation Review , 142:102049

    work page 2020

  54. [54]

    Resvanor i stockholms län 2015

    Stockhlom County (2016). Resvanor i stockholms län 2015. ‘Travel habits in Stockholm County’; in Swedish. https://miljobarometern.stockholm.se/content/docs/tema/trafik/resvanor/RVU-stockholms-lan-2015.pdf

    work page 2016

  55. [55]

    Clean air zone class 3

    Stockhlom County (2025). Clean air zone class 3. https://trafik.stockholm/en/traffic-safety-and-rules/clean-air-zones/clean-air-zone-class-3/

    work page 2025

  56. [56]

    Flödeskarta för gångtrafik

    Stockhloms County (2017). Flödeskarta för gångtrafik. ‘Gångflödeskarta över city’; in Swedish. https://miljobarometern.stockholm.se/content/Trafikrelaterat/G

    work page 2017

  57. [57]

    and Ngo, T

    Truong, X.-T. and Ngo, T. D. (2017). Toward socially aware robot navigation in dynamic and crowded environments: A proactive social motion model. IEEE Transactions on Automation Science and Engineering , 14(4):1743--1760

    work page 2017

  58. [58]

    Ulmer, M. W. and Streng, S. (2019). Same-day delivery with pickup stations and autonomous vehicles. Computers & Operations Research , 108:1--19

    work page 2019

  59. [59]

    Wahlberg, A. (2024). Uber and avride are bringing delivery robots and autonomous vehicles to city streets. https://foodondemand.com/10082024/uber-and-avride-announce-delivery-robot-and-autonomous-vehicle-partnership/

    work page arXiv 2024

  60. [60]

    Wang, Z., You, K., Song, S., and Shang, C. (2019). Data-driven distributionally robust shortest path problem using the wasserstein ambiguity set. In 2019 IEEE 15th International Conference on Control and Automation (ICCA) , pages 1391--1396

    work page 2019

  61. [61]

    Wang, Z., You, K., Song, S., and Zhang, Y. (2020). Wasserstein distributionally robust shortest path problem. European Journal of Operational Research , 284(1):31--43

    work page 2020

  62. [62]

    Yang, Y., Quan, X., and Sun, Y. (2023). Enhanced social force model for service robots in various environments: Calibration and simulation. In 2023 IEEE 13th International Conference on CYBER Technology in Automation, Control, and Intelligent Systems (CYBER) , pages 89--94

    work page 2023