Hongguang Zhang

Prof. Dr. Hongguang Zhang

associate professor

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 October 2020 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
YZYing Zhang
Ying Zhang
TLTing Ting Liu
Ting Ting Liu
HZHongguang Zhang
Hongguang Zhang
An Yuan LiuAn Yuan Liu
An Yuan Liu
In the real applications of mobile ad hoc networks (MANETs), mobile robot swarms usually have the obvious task-oriented feature and move in groups. Focusing on the group mobility feature of mobile robot swarms in the wild application scenes that are insensitive to delay, we propose LEACH relay (LEACH-R) with cache strategy to ensure reliable communication links against base station mobility, save energy even for the frequently changing topology of mobile robots, and satisfy the larger workplace requirements. Inspired by the successive approximation approach, each node computes the relative rank of residual energy in its neighborhood. According to these relative energy levels, LEACH-R selects cluster heads to balance energy consumption. Besides, based on the predicted locations, cluster heads select cooperative relays with cache to improve packet delivery ratio. By comparing with four protocols, LEACH-R outperforms others in most cases. Due to the satisfactory performance, LEACH-R could be extended to search and rescue, battlefield communication, disaster relief, drone swarm, and so on.

23 September 2019 in IEEE Access
Verified
Journal Article
Open access
HZHongguang Zhang
Hongguang Zhang
HLHan Luo
Han Luo
ZWZan Wang
Zan Wang
YLYuhong Liu
Yuhong Liu
YLYuanan Liu
Yuanan Liu
Modeling and solving multi-robot task allocation with definite path-conflict-free handling is an important research, especially in real working environments. Some of the research lines are unable to obtain definite path-conflict-free solutions for multi-robot task allocations, such as using the penalty-term method in the fitness function to restrict the survival probabilities of the solutions with path conflicts. In some cases, these solutions are only able to satisfy the objective of minimizing task time. We formulate this problem based on grid maps, while focusing on the frequently used cooperative task allocation. In our model, two subtasks of each cooperative task must be executed by two robots, simultaneously. We propose vitality-driven genetic task allocation algorithm (VGTA), which is able to simultaneously minimize task time and realize definite conflict-free path planning. VGTA consists of local operators, such as random mutations, greedy crossovers, and vitality selection. Meanwhile, VGTA includes schedule conflict and path conflict handling strategies. In path conflict handling strategy, we not only consider the common path conflicts in a grid cell, but also focus on the path conflicts between robots when exchanging positions in the adjacent grid cells. Besides, we construct our benchmarks based on real working environments, such as factory, powerhouse, and airport environments. Experimental results indicate that VGTA’s search capability and computation cost are satisfactory. Meanwhile, its solutions are able to be really executed.

7 March 2022 in Wireless Personal Communications
Verified
Journal Article
Closed access
PDF file
HZHongguang Zhang
Hongguang Zhang
TWTao Wang
Tao Wang
TLTingTing Liu
TingTing Liu
QZQingSong Zhang
QingSong Zhang
An Yuan LiuAn Yuan Liu
An Yuan Liu

12 September 2023 in IEEE Sensors Journal
Verified
Journal Article
Closed access
HZHongguang Zhang
Hongguang Zhang
YTYuxuan Tao
Yuxuan Tao
XLXiusha Lv
Xiusha Lv
An Yuan LiuAn Yuan Liu
An Yuan Liu
In UAV-assisted wireless sensor networks (WSNs), most schemes use a single UAV to collect one regional sensors’ data or multi-UAVs independently work in multi-regions for time-sensitive fixed-ground-trajectory scenarios. To our best knowledge, they are a single-objective performance enhancement scheme, such as improving data collection rate or shortening flight time. Moreover, these two objectives are contradictory. To address this problem, we propose master-slave UAV data collection algorithm (MSUDC) that is a joint framework with trajectory adjustment and air-to-ground (A2G) cooperation. MSUDC could simultaneously improve data collection rate and shorten flight time. There is little research about double-objective performance enhancement schemes like MSUDC, as far as we know. Through air-to-air (A2A) communication link, master UAV controls slave UAV trajectory adjustment. Therefore, the flight formation of master-slave UAVs could build a new shape of covered communication area on the ground. Unlike present work, the overlapped area makes their sensors have at most two times to transmit data. Besides, master-slave UAVs realize priority grouping of sensors according to connection time and use centralized control methods to make sensors in one priority group send data according to their command. This effectively avoids data collisions. Generally, the priority group and centralized control methods are different from most existing research. MSUDC outperforms single and double UAV data collection algorithms, which is robust for changing the horizontal minimum speed of master-slave UAVs. Through MSUDC, we find a new technological roadmap for our future multi-objective performance enhancement. However, the limitation of MSUDC is the high cost of master-slave UAVs.

1 November 2022 in Arabian Journal for Science and Engineering
Verified
Journal Article
Closed access
PDF file
HZHongguang Zhang
Hongguang Zhang
MTMengZhen Tang
MengZhen Tang
An Yuan LiuAn Yuan Liu
An Yuan Liu
XLXiang Li
Xiang Li

2 April 2025 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
XLXiang Li
Xiang Li
HZHongguang Zhang
Hongguang Zhang
Drone-assisted ship supply has recently garnered widespread attention for its faster, cheaper, and greener advantages, reshaping shore-to-vessel deliveries and expected to become fundamental to future maritime logistics. Facing challenges like time-dependent locations and coordination, we introduce a novel path planning problem for supply ship-drone delivery, in which drones launch from the supply ship to serve anchored and underway vessels. We then formulate a supply ship-drone delivery model and devise a synchronized drone rendezvous strategy that determines the rendezvous points between drones and underway vessels. To address this, we propose an adaptive ship-drone path coordination algorithm (ASDPC) that accounts for the movement of both the supply ship and vessels. The supply ship path is optimized using a grid-based approach, ensuring full vessel coverage with tailored operators and enhancing search diversity and intensity. Building upon this, drone path optimization employs the receding vessel priority delivery strategy, leveraging relative motion between the supply ship and vessels to select targets with low delays and short distances. Subsequently, a removal-and-insertion approach is applied to further coordinate multi-drone paths. Besides, with supply ship and drone parameters varying, ASDPC consistently outperforms the baseline algorithms in terms of reducing delivery cost and time, indicating the satisfactory performance and practicability of ASDPC across various scenarios. Generally, this work presents a scalable framework for drone collaboration with mobile platforms to address critical challenges in coordination and synchronization with moving targets, thereby offering new perspectives for maritime logistics operations.