Safety-Filter Interventions as Congestion Prices for Delay Accounting, Causal Attribution and Marginal-Cost Routing of Warehouse Mobile Robots

Authors

  • Olasubomi Akanbi Department of Systems Engineering, Bowling Green State University, Bowling Green, OH 43403, USA Author
  • Toheeb Babatunde Ibrahim Department of Mathematics and Statistics, Bowling Green State University, Bowling Green, OH 43403, USA Author
  • Joseph Oladejo Department of Mathematics and Statistics, Bowling Green State University, Bowling Green, OH 43403, USA Author
  • Warith Akinade Department of Mathematics and Statistics, Bowling Green State University, Bowling Green, OH 43403, USA Author

Keywords:

Control barrier functions; Safety filter; Warehouse robotics; Autonomous mobile robots; Congestion pricing; Marginal cost pricing; Traffic assignment

Abstract

Autonomous mobile robots in warehouses are protected by control barrier function (CBF) safety filters, which minimally modify each robot’s velocity command so that no collision constraint is violated. The modification, which we call the intervention, is computed at every control step and then discarded. We show that it is a congestion price with three properties that occupancy and travel-time signals lack. First, it accounts for delay exactly: along a lane, the time integral of the longitudinal intervention of all control layers, that is, planner holds plus filter corrections, equals the robot’s congestion delay. This is a kinematic identity, so on a single lane the signal carries the same information as the speed deficit, and a regularised Little’s-law estimator turns it into consistent edge delays while traversals are still in progress. Second, it is attributable: the Karush–Kuhn–Tucker multipliers of the filter and the hold decisions of the planner charge every second of delay to the robot whose constraint produced it, and forwarding along active headway constraints charges queue cascades to their root cause. Since this attribution is budget balanced, pricing a route by the delay its robots suffer plus the delay they impose equals the marginal social cost under pairwise conflicts and gives a conservative price under superlinear congestion. Third, it routes stably: by specialising classical day-to-day assignment stability, we derive the convergence-rate-optimal smoothing gain, its robustness margin and the gain that balances tracking lag against estimation noise. Simulations of a lane network with realistic synthetic inputs, namely order-wave demand generated by time rescaling, lognormal pick times and heterogeneous speeds, checked for collinearity, confirm the delay identity to within one integration step. The attributed imposed delay recovers 97% of the counterfactual marginal external cost at low flow, and the accrued signal improves out-of-sample delay prediction beyond occupancy and flow. Marginal-cost intervention pricing lowers the system travel time at a busy crossing by 3.5% relative to user-equilibrium pricing and recovers 83% of the gain of an oracle price. Online gain tuning did not outperform a conservatively chosen fixed gain.

References

1. P. R. Wurman, R. D’Andrea, M. Mountz, Coordinating hundreds of cooperative, autonomous vehicles in warehouses, AI Magazine 29 (1) (2008) 9–19.

2. K. Azadeh, R. De Koster, D. Roy, Robotized and automated warehouse systems: Review and recent developments, Transportation Science 53 (4) (2019) 917–945.

3. N. Boysen, R. De Koster, F. Weidinger, Warehousing in the e-commerce era: A survey, European Journal of Operational Research 277 (2) (2019) 396–411.

4. G. Fragapane, R. De Koster, F. Sgarbossa, J. O. Strandhagen, Planning and control of autonomous mobile robots for intralogistics: Literature review and research agenda, European Journal of Operational Research 294 (2) (2021) 405–426.

5. T. Le-Anh, M. B. M. De Koster, A review of design and control of automated guided vehicle systems, European Journal of Operational Research 171 (1) (2006) 1–23.

6. I. F. A. Vis, Survey of research in the design and control of automated guided vehicle systems, European Journal of Operational Research 170 (3) (2006) 677–709.

7. L. Qiu, W.-J. Hsu, S.-Y. Huang, H. Wang, Scheduling and routing algorithms for AGVs: A survey, International Journal of Production Research 40 (3) (2002) 745–760.

