DeepAI AI Chat
Log In Sign Up

Path Planning with Kinematic Constraints for Robot Groups

by   Wolfgang Hönig, et al.
University of Southern California

Path planning for multiple robots is well studied in the AI and robotics communities. For a given discretized environment, robots need to find collision-free paths to a set of specified goal locations. Robots can be fully anonymous, non-anonymous, or organized in groups. Although powerful solvers for this abstract problem exist, they make simplifying assumptions by ignoring kinematic constraints, making it difficult to use the resulting plans on actual robots. In this paper, we present a solution which takes kinematic constraints, such as maximum velocities, into account, while guaranteeing a user-specified minimum safety distance between robots. We demonstrate our approach in simulation and on real robots in 2D and 3D environments.


Prioritized SIPP for Multi-Agent Path Finding With Kinematic Constraints

Multi-Agent Path Finding (MAPF) is a long-standing problem in Robotics a...

Multi-Robot Coordinated Planning in Confined Environments under Kinematic Constraints

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

Safe Path Planning for Polynomial Shape Obstacles via Control Barrier Functions and Logistic Regression

Safe path planning is critical for bipedal robots to operate in safety-c...

Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems

The authors present an overview of a hierarchical framework for coordina...

Pose Imitation Constraints for Collaborative Robots

Achieving human-like motion in robots has been a fundamental goal in man...

Autonomous Parking by Successive Convexification and Compound State Triggers

In this paper, we propose an algorithm for optimal generation of nonholo...