Minor moves-global results: robot trajectory planning

Abstract

Two simple algorithms are used to find the global optimum in a parameter space of high dimension. Both algorithms are based on local optimization-the first one uses the gradient method, the other one modified Kohonen nets. The main topic of interest is how the qualitative features of the global optimum emerge as a consequence of iterated minor parameter adjustments. Planning the trajectory for a spray-painting robot is considered as an application example.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>