A Valley Detection for Path Planning

This paper presents a constrained valley detection algorithm. The intent is to find valleys in the map for the path planning that enables a robot or a vehicle to move safely. The constraint to the valley is a desired width and a desired depth to ensure the space for movement when a vehicle passes through the valley. We propose an algorithm to find valleys satisfying these 2 dimensional constraints. The merit of our algorithm is that the pre-processing and the post-processing are not necessary to eliminate undesired small valleys. The algorithm is validated through simulation using digitized elevation data. Keywords—valley, width, depth, path planning.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  John M. Gauch,et al.  Multiresolution Analysis of Ridges and Valleys in Grey-Scale Images , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Robert M. Haralick,et al.  Ridges and valleys on digital images , 1983, Comput. Vis. Graph. Image Process..

[4]  Mongi A. Abidi,et al.  Ridge-valley path planning for 3D terrains , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[5]  David H. Eberly,et al.  Ridges for image analysis , 1994, Journal of Mathematical Imaging and Vision.

[6]  Joan Serrat,et al.  Evaluation of Methods for Ridge and Valley Detection , 1999, IEEE Trans. Pattern Anal. Mach. Intell..