Universal path planning is a major issue in order to facilitate the task required for autonomous systems. Distance transform (wavefront) algorithm is a good path planner and can be used to determine a path near to optimum. We present a new algorithm for universal path planning in exact cell decomposition, using a raster scan method for generating an exact euclidean distance transform (EEDT). This algorithm also find, for every cell in the map, the point sequence to the goal (path smoothing), without post processing. These point sequences are computing by visibility verification between cells.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Exact Euclidean Distance Transform for Universal Path Planning


    Contributors:


    Publication date :

    2010-09-01


    Size :

    1809105 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    On Computing the Exact Euclidean Distance Transform on Rectangular and Hexagonal Grids

    Mehnert, A. J. / Jackway, P. T. | British Library Online Contents | 1999


    Exact medial axis with euclidean distance

    Remy, E. / Thiel, E. | British Library Online Contents | 2005


    Efficient Computation of the Euclidean Distance Transform

    Boxer, L. / Miller, R. | British Library Online Contents | 2000


    Multidimensional Alignment Using the Euclidean Distance Transform

    Kozinska, D. / Tretiak, O. J. / Nissanov, J. et al. | British Library Online Contents | 1997