Particle swarm optimization-based distributed control scheme for flocking robots

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

Abstract

This paper proposes a Nash equilibrium-based model predictive control (MPC) scheme incorporating a cooperative particle swarm optimization (CPSO) to deal with the control of flocking robots whose state vectors are coupled in a cost function. In conventional distributed MPC, the stability is assured by guaranteeing a bounded error between what a subsystem plans to do and what neighbors believe that the subsystem plans to do over a finite prediction horizon. This condition is referred to as compatibility constraint, and the closed-loop control performance largely depends on the responses computed at the previous time step. As an alternative of the compatibility constraint, the distributed CPSO is suggested in an MPC framework, which guarantees the stability without enforcing the compatibility constraint. A numerical simulation is performed on a group of nonholonomic mobile robots to demonstrate the effectiveness of the proposed MPC scheme incorporating CPSO. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Lee, S. M., & Myung, H. (2013). Particle swarm optimization-based distributed control scheme for flocking robots. In Advances in Intelligent Systems and Computing (Vol. 208 AISC, pp. 517–524). Springer Verlag. https://doi.org/10.1007/978-3-642-37374-9_50

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