Abstract
A kind of typical task model, namely Multi-Point Dynamic Aggregation (MPDA), is proposed in this paper for systematically studying the cooperation and coordination methodologies of multiple robots in complex tasks. MPDA refers to that multiple robots which are located in different places aggregate to their task points to complete their tasks cooperatively, and the tasks are completed when the state of each task point reaches to a value of hope. In the MPDA task, a distributed motion planning is proposed in this paper for the motion planning of multiple robots. Simulation results show that the algorithm can effectively solve the motion planning problem of multiple robots in the MPDA task. It is also demonstrated that all robots can effectively avoid collisions with obstacles in the environment and other robots, and cooperatively complete the MPDA task efficiently.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
