Second-order cone programming (SOCP) techniques for coordinating large-scale robot teams in polygonal environments
DOI10.1007/978-3-540-74356-9_6zbMATH Open1194.93143OpenAlexW173627390MaRDI QIDQ3564110FDOQ3564110
Authors: 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
Recommendations
- Model Predictive Path-Space Iteration for Multi-Robot Coordination
- scientific article; zbMATH DE number 1882044
- Nonpositive Curvature and Pareto Optimal Coordination of Robots
- Scalable distributed algorithms for multi-robot near-optimal motion planning
- Coordination and control of a team of mobile robots
complexitysecond-order cone programming (SOCP)convex and non-convex polygonal environmentscoordinating large-scale robot teams
Decentralized systems (93A14) Large-scale systems (93A15) Automated systems (robots, etc.) in control theory (93C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Constrained model predictive control: Stability and optimality
- Applications of second-order cone programming
- Title not available (Why is that?)
- Unconstrained receding-horizon control of nonlinear systems
- Introduction to global optimization.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient motion planning strategies for large-scale sensor networks
Cited In (1)
Uses Software
This page was built for publication: Second-order cone programming (SOCP) techniques for coordinating large-scale robot teams in polygonal environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564110)