Search

In this paper, the reentry phase of the Aerospaceplane is taken as the research object, and the performance parameters of the reusable rocket of a private company are analyzed. Aiming at the guidance and control scheme of the spacecraft returning to the reentry trajectory in the real environment, the original natural algorithm is optimized by considering various reentry flight constraints, and the improved original natural algorithm is used to optimize the reentry trajectory of the Aerospaceplane. We obtained two types of reentry trajectories in the presence of large flight-restricted areas, the "S-type" trajectory and the "spiral-type" trajectory, and obtained data on various influencing factors. The results showed that the basic state parameters of the spiral trajectory optimized using the improved original natural algorithm after adding constraints met the constraint conditions. The aerodynamic heating rate and overload of the spiral reentry trajectory were to some extent greater than those of the S-type trajectory. Under the increasingly stringent requirements of the aerospace environment, new requirements were put forward for the thermal protection system to meet the wider environmental situation. This paper uses the improved original natural algorithm for the first time and applies it to the field of aerospace reentry and entry and adds more constraints to this algorithm for computation. Besides, for the first time, the macroscopic nature of trajectory types is used as a comparative element for parameter comparison, providing a reference basis for selecting trajectory optimization directions from the macroscopic perspective of trajectory types. [ABSTRACT FROM AUTHOR]

The rapid development of mobile Internet has promoted the rapid rise of cloud computing technology. Mobile terminal devices have greatly expanded the service capacity of mobile terminals by migrating complex computing tasks to run in the cloud. However, in the process of data exchange between mobile terminals and cloud computing centers, on the one hand, it consumes the limited power of mobile terminals, and on the other hand, it results in longer communication time, which negatively affects user QoE. Mobile cloud can effectively improve user QoE by shortening the data transmission distance, reducing the power consumption, and shortening the communication time at the same time. In this paper, we utilize the property that genetic algorithm can perform global search seeking the global optimal solution and construct a dynamic task scheduling model by combining the device-cloud link. The task scheduling model based on genetic algorithm and random scheduling algorithm is compared through comparison experiments, which show that the assignment time of the task scheduling model based on genetic algorithm is shortened by 11.82% to 48.51% and the energy consumption is reduced by 22.28% to 47.52% under different load conditions. [ABSTRACT FROM AUTHOR]

In this paper, a variable-structure multimodel (VSMM) filtering algorithm based on the long short-term memory (LSTM) regression-deep Q network (L-DQN) is proposed to accurately track strong maneuvering targets. The algorithm can map the selection of the model set to the selection of the action label and realize the purpose of a deep reinforcement-learning agent to replace the model switching in the traditional VSMM algorithm by reasonably designing a reward function, state space, and network structure. At the same time, the algorithm introduces a LSTM algorithm, which can compensate the error of tracking results based on model history information. The simulation results show that compared with the traditional VSMM algorithm, the proposed algorithm can quickly capture the maneuvering of the target, the response time is short, the calculation accuracy is significantly improved, and the range of adaptation is wider. Precise tracking of maneuvering targets was achieved. [ABSTRACT FROM AUTHOR]