8. B. P. Gerkey, M. J. Matarić, A formal analysis and taxonomy of task allocation in multi-robot systems, The International Journal of Robotics Research 23 (9) (2004) 939–954.

9. H. Ma, J. Li, T. K. S. Kumar, S. Koenig, Lifelong multi-agent path finding for online pickup and delivery tasks, in: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2017, pp. 837–845.

10. J. Li, A. Tinka, S. Kiesel, J. W. Durham, T. K. S. Kumar, S. Koenig, Lifelong multi-agent path finding in large-scale warehouses, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35, 2021, pp. 11272–11281.

11. I. Draganjac, D. Miklić, Z. Kovačić, G. Vasiljević, S. Bogdan, Decentralized control of multi-AGV systems in autonomous warehousing applications, IEEE Transactions on Automation Science and Engineering 13 (4) (2016) 1433–1447.

12. V. Digani, L. Sabattini, C. Secchi, C. Fantuzzi, Ensemble coordination approach in multi-AGV systems applied to industrial warehouses, IEEE Transactions on Automation Science and Engineering 12 (3) (2015) 922–934.

13. K. Dresner, P. Stone, A multiagent approach to autonomous intersection management, Journal of Artificial Intelligence Research 31 (2008) 591–656.

14. W. Hönig, S. Kiesel, A. Tinka, J. W. Durham, N. Ayanian, Persistent and robust execution of MAPF schedules in warehouses, IEEE Robotics and Automation Letters 4 (2) (2019) 1125–1131.

15. A. D. Ames, J. W. Grizzle, P. Tabuada, Control barrier function based quadratic programs with application to adaptive cruise control, in: Proceedings of the 53rd IEEE Conference on Decision and Control, 2014, pp. 6271–6278.

16. A. D. Ames, X. Xu, J. W. Grizzle, P. Tabuada, Control barrier function based quadratic programs for safety critical systems, IEEE Transactions on Automatic Control 62 (8) (2017) 3861–3876.

17. A. D. Ames, S. Coogan, M. Egerstedt, G. Notomista, K. Sreenath, P. Tabuada, Control barrier functions: Theory and applications, in: Proceedings of the 18th European Control Conference, 2019, pp. 3420–3431.

18. P. Wieland, F. Allgöwer, Constructive safety using control barrier functions, IFAC Proceedings Volumes 40 (12) (2007) 462–467.

19. K. P. Wabersich, A. J. Taylor, J. J. Choi, K. Sreenath, C. J. Tomlin, A. D. Ames, M. N. Zeilinger, Data-driven safety filters: Hamilton-Jacobi reachability, control barrier functions, and predictive methods for uncertain systems, IEEE Control Systems Magazine 43 (5) (2023) 137–177.

20. K. L. Hobbs, M. L. Mote, M. C. L. Abate, S. D. Coogan, E. M. Feron, Runtime assurance for safety-critical systems: An introduction to safety filtering approaches for complex control systems, IEEE Control Systems Magazine 43 (2) (2023) 28–65.

21. K.-C. Hsu, H. Hu, J. F. Fisac, The safety filter: A unified view of safety-critical control in autonomous systems, Annual Review of Control, Robotics, and Autonomous Systems 7 (2024).

22. L. Wang, A. D. Ames, M. Egerstedt, Safety barrier certificates for collisions-free multirobot systems, IEEE Transactions on Robotics 33 (3) (2017) 661–674.

23. U. Borrmann, L. Wang, A. D. Ames, M. Egerstedt, Control barrier certificates for safe swarm behavior, IFAC-PapersOnLine 48 (27) (2015) 68–73.

24. P. Glotfelter, J. Cortés, M. Egerstedt, Nonsmooth barrier functions with applications to multi-robot systems, IEEE Control Systems Letters 1 (2) (2017) 310–315.

25. S. Farrell, C. Li, H. Yu, R. Yoshimitsu, S. Gao, H. I. Christensen, Safe human robot navigation in warehouse scenario, arXiv preprint arXiv:2503.21141 (2025).

