{"title":"基于动态步长的自适应RRT无人机航路规划","authors":"Na Lin, Ya-lun Zhang","doi":"10.1109/ICSESS.2014.6933760","DOIUrl":null,"url":null,"abstract":"Executing task in the complex environment, the traditional RRT algorithm is easy to make the tree fall into local minimum area which resulted in poor efficiency. In order to solve the problem, this paper proposes an adaptive RRT algorithm based on dynamic step for path planning and uses the cubic polynomial BSpline curve fitting to smooth the plannned path. The simulation results show that the number of explore failures reduced 35186 times, consuming time reduced 963 ms, distance reduced 33 km at the 3000th iteration by using the adaptive RRT based on dynamic step comparing to the traditional RRT algorithm.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"291 1","pages":"1111-1114"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An adaptive RRT based on dynamic step for UAVs route planning\",\"authors\":\"Na Lin, Ya-lun Zhang\",\"doi\":\"10.1109/ICSESS.2014.6933760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Executing task in the complex environment, the traditional RRT algorithm is easy to make the tree fall into local minimum area which resulted in poor efficiency. In order to solve the problem, this paper proposes an adaptive RRT algorithm based on dynamic step for path planning and uses the cubic polynomial BSpline curve fitting to smooth the plannned path. The simulation results show that the number of explore failures reduced 35186 times, consuming time reduced 963 ms, distance reduced 33 km at the 3000th iteration by using the adaptive RRT based on dynamic step comparing to the traditional RRT algorithm.\",\"PeriodicalId\":6473,\"journal\":{\"name\":\"2014 IEEE 5th International Conference on Software Engineering and Service Science\",\"volume\":\"291 1\",\"pages\":\"1111-1114\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 5th International Conference on Software Engineering and Service Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2014.6933760\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 5th International Conference on Software Engineering and Service Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2014.6933760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An adaptive RRT based on dynamic step for UAVs route planning
Executing task in the complex environment, the traditional RRT algorithm is easy to make the tree fall into local minimum area which resulted in poor efficiency. In order to solve the problem, this paper proposes an adaptive RRT algorithm based on dynamic step for path planning and uses the cubic polynomial BSpline curve fitting to smooth the plannned path. The simulation results show that the number of explore failures reduced 35186 times, consuming time reduced 963 ms, distance reduced 33 km at the 3000th iteration by using the adaptive RRT based on dynamic step comparing to the traditional RRT algorithm.