Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
From MaRDI portal
(Redirected from Publication:5347803)
Cited in
(18)- Shadow prices in territory division
- Geometric partitioning and robust ad-hoc network design
- Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints
- Distributed event-triggered output regulation of multi-agent systems
- Decentralized spatial partitioning algorithms for multi-vehicle systems based on the minimum control effort metric
- Modelling the mobile target covering problem using flying drones
- Sectorial coverage control with load balancing in non-convex hollow environments
- Self-triggered coordination of robotic networks for optimal deployment
- Wasserstein distance and the distributionally robust TSP
- Problem of uniform deployment on a line segment for second-order agents
- Distributed nonlinear Kalman filter with communication protocol
- Decentralized spatial partitioning for multi-vehicle systems in spatiotemporal flow-field
- An exact solution approach for the mobile multi‐agent sensing problem
- Coverage control for heterogeneous mobile sensor networks on a circle
- Dividing a territory among several vehicles
- Adaptive control and signal processing literature survey (No. 27)
- Cooperative receding horizon strategies for the multivehicle routing problem
- Event-triggered distributed predictive control for asynchronous coordination of multi-agent systems
This page was built for publication: Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347803)
