In this paper we propose a new technique which uses a combination of two powerful path planning methods, in order to gain a fast path planning technique, which benefitpsilas the advantages of both methods. First a feasible path is generated by a randomized path planner, and then it is leaded to a sub-optimal path by using distance transform in a bounded area.
['Sohrab Khanmohammadi', 'Amin Mahdizadeh', 'M. T. VakilBaghnlisheh']
A new technique for optimizing and smoothing randomized paths