Tianqi Qie , Weida Wang , Chao Yang , Ying Li , Wenjie Liu , Changle Xiang
{"title":"基于TF-RRT *方法的自主飞行器越野环境路径规划算法","authors":"Tianqi Qie , Weida Wang , Chao Yang , Ying Li , Wenjie Liu , Changle Xiang","doi":"10.1016/j.geits.2022.100026","DOIUrl":null,"url":null,"abstract":"<div><p>Autonomous flying vehicles (AFVs) are promising future vehicles, which have high obstacle avoidance ability. To plan a feasible path in a wide range of cross-country environments for the AFV, a triggered forward optimal rapidly-exploring random tree (TF-RRT∗) method is proposed. Firstly, an improved sampling and tree growth mechanism is built. Sampling and tree growth are allowed only in the forward region close to the target point, which significantly improves the planning speed; Secondly, the driving modes (ground-driving mode or air-driving mode) of the AFV are added to the sampling process as a planned state for uniform planning the driving path and driving mode; Thirdly, according to the dynamics and energy consumption models of the AFV, comprehensive indicators with energy consumption and efficiency are established for path optimal procedures, so as to select driving mode and plan driving path reasonably according to the demand. The proposed method is verified by simulations with an actual cross-country environment. Results show that the computation time is decreased by 71.08% compared with Informed-RRT∗ algorithm, and the path length of the proposed method decreased by 13.01% compared with RRT∗-Connect algorithm.</p></div>","PeriodicalId":100596,"journal":{"name":"Green Energy and Intelligent Transportation","volume":"1 3","pages":"Article 100026"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2773153722000263/pdfft?md5=bafd94ec369cf0e5ea1b52826c162ec7&pid=1-s2.0-S2773153722000263-main.pdf","citationCount":"6","resultStr":"{\"title\":\"A path planning algorithm for autonomous flying vehicles in cross-country environments with a novel TF-RRT∗ method\",\"authors\":\"Tianqi Qie , Weida Wang , Chao Yang , Ying Li , Wenjie Liu , Changle Xiang\",\"doi\":\"10.1016/j.geits.2022.100026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Autonomous flying vehicles (AFVs) are promising future vehicles, which have high obstacle avoidance ability. To plan a feasible path in a wide range of cross-country environments for the AFV, a triggered forward optimal rapidly-exploring random tree (TF-RRT∗) method is proposed. Firstly, an improved sampling and tree growth mechanism is built. Sampling and tree growth are allowed only in the forward region close to the target point, which significantly improves the planning speed; Secondly, the driving modes (ground-driving mode or air-driving mode) of the AFV are added to the sampling process as a planned state for uniform planning the driving path and driving mode; Thirdly, according to the dynamics and energy consumption models of the AFV, comprehensive indicators with energy consumption and efficiency are established for path optimal procedures, so as to select driving mode and plan driving path reasonably according to the demand. The proposed method is verified by simulations with an actual cross-country environment. Results show that the computation time is decreased by 71.08% compared with Informed-RRT∗ algorithm, and the path length of the proposed method decreased by 13.01% compared with RRT∗-Connect algorithm.</p></div>\",\"PeriodicalId\":100596,\"journal\":{\"name\":\"Green Energy and Intelligent Transportation\",\"volume\":\"1 3\",\"pages\":\"Article 100026\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2773153722000263/pdfft?md5=bafd94ec369cf0e5ea1b52826c162ec7&pid=1-s2.0-S2773153722000263-main.pdf\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Green Energy and Intelligent Transportation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2773153722000263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Green Energy and Intelligent Transportation","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2773153722000263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A path planning algorithm for autonomous flying vehicles in cross-country environments with a novel TF-RRT∗ method
Autonomous flying vehicles (AFVs) are promising future vehicles, which have high obstacle avoidance ability. To plan a feasible path in a wide range of cross-country environments for the AFV, a triggered forward optimal rapidly-exploring random tree (TF-RRT∗) method is proposed. Firstly, an improved sampling and tree growth mechanism is built. Sampling and tree growth are allowed only in the forward region close to the target point, which significantly improves the planning speed; Secondly, the driving modes (ground-driving mode or air-driving mode) of the AFV are added to the sampling process as a planned state for uniform planning the driving path and driving mode; Thirdly, according to the dynamics and energy consumption models of the AFV, comprehensive indicators with energy consumption and efficiency are established for path optimal procedures, so as to select driving mode and plan driving path reasonably according to the demand. The proposed method is verified by simulations with an actual cross-country environment. Results show that the computation time is decreased by 71.08% compared with Informed-RRT∗ algorithm, and the path length of the proposed method decreased by 13.01% compared with RRT∗-Connect algorithm.