26. Z. Chen, D. Harabor, J. Li, P. J. Stuckey, Traffic flow optimisation for lifelong multi-agent path finding, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38, 2024.

27. Y. Zhang, H. Jiang, V. Bhatt, S. Nikolaidis, J. Li, Guidance graph optimization for lifelong multi-agent path finding, in: Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI), 2024.

28. L. Cohen, T. Uras, S. Koenig, Feasibility study: Using highways for bounded-suboptimal multi-agent path finding, in: Proceedings of the International Symposium on Combinatorial Search (SoCS), 2015.

29. M.-F. Li, M. Sun, The study of highway for lifelong multi-agent path finding, arXiv preprint arXiv:2304.04217 (2023).

30. S. H. Q. Li, D. J. Calderone, B. Açıkmeşe, Congestion-aware path coordination game with Markov decision process dynamics, IEEE Control Systems Letters 7 (2023) 431–436.

31. A. C. Pigou, The Economics of Welfare, Macmillan, London, 1920.

32. M. Beckmann, C. B. McGuire, C. B. Winsten, Studies in the Economics of Transportation, Yale University Press, New Haven, CT, 1956.

33. W. S. Vickrey, Congestion theory and transport investment, The American Economic Review 59 (2) (1969) 251–260.

34. H. Hu, K. Nakamura, J. F. Fisac, SHARP: Shielding-aware robust planning for safe and efficient human-robot interaction, IEEE Robotics and Automation Letters 7 (2) (2022) 5591–5598.

35. J. Grover, C. Liu, K. Sycara, The before, during, and after of multi-robot deadlock, The International Journal of Robotics Research 42 (6) (2023) 317–336.

36. I. Kaddoura, B. Kickhöfer, Optimal road pricing: Towards an agent-based marginal social cost approach, VSP Working Paper 14-01, Technische Universität Berlin, Transport Systems Planning and Transport Telematics (2014).

37. I. Kaddoura, Marginal congestion cost pricing in a multi-agent simulation: Investigation of the greater Berlin area, Journal of Transport Economics and Policy 49 (4) (2015) 560–578.

38. J. L. Horowitz, The stability of stochastic equilibrium in a two-link transportation network, Transportation Research Part B: Methodological 18 (1) (1984) 13–28.

39. D. Watling, Stability of the stochastic equilibrium assignment problem: A dynamical systems approach, Transportation Research Part B: Methodological 33 (4) (1999) 281–312.

40. G. E. Cantarella, E. Cascetta, Dynamic processes and equilibrium in transportation networks: Towards a unifying theory, Transportation Science 29 (4) (1995) 305–329.

41. S. Prajna, A. Jadbabaie, Safety verification of hybrid systems using barrier certificates, in: Hybrid Systems: Computation and Control (HSCC 2004), Vol. 2993 of Lecture Notes in Computer Science, Springer, 2004, pp. 477–492.

42. F. Blanchini, Set invariance in control, Automatica 35 (11) (1999) 1747–1767.

43. E. D. Sontag, A ‘universal’ construction of Artstein’s theorem on nonlinear stabilization, Systems & Control Letters 13 (2) (1989) 117–123.

44. R. A. Freeman, P. V. Kokotović, Robust Nonlinear Control Design: State-Space and Lyapunov Techniques, Birkhäuser, Boston, 1996.

45. X. Xu, P. Tabuada, J. W. Grizzle, A. D. Ames, Robustness of control barrier functions for safety critical control, IFAC-PapersOnLine 48 (27) (2015) 54–61.

46. M. Jankovic, Robust control barrier functions for constrained stabilization of nonlinear systems, Automatica 96 (2018) 359–367.

47. S. Kolathaya, A. D. Ames, Input-to-state safety with control barrier functions, IEEE Control Systems Letters 3 (1) (2019) 108–113.

48. Q. Nguyen, K. Sreenath, Exponential control barrier functions for enforcing high relative-degree safety-critical constraints, in: Proceedings of the American Control Conference, 2016, pp. 322–328.

