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

Ishanu Chattopadhyay, Asok Ray

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    This paper formulates a self-organization algorithm to addresses the problem of emergent behavior supervision in engineered swarms of arbitrary population size. Based on collections of independent identical finitestate agents, the algorithm is derived to compute necessary perturbations in the local agents' behavior, which guarantees convergence to the desired observed state of the swarm. A simulation example illustrates the underlying concept.

    Original languageEnglish (US)
    Title of host publication2009 American Control Conference, ACC 2009
    Pages2922-2927
    Number of pages6
    DOIs
    StatePublished - Nov 23 2009
    Event2009 American Control Conference, ACC 2009 - St. Louis, MO, United States
    Duration: Jun 10 2009Jun 12 2009

    Other

    Other2009 American Control Conference, ACC 2009
    CountryUnited States
    CitySt. Louis, MO
    Period6/10/096/12/09

    Fingerprint

    Markov processes

    All Science Journal Classification (ASJC) codes

    • Electrical and Electronic Engineering

    Cite this

    Chattopadhyay, I., & Ray, A. (2009). Supervised self-organization of large homogeneous swarms using ergodic projections of markov chains. In 2009 American Control Conference, ACC 2009 (pp. 2922-2927). [5160372] https://doi.org/10.1109/ACC.2009.5160372
    Chattopadhyay, Ishanu ; Ray, Asok. / Supervised self-organization of large homogeneous swarms using ergodic projections of markov chains. 2009 American Control Conference, ACC 2009. 2009. pp. 2922-2927
    @inproceedings{3f3fde419a7640e9a2a0395fca3e44de,
    title = "Supervised self-organization of large homogeneous swarms using ergodic projections of markov chains",
    abstract = "This paper formulates a self-organization algorithm to addresses the problem of emergent behavior supervision in engineered swarms of arbitrary population size. Based on collections of independent identical finitestate agents, the algorithm is derived to compute necessary perturbations in the local agents' behavior, which guarantees convergence to the desired observed state of the swarm. A simulation example illustrates the underlying concept.",
    author = "Ishanu Chattopadhyay and Asok Ray",
    year = "2009",
    month = "11",
    day = "23",
    doi = "10.1109/ACC.2009.5160372",
    language = "English (US)",
    isbn = "9781424445240",
    pages = "2922--2927",
    booktitle = "2009 American Control Conference, ACC 2009",

    }

    Chattopadhyay, I & Ray, A 2009, Supervised self-organization of large homogeneous swarms using ergodic projections of markov chains. in 2009 American Control Conference, ACC 2009., 5160372, pp. 2922-2927, 2009 American Control Conference, ACC 2009, St. Louis, MO, United States, 6/10/09. https://doi.org/10.1109/ACC.2009.5160372

    Supervised self-organization of large homogeneous swarms using ergodic projections of markov chains. / Chattopadhyay, Ishanu; Ray, Asok.

    2009 American Control Conference, ACC 2009. 2009. p. 2922-2927 5160372.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

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

    AU - Chattopadhyay, Ishanu

    AU - Ray, Asok

    PY - 2009/11/23

    Y1 - 2009/11/23

    N2 - This paper formulates a self-organization algorithm to addresses the problem of emergent behavior supervision in engineered swarms of arbitrary population size. Based on collections of independent identical finitestate agents, the algorithm is derived to compute necessary perturbations in the local agents' behavior, which guarantees convergence to the desired observed state of the swarm. A simulation example illustrates the underlying concept.

    AB - This paper formulates a self-organization algorithm to addresses the problem of emergent behavior supervision in engineered swarms of arbitrary population size. Based on collections of independent identical finitestate agents, the algorithm is derived to compute necessary perturbations in the local agents' behavior, which guarantees convergence to the desired observed state of the swarm. A simulation example illustrates the underlying concept.

    UR - http://www.scopus.com/inward/record.url?scp=70449622908&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=70449622908&partnerID=8YFLogxK

    U2 - 10.1109/ACC.2009.5160372

    DO - 10.1109/ACC.2009.5160372

    M3 - Conference contribution

    AN - SCOPUS:70449622908

    SN - 9781424445240

    SP - 2922

    EP - 2927

    BT - 2009 American Control Conference, ACC 2009

    ER -