Toward efficient trajectory planning: the path-velocity decomposition
International Journal of Robotics Research
Robot motion planning: a distributed representation approach
International Journal of Robotics Research
Constrained Voronoi diagram and its application to autonomous mobile robot path planning
Constrained Voronoi diagram and its application to autonomous mobile robot path planning
Dynamic Motion Planning for Mobile Robots Using Potential Field Method
Autonomous Robots
Randomized single-query motion planning in expansive spaces
Randomized single-query motion planning in expansive spaces
Planning Algorithms
Theory and implementation of path planning by negotiation for decentralized agents
Robotics and Autonomous Systems
Queues and Artificial Potential Trenches for Multirobot Formations
IEEE Transactions on Robotics
Multirobot Formations Based on the Queue-Formation Scheme With Limited Communication
IEEE Transactions on Robotics
A review of conflict detection and resolution modeling methods
IEEE Transactions on Intelligent Transportation Systems
Obstacle avoidance in a dynamic environment: a collision cone approach
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Adaptive neural network control of robot with passive last joint
ICIRA'12 Proceedings of the 5th international conference on Intelligent Robotics and Applications - Volume Part III
Trajectory Planning and Control for Airport Snow Sweeping by Autonomous Formations of Ploughs
Journal of Intelligent and Robotic Systems
Hi-index | 0.00 |
This paper investigates the coordination of multiple robots with pre-specified paths, considering motion safety and minimizing the traveling time. A聽method to estimate possible collision point along the local paths of the robots is proposed. The repulsive potential energy is computed based on the distances between the robots and the potential collision points. This repulsive potential energy is used as the cost map of the probabilistic roadmap (PRM), which is constructed in the coordination space for multiple robots taking into account both motion time cost and safety cost. We propose a search method on the PRM to obtain the Pareto-optimal coordination solution for multiple robots. Both simulation and experimental results are presented to demonstrate the effectiveness of the algorithms.