Optimal Robot Path Planning In a Collaborative Human-Robot Team with Intermittent Human Availability (2307.04674v1)
Abstract: This paper presents a solution for the problem of optimal planning for a robot in a collaborative human-robot team, where the human supervisor is intermittently available to assist the robot in completing tasks more quickly. Specifically, we address the challenge of computing the fastest path between two configurations in an environment with time constraints on how long the robot can wait for assistance. To solve this problem, we propose a novel approach that utilizes the concepts of budget and critical departure times, which enables us to obtain optimal solutions while scaling to larger problem instances than existing methods. We demonstrate the effectiveness of our approach by comparing it with several baseline algorithms on a city road network and analyzing the quality of the solutions obtained. Our work contributes to the field of robot planning by addressing the critical issue of incorporating human assistance and environmental restrictions, which has significant implications for real-world applications.
- L. Royakkers and R. van Est, “A literature review on new robotics: automation from love to war,” International journal of social robotics, vol. 7, pp. 549–570, 2015.
- M. Mintrom, S. Sumartojo, D. Kulić, L. Tian, P. Carreno-Medrano, and A. Allen, “Robots in public spaces: Implications for policy design,” Policy Design and Practice, vol. 5, no. 2, pp. 123–139, 2022.
- A. Dahiya, A. M. Aroyo, K. Dautenhahn, and S. L. Smith, “A survey of multi-agent human–robot interaction systems,” Robotics and Autonomous Systems, vol. 161, p. 104335, 2023.
- D. G. Riley and E. W. Frew, “Assessment of coordinated heterogeneous exploration of complex environments,” in IEEE Conference on Control Technology and Applications (CCTA), 2021, pp. 138–143.
- Y. Wang, Y. Yuan, Y. Ma, and G. Wang, “Time-dependent graphs: Definitions, applications, and algorithms,” Data Science and Engineering, vol. 4, pp. 352–366, 2019.
- G. Swamy, S. Reddy, S. Levine, and A. D. Dragan, “Scaled autonomy: Enabling human operators to control robot fleets,” in IEEE International Conference on Robotics and Automation (ICRA), 2020, pp. 5942–5948.
- A. Dahiya, N. Akbarzadeh, A. Mahajan, and S. L. Smith, “Scalable operator allocation for multirobot assistance: A restless bandit approach,” IEEE Transactions on Control of Network Systems, vol. 9, no. 3, pp. 1397–1408, 2022.
- C. Hickert, S. Li, and C. Wu, “Cooperation for scalable supervision of autonomy in mixed traffic,” arXiv preprint arXiv:2112.07569, 2021.
- Y. Cai, A. Dahiya, N. Wilde, and S. L. Smith, “Scheduling operator assistance for shared autonomy in multi-robot teams,” in IEEE Conference on Decision and Control (CDC), 2022, pp. 3997–4003.
- F. Fusaro, E. Lamon, E. De Momi, and A. Ajoudani, “An integrated dynamic method for allocating roles and planning tasks for mixed human-robot teams,” in IEEE International Conference on Robot & Human Interactive Communication (RO-MAN), 2021, pp. 534–539.
- S. K. K. Hari, A. Nayak, and S. Rathinam, “An approximation algorithm for a task allocation, sequencing and scheduling problem involving a human-robot team,” Robotics and Automation Letters, vol. 5, no. 2, pp. 2146–2153, 2020.
- S. Mau and J. Dolan, “Scheduling for humans in multirobot supervisory control,” in 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, 2007, pp. 1637–1643.
- P. Gupta and V. Srivastava, “Optimal fidelity selection for human-in-the-loop queues using semi-markov decision processes,” in 2019 American Control Conference (ACC), 2019, pp. 5266–5271.
- N. D. Powel and K. A. Morgansen, “Multiserver queueing for supervisory control of autonomous vehicles,” in 2012 American Control Conference (ACC). IEEE, 2012, pp. 3179–3185.
- B. C. Dean, “Algorithms for minimum-cost paths in time-dependent networks with waiting policies,” Networks: An International Journal, vol. 44, no. 1, pp. 41–46, 2004.
- L. Zhao, T. Ohshima, and H. Nagamochi, “A* algorithm for the time-dependent shortest path problem,” in WAAC08: The 11th Japan-Korea Joint Workshop on Algorithms and Computation, vol. 10, 2008.
- A. Orda and R. Rom, “Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length,” Journal of the ACM (JACM), vol. 37, no. 3, pp. 607–625, 1990.
- B. Ding, J. X. Yu, and L. Qin, “Finding time-dependent shortest paths over large graphs,” in International Conference on Extending Database Technology: Advances in Database Technology, 2008, pp. 205–216.
- M. Bentert, A.-S. Himmel, A. Nichterlein, and R. Niedermeier, “Efficient computation of optimal temporal walks under waiting-time constraints,” Applied Network Science, vol. 5, no. 1, pp. 1–26, 2020.
- E. He, N. Boland, G. Nemhauser, and M. Savelsbergh, “Time-dependent shortest path problems with penalties and limits on waiting,” INFORMS Journal on Computing, vol. 33, no. 3, pp. 997–1014, 2021.
- L. Foschini, J. Hershberger, and S. Suri, “On the complexity of time-dependent shortest paths,” in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011, pp. 327–341.
- X. Cai, T. Kloks, and C.-K. Wong, “Time-varying shortest path problems with constraints,” Networks: An International Journal, vol. 29, no. 3, pp. 141–150, 1997.
- L. R. Ford Jr and D. R. Fulkerson, “Constructing maximal dynamic flows from static flows,” Operations research, vol. 6, no. 3, pp. 419–433, 1958.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
