DocumentCode
2488124
Title
Shortest path planning with dominance relation
Author
Jun, Sungtaeg ; Shin, Kang G.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fYear
1990
fDate
13-18 May 1990
Firstpage
138
Abstract
A method of partitioning a workspace using rectilinear visibility in 3-D or higher space is presented. Unlike the case of 2-D space, where the space of a partition is a rectangle, the shape of a partition in 3-D or higher space is arbitrary. In spite of the arbitrary shape of partitioned regions, it is proved that there exist dominance relations between regions. This relation is then utilized to solve efficiently the shortest path planning problem in 3-D or higher space
Keywords
graph theory; mobile robots; optimisation; planning (artificial intelligence); 2D space; 3D space; dominance relation; graph theory; mobile robots; rectilinear visibility; shortest path planning; Application software; Costs; Laboratories; Manipulators; Mobile robots; Path planning; Remotely operated vehicles; Routing; Shape; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 1990. Proceedings., 1990 IEEE International Conference on
Conference_Location
Cincinnati, OH
Print_ISBN
0-8186-9061-5
Type
conf
DOI
10.1109/ROBOT.1990.125961
Filename
125961
Link To Document