49. W. Xiao, C. Belta, High-order control barrier functions, IEEE Transactions on Automatic Control 67 (7) (2022) 3655–3662.

50. A. J. Taylor, A. D. Ames, Adaptive safety with control barrier functions, in: Proceedings of the American Control Conference, 2020, pp. 1399–1405.

51. A. Agrawal, K. Sreenath, Discrete control barrier functions for safety-critical control of discrete systems with application to bipedal robot navigation, in: Robotics: Science and Systems XIII, 2017.

52. J. Zeng, B. Zhang, K. Sreenath, Safety-critical model predictive control with discrete-time control barrier function, in: Proceedings of the American Control Conference, 2021, pp. 3882–3889.

53. L. Lindemann, D. V. Dimarogonas, Control barrier functions for signal temporal logic tasks, IEEE Control Systems Letters 3 (1) (2019) 96–101.

54. Y. Chen, M. Jankovic, M. Santillo, A. D. Ames, Backup control barrier functions: Formulation and comparative study, in: Proceedings of the 60th IEEE Conference on Decision and Control, 2021.

55. B. Morris, M. J. Powell, A. D. Ames, Sufficient conditions for the Lipschitz continuity of QP-based multi-objective control of humanoid robots, in: Proceedings of the 52nd IEEE Conference on Decision and Control, 2013.

56. R. Cheng, G. Orosz, R. M. Murray, J. W. Burdick, End-to-end safe reinforcement learning through barrier functions for safety-critical continuous control tasks, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33, 2019, pp. 3387–3395.

57. C. Dawson, S. Gao, C. Fan, Safe control with learned certificates: A survey of neural Lyapunov, barrier, and contraction methods for robotics and control, IEEE Transactions on Robotics 39 (3) (2023) 1749–1767.

58. D. Pickem, P. Glotfelter, L. Wang, M. Mote, A. Ames, E. Feron, M. Egerstedt, The Robotarium: A remotely accessible swarm robotics research testbed, in: Proceedings of the IEEE International Conference on Robotics and Automation, 2017, pp. 1699–1706.

59. Y. Chen, A. Singletary, A. D. Ames, Guaranteed obstacle avoidance for multi-robot operations with limited actuation: A control barrier function approach, IEEE Control Systems Letters 5 (1) (2021) 127–132.

60. G. Notomista, M. Egerstedt, Constraint-driven coordinated control of multi-robot systems, in: Proceedings of the American Control Conference, 2019, pp. 1990–1996.

61. W. Luo, W. Sun, A. Kapoor, Multi-robot collision avoidance under uncertainty with probabilistic safety barrier certificates, in: Advances in Neural Information Processing Systems 33 (NeurIPS 2020), 2020.

62. Z. Qin, K. Zhang, Y. Chen, J. Chen, C. Fan, Learning safe multi-agent control with decentralized neural barrier certificates, in: International Conference on Learning Representations (ICLR), 2021.

63. V. Zinage, A. Jha, R. Chandra, E. Bakolas, Decentralized safe and scalable multi-agent control under limited actuation, arXiv preprint arXiv:2409.09573 (2024).

64. J. Autenrieb, M. Spiller, Auction-based responsibility allocation for scalable decentralized safety filters in cooperative multi-agent collision avoidance, arXiv preprint arXiv:2510.21546 (2025).

65. J. Autenrieb, M. Spiller, H.-S. Shin, N. Cho, Combinatorial safety-critical coordination of multi-agent systems via mixed-integer responsibility allocation and control barrier functions, arXiv preprint arXiv:2603.05762 (2026).

66. C. K. Sah, J. Keshavan, Exact feasibility certification and optimal responsibility allocation for multi-robot CBF safety filters, arXiv preprint arXiv:2609.14935 (2026).

67. M. F. Reis, A. P. Aguiar, P. Tabuada, Control barrier function-based quadratic programs introduce undesirable asymptotically stable equilibria, IEEE Control Systems Letters 5 (2) (2021) 731–736.

