A sub-optimal sampling based method for path planning
This is an incremental improvement for robotics and autonomous vehicle navigation, focusing on efficient path planning with reduced computation time.
The paper tackles path planning for non-holonomic systems by proposing a sampling-based search algorithm that uses a bicycle model and cost function to find sub-optimal paths, with simulation results demonstrating its success in various scenarios.
In this paper a search algorithm is proposed to find a sub optimal path for a non-holonomic system. For this purpose the algorithm starts sampling the front part of the vehicle and moves towards the destination with a cost function. The bicycle model is used to define the non-holonomic system and a stability analysis with different integration methods is performed on the dynamics of the system. A proper integration method is chosen with a reasonably large step size in order to decrease the computation time. When the tree is close enough to destination the algorithm returns the path and in order to connect the tree to destination point an optimal control problem using single shooting method is defined. To test the algorithm different scenarios are tested and the simulation results show the success of the algorithm.