Veuillez utiliser cette adresse pour citer ce document : https://di.univ-blida.dz/jspui/handle/123456789/13366
Affichage complet
Élément Dublin CoreValeurLangue
dc.contributor.authorHaik, Walid
dc.contributor.authorHamrani, Said; Dilmi, Ismail (Promoteur); Cheggaga, N.(promoteur); Choutri, K.E. (promoteur)
dc.date.accessioned2021-12-02T09:15:51Z
dc.date.available2021-12-02T09:15:51Z
dc.date.issued2021
dc.identifier.urihttp://di.univ-blida.dz:8080/jspui/handle/123456789/13366
dc.descriptionMémoire de Master.-Numéro de Thèse 051/2021fr_FR
dc.description.abstractOptimization is one of the important categories of engineering problems, concerned with the search for better solutions of maximum or minimum ways in a certain areas. Because of its complexity, the meta-heuristique algorithms are usually used and applied because these algorithms don't require prior knowledge of the search space and because they also depend on theories based on randomness. A large group of this algorithms (optimization techniques) compete to nd a better solution, the most prominent of which is particle swarm optimization (PSO), and given its good performance in many optimization problems, it is considered a modern method and is relatively close to experimenting with swarms. This thesis aims to provide a review and discussion of the application of the PSO algorithm and its projection to plan the path of drone swarms and we analyze its present situation of research and parameter selection, topology structure, Basic PSO algorithm and multi-objective optimization PSO and its simulations. Finally, current problems are analyzed and future research directions are presented.fr_FR
dc.language.isoenfr_FR
dc.publisherUniversité Blida 01fr_FR
dc.titleUAVs path planning using particle swarm optimizationfr_FR
dc.typeThesisfr_FR
Collection(s) :Mémoires de Master

Fichier(s) constituant ce document :
Fichier Description TailleFormat 
My_Master_Thesis final version.pdf1,97 MBAdobe PDFVoir/Ouvrir


Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.