Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/74623
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKothai Manickam, Laxman-
dc.date.accessioned2018-05-22T06:48:55Z-
dc.date.available2018-05-22T06:48:55Z-
dc.date.issued2018-
dc.identifier.urihttp://hdl.handle.net/10356/74623-
dc.description.abstractIn this report, Rapidly-exploring Random Tree (RRT) and Bidirectional Rapidly-exploring Random Tree (BiRRT) were implemented for drone path planning. Our design and analysis of path planning algorithms based on RRT and BiRRT is presented. We tried to enhance the computation capability by varying the goal bias which minimizes the time to find a collision free path to the destination. Experimental results are discussed and compared. Other important issues and recommendations for future research are also discussed.en_US
dc.format.extent50 p.en_US
dc.language.isoenen_US
dc.rightsNanyang Technological University-
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systemsen_US
dc.titleDevelopment of efficient path planning algorithm for UAV navigationen_US
dc.typeFinal Year Project (FYP)en_US
dc.contributor.supervisorWang Hanen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeBachelor of Engineeringen_US
item.grantfulltextrestricted-
item.fulltextWith Fulltext-
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)
Files in This Item:
File Description SizeFormat 
FYP_Final_Report_Manickam.pdf
  Restricted Access		FYP Final Report3.37 MBAdobe PDFView/Open

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.