For traditional predictor-corrector guidance algorithm for reentry glide vehicle, it cost a lot of time to obtain predicted flight range with a slow speed to iterate. In this paper, according to residual network (ResNet)'s block and dynamic model of vehicle, through analyzing the characteristics of predicted flight range with constraints, the flight range prediction block and flight range prediction neural network are designed, which can obtain the predicted range accurately and quickly; then aiming at the separation between guidance logic and no-fly zone avoidance logic, which may lead to guidance failure and increasing of the sign variation number of the bank angle, the no-fly zone crossrange and the no-fly zone mapping crossrange are proposed in this paper. According the repulsion force of artificial potential field, an adaptive crossrange corridor combining guidance logic and no-fly zone avoidance logic is proposed, and the convergence of the corridor is analyzed theoretically. Through simulation, the block number of flight range prediction network is determined firstly. By this method, the efficiency of lateral guidance can be improved. Then, through the simulation with the different no-fly zones under different disturbed conditions, the stability and validity of the guidance method are verified. Finally, compared with other predictor-corrector algorithms, the proposed method can realize guidance with less sign variation number of bank angle and better avoidance for no-fly zones. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of motion intention recognition for cluster targets with splitting behaviour and lack of motion prior information. This is a challenge to the classical Bayesian inference based intention recognition algorithms because they rely heavily on a priori knowledge. In order to solve these problems, a joint algorithm of deep echo state network optimized by adaptive genetic algorithm (AGADESN) and DBSCAN clustering algorithm is proposed in this paper. We use improved Olfati-Saber model with direction noise to generate cluster motion and use the cluster motion data to drive AGADESN algorithm to predict cluster destination, which achieves higher destination prediction accuracy than DESN algorithm. We innovatively design the motion similarity distance (MSD) and take the destination prediction output as one of the distance inputs, alleviating the lack of differentiation among different cluster targets caused by only relying on speed and position distance at the early stage of cluster motion. Based on the MSD, DBSCAN clustering algorithm is used to identify clusters in the field of view to determine whether splitting behaviour occurs. Simulation results demonstrate the effectiveness of the proposed algorithm in cluster target motion intention recognition and its superiority over DESN algorithm and DBSCAN algorithm only based on speed and position distance. [ABSTRACT FROM AUTHOR]

The platform inertial-stellar composite guidance is a composite guidance method supplemented by stellar correction on the basis of inertial navigation, which can effectively improve the accuracy of responsive launch vehicles. In order to solve the problem of rapid determining the optimal navigation star in the system, this paper proposes an algorithm based on the equivalent information compression theory. At first, this paper explains why the single-star scheme can achieve the same accuracy as the dual-star scheme. At the same time, the analytical expression of the optimal navigation star with significant initial error is derived. In addition, the available optimal navigation star determination strategy is also designed according to the arrow-borne navigation star database. The proposed algorithm is evaluated by two representative responsive launch vehicle trajectory simulations. The simulation results demonstrate that the proposed algorithm can determine the optimal navigation star quickly, which greatly shorten the preparation time before the rapid launch of vehicles and improve the composite guidance accuracy. [ABSTRACT FROM AUTHOR]

To improve the probability of missile coordinated detection, this paper investigates the control method of multimissile cooperative formation. Based on the missile's nonlinear dynamics modeling, the formation control algorithm based on the position of the leader missile (or virtual leader missile) is studied. Meanwhile, considering the influence of the communication time delay, a robust adaptive cooperative controller satisfying the time delay network is designed. The simulation verification result indicates that cooperative formation can be achieved quickly with small velocity and position tracking errors when the missiles are fully connected. Therefore, the multimissile cooperative formation control algorithm designed in this paper can meet the requirements of multimissile coordinated detection, thus improving the missile's cooperative attack capability. [ABSTRACT FROM AUTHOR]

The unmanned aerial vehicles (UAV) are now widely used in search and rescue (SAR) missions to locate casualties and survey terrain. To solve the problem of long calculation time and large memory usage of the UAV obstacle-avoidance path-planning algorithm in cooperative tasks, this paper proposes a method that combines the A ∗ algorithm and the task allocation algorithm to achieve a faster and more effective path-planning method. First, the environment is displayed in the form of a grid. Then, the enhanced algorithm divides the task area for UAVs. Finally, each UAV performs SAR path planning in the mission area. The tasks of mapping the environment and searching for target points by UAV swarms are discussed in this study. Our research enhances A ∗ algorithms for generating the shortest collision-free paths for drone swarms. Further, we evaluate the algorithm via simulating the task assignment algorithm and path-planning algorithm of a 3D map and 2D map. Compared with the traditional A ∗ algorithm, the results demonstrate that the enhanced algorithm is effective in the scenario. [ABSTRACT FROM AUTHOR]

