• Aucun résultat trouvé

Non linear predictive control of a LEGO mobilerobot

N/A
N/A
Protected

Academic year: 2021

Partager "Non linear predictive control of a LEGO mobilerobot"

Copied!
1
0
0

Texte intégral

(1)

10th International Conference of Computational Methods in Sciences and Engineering, ICCMSE 2014 2014

Non linear predictive control of a LEGO mobile robot

H. Merabti, B. Bouchemal, K. Belarbi, D. Boucherma, and A. Amouri

Abstract : Metaheuristics are general purpose heuristics which have shown a great potential for the solution of difficult optimization problems. In this work, we apply the meta heuristic, namely particle swarm optimization, PSO, for the solution of the optimization problem arising in NLMPC. This algorithm is easy to code and may be considered as alternatives for the more classical solution procedures. The PSO- NLMPC is applied to control a mobile robot for the tracking trajectory and obstacles avoidance.

Experimental results show the strength of this approach.

Keywords : predictive control, non linear control, mobile robotics, metaheuristics.

Centre de Recherche en Technologies Industrielles - CRTI - www.crti.dz

Powered by TCPDF (www.tcpdf.org)

Références

Documents relatifs

During this 1906 visit, Rinpoche’s father met the 8 th Khachoed Rinpoche, Drupwang Lungtok Tenzin Palzangpo of Khachoedpalri monastery in West Sikkim, and from

On s’intéresse à l’étude de ces équations le cas où les coefficients ne vérifient pas la condition de Lipschits ; précisément dans le cas où les coefficients sont

A travers cette étude, plusieurs microstructures et courbes de dureté ont été présentées, où nous avons montré les conditions des traitements thermomécaniques qui permettent

In this work , we use and compare two multi objective metaheuristics, Multi-Objective Particle swarm Optimization, MOPSO, and Multi-Objective Gravitational

For these purpose, we consider two meta heuristics: particles swarm optimization, PSO, and gravitational search algorithm, GSA and a hybrid algorithm, PSO-GSA.. Two

This problem can easily be observed in table 5: the global minima obtained by Couenne on Michalewicz, Sine Envelope, Egg Holder and Keane’s function are not correct compared to

Our goal is, on one hand, to write down explicit first and second order optimality conditions for general 2-dimensional shape optimization problems with convexity con- straint and,

The common point to Kostant’s and Steinberg’s formulae is the function count- ing the number of decompositions of a root lattice element as a linear combination with