Applications in environmental monitoring, surveillance and patrolling typically require a network of mobile agents to collectively gain information regarding the state of a static or dynamical process evolving over a region. However, these networks of mobile agents also introduce various challenges, including intermittent observations of the dynamical process, loss of communication links due to mobility and packet drops, and the potential for malicious or faulty behavior by some of the agents. The main contribution of this paper is the development of resilient, fully-distributed, and provably correct state estimation algorithms that simultaneously account for each of the above considerations, and in turn, offer a general framework for reasoning about state estimation problems in dynamic, failure-prone and adversarial environments. Specifically, we develop a simple switched linear observer for dealing with the issue of time-varying measurement models, and resilient filtering techniques for dealing with worst-case adversarial behavior subject to time-varying communication patterns among the agents. Here, our approach considers both communication patterns that recur in a deterministic manner, and patterns that are induced by random packet drops. For each scenario, we identify conditions on the dynamical system, the patrols, the nominal communication network topology, and the failure models that guarantee applicability of our proposed techniques. Finally, we complement our theoretical results with detailed simulations that illustrate the efficacy of our algorithms in the presence of the technical challenges described above.
Mitra, Aritra, et al. "Resilient distributed state estimation with mobile agents: overcoming Byzantine adversaries, communication losses, and intermittent measurements." Autonomous Robots, vol. 43, no. 3, Nov. 2018. https://doi.org/10.1007/s10514-018-9813-7
Mitra, Aritra, Richards, John A., Bagchi, Saurabh, & Sundaram, Shreyas (2018). Resilient distributed state estimation with mobile agents: overcoming Byzantine adversaries, communication losses, and intermittent measurements. Autonomous Robots, 43(3). https://doi.org/10.1007/s10514-018-9813-7
Mitra, Aritra, Richards, John A., Bagchi, Saurabh, et al., "Resilient distributed state estimation with mobile agents: overcoming Byzantine adversaries, communication losses, and intermittent measurements," Autonomous Robots 43, no. 3 (2018), https://doi.org/10.1007/s10514-018-9813-7
@article{osti_1485814,
author = {Mitra, Aritra and Richards, John A. and Bagchi, Saurabh and Sundaram, Shreyas},
title = {Resilient distributed state estimation with mobile agents: overcoming Byzantine adversaries, communication losses, and intermittent measurements},
annote = {Applications in environmental monitoring, surveillance and patrolling typically require a network of mobile agents to collectively gain information regarding the state of a static or dynamical process evolving over a region. However, these networks of mobile agents also introduce various challenges, including intermittent observations of the dynamical process, loss of communication links due to mobility and packet drops, and the potential for malicious or faulty behavior by some of the agents. The main contribution of this paper is the development of resilient, fully-distributed, and provably correct state estimation algorithms that simultaneously account for each of the above considerations, and in turn, offer a general framework for reasoning about state estimation problems in dynamic, failure-prone and adversarial environments. Specifically, we develop a simple switched linear observer for dealing with the issue of time-varying measurement models, and resilient filtering techniques for dealing with worst-case adversarial behavior subject to time-varying communication patterns among the agents. Here, our approach considers both communication patterns that recur in a deterministic manner, and patterns that are induced by random packet drops. For each scenario, we identify conditions on the dynamical system, the patrols, the nominal communication network topology, and the failure models that guarantee applicability of our proposed techniques. Finally, we complement our theoretical results with detailed simulations that illustrate the efficacy of our algorithms in the presence of the technical challenges described above.},
doi = {10.1007/s10514-018-9813-7},
url = {https://www.osti.gov/biblio/1485814},
journal = {Autonomous Robots},
issn = {ISSN 0929-5593},
number = {3},
volume = {43},
place = {United States},
publisher = {Springer},
year = {2018},
month = {11}}
2015 53rd Annual Allerton Conference on Communication, Control and Computing (Allerton), 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)https://doi.org/10.1109/ALLERTON.2015.7447011
2009 Joint 48th IEEE Conference on Decision and Control (CDC) and 28th Chinese Control Conference (CCC), Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conferencehttps://doi.org/10.1109/CDC.2009.5399678
2012 20th Mediterranean Conference on Control & Automation (MED 2012), 2012 20th Mediterranean Conference on Control & Automation (MED)https://doi.org/10.1109/MED.2012.6265722