2000 character limit reached
Periodic Multi-Agent Path Planning (2301.10910v2)
Published 26 Jan 2023 in cs.MA
Abstract: Multi-agent path planning (MAPP) is the problem of planning collision-free trajectories from start to goal locations for a team of agents. This work explores a relatively unexplored setting of MAPP where streams of agents have to go through the starts and goals with high throughput. We tackle this problem by formulating a new variant of MAPP called periodic MAPP in which the timing of agent appearances is periodic. The objective with periodic MAPP is to find a periodic plan, a set of collision-free trajectories that the agent streams can use repeatedly over periods, with periods that are as small as possible. To meet this objective, we propose a solution method that is based on constraint relaxation and optimization. We show that the periodic plans once found can be used for a more practical case in which agents in a stream can appear at random times. We confirm the effectiveness of our method compared with baseline methods in terms of throughput in several scenarios that abstract autonomous intersection management tasks.
- Improving continuous-time conflict based search. In AAAI Conference on Artificial Intelligence, volume 35, 11220–11227.
- Multi-agent pathfinding with continuous time. Artificial Intelligence, 103662.
- Bhattacharya, S. 2010. Search-based path planning with homotopy class constraints. In AAAI conference on artificial intelligence, volume 24, 1230–1237.
- Path homotopy invariants and their application to optimal trajectory planning. Annals of Mathematics and Artificial Intelligence, 84(3): 139–160.
- Sample-based motion planning for soft robot manipulators under task constraints. In IEEE International Conference on Robotics and Automation, 2522–2527.
- Noninteracting constrained motion planning and control for robot manipulators. In IEEE International Conference on Robotics and Automation, 4038–4043. IEEE.
- Scalable Multiagent Driving Policies for Reducing Traffic Congestion. In International Conference on Autonomous Agents and MultiAgent Systems.
- A multiagent approach to autonomous intersection management. Journal of Artificial Intelligence Research, 31: 591–656.
- Erlang, A. K. 1909. The theory of probabilities and telephone conversations. Nyt Tidsskrift for Matematik B, 20: 33–39.
- Improving relaxation-based constrained path planning via quadratic programming. In International Conference on Intelligent Autonomous Systems, 15–26. Springer.
- Trajectory planning for quadrotor swarms. IEEE Transactions on Robotics, 34(4): 856–869.
- Simulation to Scaled City: Zero-Shot Policy Transfer for Traffic Control via Autonomous Vehicles. In ACM/IEEE International Conference on Cyber-Physical Systems, 291–300.
- Sampling-based algorithms for optimal motion planning. The International Journal of Robotics Research, 30(7): 846–894.
- Prioritized safe interval path planning for multi-agent pathfinding with continuous time on 2D roadmaps. IEEE Robotics and Automation Letters, 7(4): 10494–10501.
- Kendall, D. G. 1953. Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. The Annals of Mathematical Statistics, 338–354.
- Khatib, O. 1986. Real-time obstacle avoidance for manipulators and mobile robots. In Autonomous Robot Vehicles, 396–404. Springer.
- Path planning for permutation-invariant multirobot formations. IEEE Transactions on Robotics, 22(4): 650–665.
- Dissipating stop-and-go waves in closed and open networks via deep reinforcement learning. In International Conference on Intelligent Transportation Systems, 1475–1480.
- g 2 o: A general framework for graph optimization. In 2011 IEEE International Conference on Robotics and Automation, 3607–3613. IEEE.
- From path to trajectory deformation. Ph.D. thesis, INRIA.
- Levenberg, K. 1944. A method for the solution of certain non-linear problems in least squares. Quarterly of Applied Mathematics, 2(2): 164–168.
- Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. In AAAI Conference on Artificial Intelligence.
- Ma, H. 2021. A Competitive Analysis of Online Multi-Agent Path Finding. In International Conference on Automated Planning and Scheduling.
- Lifelong multi-agent path finding for online pickup and delivery tasks. In Conference on Autonomous Agents and MultiAgent Systems, 837–845.
- Marquardt, D. W. 1963. An algorithm for least-squares estimation of nonlinear parameters. Journal of the society for Industrial and Applied Mathematics, 11(2): 431–441.
- n𝑛nitalic_n-transitivity of certain diffeomorphism groups. Acta Mathematica Universitatis Comenianae. New Series, 63(2): 221–225.
- CTRMs: Learning to construct cooperative timed roadmaps for multi-agent path planning in continuous spaces. In International Conference on Autonomous Agents and Multiagent Systems, 972–981.
- Kinodynamic trajectory optimization and control for car-like robots. In 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 5681–5686. IEEE.
- Conflict-based search for optimal multi-agent pathfinding. Artificial Intelligence, 219: 40–66.
- Silver, D. 2005. Cooperative pathfinding. In AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, volume 1, 117–122.
- Multi-agent pathfinding: Definitions, variants, and benchmarks. In Annual Symposium on Combinatorial Search, 151–158.
- Online multi-agent pathfinding. In AAAI Conference on Artificial Intelligence, volume 33, 7732–7739.
- Extended Increasing Cost Tree Search for Non-Unit Cost Domains. In International Joint Conference on Artificial Intelligence, 534–540.
- Extended increasing cost tree search for non-unit cost domains. In International Joint Conference on Artificial Intelligence, 534–540.
- Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Magazine, 29(1): 9–9.
- Multi-agent Path Planning and Network Flow. In Frazzoli, E.; Lozano-Perez, T.; Roy, N.; and Rus, D., eds., Algorithmic Foundations of Robotics X, 157–173.