Advances in Astronautics Science and Technology最新文献

Surveillance and anti-surveillance are currently the dominant forms of orbital game of spacecraft. Based on the maneuver capabilities and surveil strategies of typical surveillance satellites, an evasion strategy as well as a defend strategy using an escort satellite are proposed. The maneuver capabilities of a typical geostationary earth orbit (GEO) satellite are first demonstrated, followed by a detailed demonstration of the evasion abilities against the approaching surveillance satellite. Then a high-maneuvering escort satellite is proposed as another way to cope with the surveillance satellite and the corresponding defend strategies are analyzed. Simulation results demonstrate that a normal satellite can hardly escape the approach and detection of a smart surveillance satellite. However, a high-maneuvering escort satellite can maintain precise sight tracking of the surveillance satellite, which means with certain protective payloads installed, the escort satellite can successfully drive the surveillance satellite away from our high-valued GEO satellite.

A fixed-time orbital rendezvous guidance strategy was proposed to meet the requirements of the time-sensitive pursuit-capture game mission. A key problem of fixed-time orbit rendezvous is the design of deceleration guidance strategy and the choice of transfer time. In order to solve the deceleration guidance problem under limited thrust, a displacement formula under constant rocket thrust is proposed. Basing on the formula, a deceleration guidance strategy of "pulse correction, deceleration condition, inverse-relative-velocity deceleration" was designed so that the spacecraft can meet the terminal position constraint. Basing on the formula, a deceleration guidance strategy of "pulse correction, deceleration condition, inverse-relative-velocity deceleration" was designed so that the spacecraft can meet the terminal position constraint. For the mission time delay caused by deceleration process, a differential correction method was designed based on the displacement formula, which can obtain the Lambert transfer time corresponding to a given mission time. With the proposed method, the mission time error is reduced less than 1 s.

The pursuit-evasion game of orbital satellite is an important research problem in the field of space security. In this pursuit-evasion game, intercepting the target usually requires superior maneuvering capabilities. To address this issue, a method is proposed in this paper to use multiple small satellites with weaker maneuvering capabilities to encircle and capture larger targets with stronger maneuvering abilities. Firstly, based on Tsiolkovsky’s formula, the planar interception problem is derived and a one-on-one planar interception strategy is designed. Next, the existence of solutions for planar mission is analyzed, and a multi-satellite encirclement configuration is designed based on elliptical passive flyby theory. Finally, simulation analysis is conducted on the impact of various design parameters of the planar interception configuration on the encirclement task. The results indicate that the initial distance between interceptor and target significantly affects interception time. Simulation results validate that the proposed interception strategy and encirclement configuration can achieve rapid interception of close-range targets effectively.

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 tasks, and the visible time window features, the indicators of the impact, the conflict, the flexibility, and the bad impact are first established. On this basis, a first-come first-served greedy algorithm and a minimum bad impact greedy algorithm are designed for the generation of the initial solution. some rule-based heuristic strategies are also adopted for optimizing. Additionally, the algorithm incorporates three types of neighborhood structures including insertion, swapping and rearrangement, and deletion, using a tabu list to avoid local optima. Experimental results indicate the validity and efficiency of the proposed method. All solutions are within 10% of the optimal solution, with some even within 5%.The proposed method is effective for obtaining optimum solutions or solutions with a very good quality in various multi-satellite scheduling scenarios of realistic planning.

The properties of control allocation for attitude takeover of a failed spacecraft using nanosatellites are investigated in this paper. Since each nanosatellite with thrusters can only provide a two-axis torque on the combined system, multi-nanosatellites are distributed on different positions of the failed spacecraft to achieve three-axis attitude control. Considering there is no centralized node to calculate the allocation torque, a distributed optimization algorithm is developed. The proposed method can provide each nanosatellite with the optimal torque through communication with its neighbors, leading to energy consumption balance. The communication load is reduced using an event-triggering detector without Zeno Effect. Compared with the other two methods, the effectiveness of the proposed method is demonstrated using attitude maneuver examples.