Aiming at the problem that unmanned combat aerial vehicle (UCAV) is difficult to quickly and accurately perceive situation information and make maneuvering decision autonomously in modern air combat, which is easily affected by complex factors, a maneuvering decision algorithm of UCAV combined with deep reinforcement learning and game theory is proposed in this paper. Firstly, through the UCAV dynamics model and maneuver library, a reasonable air combat situation assessment model and advantage reward function are established, and the sample data of situation assessment indicators are constructed using the structure entropy weight method. Secondly, the convolutional neural network (CNN) is used to process the high-dimensional continuous situation features of UCAV in air combat, eliminate the correlation and redundancy between situation features, and train the neural network to approximate the action-value function. Then, the double deep Q network (DDQN) algorithm in reinforcement learning (RL) is introduced to train the agent by the interaction with the environment and combined with Minimax algorithm in stochastic game theory to solve the optimal value function in each specific state, and the optimal maneuver decision of UCAV is obtained. Air combat simulation results show that UCAV can choose maneuvers autonomously under different situations and occupy a dominant position quickly by this method, which greatly improves the combat effectiveness of UCAV. [ABSTRACT FROM AUTHOR]

In this paper, an intelligent algorithm for the aerodynamic parameter calibration of wind tunnel experiments of advanced layout aircraft at a high angle of attack is proposed. The proposed algorithm is based on a homologous comparison and tuning algorithm, and it can effectively improve the accuracy of the wind tunnel experiment model. First, based on the analysis of large oscillation wind tunnel experimental data of an advanced layout scaled aircraft, the high angle of attack wind tunnel experimental model composed of static derivative, dynamic derivative, and rotating balance derivative is established. Second, to improve the accuracy of the wind tunnel experimental model effectively, the idea of combing layered calibration and intelligent algorithm for high angle of attack homologous comparison correction is proposed. The proposed method solves the problems of complex structure, a large amount of data, and poor accuracy in homologous comparison of high angle of attack aerodynamic models of advanced layout aircraft. Finally, the homologous comparison interface software is designed based on MATLAB GUI, which integrates the proposed methods and ideas and realizes effective adjustment of aerodynamic parameters of high angle of attack simulation flight wind tunnel test of an advanced layout aircraft. This study provides a reliable engineering and technical means for subsequent high angle of attack flight test verification of the advanced layout aircraft. [ABSTRACT FROM AUTHOR]

In this paper, a cognitive electronic jamming decision-making method based on improved Q -learning is proposed to improve the efficiency of radar jamming decision-making. First, the method adopts the simulated annealing (SA) algorithm's Metropolis criterion to enhance the exploration strategy, balancing the contradictory relationship between exploration and utilization in the algorithm to avoid falling into local optima. At the same time, the idea of stochastic gradient descent with warm restarts (SGDR) is introduced to improve the learning rate of the algorithm, which reduces the oscillation and improves convergence speed at the later stage of the algorithm iteration. Then, a cognitive electronic jamming decision-making model is constructed, and the improved Q -learning algorithm's specific steps are given. The simulation experiment takes a multifunctional radar as an example to analyze the influence of exploration strategy and learning rate on decision-making performance. The results reveal that compared with the traditional Q -learning algorithm, the improved Q -learning algorithm proposed in this paper can fully explore and efficiently utilize and converge the results to a better solution at a faster speed. The number of iterations can be reduced to more than 50%, which proves the feasibility and effectiveness of the method applied to cognitive electronic jamming decision-making. [ABSTRACT FROM AUTHOR]

Trajectory prediction for hypersonic glide targets is a difficult task that needs to be solved. To improve the prediction precision for hypersonic glide targets, based on the analysis of the target's maneuver characteristic, an intelligent trajectory prediction algorithm based on the maneuver mode identification is proposed in this paper. Firstly, according to the typical maneuver modes of the target, a group of parameter suitable for maneuver mode identification and parameter estimation is proposed. The proposed maneuver parameters can reflect the maneuvering characteristics of the target than the other control parameters. Then, the rationality of parameters is analyzed. Secondly, using the long-short-term memory network (LSTM), the structure of intelligent trajectory prediction based on maneuver mode identification is proposed. The proposed prediction method is designed to improve the prediction accuracy by combining the target dynamic model with the flight data. Finally, the maneuver trajectory data set is established to train and test the method. For the test data set, when the observation time for the target is 200 s and the prediction time is 150 s, with a fast prediction speed, our method's average error of spatial distance (AESD) is less than 2.9 km, and the maximum error of spatial distance (MESD) is less than 6.9 km. The result is better than other compared mainstream methods. And it is also proved valid with some observational error. [ABSTRACT FROM AUTHOR]

