A geometric assignment problem for robotic networks

MaRDI QIDQ5436810zbMATH OpenFDO

Authors Stephen Smith, Francesco Bullo

Publication date 17 January 2008

zbMATH Keywords

distributed algorithmcommunication between agentsgeometric target assignment problem of mobile agents and distinct target locations

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Artificial intelligence for robotics (68T40) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms
• Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
• Distributed coverage of nonconvex environments
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Geometric partitioning and robust ad-hoc network design

Cited in

(4)

• The dynamic team forming problem: throughput and delay for unbiased policies
• Constrained distributed algebraic connectivity maximization in robotic networks
• Spatio-temporal multi-robot routing
• Analyzing the multiple-target-multiple-agent scenario using optimal assignment algorithms

This page was built for publication: A geometric assignment problem for robotic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5436810)