DeepAI AI Chat
Log In Sign Up

Prioritized SIPP for Multi-Agent Path Finding With Kinematic Constraints

by   Zain Alabedeen Ali, et al.

Multi-Agent Path Finding (MAPF) is a long-standing problem in Robotics and Artificial Intelligence in which one needs to find a set of collision-free paths for a group of mobile agents (robots) operating in the shared workspace. Due to its importance, the problem is well-studied and multiple optimal and approximate algorithms are known. However, many of them abstract away from the kinematic constraints and assume that the agents can accelerate/decelerate instantaneously. This complicates the application of the algorithms on the real robots. In this paper, we present a method that mitigates this issue to a certain extent. The suggested solver is essentially, a prioritized planner based on the well-known Safe Interval Path Planning (SIPP) algorithm. Within SIPP we explicitly reason about the speed and the acceleration thus the constructed plans directly take kinematic constraints of agents into account. We suggest a range of heuristic functions for that setting and conduct a thorough empirical evaluation of the suggested algorithm.


page 1

page 2

page 3

page 4


Path Planning with Kinematic Constraints for Robot Groups

Path planning for multiple robots is well studied in the AI and robotics...

CL-MAPF: Multi-Agent Path Finding for Car-Like Robots with Kinematic and Spatiotemporal Constraints

Multi-Agent Path Finding has been widely studied in the past few years d...

Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery

The Multi-Agent Pickup and Delivery (MAPD) problem models applications w...

Prioritized Multi-agent Path Finding for Differential Drive Robots

Methods for centralized planning of the collision-free trajectories for ...

Multi-Robot Coordinated Planning in Confined Environments under Kinematic Constraints

We investigate the problem of multi-robot coordinated planning in enviro...

Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)

Cooperative pathfinding is a problem of finding a set of non-conflicting...

Scalable and Safe Multi-Agent Motion Planning with Nonlinear Dynamics and Bounded Disturbances

We present a scalable and effective multi-agent safe motion planner that...