Research

This page provides research highlights. Please see our publications page for more information and/or feel free to contact us. We enjoy discussing interesting ideas and pursuing new collaborations.


Nonlinear Opinion Dynamics with Tunable Sensitivity
Researchers: Anastasia Bizyaeva, Alessio Franci, and Naomi Ehrich Leonard
Abstract: We propose a continuous-time multi-option nonlinear generalization of classical linear weighted-average opinion dynamics. Nonlinearity is introduced by saturating opinion exchanges, and this is enough to enable a significantly greater range of opinion-forming behaviors with our model as compared to existing linear and nonlinear models. For a group of agents that communicate opinions over a network, these behaviors include multistable agreement and disagreement, tunable sensitivity to input, robustness to disturbance, flexible transition between patterns of opinions, and opinion cascades. We derive network-dependent tuning rules to robustly control the system behavior and we design state-feedback dynamics for the model parameters to make the behavior adaptive to changing external conditions.} The model provides new means for systematic study of dynamics on natural and engineered networks, from information spread and political polarization to collective decision making and dynamic task allocation.
Related Publications:
A. Bizyaeva, A. Franci, and N. E. Leonard, “Nonlinear Opinion Dynamics with Tunable Sensitivity”, in arXiv:2009.04332 [math.OC], 2021. [arXiv]
A. Bizyaeva, A. Matthews, A. Franci, and N. E. Leonard, “Patterns of nonlinear opinion formation on networks”, in 2021 American Control Conference (ACC), pp. 2739-2744, 2021. [arXiv]
A. Franci, M. Golubitsky, A. Bizyaeva, and N. E. Leonard, “A model-independent theory of consensus and dissensus decision making”, in arXiv:1909.05765v2 [math.OC]. [arXiv]
R. Gray, A. Franci, V. Srivastava, and N. E. Leonard, “Multi-agent decision-making dynamics inspired by honeybees”, in IEEE Transactions on Control of Network Systems, Vol. 5, No. 2, June 2018, pp. 793-806. [PDF] [arXiv]

Rationality and Reciprocity of Opinion Dynamics in Games
Researchers: Shinkyu Park, Anastasia Bizyaeva, Mari Kawakatsu, Alessio Franci, and Naomi Ehrich Leonard
Abstract: We examine opinion dynamics in repeated multi-agent games. In our model, each agent updates, in continuous time, its opinion about multiple available strategies, in response to payoffs associated with the game and exchanges of opinions with other agents. We show how the model provides a principled and systematic means to investigate behavior of agents that select strategies using rationality and reciprocity, both of which are key features observed in human decision making in social dilemmas. Using bifurcation analysis, we prove conditions for the multistability of equilibria in two-agent two-strategy social dilemmas. For the iterated prisoner’s dilemma, we show how, with sufficiently strong reciprocity, the model predicts bistability of mutual cooperation and mutual defection. We illustrate further how the theory predicts important aspects of rational and reciprocal decision making and the sensitivity of behavior to parameters. The results are generalizable to games with more agents and more strategies, and to additional feedback dynamics, e.g., those designed to elicit cooperation.
Related Publications:
S. Park, A. Bizyaeva, M. Kawakatsu, A. Franci, and N. E. Leonard, “Rationality and Reciprocity of Opinion Dynamics in Games”, in arXiv:2108.00966 [physics.soc-ph], 2021. [arXiv]

Influence Spread in the Heterogeneous Multiplex Linear Threshold Model
Researchers: Yaofeng Desmond Zhong, Vaibhav Srivastava, and Naomi Ehrich Leonard
Abstract: The linear threshold model (LTM) has been used to study spread on single-layer networks defined by one inter-agent sensing modality and agents homogeneous in protocol. We define and analyze the heterogeneous multiplex LTM to study spread on multi-layer networks with each layer representing a different sensing modality and agents heterogeneous in protocol. Protocols are designed to distinguish signals from different layers: an agent becomes active if a sufficient number of its neighbors in each of any a of the m layers is active. We focus on Protocol OR, when a=1, and Protocol AND, when a=m, which model agents that are most and least readily activated, respectively. We develop theory and algorithms to compute the size of the spread at steady state for any set of initially active agents and to analyze the role of distinguished sensing modalities, network structure, and heterogeneity. We show how heterogeneity manages the tension in spreading dynamics between sensitivity to inputs and robustness to disturbances.
Related Publications:
Y. D. Zhong, V. Srivastava and N. E. Leonard, “Influence Spread in the Heterogeneous Multiplex Linear Threshold Model,” in IEEE Transactions on Control of Network Systems (Early Access). [PDF]
Y. D. Zhong, V. Srivastava and N. E. Leonard, “On the linear threshold model for diffusion of innovations in multiplex social networks,” 2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017, pp. 2593-2598. [PDF]