This paper proposes an optimization strategy using competitive particle swarm algorithm for the anti-reconnaissance problem in the near-range game scenario of spacecraft. Firstly, the constraint analysis is carried out for the anti-reconnaissance game scenario, and game model are designed. Then, an adaptive sliding mode pointing controller is designed, and the effectiveness of the controller is verified through simulation examples. For the survival game, the two-point boundary value problem is derived. To facilitate the solution, it is further transformed into a single-objective optimization problem, and solved by using competitive particle swarm optimization algorithm. The simulation results verify the effectiveness of the solution method.

Aiming at the problem of non-cooperative spacecraft interception under the many-to-many pursuit-evasion game scenario with complete information, this paper establishes a multi-round interception model based on the theory of matrix game, and elaborates the practical significance of the Nash equilibrium mixed strategy in this scenario. Aiming at the demand of model solving, a model solver based on genetic algorithm is designed. Finally, the optimized strategies for many-to-many space interception game is analyzed based on the given scenario and control requirements, and the effectiveness of the established model and its solver is verified by numerical simulation.

Focusing on cutting-edge scientific issues related to lunar exploration and applications, 9 overarching goals and 38 specific objectives for China's manned lunar exploration program have been proposed. Leveraging China's technical capabilities in manned spaceflight and lunar exploration, as well as its expertise in lunar and planetary science, the objectives center on scientific research, lunar-based scientific research, and resource exploration and utilization. Based on these scientific goals and trends in domestic and international manned lunar exploration landing site selection, China's basic principles and processes for selecting landing sites have been established. Thirty prime landing sites have been identified, including 11 low-latitude regions and 1 mid-latitude region, taking into account scientific value and engineering implementation conditions. These scientific objectives and landing site selection recommendations will serve as important guidance and top-level input for the design and implementation of China's manned lunar exploration program.

Aiming at the main constraint of high cost of round-trip transportation between Earth and space in the large-scale space application of space station and manned deep space exploration program, in the development of new-generation manned spaceships in China, to reduce the operation cost and enhance the economic benefit, the relevant design is carried out in accordance with the reusable capability. First, the concept of reusable mode of new-generation manned spacecraft is put forward, the technical difficulties of reusable spacecraft are analyzed, and the technical ways to solve the problems are given in four dimensions, design of reusable conditions, design of reusable performance, design of reusable maintenance security, and design of autonomous health detection and diagnosis, so as to form the technical system of reusable new-generation manned spacecraft. This study has clarified the reusable technology route and realization direction of the new generation of manned spacecraft, which can be used to guide the development of future reusable spacecraft and lay the foundation for large-scale space development.

To cope with the potential thrust-drop malfunction of the manned lunar exploration launch vehicle, a parking orbit replanning method is proposed based on the evaluation of the residual carrying capacity of the launcher. By analyzing the constraints of the whole flight profile and the characteristics of the Earth–Moon transfer orbit systematically, the offline trajectory planning algorithm exhibits improved convergence performance, and thus can be used to evaluate the residual carrying capacity as thrust-drop happens. For the situations that the launcher is not capable of injecting the transfer orbit, a sequential orbit/trajectory replanning method is designed to guarantee the safety of the astronauts. On the premise of ensuring the altitude of the parking orbit, the elements about the orbital plane are further optimized to provide a favorable initial state for the subsequent rescue action. Meanwhile, the nonlinearity of the terminal constraints is alleviated by the injection point forecast, and the initial reference is generated by convex optimization method with well convergence; thus, the solving efficiency of the sequential replanning algorithm can be improved. Simulation results show the proposed method can generate the trajectory that transport the spacecraft to the optimal parking orbit under the thrust-drop malfunction situation. This is an English translated version of “Residual Carrying Capacity Evaluation and Parking Orbit Re-planning for Lunar Exploration Launch Vehicle”.