UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm
Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajec...
Ausführliche Beschreibung
Autor*in: |
Jingcheng Zhang [verfasserIn] Yuqiang An [verfasserIn] Jianing Cao [verfasserIn] Shibo Ouyang [verfasserIn] Lei Wang [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2023 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
In: IEEE Access - IEEE, 2014, 11(2023), Seite 23189-23204 |
---|---|
Übergeordnetes Werk: |
volume:11 ; year:2023 ; pages:23189-23204 |
Links: |
---|
DOI / URN: |
10.1109/ACCESS.2023.3252018 |
---|
Katalog-ID: |
DOAJ088635368 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | DOAJ088635368 | ||
003 | DE-627 | ||
005 | 20230410114224.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230410s2023 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1109/ACCESS.2023.3252018 |2 doi | |
035 | |a (DE-627)DOAJ088635368 | ||
035 | |a (DE-599)DOAJ4b23dff07f074889891675fd2aa20d18 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
050 | 0 | |a TK1-9971 | |
100 | 0 | |a Jingcheng Zhang |e verfasserin |4 aut | |
245 | 1 | 0 | |a UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm |
264 | 1 | |c 2023 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. | ||
650 | 4 | |a RRT | |
650 | 4 | |a salp swarm algorithm | |
650 | 4 | |a path planning | |
650 | 4 | |a UAV | |
650 | 4 | |a adaptive | |
650 | 4 | |a reverse search | |
653 | 0 | |a Electrical engineering. Electronics. Nuclear engineering | |
700 | 0 | |a Yuqiang An |e verfasserin |4 aut | |
700 | 0 | |a Jianing Cao |e verfasserin |4 aut | |
700 | 0 | |a Shibo Ouyang |e verfasserin |4 aut | |
700 | 0 | |a Lei Wang |e verfasserin |4 aut | |
773 | 0 | 8 | |i In |t IEEE Access |d IEEE, 2014 |g 11(2023), Seite 23189-23204 |w (DE-627)728440385 |w (DE-600)2687964-5 |x 21693536 |7 nnns |
773 | 1 | 8 | |g volume:11 |g year:2023 |g pages:23189-23204 |
856 | 4 | 0 | |u https://doi.org/10.1109/ACCESS.2023.3252018 |z kostenfrei |
856 | 4 | 0 | |u https://doaj.org/article/4b23dff07f074889891675fd2aa20d18 |z kostenfrei |
856 | 4 | 0 | |u https://ieeexplore.ieee.org/document/10058520/ |z kostenfrei |
856 | 4 | 2 | |u https://doaj.org/toc/2169-3536 |y Journal toc |z kostenfrei |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_DOAJ | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_39 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_170 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_4012 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4249 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4306 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4367 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 11 |j 2023 |h 23189-23204 |
author_variant |
j z jz y a ya j c jc s o so l w lw |
---|---|
matchkey_str |
article:21693536:2023----::ataetrpannfropeoesoaeniomnsaeo |
hierarchy_sort_str |
2023 |
callnumber-subject-code |
TK |
publishDate |
2023 |
allfields |
10.1109/ACCESS.2023.3252018 doi (DE-627)DOAJ088635368 (DE-599)DOAJ4b23dff07f074889891675fd2aa20d18 DE-627 ger DE-627 rakwb eng TK1-9971 Jingcheng Zhang verfasserin aut UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. RRT salp swarm algorithm path planning UAV adaptive reverse search Electrical engineering. Electronics. Nuclear engineering Yuqiang An verfasserin aut Jianing Cao verfasserin aut Shibo Ouyang verfasserin aut Lei Wang verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 23189-23204 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:23189-23204 https://doi.org/10.1109/ACCESS.2023.3252018 kostenfrei https://doaj.org/article/4b23dff07f074889891675fd2aa20d18 kostenfrei https://ieeexplore.ieee.org/document/10058520/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 23189-23204 |
spelling |
10.1109/ACCESS.2023.3252018 doi (DE-627)DOAJ088635368 (DE-599)DOAJ4b23dff07f074889891675fd2aa20d18 DE-627 ger DE-627 rakwb eng TK1-9971 Jingcheng Zhang verfasserin aut UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. RRT salp swarm algorithm path planning UAV adaptive reverse search Electrical engineering. Electronics. Nuclear engineering Yuqiang An verfasserin aut Jianing Cao verfasserin aut Shibo Ouyang verfasserin aut Lei Wang verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 23189-23204 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:23189-23204 https://doi.org/10.1109/ACCESS.2023.3252018 kostenfrei https://doaj.org/article/4b23dff07f074889891675fd2aa20d18 kostenfrei https://ieeexplore.ieee.org/document/10058520/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 23189-23204 |
allfields_unstemmed |
10.1109/ACCESS.2023.3252018 doi (DE-627)DOAJ088635368 (DE-599)DOAJ4b23dff07f074889891675fd2aa20d18 DE-627 ger DE-627 rakwb eng TK1-9971 Jingcheng Zhang verfasserin aut UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. RRT salp swarm algorithm path planning UAV adaptive reverse search Electrical engineering. Electronics. Nuclear engineering Yuqiang An verfasserin aut Jianing Cao verfasserin aut Shibo Ouyang verfasserin aut Lei Wang verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 23189-23204 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:23189-23204 https://doi.org/10.1109/ACCESS.2023.3252018 kostenfrei https://doaj.org/article/4b23dff07f074889891675fd2aa20d18 kostenfrei https://ieeexplore.ieee.org/document/10058520/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 23189-23204 |
allfieldsGer |
10.1109/ACCESS.2023.3252018 doi (DE-627)DOAJ088635368 (DE-599)DOAJ4b23dff07f074889891675fd2aa20d18 DE-627 ger DE-627 rakwb eng TK1-9971 Jingcheng Zhang verfasserin aut UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. RRT salp swarm algorithm path planning UAV adaptive reverse search Electrical engineering. Electronics. Nuclear engineering Yuqiang An verfasserin aut Jianing Cao verfasserin aut Shibo Ouyang verfasserin aut Lei Wang verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 23189-23204 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:23189-23204 https://doi.org/10.1109/ACCESS.2023.3252018 kostenfrei https://doaj.org/article/4b23dff07f074889891675fd2aa20d18 kostenfrei https://ieeexplore.ieee.org/document/10058520/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 23189-23204 |
allfieldsSound |
10.1109/ACCESS.2023.3252018 doi (DE-627)DOAJ088635368 (DE-599)DOAJ4b23dff07f074889891675fd2aa20d18 DE-627 ger DE-627 rakwb eng TK1-9971 Jingcheng Zhang verfasserin aut UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. RRT salp swarm algorithm path planning UAV adaptive reverse search Electrical engineering. Electronics. Nuclear engineering Yuqiang An verfasserin aut Jianing Cao verfasserin aut Shibo Ouyang verfasserin aut Lei Wang verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 23189-23204 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:23189-23204 https://doi.org/10.1109/ACCESS.2023.3252018 kostenfrei https://doaj.org/article/4b23dff07f074889891675fd2aa20d18 kostenfrei https://ieeexplore.ieee.org/document/10058520/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 23189-23204 |
language |
English |
source |
In IEEE Access 11(2023), Seite 23189-23204 volume:11 year:2023 pages:23189-23204 |
sourceStr |
In IEEE Access 11(2023), Seite 23189-23204 volume:11 year:2023 pages:23189-23204 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
RRT salp swarm algorithm path planning UAV adaptive reverse search Electrical engineering. Electronics. Nuclear engineering |
isfreeaccess_bool |
true |
container_title |
IEEE Access |
authorswithroles_txt_mv |
Jingcheng Zhang @@aut@@ Yuqiang An @@aut@@ Jianing Cao @@aut@@ Shibo Ouyang @@aut@@ Lei Wang @@aut@@ |
publishDateDaySort_date |
2023-01-01T00:00:00Z |
hierarchy_top_id |
728440385 |
id |
DOAJ088635368 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ088635368</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230410114224.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230410s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2023.3252018</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ088635368</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ4b23dff07f074889891675fd2aa20d18</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Jingcheng Zhang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RRT</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">salp swarm algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">path planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">UAV</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">adaptive</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">reverse search</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuqiang An</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jianing Cao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shibo Ouyang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Lei Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">11(2023), Seite 23189-23204</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2023</subfield><subfield code="g">pages:23189-23204</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2023.3252018</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/4b23dff07f074889891675fd2aa20d18</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/10058520/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2023</subfield><subfield code="h">23189-23204</subfield></datafield></record></collection>
|
callnumber-first |
T - Technology |
author |
Jingcheng Zhang |
spellingShingle |
Jingcheng Zhang misc TK1-9971 misc RRT misc salp swarm algorithm misc path planning misc UAV misc adaptive misc reverse search misc Electrical engineering. Electronics. Nuclear engineering UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm |
authorStr |
Jingcheng Zhang |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)728440385 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut |
collection |
DOAJ |
remote_str |
true |
callnumber-label |
TK1-9971 |
illustrated |
Not Illustrated |
issn |
21693536 |
topic_title |
TK1-9971 UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm RRT salp swarm algorithm path planning UAV adaptive reverse search |
topic |
misc TK1-9971 misc RRT misc salp swarm algorithm misc path planning misc UAV misc adaptive misc reverse search misc Electrical engineering. Electronics. Nuclear engineering |
topic_unstemmed |
misc TK1-9971 misc RRT misc salp swarm algorithm misc path planning misc UAV misc adaptive misc reverse search misc Electrical engineering. Electronics. Nuclear engineering |
topic_browse |
misc TK1-9971 misc RRT misc salp swarm algorithm misc path planning misc UAV misc adaptive misc reverse search misc Electrical engineering. Electronics. Nuclear engineering |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
IEEE Access |
hierarchy_parent_id |
728440385 |
hierarchy_top_title |
IEEE Access |
isfreeaccess_txt |
true |
familylinks_str_mv |
(DE-627)728440385 (DE-600)2687964-5 |
title |
UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm |
ctrlnum |
(DE-627)DOAJ088635368 (DE-599)DOAJ4b23dff07f074889891675fd2aa20d18 |
title_full |
UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm |
author_sort |
Jingcheng Zhang |
journal |
IEEE Access |
journalStr |
IEEE Access |
callnumber-first-code |
T |
lang_code |
eng |
isOA_bool |
true |
recordtype |
marc |
publishDateSort |
2023 |
contenttype_str_mv |
txt |
container_start_page |
23189 |
author_browse |
Jingcheng Zhang Yuqiang An Jianing Cao Shibo Ouyang Lei Wang |
container_volume |
11 |
class |
TK1-9971 |
format_se |
Elektronische Aufsätze |
author-letter |
Jingcheng Zhang |
doi_str_mv |
10.1109/ACCESS.2023.3252018 |
author2-role |
verfasserin |
title_sort |
uav trajectory planning for complex open storage environments based on an improved rrt algorithm |
callnumber |
TK1-9971 |
title_auth |
UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm |
abstract |
Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. |
abstractGer |
Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. |
abstract_unstemmed |
Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning. |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
title_short |
UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm |
url |
https://doi.org/10.1109/ACCESS.2023.3252018 https://doaj.org/article/4b23dff07f074889891675fd2aa20d18 https://ieeexplore.ieee.org/document/10058520/ https://doaj.org/toc/2169-3536 |
remote_bool |
true |
author2 |
Yuqiang An Jianing Cao Shibo Ouyang Lei Wang |
author2Str |
Yuqiang An Jianing Cao Shibo Ouyang Lei Wang |
ppnlink |
728440385 |
callnumber-subject |
TK - Electrical and Nuclear Engineering |
mediatype_str_mv |
c |
isOA_txt |
true |
hochschulschrift_bool |
false |
doi_str |
10.1109/ACCESS.2023.3252018 |
callnumber-a |
TK1-9971 |
up_date |
2024-07-03T18:45:24.458Z |
_version_ |
1803584614655066112 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ088635368</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230410114224.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230410s2023 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2023.3252018</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ088635368</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ4b23dff07f074889891675fd2aa20d18</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Jingcheng Zhang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT Algorithm</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Multi-rotor UAVs (Unmanned Aerial Vehicles) have been increasingly used for hazardous inspection tasks in complex open-air warehouse storage environments due to their high maneuverability and aerial perspective. To facilitate rapid response to patrol missions and improve the efficiency of UAV trajectory planning. This paper established a rotary-wing UAV trajectory plan model considering UAV patrol efficiency, trajectory cost, and power consumption cost. Secondly, an improved SSA (salp swarm algorithm) is incorporated for the shortcomings of low algorithmic search efficiency and unsmooth paths when planning paths in the traditional RRT (Rapidly-exploring Random Trees). The predation mechanism of the salps group is incorporated into the random sampling of the RRT algorithm, which reduces the invalid sampling of random points and introduces the adaptive leader structure, and reverses the search strategy to improve the algorithm’s global search for superiority at the later stage of the search. Finally, the designed LASSA-RRT algorithm is subjected to simulation experiments and compared with RRT, RRT*, IRRT, and PF-RRT* in a cross-sectional manner. The results show that the LASSA-RRT algorithm has an average reduction of 55.83% in sampling times, 51.91% in run time, 13.17% in track length, and 0.1491% in flight cost. In summary, this paper’s UAV trajectory planning method can be effectively applied to complex open storage environments. It can provide a helpful reference direction for UAV trajectory planning.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RRT</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">salp swarm algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">path planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">UAV</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">adaptive</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">reverse search</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuqiang An</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jianing Cao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Shibo Ouyang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Lei Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">11(2023), Seite 23189-23204</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2023</subfield><subfield code="g">pages:23189-23204</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2023.3252018</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/4b23dff07f074889891675fd2aa20d18</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/10058520/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2023</subfield><subfield code="h">23189-23204</subfield></datafield></record></collection>
|
score |
7.3998413 |