In this paper,we investigate the application of the Unmanned Aerial Vehicle(UAV)-enabled relaying system in emergency communications,where one UAV is applied as a relay to help transmit information from ground users t...In this paper,we investigate the application of the Unmanned Aerial Vehicle(UAV)-enabled relaying system in emergency communications,where one UAV is applied as a relay to help transmit information from ground users to a Base Station(BS).We maximize the total transmitted data from the users to the BS,by optimizing the user communication scheduling and association along with the power allocation and the trajectory of the UAV.To solve this non-convex optimization problem,we propose the traditional Convex Optimization(CO)and the Reinforcement Learning(RL)-based approaches.Specifically,we apply the block coordinate descent and successive convex approximation techniques in the CO approach,while applying the soft actor-critic algorithm in the RL approach.The simulation results show that both approaches can solve the proposed optimization problem and obtain good results.Moreover,the RL approach establishes emergency communications more rapidly than the CO approach once the training process has been completed.展开更多
Trajectory planning under uncertain dynamics is critical for safety-critical systems like Unmanned Aerial Vehicles(UAVs),where uncertainties in aerodynamic force and control surface failure can lead to mission failure...Trajectory planning under uncertain dynamics is critical for safety-critical systems like Unmanned Aerial Vehicles(UAVs),where uncertainties in aerodynamic force and control surface failure can lead to mission failure.This paper proposes a Multi-stage Robust Optimization(MRO)framework to address nonlinear trajectory planning with bounded but unknown parameters.By integrating first-order sensitivity analysis and sequential optimization,the proposed method ensures robustness against worst-case parameter deviations while maintaining high terminal accuracy.Unlike existing approaches,this paper explicitly quantifies uncertainty propagation through sensitivity bounds and divides long-term planning into sub-stages to reduce cumulative errors.Simulations on a UAV model with uncertainties in aerodynamic coefficients,wind fields and coefficients of control inputs demonstrate that MRO achieves high terminal state accuracy and strong robustness.展开更多
To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex co...To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex constraints are essential.A significant obstacle is the uncertainty of passage time or energy states of the maximum peak entry heat flux point and waypoints.This paper showcases an endeavour to leverage disjunctive programming and combinatorial theory for the max-max type(maximum peak-heat-flux)Entry Trajectory Optimization(ETO)problems with complex constraints such as dynamic pressure,normal load,waypoints,and no-fly zones.The concept of a"generalized waypoint"is introduced,and the maximum peak-heat-flux point is regarded as a"generalized waypoint".Through the application of propositional calculus rules,the derivation of generalized waypoints incorporating various physical quantities and magnitudes such as heat flux density,longitude,and latitude is actualized in one disjunctive normal form,enabling resolution via a unified method.Consequently,a novel method based on combinatorial prior rules is proposed,utilizing Successive Mixed-Integer Nonlinear Programming(SMINLP)to optimize various heat entry test flight trajectories.Numerical experiments are provided to show the computational accuracy,stability,and adaptability of the proposed method in solving maxmax type entry optimal control problems.展开更多
This study introduces a novel algorithm known as the dung beetle optimization algorithm based on bounded reflection optimization andmulti-strategy fusion(BFDBO),which is designed to tackle the complexities associated ...This study introduces a novel algorithm known as the dung beetle optimization algorithm based on bounded reflection optimization andmulti-strategy fusion(BFDBO),which is designed to tackle the complexities associated with multi-UAV collaborative trajectory planning in intricate battlefield environments.Initially,a collaborative planning cost function for the multi-UAV system is formulated,thereby converting the trajectory planning challenge into an optimization problem.Building on the foundational dung beetle optimization(DBO)algorithm,BFDBO incorporates three significant innovations:a boundary reflection mechanism,an adaptive mixed exploration strategy,and a dynamic multi-scale mutation strategy.These enhancements are intended to optimize the equilibrium between local exploration and global exploitation,facilitating the discovery of globally optimal trajectories thatminimize the cost function.Numerical simulations utilizing the CEC2022 benchmark function indicate that all three enhancements of BFDBOpositively influence its performance,resulting in accelerated convergence and improved optimization accuracy relative to leading optimization algorithms.In two battlefield scenarios of varying complexities,BFDBO achieved a minimum of a 39% reduction in total trajectory planning costs when compared to DBO and three other highperformance variants,while also demonstrating superior average runtime.This evidence underscores the effectiveness and applicability of BFDBO in practical,real-world contexts.展开更多
Trans-medium flight vehicles can combine high aerial maneuverability and underwater concealment ability,which have attracted much attention recently.As the most crucial procedure,the trajectory design generally determ...Trans-medium flight vehicles can combine high aerial maneuverability and underwater concealment ability,which have attracted much attention recently.As the most crucial procedure,the trajectory design generally determines the trans-medium flight vehicle performance.To quantitatively analyze the flight vehicle performance,an entire aerial-aquatic trajectory model is developed in this paper.Different from modeling a trajectory purely for the water entry process,the constructed entire trajectory model has integrated aerial,water entry,and underwater trajectories together,which can consider the influence of the connected trajectories.As for the aerial and underwater trajectories,explicit dynamic models are established to obtain the trajectory parameters.Due to the complicated fluid force during high-velocity water entry,a computational fluid dynamics model is investigated to analyze this phase.The compu-tational domain size is adaptively refined according to the final aerial trajectory state,where the redundant computational domain is removed.An entire trajectory optimization problem is then formulated to maximize the total flight range via tuning the joint states of different trajectories.Simultaneously,several constraints,i.e.,the max impact load,trajectory height,etc.,are involved in the optimization problem.Rather than directly optimizing by a heuristic algorithm,a multi-surrogate cooperative sampling-based optimization method is proposed to alleviate the computational complexity of the entire trajectory optimization problem.In this method,various surrogates coopera-tively generate infill sample points,thereby preventing the poor approximation.After optimization,the total flight range can be improved by 20%,while all the constraints are satisfied.The result demonstrates the effectiveness and practicability of the developed model and optimization framework.展开更多
This paper proposes the Unmanned Aerial Vehicle(UAV)-assisted Full-Duplex(FD)Integrated Sensing And Communication(ISAC)system.In this system,the UAV integrates sensing and communication functions,capable of receiving ...This paper proposes the Unmanned Aerial Vehicle(UAV)-assisted Full-Duplex(FD)Integrated Sensing And Communication(ISAC)system.In this system,the UAV integrates sensing and communication functions,capable of receiving transmission signals from Uplink(UL)users and echo signal from target,while communicating with Downlink(DL)users and simultaneously detecting target.With the objective of maximizing the Average Sum Rate(ASR)for both UL and DL users,a composite non-convex optimization problem is established,which is decomposed into sub-problems of communication scheduling optimization,transceiver beamforming design,and UAV trajectory optimization.An alternating iterative algorithm is proposed,employing relaxation optimization,extremum traversal search,augmented weighted minimum mean square error,and successive convex approximation methods to solve the aforementioned sub-problems.Simulation results demonstrate that,compared to the traditional UAV-assisted Half-Duplex(HD)ISAC scheme,the proposed FD ISAC scheme effectively improves the ASR.展开更多
With the widespread application of com-munication technology in the non-terrestrial network(NTN),the issue of the insecure communication due to the inherent openness of the NTN is increasingly being recognized.Consequ...With the widespread application of com-munication technology in the non-terrestrial network(NTN),the issue of the insecure communication due to the inherent openness of the NTN is increasingly being recognized.Consequently,safeguarding com-munication information in the NTN has emerged as a critical challenge.To address this issue,we pro-pose a beamforming and horizontal trajectory joint op-timization method for unmanned aerial vehicle(UAV)covert communications in the NTN.First,we formu-late an optimization problem that considers constraints such as the transmitting power and the distance.More-over,we employ the integrated communication and jamming(ICAJ)signal as Alice’s transmitting signal,further protecting the content of communication in-formation.Next,we construct two subproblems,and we propose an alternate optimization(AO)algorithm based on quadratic transform and penalty term method to solve the proposed two subproblems.Simulation re-sults demonstrate that the proposed method is effective and has better performance than benchmarks.展开更多
Due to the extraordinary advantages,un-manned aerial vehicle(UAV)can be utilized as aerial base station(BS)to provide temporary and on-demand wireless connections for user equipments in the cover-age area.This article...Due to the extraordinary advantages,un-manned aerial vehicle(UAV)can be utilized as aerial base station(BS)to provide temporary and on-demand wireless connections for user equipments in the cover-age area.This article specifically considers the UAV-enabled orthogonal frequency division multiple access(OFDMA)wireless communication network.Consid-ering a practical scenario,a joint resource allocation and trajectory design optimization problem with the constraints on UAV mobility,limited total resource and backhaul link rate has been formulated,which aims to maximize the minimum achievable average rate of the users.To tackle the coupling and non-convexity of the proposed problem,an efficient opti-mization algorithm has been proposed based on alter-nating optimization,successive convex approximation and introducing slack variable techniques.Simulation results illustrate that the proposed optimization algo-rithm can effectively improve the system performance.Also,the numerical results unveil that joint optimiza-tion is superior to baseline schemes.展开更多
The principle of direct method used in optimal control problem is introduced. Details of applying this method to flight trajectory generation are presented including calculation of velocity and controls histories. And...The principle of direct method used in optimal control problem is introduced. Details of applying this method to flight trajectory generation are presented including calculation of velocity and controls histories. And capabilities of flight and propulsion systems are considered also. Combined with digital terrain map technique, the direct method is applied to the three dimensional trajectory optimization for low altitude penetration, and simplex algorithm is used to solve the parameters in optimization. For the small number of parameters, the trajectory can be optimized in real time on board.展开更多
Abstract This paper presents the novel use of the particle swarm optimization （PSO） to generate the end-to-end trajectory for hypersonic reentry vehicles in a quite simple formulation. The velocity- dependent bank a...Abstract This paper presents the novel use of the particle swarm optimization （PSO） to generate the end-to-end trajectory for hypersonic reentry vehicles in a quite simple formulation. The velocity- dependent bank angle profile is developed to reduce the search space of unknown parameters based on the constrained PSO algorithm. The path constraints are enforced by setting the fitness function to be infinite on condition that the particles violate the maximum allowable values. The PSO algo- rithm also provides a much easier means to satisfy the terminal conditions by adding penalty terms to the fitness function. Furthermore, the approximate reentry landing footprint is fast constructed by incorporating an interpolation model into the standardized bank angle profiles. Numerical sim ulations demonstrate that the PSO method is a feasible and flexible tool to generate the end-to-end trajectory and landing footprint for hypersonic reentry vehicles.展开更多
In view of generating optimal trajectories of Bolza problems, standard Chebyshev pseudospectral （PS） method makes the points＇ accumulation near the extremities and rarefaction of nodes close to the center of interv...In view of generating optimal trajectories of Bolza problems, standard Chebyshev pseudospectral （PS） method makes the points＇ accumulation near the extremities and rarefaction of nodes close to the center of interval, which causes an ill-condition of differentiation matrix and an oscillation of the optimal solution. For improvement upon the difficulties, a mapped Chebyshev pseudospectral method is proposed. A conformal map is applied to Chebyshev points to move the points closer to equidistant nodes. Condition number and spectral radius of differentiation matrices from both methods are presented to show the improvement. Furthermore, the modification keeps the Chebyshev pseudospectral method＇s advantage, the spectral convergence rate. Based on three numerical examples, a comparison of the execution time, convergence and accuracy is presented among the standard Chebyshev pseudospectral method, other collocation methods and the proposed one. In one example, the error of results from mapped Chebyshev pseudospectral method is reduced to 5% of that from standard Chebyshev pseudospectral method.展开更多
A hierarchic optimization strategy based on the offline path planning process and online trajectory planning process is presented to solve the trajectory optimization problem of multiple quad-rotor unmanned aerial veh...A hierarchic optimization strategy based on the offline path planning process and online trajectory planning process is presented to solve the trajectory optimization problem of multiple quad-rotor unmanned aerial vehicles in the collaborative assembling task. Firstly, the path planning process is solved by a novel parallel intelligent optimization algorithm, the central force optimization-genetic algorithm （CFO-GA）, which combines the central force optimization （CFO） algorithm with the genetic algorithm （GA）. Because of the immaturity of the CFO, the convergence analysis of the CFO is completed by the stability theory of the linear time-variant discrete-time sys- tems. The results show that the parallel CFO-GA algorithm converges faster than the parallel CFO and the central force optimization-sequential quadratic programming （CFO-SQP） algorithm. Then, the trajectory planning problem is established based on the path planning results. In order to limit the range of the attitude angle and guarantee the fight stability, the optimized object is changed from the ordinary six-degree-of-freedom rigid-body dynamic model to the dynamic model with an inner-loop attitude controller. The results show that the trajectory planning process can be solved by the mature SQP algorithm easily. Finally, the discussion and analysis of the real-time per- formance of the hierarchic optimization strategy are presented around the group number of the wav^oints and the eoual interval time.展开更多
Multiple Uninhabited Aerial Vehicles (multi-UAVs) coordinated trajectory replanning is one of the most complicated global optimum problems in multi-UAVs coordinated control. Based on the construction of the basic mode...Multiple Uninhabited Aerial Vehicles (multi-UAVs) coordinated trajectory replanning is one of the most complicated global optimum problems in multi-UAVs coordinated control. Based on the construction of the basic model of multi-UAVs coordinated trajectory replanning, which includes problem description, threat modeling, constraint conditions, coordinated function and coordination mechanism, a novel Max-Min adaptive Ant Colony Optimization (ACO) approach is presented in detail. In view of the characteristics of multi-UAVs coordinated trajectory replanning in dynamic and uncertain environments, the minimum and maximum pheromone trails in ACO are set to enhance the searching capability, and the point pheromone is adopted to achieve the collision avoidance between UAVs at the trajectory planner layer. Considering the simultaneous arrival and the air-space collision avoidance, an Estimated Time of Arrival (ETA) is decided first. Then the trajectory and flight velocity of each UAV are determined. Simulation experiments are performed under the complicated combating environment containing some static threats and popup threats. The results demonstrate the feasibility and the effectiveness of the proposed approach.展开更多
This paper proposes a novel hybrid algorithm called Fractional-order Particle Swarm optimization Gravitational Search Algorithm(FPSOGSA)and applies it to the trajectory planning of the hypersonic lifting reentry fligh...This paper proposes a novel hybrid algorithm called Fractional-order Particle Swarm optimization Gravitational Search Algorithm(FPSOGSA)and applies it to the trajectory planning of the hypersonic lifting reentry flight vehicles.The proposed method is used to calculate the control profiles to achieve the two objectives,namely a smoother trajectory and enforcement of the path constraints with terminal accuracy.The smoothness of the trajectory is achieved by scheduling the bank angle with the aid of a modified scheme known as a Quasi-Equilibrium Glide(QEG)scheme.The aerodynamic load factor and the dynamic pressure path constraints are enforced by further planning of the bank angle with the help of a constraint enforcement scheme.The maximum heating rate path constraint is enforced through the angle of attack parameterization.The Common Aero Vehicle(CAV)flight vehicle is used for the simulation purpose to test and compare the proposed method with that of the standard Particle Swarm Optimization(PSO)method and the standard Gravitational Search Algorithm(GSA).The simulation results confirm the efficiency of the proposed FPSOGSA method over the standard PSO and the GSA methods by showing its better convergence and computation efficiency.展开更多
To rapidly generate a reentry trajectory for hypersonic vehicle satisfying waypoint and no-fly zone constraints, a novel optimization method, which combines the improved particle swarm optimization （PSO） algorithm w...To rapidly generate a reentry trajectory for hypersonic vehicle satisfying waypoint and no-fly zone constraints, a novel optimization method, which combines the improved particle swarm optimization （PSO） algorithm with the improved Gauss pseudospectral method （GPM）, is proposed. The improved PSO algorithm is used to generate a good initial value in a short time, and the mission of the improved GPM is to find the final solution with a high precision. In the improved PSO algorithm, by controlling the entropy of the swarm in each dimension, the typical PSO algorithm＇s weakness of being easy to fall into a local optimum can be overcome. In the improved GPM, two kinds of breaks are introduced to divide the trajectory into multiple segments, and the distribution of the Legendre-Gauss （LG） nodes can be altered, so that all the constraints can be satisfied strictly. Thereby the advan- tages of both the intelligent optimization algorithm and the direct method are combined. Simulation results demonstrate that the proposed method is insensitive to initial values, and it has more rapid convergence and higher precision than traditional ones.展开更多
Conventional trajectory optimization techniques have been challenged by their inability to handle threats with irregular shapes and the tendency to be sensitive to control variations of aircraft. Aiming to overcome th...Conventional trajectory optimization techniques have been challenged by their inability to handle threats with irregular shapes and the tendency to be sensitive to control variations of aircraft. Aiming to overcome these difficulties, this paper presents an alternative approach for trajectory optimization, where the problem is formulated into a parametric optimization of the maneuver variables under a tactics template framework. To reduce the size of the problem, global sensitivity analysis （GSA） is performed to identify the less-influential maneuver variables. The probability collectives （PC） algorithm, which is well-suited to discrete and discontinuous optimization, is applied to solve the trajectory optimization problem. The robustness of the trajectory is assessed through multiple sampling around the chosen values of the maneuver variables. Meta-models based on radius basis function （RBF） are created for evaluations of the means and deviations of the problem objectives and constraints. To guarantee the approximation accuracy, the meta-models are adaptively updated during optimization. The proposed approach is demonstrated on a typical airground attack mission scenario. Results reveal that the proposed approach is capable of generating robust and optimal trajectories with both accuracy and efficiency.展开更多
Aiming at increasing the calculation efficiency of the pseudospectral methods, a multiple- interval Radau pseudospectral method （RPM） is presented to generate a reusable launch vehicle （RLV） ＇s optimal re-entry t...Aiming at increasing the calculation efficiency of the pseudospectral methods, a multiple- interval Radau pseudospectral method （RPM） is presented to generate a reusable launch vehicle （RLV） ＇s optimal re-entry trajectory. After dividing the optimal control problem into many intervals, the state and control variables are approximated using many fixed- and low-degree Lagrange polyno- mials in each interval. Convergence of the numerical discretization is then achieved by increasing the number of intervals. With the application of the proposed method, the normal nonlinear program- ming （NLP） problem transcribed from the optimal control problem can avoid being dense because of the low-degree approximation polynomials in each interval. Thus, the NLP solver can easily compute a solution. Finally, simulation results show that the optimized re-entry trajectories satisfy the path constraints and the boundary constraints successfully. Compared with the single interval RPM, the multiple-interval RPM is significantly faster and has higher calculation efficiency. The results indicate that the multiple-interval RPM can be applied for real-time trajectory generation due to its high effi- ciency and high precision.展开更多
The reentry trajectory optimization for hypersonic vehicle（HV）is a current problem of great interest.Some complex constraints,such as waypoints for reconnaissance and no-fly zones for threat avoidance,are inevitably...The reentry trajectory optimization for hypersonic vehicle（HV）is a current problem of great interest.Some complex constraints,such as waypoints for reconnaissance and no-fly zones for threat avoidance,are inevitably involved in a global strike mission.Of the many direct methods,Gauss pseudospectral method（GPM）has been demonstrated as an effective tool to solve the trajectory optimization problem with typical constraints.However,a series of diffculties arises for complex constraints,such as the uncertainty of passage time for waypoints and the inaccuracy of approximate trajectory near no-fly zones.The research herein proposes a multi-phase technique based on the GPM to generate an optimal reentry trajectory for HV satisfying waypoint and nofly zone constraints.Three kinds of specifc breaks are introduced to divide the full trajectory into multiple phases.The continuity conditions are presented to ensure a smooth connection between each pair of phases.Numerical examples for reentry trajectory optimization in free-space flight and with complex constraints are used to demonstrate the proposed technique.Simulation results show the feasible application of multi-phase technique in reentry trajectory optimization with waypoint and no-fly zone constraints.展开更多
Human trajectory prediction is essential and promising in many related applications. This is challenging due to the uncertainty of human behaviors, which can be influenced not only by himself, but also by the surround...Human trajectory prediction is essential and promising in many related applications. This is challenging due to the uncertainty of human behaviors, which can be influenced not only by himself, but also by the surrounding environment. Recent works based on long-short term memory(LSTM) models have brought tremendous improvements on the task of trajectory prediction. However, most of them focus on the spatial influence of humans but ignore the temporal influence. In this paper, we propose a novel spatial-temporal attention(ST-Attention) model,which studies spatial and temporal affinities jointly. Specifically,we introduce an attention mechanism to extract temporal affinity,learning the importance for historical trajectory information at different time instants. To explore spatial affinity, a deep neural network is employed to measure different importance of the neighbors. Experimental results show that our method achieves competitive performance compared with state-of-the-art methods on publicly available datasets.展开更多
High-area/mass ratio landers driven by Solar Radiation Pressure(SRP)have potential applications for future asteroid landing missions.This paper develops a new convex optimization-based method for planning trajectories...High-area/mass ratio landers driven by Solar Radiation Pressure(SRP)have potential applications for future asteroid landing missions.This paper develops a new convex optimization-based method for planning trajectories driven by SRP.A Minimum Landing Error(MLE)control problem is formulated to enable planning SRP-controlled trajectories with different flight times.It is transformed into Second Order Cone Programming(SOCP)successfully by a series of different convexification technologies.A trust region constraint and a modified MLE objective function are used to guarantee the convergence performance of the optimization algorithm.Thereafter,the SRP-driven trajectory optimal control problem is converted equivalently into a sequence of convex optimal control problems that can be solved effectively.A set of numerical simulation results has verified the effectiveness and feasibility of the proposed optimization method.展开更多
基金supported in part by the Shenzhen Basic Research Project under Grant JCYJ20220531103008018 and Grant 20200812112423002in part by the Guangdong Basic Research Program under Grant 2019A1515110358,2021A1515012097in part by the open research fund of National Mobile Communications Research Laboratory,Southeast University (No.2021D16)。
文摘In this paper,we investigate the application of the Unmanned Aerial Vehicle(UAV)-enabled relaying system in emergency communications,where one UAV is applied as a relay to help transmit information from ground users to a Base Station(BS).We maximize the total transmitted data from the users to the BS,by optimizing the user communication scheduling and association along with the power allocation and the trajectory of the UAV.To solve this non-convex optimization problem,we propose the traditional Convex Optimization(CO)and the Reinforcement Learning(RL)-based approaches.Specifically,we apply the block coordinate descent and successive convex approximation techniques in the CO approach,while applying the soft actor-critic algorithm in the RL approach.The simulation results show that both approaches can solve the proposed optimization problem and obtain good results.Moreover,the RL approach establishes emergency communications more rapidly than the CO approach once the training process has been completed.
基金supported by the National Natural Science Foundation of China(No.92471204)Youth Innovation Promotion Association,CAS,China。
文摘Trajectory planning under uncertain dynamics is critical for safety-critical systems like Unmanned Aerial Vehicles(UAVs),where uncertainties in aerodynamic force and control surface failure can lead to mission failure.This paper proposes a Multi-stage Robust Optimization(MRO)framework to address nonlinear trajectory planning with bounded but unknown parameters.By integrating first-order sensitivity analysis and sequential optimization,the proposed method ensures robustness against worst-case parameter deviations while maintaining high terminal accuracy.Unlike existing approaches,this paper explicitly quantifies uncertainty propagation through sensitivity bounds and divides long-term planning into sub-stages to reduce cumulative errors.Simulations on a UAV model with uncertainties in aerodynamic coefficients,wind fields and coefficients of control inputs demonstrate that MRO achieves high terminal state accuracy and strong robustness.
基金funded by the Key Laboratory of Cross-Domain Flight Interdisciplinary Technology,China(No.2024-KF02201)the National Natural Science Foundation of China(No.61973326)。
文摘To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex constraints are essential.A significant obstacle is the uncertainty of passage time or energy states of the maximum peak entry heat flux point and waypoints.This paper showcases an endeavour to leverage disjunctive programming and combinatorial theory for the max-max type(maximum peak-heat-flux)Entry Trajectory Optimization(ETO)problems with complex constraints such as dynamic pressure,normal load,waypoints,and no-fly zones.The concept of a"generalized waypoint"is introduced,and the maximum peak-heat-flux point is regarded as a"generalized waypoint".Through the application of propositional calculus rules,the derivation of generalized waypoints incorporating various physical quantities and magnitudes such as heat flux density,longitude,and latitude is actualized in one disjunctive normal form,enabling resolution via a unified method.Consequently,a novel method based on combinatorial prior rules is proposed,utilizing Successive Mixed-Integer Nonlinear Programming(SMINLP)to optimize various heat entry test flight trajectories.Numerical experiments are provided to show the computational accuracy,stability,and adaptability of the proposed method in solving maxmax type entry optimal control problems.
基金funded by the National Defense Science and Technology Innovation project,grant number ZZKY20223103the Basic Frontier InnovationProject at the Engineering University of PAP,grant number WJY202429+2 种基金the Basic Frontier lnnovation Project at the Engineering University of PAP,grant number WJY202408the Graduate Student Funding Priority Project,grant number JYWJ2024B006Key project of National Social Science Foundation,grant number 2023-SKJJ-A-116.
文摘This study introduces a novel algorithm known as the dung beetle optimization algorithm based on bounded reflection optimization andmulti-strategy fusion(BFDBO),which is designed to tackle the complexities associated with multi-UAV collaborative trajectory planning in intricate battlefield environments.Initially,a collaborative planning cost function for the multi-UAV system is formulated,thereby converting the trajectory planning challenge into an optimization problem.Building on the foundational dung beetle optimization(DBO)algorithm,BFDBO incorporates three significant innovations:a boundary reflection mechanism,an adaptive mixed exploration strategy,and a dynamic multi-scale mutation strategy.These enhancements are intended to optimize the equilibrium between local exploration and global exploitation,facilitating the discovery of globally optimal trajectories thatminimize the cost function.Numerical simulations utilizing the CEC2022 benchmark function indicate that all three enhancements of BFDBOpositively influence its performance,resulting in accelerated convergence and improved optimization accuracy relative to leading optimization algorithms.In two battlefield scenarios of varying complexities,BFDBO achieved a minimum of a 39% reduction in total trajectory planning costs when compared to DBO and three other highperformance variants,while also demonstrating superior average runtime.This evidence underscores the effectiveness and applicability of BFDBO in practical,real-world contexts.
基金supported by the National Natural Science Foundation of China(Grant Nos.52425211,52272360,and 52472394)Chongqing Natural Science Foundation(CSTB2023NSCQ-MSX0300)。
文摘Trans-medium flight vehicles can combine high aerial maneuverability and underwater concealment ability,which have attracted much attention recently.As the most crucial procedure,the trajectory design generally determines the trans-medium flight vehicle performance.To quantitatively analyze the flight vehicle performance,an entire aerial-aquatic trajectory model is developed in this paper.Different from modeling a trajectory purely for the water entry process,the constructed entire trajectory model has integrated aerial,water entry,and underwater trajectories together,which can consider the influence of the connected trajectories.As for the aerial and underwater trajectories,explicit dynamic models are established to obtain the trajectory parameters.Due to the complicated fluid force during high-velocity water entry,a computational fluid dynamics model is investigated to analyze this phase.The compu-tational domain size is adaptively refined according to the final aerial trajectory state,where the redundant computational domain is removed.An entire trajectory optimization problem is then formulated to maximize the total flight range via tuning the joint states of different trajectories.Simultaneously,several constraints,i.e.,the max impact load,trajectory height,etc.,are involved in the optimization problem.Rather than directly optimizing by a heuristic algorithm,a multi-surrogate cooperative sampling-based optimization method is proposed to alleviate the computational complexity of the entire trajectory optimization problem.In this method,various surrogates coopera-tively generate infill sample points,thereby preventing the poor approximation.After optimization,the total flight range can be improved by 20%,while all the constraints are satisfied.The result demonstrates the effectiveness and practicability of the developed model and optimization framework.
基金supported in part by Sub Project of National Key Research and Development Plan in 2020.NO.2020YFC1511704Beijing Information Science&Technology University.NO.2020KYNH212,NO.2021CGZH302+1 种基金Beijing Science and Technology Project(Grant No.Z211100004421009)in part by the National Natural Science Foundation of China(Grant No.62301058).
文摘This paper proposes the Unmanned Aerial Vehicle(UAV)-assisted Full-Duplex(FD)Integrated Sensing And Communication(ISAC)system.In this system,the UAV integrates sensing and communication functions,capable of receiving transmission signals from Uplink(UL)users and echo signal from target,while communicating with Downlink(DL)users and simultaneously detecting target.With the objective of maximizing the Average Sum Rate(ASR)for both UL and DL users,a composite non-convex optimization problem is established,which is decomposed into sub-problems of communication scheduling optimization,transceiver beamforming design,and UAV trajectory optimization.An alternating iterative algorithm is proposed,employing relaxation optimization,extremum traversal search,augmented weighted minimum mean square error,and successive convex approximation methods to solve the aforementioned sub-problems.Simulation results demonstrate that,compared to the traditional UAV-assisted Half-Duplex(HD)ISAC scheme,the proposed FD ISAC scheme effectively improves the ASR.
基金supported in part by the National Natural Science Foundation of China under Grant U2441250 and 62231027in part by Natural Science Basic Research Programof Shaanxi under Grant 2024JC-JCQN-63+2 种基金in part by InnovationCapability Support Program of Shaanxi under Grant2024RS-CXTD-01in part by New Technology Research University Cooperation Project under Grant SKX242010031in part by the FundamentalResearch Funds for the Central Universities and theInnovation Fund of Xidian University under GrantYJSJ25007.
文摘With the widespread application of com-munication technology in the non-terrestrial network(NTN),the issue of the insecure communication due to the inherent openness of the NTN is increasingly being recognized.Consequently,safeguarding com-munication information in the NTN has emerged as a critical challenge.To address this issue,we pro-pose a beamforming and horizontal trajectory joint op-timization method for unmanned aerial vehicle(UAV)covert communications in the NTN.First,we formu-late an optimization problem that considers constraints such as the transmitting power and the distance.More-over,we employ the integrated communication and jamming(ICAJ)signal as Alice’s transmitting signal,further protecting the content of communication in-formation.Next,we construct two subproblems,and we propose an alternate optimization(AO)algorithm based on quadratic transform and penalty term method to solve the proposed two subproblems.Simulation re-sults demonstrate that the proposed method is effective and has better performance than benchmarks.
基金supported by Project funded in part by China Postdoctoral Science Foundation(No.2021MD703980)in part by the National Natural Science Foundation of China(No.61901502).
文摘Due to the extraordinary advantages,un-manned aerial vehicle(UAV)can be utilized as aerial base station(BS)to provide temporary and on-demand wireless connections for user equipments in the cover-age area.This article specifically considers the UAV-enabled orthogonal frequency division multiple access(OFDMA)wireless communication network.Consid-ering a practical scenario,a joint resource allocation and trajectory design optimization problem with the constraints on UAV mobility,limited total resource and backhaul link rate has been formulated,which aims to maximize the minimum achievable average rate of the users.To tackle the coupling and non-convexity of the proposed problem,an efficient opti-mization algorithm has been proposed based on alter-nating optimization,successive convex approximation and introducing slack variable techniques.Simulation results illustrate that the proposed optimization algo-rithm can effectively improve the system performance.Also,the numerical results unveil that joint optimiza-tion is superior to baseline schemes.
文摘The principle of direct method used in optimal control problem is introduced. Details of applying this method to flight trajectory generation are presented including calculation of velocity and controls histories. And capabilities of flight and propulsion systems are considered also. Combined with digital terrain map technique, the direct method is applied to the three dimensional trajectory optimization for low altitude penetration, and simplex algorithm is used to solve the parameters in optimization. For the small number of parameters, the trajectory can be optimized in real time on board.
基金co-supported by the National Natural Science Foundation of China(Nos.61273349,61203223)the Innovation Foundation of BUAA for Ph D Graduates(No.YWF-14-YJSY-013)
文摘Abstract This paper presents the novel use of the particle swarm optimization （PSO） to generate the end-to-end trajectory for hypersonic reentry vehicles in a quite simple formulation. The velocity- dependent bank angle profile is developed to reduce the search space of unknown parameters based on the constrained PSO algorithm. The path constraints are enforced by setting the fitness function to be infinite on condition that the particles violate the maximum allowable values. The PSO algo- rithm also provides a much easier means to satisfy the terminal conditions by adding penalty terms to the fitness function. Furthermore, the approximate reentry landing footprint is fast constructed by incorporating an interpolation model into the standardized bank angle profiles. Numerical sim ulations demonstrate that the PSO method is a feasible and flexible tool to generate the end-to-end trajectory and landing footprint for hypersonic reentry vehicles.
基金supported by the National Natural Science Foundation of China (No.61203022)the Aeronautical Science Foundation of China (2012CZ51029)
文摘In view of generating optimal trajectories of Bolza problems, standard Chebyshev pseudospectral （PS） method makes the points＇ accumulation near the extremities and rarefaction of nodes close to the center of interval, which causes an ill-condition of differentiation matrix and an oscillation of the optimal solution. For improvement upon the difficulties, a mapped Chebyshev pseudospectral method is proposed. A conformal map is applied to Chebyshev points to move the points closer to equidistant nodes. Condition number and spectral radius of differentiation matrices from both methods are presented to show the improvement. Furthermore, the modification keeps the Chebyshev pseudospectral method＇s advantage, the spectral convergence rate. Based on three numerical examples, a comparison of the execution time, convergence and accuracy is presented among the standard Chebyshev pseudospectral method, other collocation methods and the proposed one. In one example, the error of results from mapped Chebyshev pseudospectral method is reduced to 5% of that from standard Chebyshev pseudospectral method.
文摘A hierarchic optimization strategy based on the offline path planning process and online trajectory planning process is presented to solve the trajectory optimization problem of multiple quad-rotor unmanned aerial vehicles in the collaborative assembling task. Firstly, the path planning process is solved by a novel parallel intelligent optimization algorithm, the central force optimization-genetic algorithm （CFO-GA）, which combines the central force optimization （CFO） algorithm with the genetic algorithm （GA）. Because of the immaturity of the CFO, the convergence analysis of the CFO is completed by the stability theory of the linear time-variant discrete-time sys- tems. The results show that the parallel CFO-GA algorithm converges faster than the parallel CFO and the central force optimization-sequential quadratic programming （CFO-SQP） algorithm. Then, the trajectory planning problem is established based on the path planning results. In order to limit the range of the attitude angle and guarantee the fight stability, the optimized object is changed from the ordinary six-degree-of-freedom rigid-body dynamic model to the dynamic model with an inner-loop attitude controller. The results show that the trajectory planning process can be solved by the mature SQP algorithm easily. Finally, the discussion and analysis of the real-time per- formance of the hierarchic optimization strategy are presented around the group number of the wav^oints and the eoual interval time.
基金supported by the Natural Science Foundation of China (Grant no.60604009)Aeronautical Science Foundation of China (Grant no.2006ZC51039,Beijing NOVA Program Foundation of China (Grant no.2007A017)+1 种基金Open Fund of the Provincial Key Laboratory for Information Processing Technology,Suzhou University (Grant no KJS0821)"New Scientific Star in Blue Sky"Talent Program of Beihang University of China
文摘Multiple Uninhabited Aerial Vehicles (multi-UAVs) coordinated trajectory replanning is one of the most complicated global optimum problems in multi-UAVs coordinated control. Based on the construction of the basic model of multi-UAVs coordinated trajectory replanning, which includes problem description, threat modeling, constraint conditions, coordinated function and coordination mechanism, a novel Max-Min adaptive Ant Colony Optimization (ACO) approach is presented in detail. In view of the characteristics of multi-UAVs coordinated trajectory replanning in dynamic and uncertain environments, the minimum and maximum pheromone trails in ACO are set to enhance the searching capability, and the point pheromone is adopted to achieve the collision avoidance between UAVs at the trajectory planner layer. Considering the simultaneous arrival and the air-space collision avoidance, an Estimated Time of Arrival (ETA) is decided first. Then the trajectory and flight velocity of each UAV are determined. Simulation experiments are performed under the complicated combating environment containing some static threats and popup threats. The results demonstrate the feasibility and the effectiveness of the proposed approach.
文摘This paper proposes a novel hybrid algorithm called Fractional-order Particle Swarm optimization Gravitational Search Algorithm(FPSOGSA)and applies it to the trajectory planning of the hypersonic lifting reentry flight vehicles.The proposed method is used to calculate the control profiles to achieve the two objectives,namely a smoother trajectory and enforcement of the path constraints with terminal accuracy.The smoothness of the trajectory is achieved by scheduling the bank angle with the aid of a modified scheme known as a Quasi-Equilibrium Glide(QEG)scheme.The aerodynamic load factor and the dynamic pressure path constraints are enforced by further planning of the bank angle with the help of a constraint enforcement scheme.The maximum heating rate path constraint is enforced through the angle of attack parameterization.The Common Aero Vehicle(CAV)flight vehicle is used for the simulation purpose to test and compare the proposed method with that of the standard Particle Swarm Optimization(PSO)method and the standard Gravitational Search Algorithm(GSA).The simulation results confirm the efficiency of the proposed FPSOGSA method over the standard PSO and the GSA methods by showing its better convergence and computation efficiency.
基金supported by the National Natural Science Foundation of China(61272011)
文摘To rapidly generate a reentry trajectory for hypersonic vehicle satisfying waypoint and no-fly zone constraints, a novel optimization method, which combines the improved particle swarm optimization （PSO） algorithm with the improved Gauss pseudospectral method （GPM）, is proposed. The improved PSO algorithm is used to generate a good initial value in a short time, and the mission of the improved GPM is to find the final solution with a high precision. In the improved PSO algorithm, by controlling the entropy of the swarm in each dimension, the typical PSO algorithm＇s weakness of being easy to fall into a local optimum can be overcome. In the improved GPM, two kinds of breaks are introduced to divide the trajectory into multiple segments, and the distribution of the Legendre-Gauss （LG） nodes can be altered, so that all the constraints can be satisfied strictly. Thereby the advan- tages of both the intelligent optimization algorithm and the direct method are combined. Simulation results demonstrate that the proposed method is insensitive to initial values, and it has more rapid convergence and higher precision than traditional ones.
基金supported by Open Research Foundation of Science and Technology on Aerospace Flight Dynamics Laboratory (No. 2012afd1010)
文摘Conventional trajectory optimization techniques have been challenged by their inability to handle threats with irregular shapes and the tendency to be sensitive to control variations of aircraft. Aiming to overcome these difficulties, this paper presents an alternative approach for trajectory optimization, where the problem is formulated into a parametric optimization of the maneuver variables under a tactics template framework. To reduce the size of the problem, global sensitivity analysis （GSA） is performed to identify the less-influential maneuver variables. The probability collectives （PC） algorithm, which is well-suited to discrete and discontinuous optimization, is applied to solve the trajectory optimization problem. The robustness of the trajectory is assessed through multiple sampling around the chosen values of the maneuver variables. Meta-models based on radius basis function （RBF） are created for evaluations of the means and deviations of the problem objectives and constraints. To guarantee the approximation accuracy, the meta-models are adaptively updated during optimization. The proposed approach is demonstrated on a typical airground attack mission scenario. Results reveal that the proposed approach is capable of generating robust and optimal trajectories with both accuracy and efficiency.
文摘Aiming at increasing the calculation efficiency of the pseudospectral methods, a multiple- interval Radau pseudospectral method （RPM） is presented to generate a reusable launch vehicle （RLV） ＇s optimal re-entry trajectory. After dividing the optimal control problem into many intervals, the state and control variables are approximated using many fixed- and low-degree Lagrange polyno- mials in each interval. Convergence of the numerical discretization is then achieved by increasing the number of intervals. With the application of the proposed method, the normal nonlinear program- ming （NLP） problem transcribed from the optimal control problem can avoid being dense because of the low-degree approximation polynomials in each interval. Thus, the NLP solver can easily compute a solution. Finally, simulation results show that the optimized re-entry trajectories satisfy the path constraints and the boundary constraints successfully. Compared with the single interval RPM, the multiple-interval RPM is significantly faster and has higher calculation efficiency. The results indicate that the multiple-interval RPM can be applied for real-time trajectory generation due to its high effi- ciency and high precision.
基金supported by Aviation Science Foundation of China(No.2011ZC13001 and 2013ZA18001)National Natural Science Foundation of China(Nos:60975073,61273349,61175109 and 61203223)Innovation Foundation of BUAA for PhD Graduates
文摘The reentry trajectory optimization for hypersonic vehicle（HV）is a current problem of great interest.Some complex constraints,such as waypoints for reconnaissance and no-fly zones for threat avoidance,are inevitably involved in a global strike mission.Of the many direct methods,Gauss pseudospectral method（GPM）has been demonstrated as an effective tool to solve the trajectory optimization problem with typical constraints.However,a series of diffculties arises for complex constraints,such as the uncertainty of passage time for waypoints and the inaccuracy of approximate trajectory near no-fly zones.The research herein proposes a multi-phase technique based on the GPM to generate an optimal reentry trajectory for HV satisfying waypoint and nofly zone constraints.Three kinds of specifc breaks are introduced to divide the full trajectory into multiple phases.The continuity conditions are presented to ensure a smooth connection between each pair of phases.Numerical examples for reentry trajectory optimization in free-space flight and with complex constraints are used to demonstrate the proposed technique.Simulation results show the feasible application of multi-phase technique in reentry trajectory optimization with waypoint and no-fly zone constraints.
基金supported by the National Key Research and Development Program of China(2018AAA0101005,2018AAA0102404)the Program of the Huawei Technologies Co.Ltd.(FA2018111061SOW12)+1 种基金the National Natural Science Foundation of China(61773054)the Youth Research Fund of the State Key Laboratory of Complex Systems Management and Control(20190213)。
文摘Human trajectory prediction is essential and promising in many related applications. This is challenging due to the uncertainty of human behaviors, which can be influenced not only by himself, but also by the surrounding environment. Recent works based on long-short term memory(LSTM) models have brought tremendous improvements on the task of trajectory prediction. However, most of them focus on the spatial influence of humans but ignore the temporal influence. In this paper, we propose a novel spatial-temporal attention(ST-Attention) model,which studies spatial and temporal affinities jointly. Specifically,we introduce an attention mechanism to extract temporal affinity,learning the importance for historical trajectory information at different time instants. To explore spatial affinity, a deep neural network is employed to measure different importance of the neighbors. Experimental results show that our method achieves competitive performance compared with state-of-the-art methods on publicly available datasets.
基金supported by the National Natural Science Foundation of China(No.12102177)the Natural Science Foundation of Jiangsu Province,China(No.BK20180410)+2 种基金the Young Elite Scientists Sponsorship Program by CAST,China(No.2018QNRC001)the Open Project Program of Tianjin Key Laboratory of Microgravity and Hypogravity Environment Simulation Technology,China(No.WDZL2020-07)the Foundation of Graduate Innovation Center at NUAA,China(No.kfjj20201503).
文摘High-area/mass ratio landers driven by Solar Radiation Pressure(SRP)have potential applications for future asteroid landing missions.This paper develops a new convex optimization-based method for planning trajectories driven by SRP.A Minimum Landing Error(MLE)control problem is formulated to enable planning SRP-controlled trajectories with different flight times.It is transformed into Second Order Cone Programming(SOCP)successfully by a series of different convexification technologies.A trust region constraint and a modified MLE objective function are used to guarantee the convergence performance of the optimization algorithm.Thereafter,the SRP-driven trajectory optimal control problem is converted equivalently into a sequence of convex optimal control problems that can be solved effectively.A set of numerical simulation results has verified the effectiveness and feasibility of the proposed optimization method.
