Time optimal trajectory planning for mobile robots by differential evolution algorithm and neural networks
Serkan Aydın, Hakan Temeltaş
- Year
- 2004
- Citations
- 8
Abstract
A method is presented and tested for planning time optimal trajectories for a mobile robot with constraints by using an evolutionary technique with neural-networks components. The method establishes shortest time trajectories redefined to form a multi-constrained non-linear global optimization problem. The trajectory components such as the turning translational speeds of the mobile robot (i.e. the parameter vector of the problem) are found by using differential evolution algorithm (DE) to obtain the time optimally. DE is a floating-point genetic algorithm. Artificial neural networks learn kinematics structure and upper bound of the velocities on the trajectory. Experiments are successfully implemented on Nomad 2000 mobile robot.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002