Xiaoyu Chen

• Dr.
• Associate Professor at China University of Geosciences

In multi-objective evolutionary algorithms, one of the focal points is finding a balance between diversity and convergence. In decomposition-based algorithms, the role of weight vectors is crucial. Despite numerous studies dedicated to these aspects, there is a scarcity of utilizing transfer learning algorithms for dual-operator feature fusion and...

With the rapid advancement of space technology and the increasing number of orbital satellites, the diverse task requirements are increasingly complex, and the satellite system is exhibiting trends toward intelligence and informatization. This paper articulates a conflict rainbow DQN based two-stage scheduling framework (CR-DQN) that integrates the...

With the increasing number and capabilities of orbital satellites and their onboard sensors, satellites scheduling plays an important role in growing demands for Earth observation tasks. A conflict-priority-based variable neighborhood tabu search method is proposed in this paper. By analyzing the flexibility of resources, the conflict-priority of t...

With continuous expansion of satellite applications, the requirements for satellite communication services, such as communication delay, transmission bandwidth, transmission power consumption, and communication coverage, are becoming higher. This paper first presents an overview of the current development status of Low Earth Orbit (LEO) satellite c...

Snake Optimizer (SO) is a novel Meta-heuristic Algorithm (MA) inspired by the mating behaviour of snakes, which has achieved success in global numerical optimization problems and practical engineering applications. However, it also has certain drawbacks for the exploration stage and the egg hatch process, resulting in slow convergence speed and inf...

Accurate and fast random error estimation is essential to improve satellite control. In this paper, the random error of the satellite being launched into orbit is explored. According to the uncertainty matrix of six satellite orbit parameters associated with the project, the uncertainty of the orbit position in the three axes of the geocentric iner...

To utilize space solar energy efficiently, this study focuses on the optimization of multi-rotary joints space solar power satellite (MR-SSPS), which is designed to efficiently collect and transmit solar energy to Earth. A constraint multi-objective optimization model is proposed for the MR-SSPS, which encompasses three objectives: truss mass, stru...

The popular word-filling game Wordle has gained widespread attention since its release in 2022. Much attention has been paid to find the optimal strategy. However, this article proposes a black-box prediction model that can accurately predict the difficulty level of words in the game to find the deep rules in the game data. In this work, we scienti...

Coverage capacity analysis of satellites constellation is the basis of satellite system design and performance evaluation, which is essential in the application of satellite technology. A characteristic area based method for continuous coverage analysis is proposed in this paper. The trajectory characteristics of the Walker constellation are first...

An increasing number of satellites are currently being launched into orbit to work in the form of clusters or constellations. However, the initial orbit position is accompanied by random errors, which will propagate during their running. Therefore, the orbit precision of the satellites directly affects space safety, network accuracy, and operating...

The balance between multiple objectives and various constraints is the key to solving constrained multi-objective optimization problems (CMOPs). When dealing with CMOPs with complex feasible regions, some evolutionary algorithms suffer from great challenges in converging to the constrained Pareto front (CPF) with well-distributed feasible solutions...

An important factor in constrained multi-objective evolutionary algorithms (CMOEAs) is how to make optimal use of the information of feasible and infeasible solutions. To fully utilize these promising solutions, this paper proposes an archive-based two-stage evolutionary algorithm, called AT-CMOEA, for solving constrained multi-objective optimizati...

Optimal wireless sensor placement (OWSP) plays a pivotal role in structural health monitoring. This study proposes a method to determine the simultaneous placement of sensors and sinks that minimizes energy consumption and maximizes information effectiveness. Network connectivity and reliability are critical constraints that determine the lifetime...

This paper studies the problem of analyzing the coverage capacity of satellite constellations with respect to ground regions. The coverage characteristics and formulations are first investigated, and a corresponding symbol system is established. On this basis, the coverage state function and the corresponding extension mode and intermediate mode fo...

Aiming at the constellation-to-ground region coverage problem, an efficient solution method called the longitude strip method is proposed. By dividing the ground region into several longitude strips, the latitude range of each strip is computed according to the region. Similarly, concerning the coverage area of the satellite, the latitude range of...

Constellation-to-ground coverage analysis is an important problem in practical satellite applications. The classical net point method is one of the most commonly used algorithms in resolving this problem, indicating that the computation efficiency significantly depends on the high-precision requirement. On this basis, an improved cell area-based me...

The demand for analysis of large‐scale data has increased with increased access to spatial vector data. Polygon overlay of vector data in a virtual globe requires proprietary data structures and proprietary analysis algorithms. A vector data structure is designed for rapid polygon overlay in a virtual globe by recording the metadata of the triangle...

We address the multi-satellite scheduling problem with limited observation capacities that arises from the need to observe a set of targets on the Earth's surface using imaging resources installed on a set of satellites. We define and analyze the conflict indicators of all available visible time windows of missions, as well as the feasible time int...

We address the multi-satellite scheduling problem with limited observation capacities that arises from the need to observe a set of targets on the Earth's surface using imaging resources installed on a set of satellites. We define and analyze the conflict indicators of all available visible time windows of missions, as well as the feasible time int...

Satellite orbit design is a fundamental and important task during the mission analysis and the agile satellite design. In this paper we first investigate the design of a more realistic repeating ground track orbit in an accurate geopotential model of Earth. Furthermore, by considering the view field of the resource equipped on an agile satellite, w...

The constellation-to-ground coverage problem is a basic and important problem in satellite applications. The grid point approach is one of the most commonly used approaches to solving this problem. However, this approach also has some serious drawbacks. A group of strategies that can improve or overcome the drawbacks of this approach are proposed....

This paper studies the influence of orbital element error on coverage calculation of a satellite. In order to present the influence, an analysis method based on the position uncertainty of the satellite shown by an error ellipsoid is proposed. In this error ellipsoid, positions surrounding the center of the error ellipsoid mean different positionin...

In this paper we address the problem of multi-satellite scheduling with limited observing ability. As with other computationally hard combinatorial optimization problems, a two-stage heuristic method is developed to obtain high quality solutions in a reasonable amount of computation time. The first stage involves the determination of an observing s...

Many computer vision applications, such as object recognition and segmentation, increasingly build on superpixels. However, there have been so far few superpixel algorithms that systematically deal with noisy images. We propose to first decompose the image into equal-sized rectangular patches, which also sets the maximum superpixel size. Within eac...

In this paper we address a problem of designing satellite constellations to deal with a sequence of Earth revisit missions in the presence of limited resource capabilities. In order to fulfill the periodic coverage requirements we take the repeating ground-track orbit into account and propose a semi-analytical method. After analyzing the coverage c...

This paper studies the problem of analyzing multisatellite constellations with respect to their coverage capacity of areas on Earth’s surface. The geometric configuration of constellation projection points on Earth’s surface is investigated. A geometric subdivision approach is described, and the coverage target area belonging to each satellite and...

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...

In the process of the satellite constellation optimization design and performance evaluation, according to the characteristics of the spherical Delaunay triangulation and Voronoi diagram, the subdivision method of the space geometric configuration of constellation in any state is mainly researched, and the coverage area belonging to each satellite...

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...