UAV Dynamic Route Planning Algorithm Based on RRT
Aiming at the problems of slow speed, poor flight ability and insufficient dynamic adjustment ability in traditional route planning algorithms, a dynamic route planning algorithm for UAV based on improved rapidly exploring random tree(RRT) is proposed.Firstly, when the RRT method is introduced for g...
Gespeichert in:
Veröffentlicht in: | Ji suan ji ke xue 2023-01, Vol.50, p.65 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | chi |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | 65 |
container_title | Ji suan ji ke xue |
container_volume | 50 |
creator | Gu, Zilyu Liu, Yu Sun, Wenbang Yue, Guang Sun, Shangwen |
description | Aiming at the problems of slow speed, poor flight ability and insufficient dynamic adjustment ability in traditional route planning algorithms, a dynamic route planning algorithm for UAV based on improved rapidly exploring random tree(RRT) is proposed.Firstly, when the RRT method is introduced for global route planning, in order to accelerate the convergence speed of the algorithm, target heuristic information is introduced in the selection of random tree nodes to be expanded, and UAV dynamic constraints are incorporated in the generation and addition of new nodes to ensure that the generated route has realistic flight abi-lity.Secondly, considering the emergent threat, a method of dynamically expanding random tree is proposed to prune and reconstruct the original random tree, so as to avoid the threat quickly and generate a safe route.Experimental results show that compared with the traditional RRT algorithm, the improved algorithm can improve the planning speed by about 20% and reduce the number of nodes by |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2835236330</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2835236330</sourcerecordid><originalsourceid>FETCH-proquest_journals_28352363303</originalsourceid><addsrcrecordid>eNpjYeA0NDAw0jU0No_gYOAtLs5MMjAyNjMBQkNOBsNQxzAFl8q8xNzMZIWg_NKSVIWAnMS8vMy8dAXHnPT8osySjFwFp8Ti1BSF_DyFoKAQHgbWtMSc4lReKM3NoOzmGuLsoVtQlF9YmlpcEp-VX1qUB5SKN7IwNgVaZWxsYEycKgBGrTKA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2835236330</pqid></control><display><type>article</type><title>UAV Dynamic Route Planning Algorithm Based on RRT</title><source>Directory of Open Access Journals</source><creator>Gu, Zilyu ; Liu, Yu ; Sun, Wenbang ; Yue, Guang ; Sun, Shangwen</creator><creatorcontrib>Gu, Zilyu ; Liu, Yu ; Sun, Wenbang ; Yue, Guang ; Sun, Shangwen</creatorcontrib><description>Aiming at the problems of slow speed, poor flight ability and insufficient dynamic adjustment ability in traditional route planning algorithms, a dynamic route planning algorithm for UAV based on improved rapidly exploring random tree(RRT) is proposed.Firstly, when the RRT method is introduced for global route planning, in order to accelerate the convergence speed of the algorithm, target heuristic information is introduced in the selection of random tree nodes to be expanded, and UAV dynamic constraints are incorporated in the generation and addition of new nodes to ensure that the generated route has realistic flight abi-lity.Secondly, considering the emergent threat, a method of dynamically expanding random tree is proposed to prune and reconstruct the original random tree, so as to avoid the threat quickly and generate a safe route.Experimental results show that compared with the traditional RRT algorithm, the improved algorithm can improve the planning speed by about 20% and reduce the number of nodes by</description><identifier>ISSN: 1002-137X</identifier><language>chi</language><publisher>Chongqing: Guojia Kexue Jishu Bu</publisher><subject>Algorithms ; Nodes ; Route planning</subject><ispartof>Ji suan ji ke xue, 2023-01, Vol.50, p.65</ispartof><rights>Copyright Guojia Kexue Jishu Bu 2023</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780</link.rule.ids></links><search><creatorcontrib>Gu, Zilyu</creatorcontrib><creatorcontrib>Liu, Yu</creatorcontrib><creatorcontrib>Sun, Wenbang</creatorcontrib><creatorcontrib>Yue, Guang</creatorcontrib><creatorcontrib>Sun, Shangwen</creatorcontrib><title>UAV Dynamic Route Planning Algorithm Based on RRT</title><title>Ji suan ji ke xue</title><description>Aiming at the problems of slow speed, poor flight ability and insufficient dynamic adjustment ability in traditional route planning algorithms, a dynamic route planning algorithm for UAV based on improved rapidly exploring random tree(RRT) is proposed.Firstly, when the RRT method is introduced for global route planning, in order to accelerate the convergence speed of the algorithm, target heuristic information is introduced in the selection of random tree nodes to be expanded, and UAV dynamic constraints are incorporated in the generation and addition of new nodes to ensure that the generated route has realistic flight abi-lity.Secondly, considering the emergent threat, a method of dynamically expanding random tree is proposed to prune and reconstruct the original random tree, so as to avoid the threat quickly and generate a safe route.Experimental results show that compared with the traditional RRT algorithm, the improved algorithm can improve the planning speed by about 20% and reduce the number of nodes by</description><subject>Algorithms</subject><subject>Nodes</subject><subject>Route planning</subject><issn>1002-137X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNpjYeA0NDAw0jU0No_gYOAtLs5MMjAyNjMBQkNOBsNQxzAFl8q8xNzMZIWg_NKSVIWAnMS8vMy8dAXHnPT8osySjFwFp8Ti1BSF_DyFoKAQHgbWtMSc4lReKM3NoOzmGuLsoVtQlF9YmlpcEp-VX1qUB5SKN7IwNgVaZWxsYEycKgBGrTKA</recordid><startdate>20230101</startdate><enddate>20230101</enddate><creator>Gu, Zilyu</creator><creator>Liu, Yu</creator><creator>Sun, Wenbang</creator><creator>Yue, Guang</creator><creator>Sun, Shangwen</creator><general>Guojia Kexue Jishu Bu</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20230101</creationdate><title>UAV Dynamic Route Planning Algorithm Based on RRT</title><author>Gu, Zilyu ; Liu, Yu ; Sun, Wenbang ; Yue, Guang ; Sun, Shangwen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28352363303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>chi</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Nodes</topic><topic>Route planning</topic><toplevel>online_resources</toplevel><creatorcontrib>Gu, Zilyu</creatorcontrib><creatorcontrib>Liu, Yu</creatorcontrib><creatorcontrib>Sun, Wenbang</creatorcontrib><creatorcontrib>Yue, Guang</creatorcontrib><creatorcontrib>Sun, Shangwen</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Ji suan ji ke xue</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gu, Zilyu</au><au>Liu, Yu</au><au>Sun, Wenbang</au><au>Yue, Guang</au><au>Sun, Shangwen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>UAV Dynamic Route Planning Algorithm Based on RRT</atitle><jtitle>Ji suan ji ke xue</jtitle><date>2023-01-01</date><risdate>2023</risdate><volume>50</volume><spage>65</spage><pages>65-</pages><issn>1002-137X</issn><abstract>Aiming at the problems of slow speed, poor flight ability and insufficient dynamic adjustment ability in traditional route planning algorithms, a dynamic route planning algorithm for UAV based on improved rapidly exploring random tree(RRT) is proposed.Firstly, when the RRT method is introduced for global route planning, in order to accelerate the convergence speed of the algorithm, target heuristic information is introduced in the selection of random tree nodes to be expanded, and UAV dynamic constraints are incorporated in the generation and addition of new nodes to ensure that the generated route has realistic flight abi-lity.Secondly, considering the emergent threat, a method of dynamically expanding random tree is proposed to prune and reconstruct the original random tree, so as to avoid the threat quickly and generate a safe route.Experimental results show that compared with the traditional RRT algorithm, the improved algorithm can improve the planning speed by about 20% and reduce the number of nodes by</abstract><cop>Chongqing</cop><pub>Guojia Kexue Jishu Bu</pub></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1002-137X |
ispartof | Ji suan ji ke xue, 2023-01, Vol.50, p.65 |
issn | 1002-137X |
language | chi |
recordid | cdi_proquest_journals_2835236330 |
source | Directory of Open Access Journals |
subjects | Algorithms Nodes Route planning |
title | UAV Dynamic Route Planning Algorithm Based on RRT |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T21%3A53%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=UAV%20Dynamic%20Route%20Planning%20Algorithm%20Based%20on%20RRT&rft.jtitle=Ji%20suan%20ji%20ke%20xue&rft.au=Gu,%20Zilyu&rft.date=2023-01-01&rft.volume=50&rft.spage=65&rft.pages=65-&rft.issn=1002-137X&rft_id=info:doi/&rft_dat=%3Cproquest%3E2835236330%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2835236330&rft_id=info:pmid/&rfr_iscdi=true |