Joint Path and Multi-Hop Communication Node Location Planning in Cluttered Environment

In the communication-constrained operating environment, a unmanned aerial vehicle (UAV) needs to plan a feasible path from the starting point to the endpoint while planning the node deployment location for multi-hop communication to establish an information pathway. In this study, a new algorithm wa...

Full description

Saved in:
Bibliographic Details
Published in:Journal of advanced computational intelligence and intelligent informatics 2023-07, Vol.27 (4), p.664-672
Main Authors: Li, Lihua, Peng, Zhihong, Wen, Chengxin, Shang, Peiqiao, Cui, Jinqiang
Format: Article
Language:English
Subjects:
Algorithms
Communication
Constraints
Iterative methods
Nodes
Optimization
Planning
Unmanned aerial vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the communication-constrained operating environment, a unmanned aerial vehicle (UAV) needs to plan a feasible path from the starting point to the endpoint while planning the node deployment location for multi-hop communication to establish an information pathway. In this study, a new algorithm was designed for joint path and multi-hop communication node location planning in cluttered environments based on rapidly-exploring random trees star (RRT*) algorithm. The maximum communication distance constraint between nodes was obtained based on the signal-free propagation model, whereas the communication node loss and path loss were established as joint optimization objectives. In bidirectional random tree growth, the structure of the trees was optimized according to the value of the loss function, and optimal path and node location planning were finally achieved through continuous growth and iteration. When tested in different complexity-barrier environments and compared to RRT*, Informed-RRT*, and IB-RRT* algorithms, the paths in the planning results of the new algorithm are close to those of the comparison algorithms; however, the number of nodes decreases significantly, which proves the effectiveness of the newly proposed algorithm.
ISSN:1343-0130
1883-8014
DOI:10.20965/jaciii.2023.p0664