Optimization of Robotic Mobile Agent Navigation

Sándor Tihamér Brassai
Petru Maior University
1 Nicolae Iorga Street, Târgu Mureş
Sapientia University
şos. Sighişoarei 1.C., Corunca/Târgu Mureş, ROMÂNIA

Barna Iantovics
Petru Maior University
1 Nicolae Iorga Street, Târgu Mureş, ROMÂNIA

Călin Enăchescu
Petru Maior University
1 Nicolae Iorga Street, Târgu Mureş, ROMÂNIA

Abstract:

The traveling salesman problem (TSP) has many applications in economy, transport logic [1] etc. It also has a wide range of applicability in the mobile robot path planning optimization [2]. The paper presents research result of solving the path planning subproblem of the navigation of an intelligent autonomous mobile robotic agent. Collecting objects by a mobile robotic agent is the final problem that is intended to be solved. For the robotic mobile agent’s path planning is used an unsupervised neural network that can find a closely optimal path between two points in the agent’s working area. We have considered a modification of the criteria function of the winner neuron selection. Simulation results are discussed at the end of the paper. The next future development is the hardware implementation of the self-organizing map with real time functioning.

Keywords:

Robotic mobile agent; neural network; unsupervised learning; computational intelligence.

>>Full text
CITE THIS PAPER AS:
Sándor Tihamér BRASSAI, Barna IANTOVICS, Călin ENĂCHESCU, Optimization of Robotic Mobile Agent Navigation, Studies in Informatics and Control, ISSN 1220-1766, vol. 21 (4), pp. 403-412, 2012. https://doi.org/10.24846/v21i4y201206