Optimal Task Assignment and Path Planning using Conflict-Based Search with Precedence and Temporal Constraints (2402.08772v3)
Abstract: The Multi-Agent Path Finding (MAPF) problem entails finding collision-free paths for a set of agents, guiding them from their start to goal locations. However, MAPF does not account for several practical task-related constraints. For example, agents may need to perform actions at goal locations with specific execution times, adhering to predetermined orders and timeframes. Moreover, goal assignments may not be predefined for agents, and the optimization objective may lack an explicit definition. To incorporate task assignment, path planning, and a user-defined objective into a coherent framework, this paper examines the Task Assignment and Path Finding with Precedence and Temporal Constraints (TAPF-PTC) problem. We augment Conflict-Based Search (CBS) to simultaneously generate task assignments and collision-free paths that adhere to precedence and temporal constraints, maximizing an objective quantified by the return from a user-defined reward function in reinforcement learning (RL). Experimentally, we demonstrate that our algorithm, CBS-TA-PTC, can solve highly challenging bomb-defusing tasks with precedence and temporal constraints efficiently relative to MARL and adapted Target Assignment and Path Finding (TAPF) methods.
- The hanabi challenge: A new frontier for ai research. Artificial Intelligence 280 (2020), 103216.
- Integrated task assignment and path planning for capacitated multi-agent pickup and delivery. IEEE Robotics and Automation Letters 6, 3 (2021), 5816–5823.
- ODrM* optimal multirobot path planning in low dimensional search spaces. In 2013 IEEE International Conference on Robotics and Automation. IEEE, 3854–3859.
- Enhanced partial expansion a. Journal of Artificial Intelligence Research 50 (2014), 141–187.
- A multi-label A* algorithm for multi-agent pathfinding. In Proceedings of the International Conference on Automated Planning and Scheduling, Vol. 29. 181–185.
- HiGHS–high performance software for linear optimization.
- John A Hartigan and Manchek A Wong. 1979. Algorithm AS 136: A k-means clustering algorithm. Journal of the royal statistical society. series c (applied statistics) 28, 1 (1979), 100–108.
- Conflict-based search with optimal task assignment. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems.
- Qi Huangfu and JA Julian Hall. 2018. Parallelizing the dual revised simplex method. Mathematical Programming Computation 10, 1 (2018), 119–142.
- Harold W Kuhn. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly 2, 1-2 (1955), 83–97.
- Steven M LaValle. 2006. Planning algorithms. Cambridge university press.
- Michael L Littman. 1994. Markov games as a framework for multi-agent reinforcement learning. In Machine learning proceedings 1994. Elsevier, 157–163.
- Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments. Neural Information Processing Systems (NIPS) (2017).
- Searching with consistent prioritization for multi-agent path finding. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33. 7643–7650.
- Hang Ma and Sven Koenig. 2016. Optimal target assignment and path finding for teams of agents. arXiv preprint arXiv:1612.05693 (2016).
- Multi-agent path finding with payload transfers and the package-exchange robot-routing problem. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 30.
- Mojang Studios. 2011. Minecraft. https://www.minecraft.net/.
- Igor Mordatch and Pieter Abbeel. 2017. Emergence of Grounded Compositional Language in Multi-Agent Populations. arXiv preprint arXiv:1703.04908 (2017).
- Planning, Scheduling and Monitoring for Airport Surface Operations.. In AAAI Workshop: Planning for Hybrid Systems. 608–614.
- Keisuke Okumura and Xavier Défago. 2023. Solving simultaneous target assignment and path planning efficiently with time-independent execution. Artificial Intelligence 321 (2023), 103946.
- Monotonic value function factorisation for deep multi-agent reinforcement learning. The Journal of Machine Learning Research 21, 1 (2020), 7234–7284.
- The StarCraft Multi-Agent Challenge. CoRR abs/1902.04043 (2019).
- Primal: Pathfinding via reinforcement and imitation multi-agent learning. IEEE Robotics and Automation Letters 4, 3 (2019), 2378–2385.
- Conflict-based search for optimal multi-agent pathfinding. Artificial Intelligence 219 (2015), 40–66.
- Paul Shaw. 1998. Using constraint programming and local search methods to solve vehicle routing problems. In International conference on principles and practice of constraint programming. Springer, 417–431.
- David Silver. 2005. Cooperative pathfinding. In Proceedings of the aaai conference on artificial intelligence and interactive digital entertainment, Vol. 1. 117–122.
- Multi-agent pathfinding: Definitions, variants, and benchmarks. In Proceedings of the International Symposium on Combinatorial Search, Vol. 10. 151–158.
- Gymnasium. https://doi.org/10.5281/zenodo.8127026
- Glenn Wagner and Howie Choset. 2015. Subdimensional expansion for multirobot path planning. Artificial intelligence 219 (2015), 1–24.
- Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI magazine 29, 1 (2008), 9–9.
- The surprising effectiveness of ppo in cooperative multi-agent games. Advances in Neural Information Processing Systems 35 (2022), 24611–24624.
- Jingjin Yu and Daniela Rus. 2015. Pebble motion on graphs with rotations: Efficient feasibility tests and planning algorithms. In Algorithmic Foundations of Robotics XI: Selected Contributions of the Eleventh International Workshop on the Algorithmic Foundations of Robotics. Springer, 729–746.
- Multi-Agent Path Finding for Precedence-Constrained Goal Sequences. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems. 1464––1472.