Continuous Control of Lagrangian Data
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.
KeywordsAdjacency Matrix Continuous Control Computer Animation Variational Data Assimilation Switching Topology
Unable to display preview. Download preview PDF.
- 2.Reynolds, C.W.: Flocks, herds, and schools: A distributed behavioral model. In: Proc. of SIGGRAPH 1987, pp. 25–34. ACM (1987)Google Scholar
- 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
- 10.Lions, J.L.: Optimal control of systems governed by PDEs. Springer, Heidelberg (1971)Google Scholar
- 11.Allain, P., Courty, N., Corpetti, T.: Graph-based optimal control of particle swarm. IEEE Trans. on Automatic Control (submitted, 2011)Google Scholar