Mobile Robots Path Planning Using the Overall Conflict Resolution and Time Baseline Coordination

الملخص EN

This paper aims at resolving the path planning problem in a time-varying environment based on the idea of overall conflict resolution and the algorithm of time baseline coordination.

The basic task of the introduced path planning algorithms is to fulfill the automatic generation of the shortest paths from the defined start poses to their end poses with consideration of generous constraints for multiple mobile robots.

Building on this, by using the overall conflict resolution, within the polynomial based paths, we take into account all the constraints including smoothness, motion boundary, kinematics constraints, obstacle avoidance, and safety constraints among robots together.

And time baseline coordination algorithm is proposed to process the above formulated problem.

The foremost strong point is that much time can be saved with our approach.

Numerical simulations verify the effectiveness of our approach.