Detection of Dynamically Changing Leaders in Complex Swarms from Observed Dynamic Data

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we consider the problem of defending against adversarial attacks from UAV swarms performing complex maneuvers, driven by multiple, dynamically changing, leaders. We rely on short-time observations of the trajectories of the UAVs and develop a leader detection scheme based on the notion of Granger causality. We proceed with the estimation of the swarm’s coordination laws, modeled by a generalized Cucker-Smale model with non-local repulsive potential functions and dynamically changing leaders, through an appropriately defined iterative optimization algorithm. Similar problems exist in communication and computer networks, as well as social networks over the Internet. Thus, the methodology and algorithms proposed can be applied to many types of network swarms including detection of influential malevolent “sources” of attacks and “miss-information”. The proposed algorithms are robust to missing data and noise. We validate our methodology using simulation data of complex swarm movements.

Cite

CITATION STYLE

APA

Mavridis, C. N., Suriyarachchi, N., & Baras, J. S. (2020). Detection of Dynamically Changing Leaders in Complex Swarms from Observed Dynamic Data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12513 LNCS, pp. 223–240). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-64793-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free