Dynamic assignment in distributed motion planning with limited information

Proceedings of the American Control Conference

Volumn , Issue , 2007, Pages 1173-1178

  Zavlanos, Michael M ^a   Pappas, George J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGENTS; AUTOMATION; COMPUTATIONAL METHODS; COMPUTER CONTROL SYSTEMS; COMPUTER SIMULATION; CONTROL THEORY; MILITARY DATA PROCESSING; MOTION PLANNING;

(E ,2E) THEORY; ASSIGNMENT PROBLEM (AP); DYNAMIC ASSIGNMENT; HOMOGENEOUS AGENTS; HYBRID MODEL (HM); IN CONTROL; LIMITED INFORMATION; LOCAL COORDINATION; MULTIPLE AGENTS; MUTUAL EXCLUSIONS; POLYNOMIAL COMPLEXITY; POTENTIAL FIELDS; PROPERTY (S);

STABILIZERS (AGENTS);

EID: 46449090397     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2007.4282723     Document Type: Conference Paper

References (18)

1. A. Jadbabaie, J. Lin and A. S. Morse. Coordination of Groups of Mobile Autonomous Agents using Nearest Neighbor Rules, IEEE Transactions on Automatic Control, vol. 48(6), pp. 988-1001, 2003.
2. R. Olfati-Saber and R. M. Murray. Consensus Problems in Networks of Agents with Switching Topology and Time-Delays, IEEE Transactions on Automatic Control, vol. 49, pp. 1520-1533, Sep. 2004.
3. H. Tanner, A Jadbabaie and G. Pappas. Flocking in Fixed and Switching Networks, IEEE Transactions on Automatic Control, April 2005. To Appear.
4. J. Cortes, S. Martinez and F. Bullo. Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions, IEEE Transactions on Automatic Control, vol. 51(8), pp. 1289-1298, Aug. 2006.
5. R. Sepulchre, D. Paley, N. E. Leonard. Stabilization of Planar Collective Motion: All-to-All Communication, IEEE Transactions on Automatic Control, 2006. To Appear.
6. S. Poduri and G. S. Sukhatme. Constrained Coverage for Mobile Sensor Networks, In IEEE International Conference on Robotics and Automation, pp. 165-172, New Orleans, LA, May 2004.
7. J. Lin, A. S. Morse and B. D. O. Anderson. The Multi-Agent Rendezvous Problem, Proceedings of the 42nd IEEE Conference on Decision and Control, pp. 1508-1513, Maui, Hawaii, Dec. 2003.
8. H. W. Kuhn. The Hungarian Method for the Assignment Problem, Naval Research Logistics, vol. 2, pp. 8397, 1955.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
10. H. A. Almohamad and S. O. Duffuaa. A Linear Programming Approach for the Weighted Graph Matching Problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15(5), pp. 522-525, May 1993.
11. H. Wolkowicz. Semidefinite Programming Approaches to the Quadratic Assignment Problem, Nonlinear Assignment Problems: Algorithms and Applications, Combinatorial Optimization Series, 7, 143-174, Kluwer Academic Publishers, 2000.
12. M. M. Zavlanos and G. J. Pappas. A Dynamical Systems Approach to Weighted Graph Matching, Proceedings of the 45th IEEE Conference on Decision and Control, pp. 3492-3497, San Diego, CA, Dec. 2006.
13. S. Kloder and S. Hutchinson. Path Planning for Permutation-Invariant Multlrobot Formations, IEEE Transactions on Robotics, vol. 22(4), pp. 650 - 665, Aug. 2006.
14. M. Ji, S. Azuma, and M. Egerstedt. Role-Assignment in MultiAgent Coordination, International Journal of Assistive Robotics and Mechatronics, vol. 7(1), pp. 32-40, March 2006.
15. M. M. Zavlanos and G. J. Pappas. Sensor-Based Dynamic Assignmnet in Distributed Motion Planning, IEEE International Conference on Robotics and Automation, Rome, Italy, April 2007. To Appear.
16. D. E. Koditschek and E. Rimon. 1990. Robot Navigation Functions on Manifolds with Boundary, Advances in Applied Mathematics, vol. 11, pp. 412-442, 1990.
17. J. O. Kim and P. K. Khosla. Real-time Obstacle Avoidance using Harmonic Potential Functions, IEEE Transactions on Robotics and Automation, vol. 8(3), pp. 338 - 349, Jun. 1992.
18. T. A. Henzinger. The Theory of Hybrid Automata, Proceedings of the 11th Annual Symposium on Logic in Computer Science (LICS), pp. 278-292, IEEE Computer Society Press, 1996.