DocumentCode
1403628
Title
Shortest path planning in discretized workspaces using dominance relation
Author
Jun, Sungtaeg ; Shin, Kang G.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
Volume
7
Issue
3
fYear
1991
fDate
6/1/1991 12:00:00 AM
Firstpage
342
Lastpage
350
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 shape of a partition is a rectangle, the shape of a partition in 3-D or higher space is arbitrary. The existence of dominance relations between the partitioned regions is proven. This relation is then utilized to efficiently solve the shortest path planning problem in 3-D or higher space
Keywords
computational geometry; optimisation; production control; 3D space; computational geometry; dominance relation; optimisation; shortest path planning; workspace partitioning; Application software; Computer networks; Costs; Manipulators; Mobile robots; Path planning; Remotely operated vehicles; Routing; Shape; Very large scale integration;
fLanguage
English
Journal_Title
Robotics and Automation, IEEE Transactions on
Publisher
ieee
ISSN
1042-296X
Type
jour
DOI
10.1109/70.88143
Filename
88143
Link To Document