Safe Cooperative Robot Dynamics on Graphs
Reprinted from SIAM Journal on Control and Optimization , Volume 40, Issue 5, February 6 2002, pages 1556–1575.
Publisher URL: http://dx.doi.org/10.1137/S0363012900368442
NOTE: At the time of publication, the author, Daniel Koditschek, was affiliated with the University of Michigan. Currently, he is a faculty member of the School of Engineering at the University of Pennsylvania.
This paper introduces the use of vector fields to design, optimize, and implement reactive schedules for safe cooperative robot patterns on planar graphs. We consider automated guided vehicles (AGVs) operating upon a predefined network of pathways. In contrast to the case of locally Euclidean configuration spaces, regularization of collisions is no longer a local procedure, and issues concerning the global topology of configuration spaces must be addressed. The focus of the present inquiry is the definition, design, and algorithmic construction of controllers for achievement of safe, efficient, cooperative patterns in the simplest nontrivial example (a pair of robots on a Y-network) by means of a hierarchical event-driven state feedback law.
Robert W. Ghrist and Daniel E. Koditschek. "Safe Cooperative Robot Dynamics on Graphs" Departmental Papers (ESE) (2002).
Available at: http://works.bepress.com/daniel_koditschek/115