Aiming at the resource optimization problem in the cooperative detection task, the objective function is constructed based on the channel capacity, and the artificial bee colony (ABC) algorithm is improved to realize the joint optimization of the UAV swarm trajectory and radiation power. Firstly, a multiple input multiple output (MIMO) cooperative detection model is constructed. Then, based on the perspective of information theory, the channel capacity of the cooperative detection model is derived and used as the objective function for optimizing the detection resources of UAV swarm. Then, the factors affecting the objective function are sorted out and analyzed one by one, and the constraints are clarified. Aiming at the shortcomings of ABC algorithm, its search strategy and parameter optimization method are improved. A joint optimization process of UAV swarm trajectory and radiated power based on improved ABC algorithm is constructed. Finally, through simulation verification and algorithm comparison, it shows that the algorithm in this paper can improve the perception ability of cooperative detection of UAV swarm. [ABSTRACT FROM AUTHOR]

Autonomous aerial refueling (AAR) has generated great interest in recent years. However, much research has focused on the vision-based close docking stage; few studies have been conducted on the navigation algorithm for the rendezvous and following stages. High-precision relative navigation in following stage can provide favourable conditions for successful docking. Aiming at precise relative navigation in the complex high dynamic environment of aerial refueling rendezvous and following stages, a two-stage adaptive filtering architecture is exploited in this paper. An adaptive main Kalman filter (AKF) is realized for ambiguity eliminated GNSS/INS tightly coupled integrated system, and a robust adaptive subfilter is developed for GNSS individually. Particularly, aiming at the influence of pseudorange observation multipath outliers and state abnormal disturbances in unmanned air vehicle- (UAV-) tanker proximity, an INS-aided bifactor robust and classified factor adaptive filtering (IBRCAF) algorithm for single-frequency ambiguity resolution is proposed. Finally, the effectiveness of the algorithm is verified by the simulation experiments for UAV-tanker. The results indicate that the IBRCAF algorithm can efficiently suppress the influence of pseudorange multipath gross errors and abnormal state disturbances and greatly raise the success rate of ambiguity resolution, and the two-stage adaptive filtering algorithm of IBRCAF-AKF can significantly improve relative navigation performance and achieve centimeter-level accuracy. [ABSTRACT FROM AUTHOR]

For future lunar exploration and planetary missions, the digital elevation model (DEM) of the target object may not be well prepared before the mission, so developing a new robust crater detection algorithm (CDA) without prepared high-precision DEM is needed to meet the requirements of a high-reliability and high-precision detection and navigation system. In this paper, we presented a new robust lunar CDA method based on maximum entropy threshold segmentation. By calculating the entropy distribution of the ternary image, the threshold for retaining the maximum amount of image information is selected adaptively, a variety of evaluation indicators are proposed, and a multiple-indicator constraint matrix is constructed to realize the extraction and fitting of the craters. The proposed method has the following advantages: (1) it has strong robustness and is capable of extracting complete craters under multiple illumination conditions, which makes it suitable for the extraction of large-scale planetary and lunar images; (2) the extracted crater edges are clear and complete and do not merge with the surrounding environment edge; and (3) it avoids the problem of parameter sensitivity that is present in a traditional CDA algorithm. The proposed method was verified using an image taken by the Chang'e-2 lunar probe, and a comparison with the traditional method based on morphology and adaptive Canny edge detection shows that the number of craters detected increases by more than 35%, while the computational efficiency is improved by more than 40%. [ABSTRACT FROM AUTHOR]

In many space missions, spacecraft are required to have the ability to avoid various obstacles and finally reach the target point. In this paper, the path planning of spacecraft attitude maneuver under boundary constraints and pointing constraints is studied. The boundary constraints and orientation constraints are constructed as finite functions of path evaluation. From the point of view of optimal time and shortest path, the constrained attitude maneuver problem is reduced to optimal time and path solving problem. To address this problem, a metaheuristic maneuver path planning method is proposed (cross-mutation grey wolf algorithm (CMGWO)). In the CMGWO method, we use angular velocity and control torque coding to model attitude maneuver, which increases the difficulty of solving the problem. In order to deal with this problem, the grey wolf algorithm is used for mutation and evolution, so as to reduce the difficulty of solving the problem and shorten the convergence time. Finally, simulation analysis is carried out under different conditions, and the feasibility and effectiveness of the method are verified by numerical simulation. [ABSTRACT FROM AUTHOR]

