A non-convex optimization approach to dynamic coverage problem of multi-agent systems in an environment with obstacles

DOI10.1007/S11424-020-8085-4zbMath1447.93007OpenAlexW3022909528MaRDI QIDQ2200107

Fenghua He, Changxi Li, Yu Yao, Long Wang, Longbiao Ma

Publication date: 15 September 2020

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-020-8085-4

zbMATH Keywords

non-convex optimizationmulti-agent systemsobstaclesdynamic coverageregion reconnaissance

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-agent systems (93A16)

Related Items (2)

Distributed event-triggered tracking control of heterogeneous discrete-time multi-agent systems with unknown parameters ⋮ Non-convex optimization of resource allocation in fog computing using successive approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Supervised coverage control of multi-agent systems
• Dynamic coverage control design of multi-agent systems under ellipse sensing regions
• Spatially-distributed coverage optimization and control with limited-range interactions
• Decentralized Dynamic Coverage Control for Mobile Sensor Networks in a Non-convex Environment
• Coverage control by multi-robot networks with limited-range anisotropic sensory
• Distributed Coverage Control and Data Collection With Mobile Sensor Networks
• Multi-agent coverage control design with dynamic sensing regions

This page was built for publication: A non-convex optimization approach to dynamic coverage problem of multi-agent systems in an environment with obstacles