Continuous Control of Lagrangian Data

  • Pierre Allain
  • Nicolas Courty
  • Thomas Corpetti
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 125)

Abstract

This paper addresses the challenging problem of globally controlling several (and possibly independent) moving agents that together form a whole, generally called swarm, which may display interesting properties. Applications are numerous and can be related either to robotics or computer animation. Assuming the agents are driven by their own dynamics (such act as Newtonian particles), controlling this swarm is known as the particle swarm control problem. In this paper, the theory of an original approach to solve this issue, where we rely on a centralized control rather than focusing on designing individual and simple rules for the agents, is presented. To that end, we propose a framework to control several particles with constraints either expressed on a per-particle basis, or expressed as a function of their environment. We refer to these two categories as respectively Lagrangian or Eulerian constraints.

Keywords

Adjacency Matrix Continuous Control Computer Animation Variational Data Assimilation Switching Topology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Feddema, J., Schoenwald, D.: Decentralized control of cooperative robotic vehicles: Theory and applications. IEEE Trans. on Rob. and Aut. 18, 852–864 (2002)CrossRefGoogle Scholar
  2. 2.
    Reynolds, C.W.: Flocks, herds, and schools: A distributed behavioral model. In: Proc. of SIGGRAPH 1987, pp. 25–34. ACM (1987)Google Scholar
  3. 3.
    Helbing, D., Farkas, I., Vicsek, T.: Simulating dynamical features of escape panic. Nature 407, 487–490 (2000)CrossRefGoogle Scholar
  4. 4.
    Olfati-saber, R., Murray, M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE T. on Aut. Cont. 49, 1520–1533 (2004)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Gazi, V., Fidan, B.: Coordination and control of multi-agent dynamic systems: Models and approaches. In: Swarm Robotics, pp. 71–102 (2006)Google Scholar
  6. 6.
    Martinez, S., Cortes, J., Bullo, F.: Motion coordination with distributed information. IEEE Control Systems Magazine 27, 75–88 (2007)CrossRefGoogle Scholar
  7. 7.
    Olfati-saber, R.: Flocking for multi-agent dynamic systems: Algorithms and theory. IEEE Trans. on Automatic Control 51, 401–420 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gazi, V., Passino, K.M.: Stability analysis of swarms. IEEE Trans. on Automatic Control 48, 692–697 (2003)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2005)MATHGoogle Scholar
  10. 10.
    Lions, J.L.: Optimal control of systems governed by PDEs. Springer, Heidelberg (1971)Google Scholar
  11. 11.
    Allain, P., Courty, N., Corpetti, T.: Graph-based optimal control of particle swarm. IEEE Trans. on Automatic Control (submitted, 2011)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  • Pierre Allain
    • 1
  • Nicolas Courty
    • 1
  • Thomas Corpetti
    • 2
  1. 1.VALORIA, University of Bretagne SudVannesFrance
  2. 2.CNRS, LIAMA (TIPE project)BeijingP.R. China

Personalised recommendations