Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Shortest path planning with dominance relation
By: Shin, K.G.; Jun, S.;
1990 / IEEE / 0-8186-9061-5
This item was taken from the IEEE Periodical ' Shortest path planning with dominance relation ' 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.<
Shortest Path Planning
Remotely Operated Vehicles
Very Large Scale Integration
Planning (artificial Intelligence)