首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 672 毫秒
1.
A theorem of Hardy, Littlewood, and Polya, first time is used to find the variational form of the well known shortest path problem, and as a consequence of that theorem, one can find the shortest path problem via quadratic programming. In this paper, we use measure theory to solve this problem. The shortest path problem can be written as an optimal control problem. Then the resulting distributed control problem is expressed in measure theoretical form, in fact an infinite dimensional linear programming problem. The optimal measure representing the shortest path problem is approximated by the solution of a finite dimensional linear programming problem.  相似文献   

2.
A two dimensional model of the orientation distribution of fibres in a paper machine headbox is studied. The goal is to control the fibre orientation distribution at the outlet of contraction by changing its shape. The mathematical formulation leads to an optimization problem with control in coefficients of a linear convection-diffusion equation as the state problem. Then, the problem is expressed as an optimal control problem governed by variational forms. By using an embedding method, the class of admissible shapes is replaced by a class of positive Radon measures. The optimization problem in measure space is then approximated by a linear programming problem. The optimal measure representing optimal shape is approximated by the solution of this linear programming problem. In this paper, we have shown that the embedding method (embedding the admissible set into a subset of measures), successfully can be applied to shape variation design to a one dimensional headbox. The usefulness of this idea is that the method is not iterative and it does not need any initial guess of the solution.   相似文献   

3.
A shape optimization problem concerned with thermal deformation of elastic bodies is considered. In this article, measure theory approach in function space is derived, resulting in an effective algorithm for the discretized optimization problem. First the problem is expressed as an optimal control problem governed by variational forms on a fixed domain. Then by using an embedding method, the class of admissible shapes is replaced by a class of positive Borel measures. The optimization problem in measure space is then approximated by a linear programming problem. The optimal measure representing optimal shape is approximated by the solution of this finite-dimensional linear programming problem. Numerical examples are also given.  相似文献   

4.
An important routing problem is to determine an optimal path through a multi-attribute network which minimizes a cost function of path attributes. In this paper, we study an optimal path problem in a bi-attribute network where the cost function for path evaluation is fractional. The problem can be equivalently formulated as the “bi-attribute rational path problem” which is known to be NP-complete. We develop an exact approach to find an optimal simple path through the network when arc attributes are non-negative. The approach uses some path preference structures and elimination techniques to discard, from further consideration, those (partial) paths that cannot be parts of an optimal path. Our extensive computational results demonstrate that the proposed method can find optimal paths for large networks in very attractive times.  相似文献   

5.
In this paper, the optimal control problem is governed by weak coupled parabolic PDEs and involves pointwise state and control constraints. We use measure theory method for solving this problem. In order to use the weak solution of problem, first problem has been transformed into measure form. This problem is reduced to a linear programming problem. Then we obtain an optimal measure which is approximated by a finite combination of atomic measures. We find piecewise-constant optimal control functions which are an approximate control for the original optimal control problem.  相似文献   

6.
《Optimization》2012,61(1):137-155
In this we study a wide class of optimal path problem in acyclic digraphs, where path lengths are defined through associative binary operations:addition, multiplication, multiplication-addition, fraction and so on. Solving a system of two interrelated recur-sive equations, we simultaneously find both shortest and longest path lengths, Further, for every problem (primal problem), we associate the other related problem (negative-equivalent problem) where each path length is defined through the associative operation connected to it in the primal problem by DeMorgan’s law. The main objective of this paper is to derive a negative-equivalency theorem between the primal problem and the negative-equivalent one  相似文献   

7.
The goal of planning a horizontal well path is to obtain a trajectory that arrives at a given target subject to various constraints. In this paper, the optimal control problem subject to a nonlinear multistage dynamical system (NMDS) for horizontal well paths is investigated. Some properties of the multistage system are proved. In order to derive the optimality conditions, we transform the optimal control problem into one with control constraints and inequality-constrained trajectories by defining some functions. The properties of these functions are then discussed and optimality conditions for optimal control problem are also given. Finally, an improved simplex method is developed and applied to the optimal design for well Ci-16-Cp146 in Oil Field of Liaohe, and the numerical results illustrate the validity of both the model and the algorithm.  相似文献   

8.
In this paper, we establish the existence of the optimal control for an optimal control problem where the state of the system is defined by a variational inequality problem with monotone type mappings. Moreover, as an application, we get several existence results of an optimal control for the optimal control problem where the system is defined by a quasilinear elliptic variational inequality problem with an obstacle.  相似文献   

9.
In this paper we describe the algorithm OPTCON which has been developed for the optimal control of nonlinear stochastic models. It can be applied to obtain approximate numerical solutions of control problems where the objective function is quadratic and the dynamic system is nonlinear. In addition to the usual additive uncertainty, some or all of the parameters of the model may be stochastic variables. The optimal values of the control variables are computed in an iterative fashion: First, the time-invariant nonlinear system is linearized around a reference path and approximated by a time-varying linear system. Second, this new problem is solved by applying Bellman's principle of optimality. The resulting feedback equations are used to project expected optimal state and control variables. These projections then serve as a new reference path, and the two steps are repeated until convergence is reached. The algorithm has been implemented in the statistical programming system GAUSS. We derive some mathematical results needed for the algorithm and give an overview of the structure of OPTCON. Moreover, we report on some tentative applications of OPTCON to two small macroeconometric models for Austria.  相似文献   

