Guangming Dai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Guangming Dai has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Maocai Wang
China University of Geosciences
3 shared publications Xiaoyu Chen
School of Computer, China University of Geosciences, Wuhan 430074, China
2 shared publications- Xin Luo
School of Computer, China University of Geosciences, Wuhan 430074, China
2 shared publications Jinlian Xiong
School of Computer Science, China University of Geosciences, Wuhan 430074, China
1 shared publicationLei Peng
School of Computer Science, China University of Geosciences, Wuhan 430074, China
1 shared publication- Mingcheng Zuo
School of Computer Science
1 shared publication
Latest Publications
- Open Access
- 1 January 2017
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2017, 1-9
A Novel Technique to Compute the Revisit Time of Satellites and Its Application in Remote Sensing Satellite Optimization Design
This paper proposes a novel technique to compute the revisit time of satellites within repeat ground tracks. Different from the repeat cycle which only depends on the orbit, the revisit time is relevant to the payload of the satellite as well, such as the tilt angle and swath width. The technique is discussed using the Bezout equation and takes the gravitational second zonal harmonic into consideration. The concept of subcycles is defined in a general way and the general concept of “small” offset is replaced by a multiple of the minimum interval on equator when analyzing the revisit time of remote sensing satellites. This technique requires simple calculations with high efficiency. At last, this technique is used to design remote sensing satellites with desired revisit time and minimum tilt angle. When the side-lap, the range of altitude, and desired revisit time are determined, a lot of orbit solutions which meet the mission requirements will be obtained fast. Among all solutions, designers can quickly find out the optimal orbits. Through various case studies, the calculation technique is successfully demonstrated.
- 1 January 2017
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2017, 1-9
Open AccessA Novel Technique to Compute the Revisit Time of Satellites and Its Application in Remote Sensing Satellite Optimization Design
This paper proposes a novel technique to compute the revisit time of satellites within repeat ground tracks. Different from the repeat cycle which only depends on the orbit, the revisit time is relevant to the payload of the satellite as well, such as the tilt angle and swath width. The technique is discussed using the Bezout equation and takes the gravitational second zonal harmonic into consideration. The concept of subcycles is defined in a general way and the general concept of “small” offset is replaced by a multiple of the minimum interval on equator when analyzing the revisit time of remote sensing satellites. This technique requires simple calculations with high efficiency. At last, this technique is used to design remote sensing satellites with desired revisit time and minimum tilt angle. When the side-lap, the range of altitude, and desired revisit time are determined, a lot of orbit solutions which meet the mission requirements will be obtained fast. Among all solutions, designers can quickly find out the optimal orbits. Through various case studies, the calculation technique is successfully demonstrated.
- Open Access
- 29 November 2016
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2016, 1-9
Application of Latitude Stripe Division in Satellite Constellation Coverage to Ground
Grid point technique is a classical method in computing satellite constellation coverage to the ground regions. Aiming at improving the low computational efficiency of the conventional method, a method using latitude stripe division is proposed, which has high efficiency, and we name it latitude stripe method. After dividing the target region into several latitude stripes, the coverage status of each latitude stripe is computed by means of the spherical geometry relationship in the first orbital period. The longitude coverage intervals in the remaining orbital periods are computed by sliding the coverage status in the first orbital period. Based on this method, the instantaneous and cumulative coverage in simulation time can be calculated more efficiently. As well, the relationship between the cumulative coverage and altitude can be computed fast by this method, which could be used in the optimized design of repeating sun-synchronous orbits. The comparison between the conventional grid point method and the latitude stripe method shows that the latitude stripe method has high efficiency and accuracy. Through various case studies, the optimization in repeating sun-synchronous orbits design is successfully represented.
- 29 November 2016
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2016, 1-9
Open AccessApplication of Latitude Stripe Division in Satellite Constellation Coverage to Ground
Grid point technique is a classical method in computing satellite constellation coverage to the ground regions. Aiming at improving the low computational efficiency of the conventional method, a method using latitude stripe division is proposed, which has high efficiency, and we name it latitude stripe method. After dividing the target region into several latitude stripes, the coverage status of each latitude stripe is computed by means of the spherical geometry relationship in the first orbital period. The longitude coverage intervals in the remaining orbital periods are computed by sliding the coverage status in the first orbital period. Based on this method, the instantaneous and cumulative coverage in simulation time can be calculated more efficiently. As well, the relationship between the cumulative coverage and altitude can be computed fast by this method, which could be used in the optimized design of repeating sun-synchronous orbits. The comparison between the conventional grid point method and the latitude stripe method shows that the latitude stripe method has high efficiency and accuracy. Through various case studies, the optimization in repeating sun-synchronous orbits design is successfully represented.
- Open Access
- 1 January 2016
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2016, 1-13
Multiple Gravity Assist Spacecraft Trajectories Design Based on BFS and EP_DE Algorithm
The paper deals with the multiple gravity assist trajectories design. In order to improve the performance of the heuristic algorithms, such as differential evolution algorithm, in multiple gravity assist trajectories design optimization, a method combining BFS (breadth-first search) and EP_DE (differential evolution algorithm based on search space exploring and principal component analysis) is proposed. In this method, firstly find the possible multiple gravity assist planet sequences with pruning based BFS and use standard differential evolution algorithm to judge the possibility of all the possible trajectories. Then select the better ones from all the possible solutions. Finally, use EP_DE which will be introduced in this paper to find an optimal decision vector of spacecraft transfer time schedule (launch window and transfer duration) for each selected planet sequence. In this paper, several cases are presented to prove the efficiency of the method proposed.
- 1 January 2016
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2016, 1-13
Open AccessMultiple Gravity Assist Spacecraft Trajectories Design Based on BFS and EP_DE Algorithm
The paper deals with the multiple gravity assist trajectories design. In order to improve the performance of the heuristic algorithms, such as differential evolution algorithm, in multiple gravity assist trajectories design optimization, a method combining BFS (breadth-first search) and EP_DE (differential evolution algorithm based on search space exploring and principal component analysis) is proposed. In this method, firstly find the possible multiple gravity assist planet sequences with pruning based BFS and use standard differential evolution algorithm to judge the possibility of all the possible trajectories. Then select the better ones from all the possible solutions. Finally, use EP_DE which will be introduced in this paper to find an optimal decision vector of spacecraft transfer time schedule (launch window and transfer duration) for each selected planet sequence. In this paper, several cases are presented to prove the efficiency of the method proposed.