We propose an efficient and simple method for finding a collision-free path and orientation for a rigid robot in a dynamic observable 3-D environment for Unmanned Aerial Vehicles (UAVs). The method uses an octree for representing every object (robot and static/dynamic obstacles) in the environment without any distinction of the movability of objects; therefore, all objects are dealt with in the same way. The path of a robot from its starting position to the given goal with arbitrary motion (i.e., translation and rotation) in a 3-D environment is efficiently searched for in successive adjoining regions (octree white cells) by using the potential field generated from each black cell of the octree. The algorithm is simple, so it can easily be accelerated by using parallelization techniques. Experimental results obtained under several conditions, such as a point shaped robot and arbitrarily shaped robots in static/dynamic environments, are reported.
|Number of pages
|Published - 1995
|Proceedings of the 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Part 3 (of 3) - Pittsburgh, PA, USA
Duration: 1995 Aug 5 → 1995 Aug 9
|Proceedings of the 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Part 3 (of 3)
|Pittsburgh, PA, USA
|95/8/5 → 95/8/9