10.
11.
This paper deals with a class of optimal control problems in which the system is governed by a linear partial differential equation and the control is distributed and with constraints. The problem is posed in the framework of the theory of optimal control of systems. A numerical method is proposed to approximate the optimal control. In this method, the state space as well as the convex set of admissible controls are discretized. An abstract error estimate for the optimal control problem is obtained that depends on both the approximation of the state equation and the space of controls. This theoretical result is illustrated by some numerical examples from the literature.  相似文献   

12.
In this paper, we study the optimal control problem for the viscous weakly dispersive Degasperis-Procesi equation. We deduce the existence and uniqueness of a weak solution to this equation in a short interval by using the Galerkin method. Then, according to optimal control theories and distributed parameter system control theories, the optimal control of the viscous weakly dispersive Degasperis-Procesi equation under boundary conditions is given and the existence of an optimal solution to the viscous weakly dispersive Degasperis-Procesi equation is proved.  相似文献   

13.
In this paper a class of infinite horizon optimal control problems with an isoperimetrical constraint, also interpreted as a budget constraint, is considered. Herein a linear both in the state and in the control dynamic is allowed. The problem setting includes a weighted Sobolev space as the state space. For this class of problems, we establish the necessary optimality conditions in form of a Pontryagin Type Maximum Principle including a transversality condition. The proved theoretical result is applied to a linear–quadratic regulator problem.  相似文献   

14.
1 引言 线性泛函的逼近问题有着十分广泛的应用背景,本文在具有再生核的W_2~1[a,b]空间中讨论线性泛函L(f)的形如 L_n(f)=sum from i=1 to n(i/1)w_if(x_i) (1)的逼近问题,其中{w_i}_1~n是待定系数,如果存在一组常数{w_i~x}_1~n使 L_n~x=sum from i=1 to n(i/1)w_i~xf(x_i) (2)满足||L—L_n~x||=inf||L—L_n||,则称L_n~x是L的最佳逼近,记 w_i E_n=L—L_n, E_n~3=L—L_n~x,则称E_n~x是最佳逼近误差泛函。 本文在§1中给出L_n~x的表达式及L_(n+1)~x与L_n~x之间的递推公式。并证明L_n~x的收敛性。§3中讨论了上L_n~x(f)在数值积分及常微分方程数值解中的应用,并给出数值算例。  相似文献   

15.
The Tonelli existence theorem in the calculus of variations and its subsequent modifications were established for integrands f which satisfy convexity and growth conditions. In this paper we consider a large class of optimal control problems which is identified with a complete metric space of integrands without convexity assumptions and show that for a generic integrand the corresponding optimal control problem possesses a unique solution and this solution is Lipschitzian.  相似文献   

16.
We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also present the numerical schemes to solve several examples arising in science and technology.  相似文献   

17.
In this paper, we consider a class of optimal control problem involving an impulsive systems in which some of its coefficients are subject to variation. We formulate this optimal control problem as a two-stage optimal control problem. We first formulate the optimal impulsive control problem with all its coefficients assigned to their nominal values. This becomes a standard optimal impulsive control problem and it can be solved by many existing optimal control computational techniques, such as the control parameterizations technique used in conjunction with the time scaling transform. The optimal control software package, MISER 3.3, is applicable. Then, we formulate the second optimal impulsive control problem, where the sensitivity of the variation of coefficients is minimized subject to an additional constraint indicating the allowable reduction in the optimal cost. The gradient formulae of the cost functional for the second optimal control problem are obtained. On this basis, a gradient-based computational method is established, and the optimal control software, MISER 3.3, can be applied. For illustration, two numerical examples are solved by using the proposed method.  相似文献   

18.
In this paper, we present a new approach to solve a class of optimal discrete-valued control problems. This type of problem is first transformed into an equivalent two-level optimization problem involving a combination of a discrete optimization problem and a standard optimal control problem. The standard optimal control problem can be solved by existing optimal control software packages such as MISER 3.2. For the discrete optimization problem, a discrete filled function method is developed to solve it. A numerical example is solved to illustrate the efficiency of our method.  相似文献   

19.
In this article, we deal with a control problem for a singular system regarding a phase-field model which describes a solid–liquid transition by the Ginzburg–Landau theory. The purpose is to control the system by the means of the heat supply r able to guide it into a certain state with a solid (or liquid) part in a prescribed subset Ω0 of the space domain Ω, and maintain it in this state during a period of time. The transition is described by a nonlinear differential system of two equations for the phase field and temperature. The control problem is set for some expressions of the cost functional which might reveal cases of physical interest. An approximating control problem is introduced and the existence of at least an optimal pair is proved. The first-order optimality conditions for the approximating problem are determined and a convergence result is given.  相似文献   

20.
基于高斯伪谱的最优控制求解及其应用   总被引:2,自引:0,他引:2  
研究一种基于高斯伪谱法的具有约束受限的最优控制数值计算问题.方法将状态演化和控制规律用多项式参数化近似,微分方程用正交多项式近似.将最优控制问题求解问题转化为一组有约束的非线性规划求解.详细论述了该种近似方法的有效性.作为该种方法的应用,讨论了一个障碍物环境下的机器人最优路径生成问题.将机器人路径规划问题转化为具有约束条件最优控制问题,然后用基于高斯伪谱的方法求解,并给出了仿真结果.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号