Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multi-Robot Task Assignment and Path Finding for Time-Sensitive Missions with Online Task Generation (2310.06153v1)

Published 9 Oct 2023 in cs.MA and cs.RO

Abstract: Executing time-sensitive multi-robot missions involves two distinct problems: Multi-Robot Task Assignment (MRTA) and Multi-Agent Path Finding (MAPF). Computing safe paths that complete every task and minimize the time to mission completion, or makespan, is a significant computational challenge even for small teams. In many missions, tasks can be generated during execution which is typically handled by either recomputing task assignments and paths from scratch, or by modifying existing plans using approximate approaches. While performing task reassignment and path finding from scratch produces theoretically optimal results, the computational load makes it too expensive for online implementation. In this work, we present Time-Sensitive Online Task Assignment and Navigation (TSOTAN), a framework which can quickly incorporate online generated tasks while guaranteeing bounded suboptimal task assignment makespans. It does this by assessing the quality of partial task reassignments and only performing a complete reoptimization when the makespan exceeds a user specified suboptimality bound. Through experiments in 2D environments we demonstrate TSOTAN's ability to produce quality solutions with computation times suitable for online implementation.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. S. Chen, T. X. Lin, S. Al-Abri, R. C. Arkin, and F. Zhang, “Hybrid susd-based task allocation for heterogeneous multi-robot teams,” in 2023 IEEE International Conference on Robotics and Automation.   IEEE, 2023, pp. 1400–1406.
  2. P. Forte, A. Mannucci, H. Andreasson, and F. Pecora, “Online task assignment and coordination in multi-robot fleets,” IEEE Robotics and Automation Letters, vol. 6, no. 3, pp. 4584–4591, 2021.
  3. R. Stern, N. Sturtevant, A. Felner, S. Koenig, H. Ma, T. Walker, J. Li, D. Atzmon, L. Cohen, T. Kumar et al., “Multi-agent pathfinding: Definitions, variants, and benchmarks,” in Proceedings of the International Symposium on Combinatorial Search, vol. 10, no. 1, 2019, pp. 151–158.
  4. W. Hönig, S. Kiesel, A. Tinka, J. Durham, and N. Ayanian, “Conflict-based search with optimal task assignment,” in Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, 2018.
  5. Z. Ren, S. Rathinam, and H. Choset, “Cbss: A new approach for multiagent combinatorial path finding,” IEEE Transactions on Robotics, 2023.
  6. H. Ma and S. Koenig, “Optimal target assignment and path finding for teams of agents,” in Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016, pp. 1144–1152.
  7. B. P. Gerkey and M. J. Matarić, “A formal analysis and taxonomy of task allocation in multi-robot systems,” The International journal of robotics research, vol. 23, no. 9, pp. 939–954, 2004.
  8. H. W. Kuhn, “The hungarian method for the assignment problem,” Naval research logistics quarterly, vol. 2, no. 1-2, pp. 83–97, 1955.
  9. I. Kara and T. Bektas, “Integer linear programming formulations of multiple salesman problems and its variations,” European Journal of Operational Research, vol. 174, no. 3, pp. 1449–1458, 2006.
  10. T. Bektas, “The multiple traveling salesman problem: an overview of formulations and solution procedures,” omega, vol. 34, no. 3, pp. 209–219, 2006.
  11. K. Sundar and S. Rathinam, “Generalized multiple depot traveling salesmen problem—polyhedral study and exact algorithm,” Computers & Operations Research, vol. 70, pp. 39–55, 2016.
  12. H. Chakraa, F. Guérin, E. Leclercq, and D. Lefebvre, “Optimization techniques for multi-robot task allocation problems: Review on the state-of-the-art,” Robotics and Autonomous Systems, p. 104492, 2023.
  13. P. Oberlin, S. Rathinam, and S. Darbha, “Today’s traveling salesman problem,” IEEE robotics & automation magazine, vol. 17, no. 4, pp. 70–77, 2010.
  14. K. Helsgaun, “General k-opt submoves for the lin–kernighan tsp heuristic,” Mathematical Programming Computation, vol. 1, pp. 119–163, 2009.
  15. M. Schneider-Fontan and M. J. Mataric, “Territorial multi-robot task division,” IEEE Transactions on Robotics and Automation, vol. 14, no. 5, pp. 815–822, 1998.
  16. B. Park, C. Kang, and J. Choi, “Cooperative multi-robot task allocation with reinforcement learning,” Applied Sciences, vol. 12, no. 1, p. 272, 2021.
  17. X. Zheng and S. Koenig, “K-swaps: Cooperative negotiation for solving task-allocation problems,” in Twenty-First International Joint Conference on Artificial Intelligence.   Citeseer, 2009.
  18. G. Sharon, R. Stern, A. Felner, and N. R. Sturtevant, “Conflict-based search for optimal multi-agent pathfinding,” Artificial Intelligence, vol. 219, pp. 40–66, 2015.
  19. M. Barer, G. Sharon, R. Stern, and A. Felner, “Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem,” in Proceedings of the International Symposium on Combinatorial Search, vol. 5, no. 1, 2014, pp. 19–27.
  20. J. Li, A. Tinka, S. Kiesel, J. W. Durham, T. S. Kumar, and S. Koenig, “Lifelong multi-agent path finding in large-scale warehouses,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 13, 2021, pp. 11 272–11 281.
  21. S. H. Arul and D. Manocha, “CGLR: Dense multi-agent navigation using voronoi cells and congestion metric-based replanning,” in IEEE International Conference on Intelligent Robots and Systems, 2022, pp. 7213–7220.
  22. W. Wu, S. Bhattacharya, and A. Prorok, “Multi-robot path deconfliction through prioritization by path prospects,” in 2020 IEEE International Conference on Robotics and Automation.   IEEE, 2020, pp. 9809–9815.
  23. G. Wagner, H. Choset, and N. Ayanian, “Subdimensional expansion and optimal task reassignment,” in Proceedings of the International Symposium on Combinatorial Search, vol. 3, no. 1, 2012, pp. 177–178.
  24. M. Turpin, K. Mohta, N. Michael, and V. Kumar, “Goal assignment and trajectory planning for large teams of interchangeable robots,” Autonomous Robots, vol. 37, no. 4, pp. 401–415, 2014.
  25. K. Okumura and X. Défago, “Solving simultaneous target assignment and path planning efficiently with time-independent execution,” Artificial Intelligence, vol. 321, p. 103946, 2023.
  26. Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,” 2023. [Online]. Available: https://www.gurobi.com

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now