68. J. S. Grover, C. Liu, K. Sycara, Deadlock analysis and resolution for multi-robot systems, in: Algorithmic Foundations of Robotics XIV (WAFR 2020), Springer Proceedings in Advanced Robotics, Springer, 2021.

69. M. Müller, Multi-agent reinforcement learning for deadlock handling among autonomous mobile robots, Doctoral dissertation, arXiv preprint arXiv:2511.07071 (2025).

70. O. Khatib, Real-time obstacle avoidance for manipulators and mobile robots, The International Journal of Robotics Research 5 (1) (1986) 90–98.

71. D. Fox, W. Burgard, S. Thrun, The dynamic window approach to collision avoidance, IEEE Robotics & Automation Magazine 4 (1) (1997) 23–33.

72. P. Fiorini, Z. Shiller, Motion planning in dynamic environments using velocity obstacles, The International Journal of Robotics Research 17 (7) (1998) 760–772.

73. J. van den Berg, M. Lin, D. Manocha, Reciprocal velocity obstacles for real-time multi-agent navigation, in: Proceedings of the IEEE International Conference on Robotics and Automation, 2008, pp. 1928–1935.

74. J. van den Berg, S. J. Guy, M. Lin, D. Manocha, Reciprocal n-body collision avoidance, in: Robotics Research, Vol. 70 of Springer Tracts in Advanced Robotics, Springer, 2011, pp. 3–19.

75. D. Zhou, Z. Wang, S. Bandyopadhyay, M. Schwager, Fast, on-line collision avoidance for dynamic vehicles using buffered Voronoi cells, IEEE Robotics and Automation Letters 2 (2) (2017) 1047–1054.

76. D. Helbing, P. Molnár, Social force model for pedestrian dynamics, Physical Review E 51 (5) (1995) 4282–4286.

77. R. Olfati-Saber, Near-identity diffeomorphisms and exponential ϵ-tracking and ϵ-stabilization of first-order nonholonomic SE(2) vehicles, in: Proceedings of the American Control Conference, 2002.

78. T. Lamballais, D. Roy, M. B. M. De Koster, Estimating performance in a robotic mobile fulfillment system, European Journal of Operational Research 256 (3) (2017) 976–990.

79. D. Roy, S. Nigam, R. De Koster, I. Adan, J. Resing, Robot-storage zone assignment strategies in mobile fulfillment systems, Transportation Research Part E: Logistics and Transportation Review 122 (2019) 119–142.

80. M. Merschformann, T. Lamballais, M. B. M. De Koster, L. Suhl, Decision rules for robotic mobile fulfillment systems, Operations Research Perspectives 6 (2019) 100128.

81. M. Merschformann, L. Xie, D. Erdmann, Multi-agent path finding with kinematic constraints for robotic mobile fulfillment systems, arXiv preprint arXiv:1706.09347 (2017).

82. R. Keith, H. M. La, Review of autonomous mobile robots for the warehouse environment, arXiv preprint arXiv:2406.08333 (2024).

83. R. Stern, N. R. Sturtevant, A. Felner, S. Koenig, H. Ma, T. T. Walker, J. Li, D. Atzmon, L. Cohen, T. K. S. Kumar, R. Barták, E. Boyarski, Multi-agent pathfinding: Definitions, variants, and benchmarks, in: Proceedings of the International Symposium on Combinatorial Search (SoCS), 2019, pp. 151–158.

84. G. Sharon, R. Stern, A. Felner, N. R. Sturtevant, Conflict-based search for optimal multi-agent pathfinding, Artificial Intelligence 219 (2015) 40–66.

85. H. Ma, D. Harabor, P. J. Stuckey, J. Li, S. Koenig, Searching with consistent prioritization for multi-agent path finding, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33, 2019.

86. K. Okumura, M. Machida, X. Défago, Y. Tamura, Priority inheritance with backtracking for iterative multi-agent path finding, Artificial Intelligence 310 (2022) 103752.

