By Topic

Shortest path planning in discretized workspaces using dominance relation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun, S. ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Shin, K.G.

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

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:7 ,  Issue: 3 )