Considering recurrent optimization process in model predictive control (MPC), the model uncertainties and disturbances terms in the missile's guidance and control model can degrade recursive feasibility, and there are control mutation problems in common MPC algorithm. This paper presents a disturbance rejection model predictive control algorithm for missile integrated guidance and control (IGC). Firstly, a sliding mode observer (SMDO) is designed to estimate the unknown disturbances caused by target maneuvering. Secondly, the method of optimizing control increment is adopted in MPC to avoid the phenomenon of control mutation in the model calculation. By limiting the control increment in each cycle, it ensures the continuity of the control input. Thirdly, by combining the SMDO and MPC, an IGC algorithm is presented, and the stability of the algorithm is proved by using Lyapunov stability theory. Finally, the simulation results with different impact angles verify the effectiveness of the proposed algorithm for intercepting maneuver target. [ABSTRACT FROM AUTHOR]

This paper considers a reconnaissance scenario where multiple unmanned aerial vehicles (UAVs) provide services cooperatively for multiple users with different priorities. Although users all expect to acquire their needed information in a short time, the degree of urgency to meet their demands is different when taking their diverse priorities into account. A priority-driven multiuser satisfaction model is designed, where users' satisfaction is quantified based on their different priorities, information acquisition demands, and the time they obtain their desired information. To ensure high priority users' fast information acquisition while avoiding excessive delay in low priority users' information acquisition, a batchwise information backhaul strategy is adopted. In each batch, a UAV is selected as the data ferry through a consultative mechanism to carry information back to users. This reconnaissance process is formulated as a cooperative path planning problem, where the optimization objective is maximizing users' total satisfaction, while an intelligent algorithm is proposed to solve this problem effectively. The simulation results show that compared with traditional path planning algorithms without considering user satisfaction, our proposed algorithm can guarantee faster information acquisition for users with higher priorities, which leads to higher satisfaction. In addition, the applicability of our proposed reconnaissance strategy and path planning algorithm in different situations is also analyzed. [ABSTRACT FROM AUTHOR]

The major advantage of the passive multiple-target tracking is that the sonars do not emit signals and thus they can remain covert, which will reduce the risk of being attacked. However, the nonlinearity of the passive Doppler and bearing measurements, the range unobservability problem, and the measurement to target data association uncertainty make the passive multiple-target tracking problem challenging. To deal with the target to measurement data association uncertainty problem from multiple sensors, this paper proposed a batch recursive extended Rauch-Tung-Striebel smoother- (RTSS-) based probabilistic multiple hypothesis tracker (PMHT) algorithm, which can effectively handle a large number of passive measurements including clutters. The recursive extended RTSS which consists of a forward filter and a backward smoothing is used to deal with the nonlinear Doppler and bearing measurements. The target range unobservability problem is avoided due to using multiple passive sensors. The simulation results show that the proposed algorithm works well in a passive multiple-target tracking system under dense clutter environment, and its computing cost is low. [ABSTRACT FROM AUTHOR]

Target threat assessment technology is one of the key technologies of intelligent tactical aid decision-making system. Aiming at the problem that traditional beyond-visual-range air combat threat assessment algorithms are susceptible to complex factors, there are correlations between assessment indicators, and accurate and objective assessment results cannot be obtained. A target threat assessment algorithm based on linear discriminant analysis (LDA) and improved glowworm swarm optimization (IGSO) algorithm to optimize extreme learning machine (ELM) is proposed in this paper. Firstly, the linear discriminant analysis method is used to classify the threat assessment indicators, eliminate the correlation between the assessment indicators, and achieve dimensionality reduction of the assessment indicators. Secondly, a prediction model with multiple parallel extreme learning machines as the core is constructed, and the input weights and thresholds of extreme learning machines are optimized by the improved glowworm swarm optimization algorithm, and the weighted integration is carried out according to the training level of the kernel. Then, the threat assessment index functions of angle, speed, distance, altitude, and air combat capability are constructed, respectively, and the sample data of air combat target threat assessment are obtained by combining the structure entropy weight method. Finally, the air combat data is selected from the air combat maneuvering instrument (ACMI), and the accuracy and real-time performance of the LDA-IGSO-ELM algorithm are verified through simulation. The results show that the algorithm can quickly and accurately assess target threats. [ABSTRACT FROM AUTHOR]

