An Effective Simulated Annealing for Off-Line Robot Motion Planning

The path planning problem using mobile robots has been a key issue on robotics since a couple of decades. Algorithms for robot motion planing should be fast, effective and adaptive to face the complexity of changing environments. In this work we propose an effective simulated annealing approach to find paths in different scenarios. Our approach allow us to find short and smooth paths in a variety of problems with different features and resolutions.