Supervised self-organization of homogeneous swarms using ergodic projections of markov chains

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

This paper formulates a self-organization algorithm to address the problem of global behavior supervision in engineered swarms of arbitrarily large population sizes. The swarms considered in this paper are assumed to be homogeneous collections of independent identical finite-state agents, each of which is modeled by an irreducible finite Markov chain. The proposed algorithm computes the necessary perturbations in the local agents' behavior, which guarantees convergence to the desired observed state of the swarm. The ergodicity property of the swarm, which is induced as a result of the irreducibility of the agent models, implies that while the local behavior of the agents converges to the desired behavior only in the time average, the overall swarm behavior converges to the specification and stays there at all times. A simulation example illustrates the underlying concept.

Original languageEnglish
Pages (from-to)1505-1515
Number of pages11
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Volume39
Issue number6
DOIs
StatePublished - 2009

Keywords

  • Algorithm design and analysis
  • Discrete event systems
  • Eigenvalues and eigenfunctions
  • Ergodic projections
  • Finite-state irreducible Markov chains
  • Markov processes
  • Probabilistic logic
  • Swarms

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Information Systems
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Supervised self-organization of homogeneous swarms using ergodic projections of markov chains'. Together they form a unique fingerprint.

Cite this