A Non-Convex Optimization Approach to Dynamic Coverage Problem of Multi-agent Systems in an Environment with Obstacles.
Longbiao MaFenghua HeLong WangChangxi LiYu YaoPublished in: J. Syst. Sci. Complex. (2020)
Keyphrases
- convex constraints
- convex optimization
- multi agent systems
- dynamic environments
- interior point methods
- low rank
- total variation
- mobile robot
- primal dual
- convex relaxation
- semi definite programming
- norm minimization
- convex optimization problems
- convex formulation
- learning algorithm
- multiscale
- image processing
- augmented lagrangian
- machine learning
- semidefinite program