Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints

DOI10.1016/J.SYSCONLE.2016.02.005zbMath1337.93005OpenAlexW2297066870MaRDI QIDQ274288

Efstathios Bakolas

Publication date: 22 April 2016

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2016.02.005

zbMATH Keywords

Voronoi diagramsdistributed partitioning algorithmssensing constraints

Mathematics Subject Classification ID

Decentralized systems (93A14) Agent technology and artificial intelligence (68T42)

Cites Work

• Unnamed Item
• Unnamed Item
• Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric
• Spatially distributed area coverage optimisation in mobile robotic networks with arbitrary convex anisotropic patterns
• Optimal partitioning for multi-vehicle systems using quadratic performance criteria
• Voronoi Diagrams and Delaunay Triangulations
• Heterogeneous locational optimisation using a generalised Voronoi partition
• Spatially-distributed coverage optimization and control with limited-range interactions
• Coverage Optimization and Spatial Load Balancing by Robotic Sensor Networks
• Coverage control by multi-robot networks with limited-range anisotropic sensory
• Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
• Adaptive Deployment of Mobile Robotic Networks

This page was built for publication: Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints