An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Robot Motion Planning
Hi-index | 0.00 |
The problem of path planning is studied for the case of a robot moving in a three-dimensional known environment. An aggressive algorithm using a description of the obstacles based on neural network is proposed. The algorithm allows constructing an optimal path and the calculation speed for the proposed algorithm is comparatively fast. Simulation results show the effectiveness of the proposed algorithm.