检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Tianqi Qie Weida Wang Chao Yang Ying Li Wenjie Liu Changle Xiang
机构地区:[1]School of Mechanical Engineering,Beijing Institute of Technology,Beijing,100081,China [2]Chongqing Innovation Center,Beijing Institute of Technology,Chongqing,401120,China
出 处:《Green Energy and Intelligent Transportation》2022年第3期81-93,共13页新能源与智能载运(英文)
基 金:National Natural Science Foundation of China(Grant No.51975048,No.52102449).
摘 要: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.
关 键 词:Autonomous flying vehicles(AFVs) Path planning Rapidly-exploring random tree(RRT) Mode switch
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.18.167