Search Results for author:
Found 7 papers, 1 papers with code
Convergence, Consensus and Dissensus in the Weighted-Median Opinion Dynamics
Moreover, we prove a necessary and sufficient graph-theoretic condition for the almost-sure convergence to consensus, as well as a sufficient graph-theoretic condition for almost-sure persistent dissensus.
Minimax Multi-Agent Persistent Monitoring of a Network System
For a given visiting sequence, we prove that in an optimal dwelling time allocation the peak uncertainty is the same among all the targets.
2-D Directed Formation Control Based on Bipolar Coordinates
This work proposes a novel 2-D formation control scheme for acyclic triangulated directed graphs (a class of minimally acyclic persistent graphs) based on bipolar coordinates with (almost) global convergence to the desired shape.
A Semidefinite Programming Approach to Discrete-time Infinite Horizon Persistent Monitoring
We investigate the problem of persistent monitoring, where a mobile agent has to survey multiple targets in an environment in order to estimate their internal states.
Are energy savings the only reason for the emergence of bird echelon formation?
We analyze the conditions under which the emergence of frequently observed echelon formation can be explained solely by the maximization of energy savings.
Graph Resistance and Learning from Pairwise Comparisons
The algorithm has a relative error decay that scales with the square root of the graph resistance, and provide a matching lower bound (up to log factors).
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
We establish the exact worst-case convergence rates of the proximal gradient method in this setting for any step size and for different standard performance measures: objective function accuracy, distance to optimality and residual gradient norm.
Optimization and Control