Analysis and Control of Agreement and Disagreement Opinion Cascades
Researchers: Alessio Franci, Anastasia Bizyaeva, Shinkyu Park, and Naomi Ehrich Leonard 
Abstract: We introduce and analyze a continuous time and state-space model of opinion cascades on networks of large numbers of agents that form opinions about two or more options. By leveraging our recent results on the emergence of agreement and disagreement states, we introduce novel tools to analyze and control agreement and disagreement opinion cascades. New notions of agreement and disagreement centrality, which depend only on network structure, are shown to be key to characterizing the nonlinear behavior of agreement and disagreement opinion formation and cascades. Our results are relevant for the analysis and control of opinion cascades in real-world networks, including biological, social, and artificial networks, and for the design of opinion-forming behaviors in robotic swarms. We illustrate an application of our model to a multi-robot task-allocation problem and discuss extensions and future directions opened by our modeling framework.
Related Publications:
A. Franci, A. Bizyaeva, S. Park, and N. E. Leonard, “Analysis and control of agreement and disagreement opinion cascades”, Swarm Intelligence, Vol. 15, No. 1, 2021. [PDF]
A. Bizyaeva, T. Sorochkin, A. Franci, and N. E. Leonard, “Control of Agreement and Disagreement Cascades with Distributed Inputs”, 2021 IEEE Conference on Decision and Control (CDC), Austin, TX, USA, 2021. [arXiv]

Multi-Robot Task Allocation Games in Dynamically Changing Environments
Researchers: Shinkyu Park, Desmond Zhong, and Naomi Ehrich Leonard
Abstract: We propose a game-theoretic multi-robot task allocation framework that enables a large team of robots to optimally allocate tasks in dynamically changing environments. As our main contribution, we design a decision-making algorithm that defines how the robots select tasks to perform and how they repeatedly revise their task selections in response to changes in the environment. Our convergence analysis establishes that the algorithm enables the robots to learn and asymptotically achieve the optimal stationary task allocation. Through experiments with a multi-robot trash collection application, we assess the algorithm’s responsiveness to changing environments and resilience to failure of individual robots.
Related Publications:
S. Park, Y. D. Zhong, and N. E. Leonard, “Multi-robot task allocation games in dynamically changing environments”, in 2021International Conference on Robotics and Automation (ICRA), Xi’an, China, 2021. [PDF]

Heterogeneous Explore-Exploit Strategies on Multi-Star Networks 
Researchers: Udari Madhushani and Naomi Ehrich Leonard
Abstract: We investigate the benefits of heterogeneity in multi-agent explore-exploit decision making where the goal of the agents is to maximize cumulative group reward. To do so we study a class of distributed stochastic bandit problems in which agents communicate over a multi-star network and make sequential choices among options in the same uncertain environment. Typically, in multi-agent bandit problems, agents use homogeneous decision-making strategies. However, group performance can be improved by incorporating heterogeneity into the choices agents make, especially when the network graph is irregular, i.e., when agents have different numbers of neighbors. We design and analyze new heterogeneous explore-exploit strategies, using the multi-star as the model irregular network graph. The key idea is to enable center agents to do more exploring than they would do using the homogeneous strategy, as a means of providing more useful data to the peripheral agents. In the case all agents broadcast their reward values and choices to their neighbors with the same probability, we provide theoretical guarantees that group performance improves under the proposed heterogeneous strategies as compared to under homogeneous strategies. We use numerical simulations to illustrate our results and to validate our theoretical bounds.
Related Publications:
U. Madhushani and N. E. Leonard, “Heterogeneous Explore-Exploit Strategies on Multi-Star Networks,” in IEEE Control Systems Letters, vol. 5, no. 5, pp. 1603-1608, Nov. 2021. [arXiv][PDF]

