Distance computing between general shape preprocessed obstacles and general segments-based robot

We present in this paper a method for distance computing in an encoded environment. The proposed method allows to find the closest point between a general polygonal shape obstacle (a robot) and some complex general shapes objects (the obstacles). Due to the discretized aspect of the model, the algorithm complexity does not depend on the obstacles number and shape. In order to have a preprocessed model, the multivalue number coding has been used. Such a distance computing can be used in mobile robotics field as a basic tool in local path planning algorithms or in more sophisticated general paths planners. All the proposed algorithms follow a general schema which makes their implementation easier in an oriented object language, using a series of class.

[1]  D. Jung,et al.  Octree-based hierarchical distance maps for collision detection , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  Ming C. Lin,et al.  A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[4]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three space , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[5]  Kamal Gupta,et al.  Octree‐based hierarchical distance maps for collision detection , 1997 .

[6]  Alain Pruski.  Multivalue coding: application to autonomous robots , 1992 .

[7]  K. Sridharan,et al.  On computing a distance measure for path planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[8]  A. Pruski.  Multivalue coding for image and solid modeling and processing , 1991 .

[9]  Alain Pruski,et al.  Dynamic modeling of an indoor environment , 1996, Proceedings of IEEE International Conference on Robotics and Automation.