In this paper a generalized version of the classical Hardy-Littlewood-Polya inequality is given.Furthermore,the Stechkin's problem for a linear differential operator is solved in L_2(R), and the optimal recovery p...In this paper a generalized version of the classical Hardy-Littlewood-Polya inequality is given.Furthermore,the Stechkin's problem for a linear differential operator is solved in L_2(R), and the optimal recovery problem for such differential operator is considered.展开更多
Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta...Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.展开更多
With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard...With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard)problems such as the Traveling Salesman Problem(TSP).However,existing diffusion model-based solvers typically employ a fixed,uniform noise schedule(e.g.,linear or cosine annealing)across all training instances,failing to fully account for the unique characteristics of each problem instance.To address this challenge,we present GraphGuided Diffusion Solvers(GGDS),an enhanced method for improving graph-based diffusion models.GGDS leverages Graph Neural Networks(GNNs)to capture graph structural information embedded in node coordinates and adjacency matrices,dynamically adjusting the noise levels in the diffusion model.This study investigates the TSP by examining two distinct time-step noise generation strategies:cosine annealing and a Neural Network(NN)-based approach.We evaluate their performance across different problem scales,particularly after integrating graph structural information.Experimental results indicate that GGDS outperforms previous methods with average performance improvements of 18.7%,6.3%,and 88.7%on TSP-500,TSP-100,and TSP-50,respectively.Specifically,GGDS demonstrates superior performance on TSP-500 and TSP-50,while its performance on TSP-100 is either comparable to or slightly better than that of previous methods,depending on the chosen noise schedule and decoding strategy.展开更多
We present in this paper a survey of recent results on the relation between time and norm optimality for linear systems and the infinite dimensional version of Pontryagin＇s maximum principle. In particular, we discus...We present in this paper a survey of recent results on the relation between time and norm optimality for linear systems and the infinite dimensional version of Pontryagin＇s maximum principle. In particular, we discuss optimality （or nonoptimality） of singular controls satisfying the maximum principle and smoothness of the costate in function of smoothness of the target.展开更多
We use the dynamic programming principle method to obtain the Hamilton-Jacobi-Bellman(HJB)equation for the value function,and solve the optimal portfolio problem explicitly in a Black-Scholes type of market driven by ...We use the dynamic programming principle method to obtain the Hamilton-Jacobi-Bellman(HJB)equation for the value function,and solve the optimal portfolio problem explicitly in a Black-Scholes type of market driven by fractional Brownian motion with Hurst parameter H∈(0,1).The results are compared with the corresponding well-known results in the standard Black-Scholes market(H=1/2).As an application of our proposed model,two optimal problems are discussed and solved,analytically.展开更多
In this paper,we investigate a streamline diffusion finite element approxi- mation scheme for the constrained optimal control problem governed by linear con- vection dominated diffusion equations.We prove the existenc...In this paper,we investigate a streamline diffusion finite element approxi- mation scheme for the constrained optimal control problem governed by linear con- vection dominated diffusion equations.We prove the existence and uniqueness of the discretized scheme.Then a priori and a posteriori error estimates are derived for the state,the co-state and the control.Three numerical examples are presented to illustrate our theoretical results.展开更多
The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the pro...The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.展开更多
In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,wh...In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,when the performance index is complicated,because one may encounter a two-point boundary value problem of nonlinear differential algebraic equations.To be a numerical method,it is hard to exactly preserve all the specified conditions,which might deteriorate the accuracy of numerical solution.With this in mind,we develop a novel algorithm to find the solution of the optimal control problem of nonlinear Duffing oscillator,which can exactly satisfy all the required conditions for the minimality of the performance index.A new idea of shape functions method(SFM)is introduced,from which we can transform the optimal control problems to the initial value problems for the new variables,whose initial values are given arbitrarily,and meanwhile the terminal values are determined iteratively.Numerical examples confirm the high-performance of the iterative algorithms based on the SFM,which are convergence fast,and also provide very accurate solutions.The new algorithm is robust,even large noise is imposed on the input data.展开更多
As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a nume...As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a numerical example is demonstrated.展开更多
In this paper, we consider a fully discrete finite element approximation for time fractional optimal control problems. The state and adjoint state are approximated by triangular linear fi nite elements in space and &l...In this paper, we consider a fully discrete finite element approximation for time fractional optimal control problems. The state and adjoint state are approximated by triangular linear fi nite elements in space and <em>L</em>1 scheme in time. The control is obtained by the variational discretization technique. The main purpose of this work is to derive the convergence and superconvergence. A numerical example is presented to validate our theoretical results.展开更多
This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approxima...This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approximate controllability are studied.展开更多
A bicubic B-spline finite element method is proposed to solve optimal control problems governed by fourth-order semilinear parabolic partial differential equations.Its key feature is the selection of bicubic B-splines...A bicubic B-spline finite element method is proposed to solve optimal control problems governed by fourth-order semilinear parabolic partial differential equations.Its key feature is the selection of bicubic B-splines as trial functions to approximate the state and costate variables in two space dimensions.A Crank-Nicolson difference scheme is constructed for time discretization.The resulting numerical solutions belong to C2in space,and the order of the coefficient matrix is low.Moreover,the Bogner-Fox-Schmit element is considered for comparison.Two numerical experiments demonstrate the feasibility and effectiveness of the proposed method.展开更多
A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which i...A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.展开更多
In this paper,we investigate a stochastic meshfree finite volume element method for an optimal control problem governed by the convection diffusion equations with random coefficients.There are two contributions of thi...In this paper,we investigate a stochastic meshfree finite volume element method for an optimal control problem governed by the convection diffusion equations with random coefficients.There are two contributions of this paper.Firstly,we establish a scheme to approximate the optimality system by using the finite volume element method in the physical space and the meshfree method in the probability space,which is competitive for high-dimensional random inputs.Secondly,the a priori error estimates are derived for the state,the co-state and the control variables.Some numerical tests are carried out to confirm the theoretical results and demonstrate the efficiency of the proposed method.展开更多
In this paper, we discuss virtual element method (VEM) approximation of optimal control problem governed by Brinkman equations with control constraints. Based on the polynomial projections and variational discretizati...In this paper, we discuss virtual element method (VEM) approximation of optimal control problem governed by Brinkman equations with control constraints. Based on the polynomial projections and variational discretization of the control variable, we build up the virtual element discrete scheme of the optimal control problem and derive the discrete first order optimality system. A priori error estimates for the state, adjoint state and control variables in L<sup>2</sup> and H<sup>1</sup> norm are derived. The theoretical findings are illustrated by the numerical experiments.展开更多
In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and ...In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and co-state variables, and piecewise constant function is used to approximate control variables. Generally, the optimal conditions for the problem are solved iteratively until the control variable reaches error tolerance. In order to calculate all the variables individually and parallelly, we introduce a gradient recovery based two-grid method. First, we solve the small scaled optimal control problem on coarse grids. Next, we use the gradient recovery technique to recover the gradients of state and co-state variables. Finally, using the recovered variables, we solve the large scaled optimal control problem for all variables independently. Moreover, we estimate priori error for the proposed scheme, and use an example to validate the theoretical results.展开更多
In this paper, we propose the nonconforming virtual element method (NCVEM) discretization for the pointwise control constraint optimal control problem governed by elliptic equations. Based on the NCVEM approximation o...In this paper, we propose the nonconforming virtual element method (NCVEM) discretization for the pointwise control constraint optimal control problem governed by elliptic equations. Based on the NCVEM approximation of state equation and the variational discretization of control variables, we construct a virtual element discrete scheme. For the state, adjoint state and control variable, we obtain the corresponding prior estimate in H<sup>1</sup> and L<sup>2</sup> norms. Finally, some numerical experiments are carried out to support the theoretical results.展开更多
This paper addresses the Singular Optimal Control Problem(SOCP)for a surface-to-air missile with limited control,fully considering aerodynamic effects with a parabolic drag polar.This problem is an extension of the ty...This paper addresses the Singular Optimal Control Problem(SOCP)for a surface-to-air missile with limited control,fully considering aerodynamic effects with a parabolic drag polar.This problem is an extension of the typical Goddard problem.First,the classical Legendre-Clebsch condition is applied to derive optimal conditions for the singular angle of attack,revealing that the missile turns by gravity along the singular arc.Second,the higher-order differentiation of the switching function provides the necessary conditions to determine the optimal thrust,expressed as linear functions of the costate variables.The vanishing coefficient determinant is then employed to decouple the control and costate variables,yielding the singular thrust solely dependent on state variables and identifying the singular surface.Moreover,the analytical singular control can be regarded as path constraints subject to the typical Optimal Control Problem(OCP),enabling the GPOPS-Ⅱ,a direct method framework that does not involve the singular condition,to solve the SOCP.Finally,three cases with different structures are presented to evaluate the performance of the proposed method.The results show that it takes a few steps to obtain the numerical optimal solution,which is consistent with the analytical solution derived from the calculus of variations,highlighting its great computational accuracy and effectiveness.展开更多
This paper proposes an optimal midcourse guidance method for dual pulse air-to-air missiles,which is based on the framework of the linear Gauss pseudospectral model predictive control method.Firstly,a multistage optim...This paper proposes an optimal midcourse guidance method for dual pulse air-to-air missiles,which is based on the framework of the linear Gauss pseudospectral model predictive control method.Firstly,a multistage optimal control problem with unspecified terminal time is formulated.Secondly,the control and terminal time update formulas are derived analytically.In contrast to previous work,the derivation process fully considers the Hamiltonian function corresponding to the unspecified terminal time,which is coupled with control,state,and costate.On the assumption of small perturbation,a special algebraic equation is provided to represent the equivalent optimal condition for the terminal time.Also,using Gauss pseudospectral collocation,error propagation dynamical equations involving the first-order correction term of the terminal time are transformed into a set of algebraic equations.Furthermore,analytical modification formulas can be derived by associating those equations and optimal conditions to eliminate terminal error and approach nonlinear optimal control.Even with their mathematical complexity,these formulas produce more accurate control and terminal time corrections and remove reliance on task-related parameters.Finally,several numerical simulations,comparisons with typical methods,and Monte Carlo simulations have been done to verify its optimality,high convergence rate,great stability and robustness.展开更多
Dear Editor,This letter investigates the optimal transmission scheduling problem in remote state estimation systems over an unknown wireless channel.We propose a partially observable Markov decision Process(POMDP)fram...Dear Editor,This letter investigates the optimal transmission scheduling problem in remote state estimation systems over an unknown wireless channel.We propose a partially observable Markov decision Process(POMDP)framework to model the sensor scheduling problem.By truncating and simplifying the POMDP problem,we have established the properties of the optimal solution under the POMDP model,through a fixed-point contraction method,and have shown that the threshold structure of the POMDP solution is not easily attainable.Subsequently,we obtained a suboptimal solution via Qlearning.Numerical simulations are used to demonstrate the efficacy of the proposed Q-learning approach.展开更多
基金Supported by the National Fund of Natural Sciences.
文摘In this paper a generalized version of the classical Hardy-Littlewood-Polya inequality is given.Furthermore,the Stechkin's problem for a linear differential operator is solved in L_2(R), and the optimal recovery problem for such differential operator is considered.
基金funded by National Natural Science Foundation of China(Nos.12402142,11832013 and 11572134)Natural Science Foundation of Hubei Province(No.2024AFB235)+1 种基金Hubei Provincial Department of Education Science and Technology Research Project(No.Q20221714)the Opening Foundation of Hubei Key Laboratory of Digital Textile Equipment(Nos.DTL2023019 and DTL2022012).
文摘Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.
基金supported by the National Science and Technology Council,Taiwan,under grant no.NSTC 114-2221-E-197-005-MY3.
文摘With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard)problems such as the Traveling Salesman Problem(TSP).However,existing diffusion model-based solvers typically employ a fixed,uniform noise schedule(e.g.,linear or cosine annealing)across all training instances,failing to fully account for the unique characteristics of each problem instance.To address this challenge,we present GraphGuided Diffusion Solvers(GGDS),an enhanced method for improving graph-based diffusion models.GGDS leverages Graph Neural Networks(GNNs)to capture graph structural information embedded in node coordinates and adjacency matrices,dynamically adjusting the noise levels in the diffusion model.This study investigates the TSP by examining two distinct time-step noise generation strategies:cosine annealing and a Neural Network(NN)-based approach.We evaluate their performance across different problem scales,particularly after integrating graph structural information.Experimental results indicate that GGDS outperforms previous methods with average performance improvements of 18.7%,6.3%,and 88.7%on TSP-500,TSP-100,and TSP-50,respectively.Specifically,GGDS demonstrates superior performance on TSP-500 and TSP-50,while its performance on TSP-100 is either comparable to or slightly better than that of previous methods,depending on the chosen noise schedule and decoding strategy.
文摘We present in this paper a survey of recent results on the relation between time and norm optimality for linear systems and the infinite dimensional version of Pontryagin＇s maximum principle. In particular, we discuss optimality （or nonoptimality） of singular controls satisfying the maximum principle and smoothness of the costate in function of smoothness of the target.
基金Supported by the Science and Technology Research Program of Chongqing Municipal Education Commission(KJQN201900506)
文摘We use the dynamic programming principle method to obtain the Hamilton-Jacobi-Bellman(HJB)equation for the value function,and solve the optimal portfolio problem explicitly in a Black-Scholes type of market driven by fractional Brownian motion with Hurst parameter H∈(0,1).The results are compared with the corresponding well-known results in the standard Black-Scholes market(H=1/2).As an application of our proposed model,two optimal problems are discussed and solved,analytically.
基金supported by the National Basic Research Program under the Grant 2005CB321701the National Natural Science Foundation of China under the Grants 60474027 and 10771211.
文摘In this paper,we investigate a streamline diffusion finite element approxi- mation scheme for the constrained optimal control problem governed by linear con- vection dominated diffusion equations.We prove the existence and uniqueness of the discretized scheme.Then a priori and a posteriori error estimates are derived for the state,the co-state and the control.Three numerical examples are presented to illustrate our theoretical results.
文摘The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.
文摘In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,when the performance index is complicated,because one may encounter a two-point boundary value problem of nonlinear differential algebraic equations.To be a numerical method,it is hard to exactly preserve all the specified conditions,which might deteriorate the accuracy of numerical solution.With this in mind,we develop a novel algorithm to find the solution of the optimal control problem of nonlinear Duffing oscillator,which can exactly satisfy all the required conditions for the minimality of the performance index.A new idea of shape functions method(SFM)is introduced,from which we can transform the optimal control problems to the initial value problems for the new variables,whose initial values are given arbitrarily,and meanwhile the terminal values are determined iteratively.Numerical examples confirm the high-performance of the iterative algorithms based on the SFM,which are convergence fast,and also provide very accurate solutions.The new algorithm is robust,even large noise is imposed on the input data.
文摘As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a numerical example is demonstrated.
文摘In this paper, we consider a fully discrete finite element approximation for time fractional optimal control problems. The state and adjoint state are approximated by triangular linear fi nite elements in space and <em>L</em>1 scheme in time. The control is obtained by the variational discretization technique. The main purpose of this work is to derive the convergence and superconvergence. A numerical example is presented to validate our theoretical results.
基金This work was partially supported by the NutionalNatural Science Foundation of China
文摘This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approximate controllability are studied.
基金supported by the National Natural Science Foundation of China(11871312,12131014)the Natural Science Foundation of Shandong Province,China(ZR2023MA086)。
文摘A bicubic B-spline finite element method is proposed to solve optimal control problems governed by fourth-order semilinear parabolic partial differential equations.Its key feature is the selection of bicubic B-splines as trial functions to approximate the state and costate variables in two space dimensions.A Crank-Nicolson difference scheme is constructed for time discretization.The resulting numerical solutions belong to C2in space,and the order of the coefficient matrix is low.Moreover,the Bogner-Fox-Schmit element is considered for comparison.Two numerical experiments demonstrate the feasibility and effectiveness of the proposed method.
文摘A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.
基金supported by the National Natural Science Foundation of China(Nos.11701253,11971259,11801216)Natural Science Foundation of Shandong Province(No.ZR2017BA010)。
文摘In this paper,we investigate a stochastic meshfree finite volume element method for an optimal control problem governed by the convection diffusion equations with random coefficients.There are two contributions of this paper.Firstly,we establish a scheme to approximate the optimality system by using the finite volume element method in the physical space and the meshfree method in the probability space,which is competitive for high-dimensional random inputs.Secondly,the a priori error estimates are derived for the state,the co-state and the control variables.Some numerical tests are carried out to confirm the theoretical results and demonstrate the efficiency of the proposed method.
文摘In this paper, we discuss virtual element method (VEM) approximation of optimal control problem governed by Brinkman equations with control constraints. Based on the polynomial projections and variational discretization of the control variable, we build up the virtual element discrete scheme of the optimal control problem and derive the discrete first order optimality system. A priori error estimates for the state, adjoint state and control variables in L<sup>2</sup> and H<sup>1</sup> norm are derived. The theoretical findings are illustrated by the numerical experiments.
文摘In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and co-state variables, and piecewise constant function is used to approximate control variables. Generally, the optimal conditions for the problem are solved iteratively until the control variable reaches error tolerance. In order to calculate all the variables individually and parallelly, we introduce a gradient recovery based two-grid method. First, we solve the small scaled optimal control problem on coarse grids. Next, we use the gradient recovery technique to recover the gradients of state and co-state variables. Finally, using the recovered variables, we solve the large scaled optimal control problem for all variables independently. Moreover, we estimate priori error for the proposed scheme, and use an example to validate the theoretical results.
文摘In this paper, we propose the nonconforming virtual element method (NCVEM) discretization for the pointwise control constraint optimal control problem governed by elliptic equations. Based on the NCVEM approximation of state equation and the variational discretization of control variables, we construct a virtual element discrete scheme. For the state, adjoint state and control variable, we obtain the corresponding prior estimate in H<sup>1</sup> and L<sup>2</sup> norms. Finally, some numerical experiments are carried out to support the theoretical results.
基金co-supported by the National Natural Science Foundation of China(No.62003019)the Young Talents Support Program of Beihang University,China(No.YWF21-BJ-J-1180)。
文摘This paper addresses the Singular Optimal Control Problem(SOCP)for a surface-to-air missile with limited control,fully considering aerodynamic effects with a parabolic drag polar.This problem is an extension of the typical Goddard problem.First,the classical Legendre-Clebsch condition is applied to derive optimal conditions for the singular angle of attack,revealing that the missile turns by gravity along the singular arc.Second,the higher-order differentiation of the switching function provides the necessary conditions to determine the optimal thrust,expressed as linear functions of the costate variables.The vanishing coefficient determinant is then employed to decouple the control and costate variables,yielding the singular thrust solely dependent on state variables and identifying the singular surface.Moreover,the analytical singular control can be regarded as path constraints subject to the typical Optimal Control Problem(OCP),enabling the GPOPS-Ⅱ,a direct method framework that does not involve the singular condition,to solve the SOCP.Finally,three cases with different structures are presented to evaluate the performance of the proposed method.The results show that it takes a few steps to obtain the numerical optimal solution,which is consistent with the analytical solution derived from the calculus of variations,highlighting its great computational accuracy and effectiveness.
基金supported by the National Natural Science Foundation of China(No.62003019)the Young Talents Support Program of Beihang University,China(No.YWF-21-BJ-J-1180).
文摘This paper proposes an optimal midcourse guidance method for dual pulse air-to-air missiles,which is based on the framework of the linear Gauss pseudospectral model predictive control method.Firstly,a multistage optimal control problem with unspecified terminal time is formulated.Secondly,the control and terminal time update formulas are derived analytically.In contrast to previous work,the derivation process fully considers the Hamiltonian function corresponding to the unspecified terminal time,which is coupled with control,state,and costate.On the assumption of small perturbation,a special algebraic equation is provided to represent the equivalent optimal condition for the terminal time.Also,using Gauss pseudospectral collocation,error propagation dynamical equations involving the first-order correction term of the terminal time are transformed into a set of algebraic equations.Furthermore,analytical modification formulas can be derived by associating those equations and optimal conditions to eliminate terminal error and approach nonlinear optimal control.Even with their mathematical complexity,these formulas produce more accurate control and terminal time corrections and remove reliance on task-related parameters.Finally,several numerical simulations,comparisons with typical methods,and Monte Carlo simulations have been done to verify its optimality,high convergence rate,great stability and robustness.
基金supported in part by the Frontier Technology R&D Plan of Jiangsu Province(BF2024065)the Shenzhen Science and Technology Program(JCYJ20230807114609019)Postgraduate Research&Practice Innovation Program of Jiangsu Province(KYCX22_0236).
文摘Dear Editor,This letter investigates the optimal transmission scheduling problem in remote state estimation systems over an unknown wireless channel.We propose a partially observable Markov decision Process(POMDP)framework to model the sensor scheduling problem.By truncating and simplifying the POMDP problem,we have established the properties of the optimal solution under the POMDP model,through a fixed-point contraction method,and have shown that the threshold structure of the POMDP solution is not easily attainable.Subsequently,we obtained a suboptimal solution via Qlearning.Numerical simulations are used to demonstrate the efficacy of the proposed Q-learning approach.