Distributed Cooperative Decision Making in Multi-agent Multi-armed Bandits
Researchers: Peter Landgren, Vaibhav Srivastava, and Naomi Ehrich Leonard
Abstract: We study a distributed decision-making problem in which multiple agents face the same multi-armed bandit (MAB), and each agent makes sequential choices among arms to maximize its own individual reward. The agents cooperate by sharing their estimates over a fixed communication graph. We consider an unconstrained reward model in which two or more agents can choose the same arm and collect independent rewards. And we consider a constrained reward model in which agents that choose the same arm at the same time receive no reward. We design a dynamic, consensus-based, distributed estimation algorithm for cooperative estimation of mean rewards at each arm. We leverage the estimates from this algorithm to develop two distributed algorithms: coop-UCB2 and coop-UCB2-selective-learning, for the unconstrained and constrained reward models, respectively. We show that both algorithms achieve group performance close to the performance of a centralized fusion center. Further, we investigate the influence of the communication graph structure on performance. We propose a novel graph explore-exploit index that predicts the relative performance of groups in terms of the communication graph, and we propose a novel nodal explore-exploit centrality index that predicts the relative performance of agents in terms of the agent locations in the communication graph.
Related Publications:
P. Landgren, V. Srivastava, and N. E. Leonard, “Distributed cooperative decision making in multi-agent multi-armed bandits”, in Automatica, Vol. 125, 2021. Mar. 2021. [arXiv][PDF]
P. Landgren, V. Srivastava, and N. E. Leonard, “Distributed cooperative decision-making in multiarmed bandits: Frequentist and Bayesian algorithms”, in Conference on Decision and Control (CDC), Las Vegas, NV, 2016, pp. 167-172. [PDF] [PDF with correction] [arXiv]

Adaptive susceptibility and heterogeneity in contagion models on networks
Researchers: Renato Pagliara and Naomi Ehrich Leonard
Abstract: Contagious processes, such as spread of infectious diseases, social behaviors, or computer viruses, affect biological, social, and technological systems. Epidemic models for large populations and finite populations on networks have been used to understand and control both transient and steady-state behaviors. Typically it is assumed that after recovery from an infection, every agent will either return to its original susceptible state or acquire full immunity to reinfection. We study the network SIRI (Susceptible-Infected-Recovered-Infected) model, an epidemic model for the spread of contagious processes on a network of heterogeneous agents that can adapt their susceptibility to reinfection. The model generalizes existing models to accommodate realistic conditions in which agents acquire partial or compromised immunity after first exposure to an infection. We prove necessary and sufficient conditions on model parameters and network structure that distinguish four dynamic regimes: infection-free, epidemic, endemic, and bistable. For the bistable regime, which is not accounted for in traditional models, we show how there can be a rapid resurgent epidemic after what looks like convergence to an infection-free population. We use the model and its predictive capability to show how control strategies can be designed to mitigate problematic contagious behaviors.
Related Publications:
R. Pagliara, and N. E. Leonard, “Adaptive susceptibility and heterogeneity in contagion models on networks”, in IEEE Transactions on Automatic Control, vol. 66, no. 2, pp. 581-594, Feb. 2021. [arXiv][PDF]
R. Pagliara, B. Dey and N. E. Leonard, “Bistability and resurgent epidemics in reinfection models”, in IEEE Control Systems Letters, Vol. 2, No. 2, pp. 290-295, 2018. [PDF]
Y. Zhou, S. A. Levin, and N. E. Leonard, “Active control and sustained oscillations in actSIS epidemic dynamics”, in IFAC Workshop on Cyber-Physical & Human Systems (CPHS), 2020. [arXiv]

Optimal evasive strategies for multiple interacting agents with motion constraints
Researchers: William Lewis Scott and Naomi Ehrich Leonard
Abstract: We derive and analyze optimal control strategies for a system of pursuit and evasion with a single speed-limited pursuer, and multiple heterogeneous evaders with limits on speed, angular turning rate, and lateral acceleration. The goal of the pursuer is to capture a single evader in the minimum time possible, and the goal of each evader is to avoid capture if possible, or else delay capture for as long as possible. Optimal strategies are derived for the one-on-one differential game, and these form the basis of strategies for the multiple-evader system. We propose a pursuer strategy of optimal target selection which leads to capture in bounded time. For evaders, we prove how any evader not initially targeted can avoid capture. We also consider optimal strategies for agents with radius-limited sensing capabilities, proving conditions for evader capture avoidance through a local strategy of risk reduction. We show how evaders aggregate in response to a pursuer, much like animals behave in the wild.
Related Publications:
W. L. Scott and N. E. Leonard, “Minimum-time trajectories for steered agent with constraints on speed, lateral acceleration, and turning rate”, in ASME Journal of Dynamic Systems, Measurement and Control, Vol. 140, No. 7, p. 071017, July 2018. [PDF]
W. L. Scott and N. E. Leonard, “Dynamics of pursuit and evasion in a heterogeneous herd”, in 53rd IEEE Conference on Decision and Control (CDC), pp. 2920-2925, 2014. [PDF]
W. L. Scott and N. E. Leonard, “Pursuit, herding and evasion: A three-agent model of caribou predation”, in 2013 American Control Conference (ACC), pp. 2978-2983, 2013. [PDF]