Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning

Authors:
R. S. Tavares;T. C. Martins;M. S. G. Tsuzuki
Affiliations:
Escola Politécnica da Universidade de São Paulo, Department of Mechatronics and Mechanical Systems Engineering, Computational Geometry Laboratory, Av. Prof. Mello Moraes, 2231 São P ...;Escola Politécnica da Universidade de São Paulo, Department of Mechatronics and Mechanical Systems Engineering, Computational Geometry Laboratory, Av. Prof. Mello Moraes, 2231 São P ...;Escola Politécnica da Universidade de São Paulo, Department of Mechatronics and Mechanical Systems Engineering, Computational Geometry Laboratory, Av. Prof. Mello Moraes, 2231 São P ...
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 11
Cited 1

Generalized simulated annealing for function optimization

Technometrics
Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
An introduction to splines for use in computer graphics & geometric modeling

An introduction to splines for use in computer graphics & geometric modeling
Computational experience with generalized simulated annealing over continuous variables

American Journal of Mathematical and Management Sciences
Phase transitions and the search problem

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Continuous optimization by a variant of simulated annealing

Computational Optimization and Applications
Simulated Annealing: Searching for an Optimal Temperature Schedule

SIAM Journal on Optimization
Simulated annealing with advanced adaptive neighborhood

Second international workshop on Intelligent systems design and application
Simulated annealing applied to the irregular rotational placement of shapes over containers with fixed dimensions

Expert Systems with Applications: An International Journal
Very fast simulated re-annealing

Mathematical and Computer Modelling: An International Journal
Genetic Algorithms and Very Fast Simulated Reannealing: A comparison

Mathematical and Computer Modelling: An International Journal

Robot path planning in uncertain environment using multi-objective particle swarm optimization

Neurocomputing

Quantified Score

Hi-index	12.05

Visualization

Abstract

Simulated annealing (SA) is an optimization technique that can process cost functions with degrees of nonlinearities, discontinuities and stochasticity. It can process arbitrary boundary conditions and constraints imposed on these cost functions. The SA technique is applied to the problem of robot path planning. Three situations are considered here: the path is represented as a polyline; as a Bezier curve; and as a spline interpolated curve. In the proposed SA algorithm, the sensitivity of each continuous parameter is evaluated at each iteration increasing the number of accepted solutions. The sensitivity of each parameter is associated to its probability distribution in the definition of the next candidate.