Convex optimization strategies for coordinating large-scale robot formations

IEEE Transactions on Robotics

Volumn 23, Issue 6, 2007, Pages 1252-1259

  Derenick, Jason C ^a   Spletzer, John R ^a  

^a Lehigh University   (United States)

Author keywords

Ad hoc networks; Barrier method; Convex optimization; Mobile ad hoc networks; Mobile communication; Optimal shape formation; Optimization; Second order cone programming (SOCP); Shape change; Shape control

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL COMPLEXITY; MOBILE ROBOTS; MOTION PLANNING; OPTIMIZATION; REAL TIME CONTROL;

BARRIER METHOD; CONVEX OPTIMIZATION STRATEGIES; OPTIMAL SHAPE FORMATION; SECOND-ORDER CONE PROGRAMMING (SOCP); SHAPE CHANGE;

ROBOTICS;

EID: 37549071039     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2007.909833     Document Type: Article

References (29)

1. R. Bachmayer and N. E. Leonard, "Vehicle networks for gradient descent in a sampled environment," in Proc. IEEE Conf. Dec. Control, Las Vegas, NV, Dec. 2002, pp. 112-117.
2. C. Belta, V. Isler, and G. Pappas, "Discrete abstractions for robot motion planning and control in polygonal environments," IEEE Trans. Robotics, vol. 21, no. 5, pp. 864-874, Oct. 2005.
3. C. Belta and V. Kumar, "Abstraction and control for groups of robots," IEEE Trans. Robot. Automat., vol. 20, no. 5, pp. 865-875, Oct. 2004.
4. C. Belta and V. Kumar, "Optimal motion generation for groups of robots: A geometric approach," ASME J. Mech. Des., vol. 126, pp. 63-70, 2004.
5. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
6. H. Choset, K. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L. Kavraki, and S. Thrun, Principles of Robot Motion Planning. Cambdrige, MA: MIT Press, 2005.
7. J. Cortés, S. Martínez, T. Karatas, and F. Bullo, "Coverage control for mobile sensing networks," IEEE Trans. Robot. Automat., vol. 20, no. 2, pp. 243-255, Apr. 2004.
8. A. K. Das, R. Fierro, V. Kumar, J. P. Ostrowski, J. Spletzer, and C. J. Taylor, "A vision-based formation control framework," IEEE Trans. Robot. Automat., vol. 18, no. 5, pp. 813-825, Oct. 2002.
9. A. d' Aspremont and S. Boyd, Relaxations and Randomized Methods for Nonconvex QCQPs, Stanford Univ., Stanford, CA, 2003.
10. J. Derenick, C. Mansley, and J. Spletzer, "Efficient motion planning strategies for large-scale sensor networks," in Proc. 7th Int. Workshop Algorithmic Found. Robot. (WAFR 2006), New York, NY.
11. J. Derenick and J. Spletzer, "TR LU-CSE-05-029: Optimal shape changes for robot teams," Lehigh Univ., Bethlehem, PA, Tech. Rep., 2005.
12. J. Derenick and J. Spletzer, "Second-order cone programming (SOCP) techniques for coordinating large-scale robot teams in polygonal environments," Advances Coop. Control Optim., to be published.
13. E. Dijkstra, "A note on two problems in connexion with graphs," Numer. Math., vol. 1, pp. 269-272, 1959.
14. I. L. Dryden and K. V. Mardia, Statistical Shape Analysis. Hoboken, NJ: Wiley, 1998.
15. J. T. Feddema, R. D. Robinett, and R. H. Byrne, "An optimization approach to distributed controls of multiple robot vehicles," presented at the Workshop Control Coop. Intell. Miniature Robots, IEEE /RSJ IROS, Las Vegas, NV, Oct. 31, 2003.
16. N. Heo and P. K. Varshney, "Energy-efficient deployment of intelligent mobile sensor networks," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 35, no. 1, pp. 78-92, 2005.
17. A. Howard, M. J. Mataric, and G. S. Sukhatme, "An incremental self-deployment algorithm for mobile sensor networks," Auton. Robots, vol. 13, no. 2, pp. 113-126, Sep. 2002.
18. A. Jadbabaie, J. Yu, and J. Hauser, "Unconstrained receding-horizon control of nonlinear systems," IEEE Trans. Autom. Control, vol. 46, no. 5, pp. 776-783, May 2001.
19. D. Kendall, D. Barden, T. Came, and H. Le, Shape and Shape Theory. Hoboken, NJ: Wiley, 1999.
20. H. W. Kuhn, "The Hungarian method for the assignment problem," Naval Res. Logistics Quart., vol. 2, pp. 83-97, 1955.
21. S. LaValle and S. Hutchinson, "Optimal motion planning for multiple robots having independent goals," IEEE Trans. Robot. Automat., vol. 14, no. 6, pp. 912-925, Dec. 1998.
22. M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, "Applications of second-order cone programming," Linear Algebra Appl., Special Issue Linear Algebra Control, Signals Image Process., vol. 284, pp. 193-228, 1998.
23. D. Mayne, J. Rawings, C. Rao, and P. Scokaert, "Constrained model predictive control: Stability and optimality," Automatics, vol. 36, no. 6, pp. 789-814, Jun. 2000.
24. MOSEK ApS, The MOSEK Optimization Tools Version 3.2 (Revision 8) User's Manual and Reference Online. Available: http://www.mosek. com/ fileadmin/products/3/tools/doc/html/tools/tools.html
25. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes in C. Cambridge, U.K.: Cambridge Univ. Press, 1993.
26. Y. Saad, Iterative Methods for Sparse Linear Systems. Philadelphia, PA: SIAM, 2003.
27. J. Spletzer and R. Fierro, "Optimal positioning strategies for shape changes in robot teams," in Proc. IEEE Int. Conf. Robot. Automat., 2005, pp. 742-747.
28. P. B. V. Wamelen, Z. Li, and S. S. Iyengar, "A fast algorithm for the point pattern matching problem," Pattern Recog., vol. 37, no. 8, pp. 1699-1711, Aug. 2004.
29. F. Zhang, M. Goldgeier, and P. S. Krishnaprasad, "Control of small formations using shape coordinates," in Proc. IEEE Int. Conf. Robot. Automat., Taipei, Taiwan, R.O.C.S, Sep. 2003, vol. 2, pp. 2510-2515.