Chao Han

Chao Han

Auto-generated profile, based on publicly available information

Chao Han

School of Astronautics, Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
18 November 2022 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
CHChao Han
Chao Han
YGYi Gu
Yi Gu
GWGuohua Wu
Guohua Wu
XWXinwei Wang
Xinwei Wang
Agile satellites are the new generation of Earth observation satellites (EOSs) with stronger attitude maneuvering capability. Since optical remote sensing instruments cannot see through the cloud, the cloud coverage brings a significant influence on the satellite observation missions. The scheduling of multiple agile EOSs (AEOSs) is already complicated due to strong satellite maneuverability and onboard satellite energy constraints. Moreover, introducing cloud coverage uncertainty further increases scheduling complexity. Motivated by these challenges, we address the multiple AEOSs scheduling problem under cloud coverage uncertainty where the objective aims to maximize the entire observation profit. A chance constraint programming model is adopted to describe the uncertainty initially, and the observation profit under cloud coverage uncertainty is then calculated via a sample approximation method. To overcome the solving difficulty, an improved simulated annealing (ISA)-based heuristic including a fast insertion strategy is proposed for large-scale observation missions. Finally, extensive experiments are conducted to verify the effectiveness and efficiency of the proposed method. Experimental results show that the ISA-based heuristic outperforms other algorithms for the multiple AEOSs scheduling problem under cloud coverage uncertainty, which validates the proposed algorithm.

25 October 2019 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
XWXinwei Wang
Xinwei Wang
GSGuopeng Song
Guopeng Song
RLRoel Leus
Roel Leus
CHChao Han
Chao Han

1 October 2019 in Acta Astronautica
Verified
Journal Article
Closed access
CHChao Han
Chao Han
SBShengzhou Bai
Shengzhou Bai
SZSihang Zhang
Sihang Zhang
XWXinwei Wang
Xinwei Wang
XWXiaohui Wang
Xiaohui Wang

28 June 2019 in IEEE Access
Verified
Journal Article
Open access
XWXinwei Wang
Xinwei Wang
CHChao Han
Chao Han
RZRui Zhang
Rui Zhang
YGYi Gu
Yi Gu
The Earth observation satellites (EOSs) scheduling is of great importance to achieve efficient observation missions. The agile EOSs (AEOS) with stronger attitude maneuvering capacity can greatly improve observation efficiency while increasing scheduling complexity. Meanwhile, multiple observations requirements for the same ground target, which the existing models and methods cannot completely satisfy, are raised to accomplish scientific projects. In order to fill in this gap, a multiple AEOSs scheduling model for oversubscribed targets with multiple observations is initially developed, and the potential observation missions attained by available time windows discretization are regarded as nodes in the complex networks. To solve the multiple-observation AEOS scheduling problem, an improved feedback structured heuristic is designed by defining the node and target importance factors. On the basis of a real world Chinese AEOS constellation, simulation experiments are conducted to validate the heuristic’s efficiency in comparison with a constructive algorithm and a structured genetic algorithm.

12 September 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
YGYi Gu
Yi Gu
CHChao Han
Chao Han
YCYuhan Chen
Yuhan Chen
SLShenggang Liu
Shenggang Liu
XWXinwei Wang
Xinwei Wang
The last decades have witnessed a rapid increase of Earth observation satellites (EOSs), leading to the increasing complexity of EOSs scheduling. On account of the widespread applications of large region observation, this paper aims to address the EOSs observation scheduling problem for large region targets. A rapid coverage calculation method employing a projection reference plane and a polygon clipping technique is first developed. We then formulate a nonlinear integer programming model for the scheduling problem, where the objective function is calculated based on the developed coverage calculation method. A greedy initialization-based resampling particle swarm optimization (GI-RPSO) algorithm is proposed to solve the model. The adopted greedy initialization strategy and particle resampling method contribute to generating efficient and effective solutions during the evolution process. In the end, extensive experiments are conducted to illustrate the effectiveness and reliability of the proposed method. Compared to the traditional particle swarm optimization and the widely used greedy algorithm, the proposed GI-RPSO can improve the scheduling result by 5.42% and 15.86%, respectively.

15 December 2021 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
YGYi Gu
Yi Gu
CHChao Han
Chao Han
YCYuhan Chen
Yuhan Chen
WXWei W. Xing
Wei W. Xing
Recent decades have witnessed a tremendous growth in the number of Earth observation satellites (EOSs), which presents a huge challenge for mission planning. For the EOSs with optical sensors particularly, the observation mission is significantly influenced by the uncertainty of cloud coverage, which has been identified as the most dominant factor for the invalidation of remote sensing images. To overcome this uncertainty, uncertainty programming methods, namely, chance constraint programming, stochastic expectation model, and robust optimization, are put forth. Despite their success, these approaches are limited in that: 1) they simplified the complex cloud coverage uncertainty, which may be different from the true cloud conditions, and 2) they did not take the true cloud information into consideration. Motivated by these recent trends towards big data of satellite cloud images and machine learning for spatiotemporal prediction, this paper explores a dynamic re-planning scheme for multiple EOSs based on cloud forecasting. Specifically, we propose a new approach mainly in three steps: first, proactive scheduling based on a chance constraint programming is implemented and uploaded via ground control; second, cloud forecasting can be continuously conducted relying on the predictive recurrent neural network and the latest satellite cloud image; third, mission re-planning can be conducted according to the initial schedule and relatively accurate cloud information. Simulation results show that the cloud forecasting method is effective, and the re-planning approach presents highly efficient and accurate scheduling results.