This paper proposed an improved particle swarm optimization (PSO) algorithm to solve the three-dimensional problem of path planning for the fixed-wing unmanned aerial vehicle (UAV) in the complex environment. The improved PSO algorithm (called DCA ∗ PSO) based dynamic divide-and-conquer (DC) strategy and modified A ∗ algorithm is designed to reach higher precision for the optimal flight path. In the proposed method, the entire path is divided into multiple segments, and these segments are evolved in parallel by using DC strategy, which can convert the complex high-dimensional problem into several parallel low-dimensional problems. In addition, A ∗ algorithm is adopted to generated an optimal path from the particle swarm, which can avoid premature convergence and enhance global search ability. When DCA ∗ PSO is used to solve the large-scale path planning problem, an adaptive dynamic strategy of the segment selection is further developed to complete an effective variable grouping according to the cost. To verify the optimization performance of DCA ∗ PSO algorithm, the real terrain data is utilized to test the performance for the route planning. The experiment results show that the proposed DCA ∗ PSO algorithm can effectively obtain better optimization results in solving the path planning problem of UAV, and it takes on better optimization ability and stability. In addition, DCA ∗ PSO algorithm is proved to search a feasible route in the complex environment with a large number of the waypoints by the experiment. [ABSTRACT FROM AUTHOR]

For the large-scale search and rescue (S&R) scenarios, the centralized and distributed multi-UAV multitask assignment algorithms for multi-UAV systems have the problems of heavy computational load and massive communication burden, which make it hard to guarantee the effectiveness and convergence speed of their task assignment results. To address this issue, this paper proposes a hierarchical task assignment strategy. Firstly, a model decoupling algorithm based on density clustering and negotiation mechanism is raised to decompose the large-scale task assignment problem into several nonintersection and complete small-scale task assignment problems, which effectively reduces the required computational amount and communication cost. Then, a cluster head selection method based on multiattribute decision is put forward to select the cluster head for each UAV team. These cluster heads will communicate with the central control station about the latest assignment information to guarantee the completion of S&R mission. At last, considering that a few targets cannot be effectively allocated due to UAVs' limited and unbalanced resources, an auction-based task sharing scheme among UAV teams is presented to guarantee the mission coverage of the multi-UAV system. Simulation results and analyses comprehensively verify the feasibility and effectiveness of the proposed hierarchical task assignment strategy in large-scale S&R scenarios with dispersed clustering targets. [ABSTRACT FROM AUTHOR]

Control and path planning are two essential and challenging issues in quadrotor unmanned aerial vehicle (UAV). In this paper, an approach for moving around the nearest obstacle is integrated into an artificial potential field (APF) to avoid the trap of local minimum of APF. The advantage of this approach is that it can help the UAV successfully escape from the local minimum without collision with any obstacles. Moreover, the UAV may encounter the problem of unreachable target when there are too many obstacles near its target. To address the problem, a parallel search algorithm is proposed, which requires UAV to simultaneously detect obstacles between current point and target point when it moves around the nearest obstacle to approach the target. Then, to achieve tracking of the planned path, the desired attitude states are calculated. Considering the external disturbance acting on the quadrotor, a nonlinear disturbance observer (NDO) is developed to guarantee observation error to exponentially converge to zero. Furthermore, a backstepping controller synthesized with the NDO is designed to eliminate tracking errors of attitude. Finally, comparative simulations are carried out to illustrate the effectiveness of the proposed path planning algorithm and controller. [ABSTRACT FROM AUTHOR]

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 method is proposed in this paper, in which a cell is used as the basic analytical unit. By calculating the accuracy area of a cell that is partly contained by the ground region or partly covered by the constellation, the accurate coverage area can be obtained accordingly. Experiments simulating different types of coverage problems are conducted, and the results reveal the correctness and high efficiency of the proposed analytical method. [ABSTRACT FROM AUTHOR]