Based on fuzzy adaptive and dynamic surface(FADS),an integrated guidance and control(IGC)approach was proposed for large caliber naval gun guided projectile,which was robust to target maneuver,canard dynamic character...Based on fuzzy adaptive and dynamic surface(FADS),an integrated guidance and control(IGC)approach was proposed for large caliber naval gun guided projectile,which was robust to target maneuver,canard dynamic characteristics,and multiple constraints,such as impact angle,limited measurement of line of sight(LOS)angle rate and nonlinear saturation of canard deflection.Initially,a strict feedback cascade model of IGC in longitudinal plane was established,and extended state observer(ESO)was designed to estimate LOS angle rate and uncertain disturbances with unknown boundary inside and outside of system,including aerodynamic parameters perturbation,target maneuver and model errors.Secondly,aiming at zeroing LOS angle tracking error and LOS angle rate in finite time,a nonsingular terminal sliding mode(NTSM)was designed with adaptive exponential reaching law.Furthermore,combining with dynamic surface,which prevented the complex differential of virtual control laws,the fuzzy adaptive systems were designed to approximate observation errors of uncertain disturbances and to reduce chatter of control law.Finally,the adaptive Nussbaum gain function was introduced to compensate nonlinear saturation of canard deflection.The LOS angle tracking error and LOS angle rate were convergent in finite time and whole system states were uniform ultimately bounded,rigorously proven by Lyapunov stability theory.Hardware-in-the-loop simulation(HILS)and digital simulation experiments both showed FADS provided guided projectile with good guidance performance while striking targets with different maneuvering forms.展开更多
Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed sy...Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.展开更多
Aiming at the suppression of enemy air defense(SEAD)task under the complex and complicated combat sce-nario,the spatiotemporal cooperative path planning methods are studied in this paper.The major research contents in...Aiming at the suppression of enemy air defense(SEAD)task under the complex and complicated combat sce-nario,the spatiotemporal cooperative path planning methods are studied in this paper.The major research contents include opti-mal path points generation,path smoothing and cooperative rendezvous.In the path points generation part,the path points availability testing algorithm and the path segments availability testing algorithm are designed,on this foundation,the swarm intelligence-based path point generation algorithm is utilized to generate the optimal path.In the path smoothing part,taking ter-minal attack angle constraint and maneuverability constraint into consideration,the Dubins curve is introduced to smooth the path segments.In cooperative rendezvous part,we take esti-mated time of arrival requirement constraint and flight speed range constraint into consideration,the speed control strategy and flight path control strategy are introduced,further,the decoupling scheme of the circling maneuver and detouring maneuver is designed,in this case,the maneuver ways,maneu-ver point,maneuver times,maneuver path and flight speed are determined.Finally,the simulation experiments are conducted and the acquired results reveal that the time-space cooperation of multiple unmanned aeriel vehicles(UAVs)is effectively real-ized,in this way,the combat situation suppression against the enemy can be realized in SEAD scenarios.展开更多
To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm i...To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm is introduced.Firstly,a formation controller based on prescribed performance theory is designed to control the transient and steady formation configuration,as well as the formation forming time,which not only can form the designated formation configuration but also can guarantee collision avoidance and terrain avoidance theoretically.Next,considering the constraints caused by formation controller on trajectory planning such as the safe distance,turn angle and step length,as well as the constraint of formation shape,a leader trajectory planning method based on sparse A^(*)algorithm is proposed.Simulation results show that the UAV formation can arrive at the destination safely with a short trajectory no matter keeping the formation or encountering formation transformation.展开更多
The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense ...The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense anti-missile targets defense problem is abstracted as a nonconvex constrained combinatorial optimization problem with the optimization objective of maximizing the degree of contribution of the processing scheme to non-cooperative targets, and the constraints mainly consider geographical conditions and anti-missile equipment resources. The grid discretization concept is used to partition the defense area into network nodes, and the overall defense strategy scheme is described as a nonlinear programming problem to solve the minimum defense cost within the maximum defense capability of the defense system network. In the solution of the minimum defense cost problem, the processing scheme, equipment coverage capability, constraints and node cost requirements are characterized, then a nonlinear mathematical model of the non-cooperative target distributed hybrid processing optimization problem is established, and a local optimal solution based on the sequential quadratic programming algorithm is constructed, and the optimal firepower processing scheme is given by using the sequential quadratic programming method containing non-convex quadratic equations and inequality constraints. Finally, the effectiveness of the proposed method is verified by simulation examples.展开更多
The trajectory optimization of an unpowered reentry vehicle via artificial emotion memory optimization(AEMO)is discussed.Firstly,reentry dynamics are established based on multiple constraints and parameterized control...The trajectory optimization of an unpowered reentry vehicle via artificial emotion memory optimization(AEMO)is discussed.Firstly,reentry dynamics are established based on multiple constraints and parameterized control variables with finite dimensions are designed.If the constraint is not satisfied,a distance measure and an adaptive penalty function are used to address this scenario.Secondly,AEMO is introduced to solve the trajectory optimization problem.Based on the theories of biology and cognition,the trial solutions based on emotional memory are established.Three search strategies are designed for realizing the random search of trial solutions and for avoiding becoming trapped in a local minimum.The states of the trial solutions are determined according to the rules of memory enhancement and forgetting.As the iterations proceed,the trial solutions with poor quality will gradually be forgotten.Therefore,the number of trial solutions is decreased,and the convergence of the algorithm is accelerated.Finally,a numerical simulation is conducted,and the results demonstrate that the path and terminal constraints are satisfied and the method can realize satisfactory performance.展开更多
基金supported by Naval Weapons and Equipment Pre-Research Project(Grant No.3020801010105).
文摘Based on fuzzy adaptive and dynamic surface(FADS),an integrated guidance and control(IGC)approach was proposed for large caliber naval gun guided projectile,which was robust to target maneuver,canard dynamic characteristics,and multiple constraints,such as impact angle,limited measurement of line of sight(LOS)angle rate and nonlinear saturation of canard deflection.Initially,a strict feedback cascade model of IGC in longitudinal plane was established,and extended state observer(ESO)was designed to estimate LOS angle rate and uncertain disturbances with unknown boundary inside and outside of system,including aerodynamic parameters perturbation,target maneuver and model errors.Secondly,aiming at zeroing LOS angle tracking error and LOS angle rate in finite time,a nonsingular terminal sliding mode(NTSM)was designed with adaptive exponential reaching law.Furthermore,combining with dynamic surface,which prevented the complex differential of virtual control laws,the fuzzy adaptive systems were designed to approximate observation errors of uncertain disturbances and to reduce chatter of control law.Finally,the adaptive Nussbaum gain function was introduced to compensate nonlinear saturation of canard deflection.The LOS angle tracking error and LOS angle rate were convergent in finite time and whole system states were uniform ultimately bounded,rigorously proven by Lyapunov stability theory.Hardware-in-the-loop simulation(HILS)and digital simulation experiments both showed FADS provided guided projectile with good guidance performance while striking targets with different maneuvering forms.
文摘Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.
文摘Aiming at the suppression of enemy air defense(SEAD)task under the complex and complicated combat sce-nario,the spatiotemporal cooperative path planning methods are studied in this paper.The major research contents include opti-mal path points generation,path smoothing and cooperative rendezvous.In the path points generation part,the path points availability testing algorithm and the path segments availability testing algorithm are designed,on this foundation,the swarm intelligence-based path point generation algorithm is utilized to generate the optimal path.In the path smoothing part,taking ter-minal attack angle constraint and maneuverability constraint into consideration,the Dubins curve is introduced to smooth the path segments.In cooperative rendezvous part,we take esti-mated time of arrival requirement constraint and flight speed range constraint into consideration,the speed control strategy and flight path control strategy are introduced,further,the decoupling scheme of the circling maneuver and detouring maneuver is designed,in this case,the maneuver ways,maneu-ver point,maneuver times,maneuver path and flight speed are determined.Finally,the simulation experiments are conducted and the acquired results reveal that the time-space cooperation of multiple unmanned aeriel vehicles(UAVs)is effectively real-ized,in this way,the combat situation suppression against the enemy can be realized in SEAD scenarios.
基金supported by the National Natural Science Foundation of China(11502019).
文摘To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm is introduced.Firstly,a formation controller based on prescribed performance theory is designed to control the transient and steady formation configuration,as well as the formation forming time,which not only can form the designated formation configuration but also can guarantee collision avoidance and terrain avoidance theoretically.Next,considering the constraints caused by formation controller on trajectory planning such as the safe distance,turn angle and step length,as well as the constraint of formation shape,a leader trajectory planning method based on sparse A^(*)algorithm is proposed.Simulation results show that the UAV formation can arrive at the destination safely with a short trajectory no matter keeping the formation or encountering formation transformation.
基金supported by the National Natural Science Foundation of China (61903025)the Fundamental Research Funds for the Cent ral Universities (FRF-IDRY-20-013)。
文摘The distributed hybrid processing optimization problem of non-cooperative targets is an important research direction for future networked air-defense and anti-missile firepower systems. In this paper, the air-defense anti-missile targets defense problem is abstracted as a nonconvex constrained combinatorial optimization problem with the optimization objective of maximizing the degree of contribution of the processing scheme to non-cooperative targets, and the constraints mainly consider geographical conditions and anti-missile equipment resources. The grid discretization concept is used to partition the defense area into network nodes, and the overall defense strategy scheme is described as a nonlinear programming problem to solve the minimum defense cost within the maximum defense capability of the defense system network. In the solution of the minimum defense cost problem, the processing scheme, equipment coverage capability, constraints and node cost requirements are characterized, then a nonlinear mathematical model of the non-cooperative target distributed hybrid processing optimization problem is established, and a local optimal solution based on the sequential quadratic programming algorithm is constructed, and the optimal firepower processing scheme is given by using the sequential quadratic programming method containing non-convex quadratic equations and inequality constraints. Finally, the effectiveness of the proposed method is verified by simulation examples.
基金supported by the Defense Science and Technology Key Laboratory Fund of Luoyang Electro-optical Equipment Institute,Aviation Industry Corporation of China(6142504200108).
文摘The trajectory optimization of an unpowered reentry vehicle via artificial emotion memory optimization(AEMO)is discussed.Firstly,reentry dynamics are established based on multiple constraints and parameterized control variables with finite dimensions are designed.If the constraint is not satisfied,a distance measure and an adaptive penalty function are used to address this scenario.Secondly,AEMO is introduced to solve the trajectory optimization problem.Based on the theories of biology and cognition,the trial solutions based on emotional memory are established.Three search strategies are designed for realizing the random search of trial solutions and for avoiding becoming trapped in a local minimum.The states of the trial solutions are determined according to the rules of memory enhancement and forgetting.As the iterations proceed,the trial solutions with poor quality will gradually be forgotten.Therefore,the number of trial solutions is decreased,and the convergence of the algorithm is accelerated.Finally,a numerical simulation is conducted,and the results demonstrate that the path and terminal constraints are satisfied and the method can realize satisfactory performance.
