Title :
Disjoint path algorithms for planar reconfiguration of identical vehicles
Author_Institution :
Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada
Abstract :
This paper is proposed for an approach in the reconfiguration problem using a matching algorithm for vehicles moving on planar rectilinear and diagonal grid graphs. These graphs are useful when considering vehicles with non-zero width. We also obtain algorithms with the running time based on a suitable weighted bipartite matching algorithm.
Keywords :
computational complexity; graph theory; linear programming; path planning; pattern matching; vehicles; Euclidean distance; NP complete problem; diagonal grid graphs; disjoint path algorithms; identical vehicles; linear programming; matching algorithm; nonzero width; planar reconfiguration problem; planar rectilinear graphs; Bipartite graph; Costs; Joining processes; Law; Legal factors; NP-complete problem; Remotely operated vehicles; Routing; Tin; Vectors;
Conference_Titel :
American Control Conference, 2003. Proceedings of the 2003
Print_ISBN :
0-7803-7896-2
DOI :
10.1109/ACC.2003.1243400
