Reconfiguration of Identical Vehicles in 3D

Proceedings of the IEEE Conference on Decision and Control

Volumn 2, Issue , 2003, Pages 1538-1543

  Broucke, M E ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; GRAPH THEORY; LINEAR PROGRAMMING; MATRIX ALGEBRA;

COMMON COORDINATE SYSTEMS; IDENTICAL VEHICLES;

REMOTELY OPERATED VEHICLES;

EID: 1542358878     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. R Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
2. M. Branicky. Nonlinear and hybrid control via RRT's. Proc, of Mathematical Theory of Networks and Systems (MTNS '02) May 2002.
3. M. Broucke. Disjoint path algorithms for planar reconfiguration of identical vehicles. Proc. of the American Control Conference(ACC '03), June 2003.
4. J. Desai, J. Ostrowski, and V. Kumar. Modeling and control of formations of nonholonomic mobile robots. IEEE Transactions on Robotics and Automation, 17(6):905-908, 2001.
5. S. Even and R. Tarjan. Network flow and testing graph connectivity. SIAM Journal on Computing, 4, 1975, pp. 507-518.
6. J. Fax and R. Murray. Graph Laplacians and stabilization of vehicle formations. Proc. of the 15th IFAC World Congress, July 2002.
7. M. Garey and D. Johnson. Computers and Intractibility. W.H. Freeman Co. 1979.
8. J. Goodman and J. O'Rourke, eds. Handbook of Discrete and Computational Geometry. CRC Press, 1997.
9. A. Jadbabaie, J. Lin, and A.S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. Proc. of the IEEE Conference on Decision and Control (CDC '02), December 2002.
10. K. Kant and S. Zucker. Toward efficient trajectory planning: the path-velocity decomposition. International Journal of Robotics Research. vol. 5, no. 3, 1986.
11. R. M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U.V. Vazirani, and V.V. Vazirani. Global wire routing in two-dimensional arrays. Algorithmica, vol. 2, pp. 113-129, 1987.
12. M.R. Kramer and J. van Leeuwen. The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits. VLSI Theory. F.P. Preparata, ed. JAI Press, Advances in Computing Research, vol. 2, pp.129-146, 1984.
13. H.W. Kuhn. The Hungarian method for the assignment problem. Naval Res. Logist. Quart., 2, pp. 83-97, 1955.
14. N. Leonard and E. Fiorelli. Virtual leaders, artificial potentials and coordinated control of groups. Proc. of the IEEE Conference on Decision and Control (CDC '01), 2001.
15. J.F. Lynch. The equivalence of theorem-proving and the interconnection problem. ACM SIGDA Newsletter, 5, pp. 31-65, 1975.
16. M. Mesbahi and F.Y Hadegh, Formation flying of multiple spacecraft via graphs, matrix inequalities, and switching. AIAA Journal of Guidance, Control, and Dynamics, vol. 24, no. 2, pp. 369-377, March 2000.
17. R. Olfati-Saber and R. Murray. Graph rigidity and distributed formation stabilization of multi-vehicle systems. Proc. of the IEEE Conference on Decision and Control (CDC '02), December 2002.
18. R. Olfati-Saber and R. Murray. Distributed cooperative control of multiple vehicle formations using structural potential functions. Proc. of the 15th IFAC World Congress, July 2002.
19. J.W. Suurballe. Disjoint paths in a network. Networks, no. 4, pp. 125-145, 1974.
20. P. Vaidya. Geometry helps in matching. Siam Journal on Computing, vol. 18, no. 6, pp. 1201-1225, December 1989.