Obstacle growing in a nonpolygonal world
Information Processing Letters
Computer arithmetic algorithms
Computer arithmetic algorithms
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An Algorithm for the Computation of Binary Logarithms
IEEE Transactions on Computers
Parallel computational geometry
Parallel computational geometry
Robot Motion Planning
Specialized Computer Architectures for Robotics and Automation
Specialized Computer Architectures for Robotics and Automation
| Hi-index | 0.00 |
One of the major drawbacks of the visibility graph-based environment modelling process is its high computational complexity, particularly when the number of obstacles is large. In this paper, a logarithmic approximation based gradient computation method has been proposed to efficiently identify the farthest front vertices. It has been shown that the half-plane methods can be employed by examining only these farthest front vertices to rapidly identify the links that are obstructed by other objects. Novel techniques have been incorporated to substantially reduce the size of the look-up table required to implement the logarithmic approximation method. VLSI efficient architecture was then developed to demonstrate the viability of incorporating the visibility graph-based approach into a high-speed environment modelling process, which is well suited to dynamic robot navigation.