Coordination and geometric optimization via distributed dynamical systems
Jorge Cortes, Francesco Bullo
Abstract
This paper discusses dynamical systems for disk-covering and sphere-packing problems. We present facility location functions from geometric optimization and characterize their differentiable properties. We design and analyze a collection of distributed control laws that are related to nonsmooth gradient systems. The resulting dynamical systems promise to be of use in coordination problems for networked robots; in this setting the distributed control laws correspond to local interactions between the robots. The technical approach relies on concepts from computational geometry, nonsmooth analysis, and the dynamical system approach to algorithms.
Create a lesson
Related papers
A Network Simplex Framework For Discrete Unbalanced Optimal Transport
Gaetano Agazzotti, Antonin Chambolle, Clément W. Royer
Warm-IP: A Path-Following ADMM Warm Start for Interior-Point Quadratic Programming
Babak Aslani, Mojtaba Tefagh, Gourav Jhanwar et al.
Adaptive Variance Reduction without Knowing Oracle Smoothness
Wei Jiang, Yibo Wang, Zechao Li
Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints
Gon Buzaglo, Guy Kornowski
Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates
El Mahdi Chayti, Alireza Mirrokni, Martin Jaggi
Estimation, Sensitivity Analysis, and Optimization of Distortion Risk Measures via Simulation
Hao Cao, Jian-Qiang Hu, Jiaqiao Hu