Minggang Gan

Dr. Minggang Gan


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
29 December 2015 in Science China Information Sciences
Verified
Journal Article
Closed access
PDF file
JCJie Chen
Jie Chen
MGMinggang Gan
Minggang Gan
JHJie Huang
Jie Huang
LDLihua Dou
Lihua Dou
HFHao Fang
Hao Fang

3 August 2021 in IEEE Access
Verified
Journal Article
Open access
HZHao Zhang
Hao Zhang
LDLihua Dou
Lihua Dou
BXBin Xin
Bin Xin
JCJie Chen
Jie Chen
MGMinggang Gan
Minggang Gan
YDYulong Ding
Yulong Ding
This article studies the data collection task planning for a fixed-wing unmanned aerial vehicle (UAV) in forest fire monitoring. Multiple wireless-based detection nodes (DNs) are distributed in high-risk areas of the forest to monitor the surrounding environment. The task of UAV is to circularly fly to them and collect the environmental data. Because of the kinematic constraints of UAV and the effective communication range between UAV and DN, this problem can be generally regarded as a Dubins traveling salesman problem with neighborhood (DTSPN). A bi-level hybridization-based metaheuristic algorithm (BLHMA) is proposed for solving this problem. At the first level, differential evolution (DE) optimizes the continuous-valued communication positions and UAV headings by the population-based search. For the asymmetric traveling salesman problem (ATSP) corresponding to the combination of the positions and headings generated by DE, a constructive heuristic based on self-organized multi-agent competition (SOMAC) is proposed to determine the discrete collection sequence. By competitive iterations in such a cooperative way in DE, a high-quality data collection tour can be generated. At the second level, a local search based on multistage approximate gradient is proposed to further refine the positions and headings, which accelerates the convergence of the BLHMA. Referring to a real-world scene of forest fire monitoring, the simulation experiments are designed, and comparative results show that BLHMA can find significantly shorter data collection tours in most cases over three state-of-the-art algorithms. The proposed UAV data collection planning algorithm is conducive to the efficient execution of the forest fire monitoring data collection mission and the energy saving of UAV.


31 July 2020 in International Journal of Systems Science
Verified
Journal Article
Closed access
JZJingang Zhao
Jingang Zhao
MGMinggang Gan
Minggang Gan
This paper investigates finite-horizon optimal control problem of continuous-time uncertain nonlinear systems. The uncertainty here refers to partially unknown system dynamics. Unlike the infinite-horizon, the difficulty of finite-horizon optimal control problem is that the Hamilton–Jacobi–Bellman (HJB) equation is time-varying and must meet certain terminal boundary constraints, which brings greater challenges. At the same time, the partially unknown system dynamics have also caused additional difficulties. The main innovation of this paper is the proposed cyclic fixed-finite-horizon-based reinforcement learning algorithm to approximately solve the time-varying HJB equation. The proposed algorithm mainly consists of two phases: the data collection phase over a fixed-finite-horizon and the parameters update phase. A least-squares method is used to correlate the two phases to obtain the optimal parameters by cyclic. Finally, simulation results are given to verify the effectiveness of the proposed cyclic fixed-finite-horizon-based reinforcement learning algorithm.

7 November 2024 in Drones
Verified
Journal Article
Open access
PDF file
JGJia Guo
Jia Guo
MGMinggang Gan
Minggang Gan
KHKang Hu
Kang Hu
In the field of Unmanned Aerial Vehicle (UAV) path planning, designing efficient, safe, and feasible trajectories in complex, dynamic environments poses substantial challenges. Traditional optimization methods often struggle to address the multidimensional nature of these problems, particularly when considering constraints like obstacle avoidance, energy efficiency, and real-time responsiveness. In this paper, we propose a novel algorithm, Dimensional Learning Strategy and Spherical Motion-based Particle Swarm Optimization (DLS-SMPSO), specifically designed to handle the unique constraints and requirements of cooperative path planning for Multiple UAVs (Multi-UAVs). By encoding particle positions as motion paths in spherical coordinates, the algorithm offers a natural and effective approach to navigating multidimensional search spaces. The incorporation of a Dimensional Learning Strategy (DLS) enhances performance by minimizing particle oscillations and allowing each particle to learn valuable information from the global best solution on a dimension-by-dimension basis. Extensive simulations validate the effectiveness of the DLS-SMPSO algorithm, demonstrating its capability to consistently generate optimal paths. The proposed algorithm outperforms other metaheuristic optimization algorithms, achieving a feasibility ratio as high as 97%. The proposed solution is scalable, adaptable, and suitable for real-time implementation, making it an excellent choice for a broad range of cooperative multi-UAV applications.

20 April 2010 in Journal of Electronics & Information Technology
Verified
Journal Article
Closed access
MGMinggang Gan
Minggang Gan
JCJie Chen
Jie Chen
JLJin Liu
Jin Liu
YWYa-Nan Wang
Ya-Nan Wang