Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints
From MaRDI portal
Publication:274288
Recommendations
- Partitioning algorithms for multi-agent systems based on finite-time proximity metrics
- Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric
- Optimal partitioning for multi-vehicle systems using quadratic performance criteria
- Spatially-distributed coverage optimization and control with limited-range interactions
- Partitioning of relative sensing networks: a stability margin perspective
Cites work
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- Adaptive Deployment of Mobile Robotic Networks
- Convexity and optimization in \({\mathbb R^n}\)
- Coverage Optimization and Spatial Load Balancing by Robotic Sensor Networks
- Coverage control by multi-robot networks with limited-range anisotropic sensory
- Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric
- Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
- Heterogeneous locational optimisation using a generalised Voronoi partition
- Optimal partitioning for multi-vehicle systems using quadratic performance criteria
- Spatially distributed area coverage optimisation in mobile robotic networks with arbitrary convex anisotropic patterns
- Spatially-distributed coverage optimization and control with limited-range interactions
- Voronoi diagrams and Delaunay triangulations
Cited in
(3)
This page was built for publication: Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q274288)