Second-Order Cone Programming (SOCP) Techniques for Coordinating Large-Scale Robot Teams in Polygonal Environments

DOI10.1007/978-3-540-74356-9_6zbMath1194.93143OpenAlexW173627390MaRDI QIDQ3564110

Jason Derenick, John Spletzer

Publication date: 2 June 2010

Published in: Advances in Cooperative Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74356-9_6

zbMATH Keywords

complexitysecond-order cone programming (SOCP)convex and non-convex polygonal environmentscoordinating large-scale robot teams

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14) Large-scale systems (93A15)

Uses Software

• Mosek

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Applications of second-order cone programming
• Constrained model predictive control: Stability and optimality
• Efficient Motion Planning Strategies for Large-Scale Sensor Networks
• Unconstrained receding-horizon control of nonlinear systems
• Introduction to global optimization.

This page was built for publication: Second-Order Cone Programming (SOCP) Techniques for Coordinating Large-Scale Robot Teams in Polygonal Environments