Please use this identifier to cite or link to this item: http://univ-bejaia.dz/dspace/123456789/18464
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBelaid, Amine-
dc.contributor.authorMendil, Boubekeur ; directeur de thèse-
dc.date.accessioned2022-03-14T09:30:26Z-
dc.date.available2022-03-14T09:30:26Z-
dc.date.issued2022-
dc.identifier.urihttp://hdl.handle.net/123456789/18464-
dc.descriptionOption : Automatiqueen_US
dc.description.abstractThis thesis addresses the development of trajectory planning algorithms for unmanned aerial vehicles (UAVs). It focuses on the motion planning for Quadrotor type and contributes in the both stages: the path planning and the trajectory planning. In path planning, a technique is proposed to reduce the collision checking time in cluttered environment for sampling-based path planning. The method disassociates the dependence of time complexity with number of obstacles, by performing a pre-processing that stores information about the obstacles, then using them in the collision checking queries. Also, we propose a new variant of Rapidly Exploring Random Trees Star (RRT*) named NP-RRT* to deal mainly with narrow passages in the workspace and to speed up the convergence rate to optimal solution, also, to minimize the memory consumption. In the trajectory planning, we implement the Particle Swarm Optimization (PSO) to minimize the snap and distance trajectory for Quadrotor. The minimum snap polynomial trajectories are the natural choice for Quadrotors, since the motor commands and attitude accelerations of the vehicle are proportional to the snap of the path.en_US
dc.language.isoenen_US
dc.publisherUniversité Abderrahmane Mira- Bejaiaen_US
dc.subject3D : Quadrotors : Aerial Systemsen_US
dc.title3D Trajectory planning for Autonomous Aerial Systems.en_US
dc.typeThesisen_US
Appears in Collections:Mémoires de Master

Files in This Item:
File Description SizeFormat 
3D Trajectory planning for Autonomous Aerial Systems.pdf9.02 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.