A motion planning framework with connectivity management for multiple cooperative robots

7Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a decentralized motion planning algorithm for multiple cooperative robots subject to constraints imposed by sensors and the communication network. It consists of decentralized receding horizon planners that reside on each vehicle to navigate to individual target positions. A routing algorithm which modify the network topology based on the position of the robots and the limited range of transmitters and receivers, enables to reduce the communication link failures. A comparative study between the proposed algorithm and other existing algorithms is provided in order to show the advantages especially in terms of traveling time and communication link failure. © 2013 Springer Science+Business Media Dordrecht.

Cite

CITATION STYLE

APA

Defoort, M., & Veluvolu, K. C. (2014). A motion planning framework with connectivity management for multiple cooperative robots. Journal of Intelligent and Robotic Systems: Theory and Applications, 75(2), 343–357. https://doi.org/10.1007/s10846-013-9872-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free