87. J. Li, Z. Chen, D. Harabor, P. J. Stuckey, S. Koenig, MAPF-LNS2: Fast repairing for multi-agent path finding via large neighborhood search, in: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36, 2022.

88. S. Varambally, J. Li, S. Koenig, Which MAPF model works best for automated warehousing?, in: Proceedings of the International Symposium on Combinatorial Search (SoCS), 2022.

89. International Organization for Standardization, ISO 3691-4:2023 industrial trucks — safety requirements and verification — part 4: Driverless industrial trucks and their systems, ISO, Geneva (2023).

90. J. G. Wardrop, Some theoretical aspects of road traffic research, Proceedings of the Institution of Civil Engineers 1 (3) (1952) 325–362.

91. C. Fisk, Some developments in equilibrium traffic assignment, Transportation Research Part B: Methodological 14 (3) (1980) 243–255.

92. Y. Sheffi, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall, Englewood Cliffs, NJ, 1985.

93. T. Roughgarden, É. Tardos, How bad is selfish routing?, Journal of the ACM 49 (2) (2002) 236–259.

94. M. J. Smith, The stability of a dynamic model of traffic assignment—an application of a method of Lyapunov, Transportation Science 18 (3) (1984) 245–252.

95. W. H. Sandholm, Population Games and Evolutionary Dynamics, MIT Press, Cambridge, MA, 2010.

96. S. Fischer, B. Vöcking, Adaptive routing with stale information, in: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), 2005.

97. H. X. Liu, X. He, B. He, Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem, Networks and Spatial Economics 9 (4) (2009) 485–503.

98. F. P. Kelly, A. K. Maulloo, D. K. H. Tan, Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of the Operational Research Society 49 (3) (1998) 237–252.

99. S. H. Low, D. E. Lapsley, Optimization flow control—I: Basic algorithm and convergence, IEEE/ACM Transactions on Networking 7 (6) (1999) 861–874.

100. R. Srikant, The Mathematics of Internet Congestion Control, Birkhäuser, Boston, 2004.

101. B. D. Greenshields, A study of traffic capacity, Highway Research Board Proceedings 14 (1935) 448–477.

102. M. J. Lighthill, G. B. Whitham, On kinematic waves II. A theory of traffic flow on long crowded roads, Proceedings of the Royal Society of London. Series A 229 (1178) (1955) 317–345.

103. C. F. Daganzo, The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory, Transportation Research Part B: Methodological 28 (4) (1994) 269–287.

104. S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, 2004.

105. A. V. Fiacco, Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Academic Press, New York, 1983.

106. S. M. Robinson, Strongly regular generalized equations, Mathematics of Operations Research 5 (1) (1980) 43–62.

107. J. D. C. Little, A proof for the queuing formula: L=λW, Operations Research 9 (3) (1961) 383–387.

108. D. P. Heyman, S. Stidham, The relation between customer and time averages in queues, Operations Research 28 (4) (1980) 983–994.

109. R. A. Horn, C. R. Johnson, Matrix Analysis, 2nd Edition, Cambridge University Press, Cambridge, 2013.

110. H. K. Khalil, Nonlinear Systems, 3rd Edition, Prentice Hall, Upper Saddle River, NJ, 2002.

111. E. N. Brown, R. Barbieri, V. Ventura, R. E. Kass, L. M. Frank, The time-rescaling theorem and its application to neural spike train data analysis, Neural Computation 14 (2) (2002) 325–346.

112. A. Meurer, C. P. Smith, M. Paprocki, et al., SymPy: Symbolic computing in Python, PeerJ Computer Science 3 (2017) e103.

113. D. A. Belsley, E. Kuh, R. E. Welsch, Regression Diagnostics: Identifying Influential Data and Sources of Collinearity, Wiley, New York, 1980.

114. A. E. Hoerl, R. W. Kennard, Ridge regression: Biased estimation for nonorthogonal problems, Technometrics 12 (1) (1970) 55–67.

Downloads

Published

2026-11-12

Similar Articles

21-25 of 25

You may also start an advanced similarity search for this article.