Optimal control and optimal trajectories of regional macroeconomic dynamics based on the Pontryagin maximum principle

The Pontryagin maximum principle is used to prove a theorem concerning optimal control in regional macroeconomics. A boundary value problem for optimal trajectories of the state and adjoint variables is formulated, and optimal curves are analyzed. An algorithm is proposed for solving the boundary value problem of optimal control. The performance of the algorithm is demonstrated by computing an optimal control and the corresponding optimal trajectories.     

冲裁件有约束最优剪切方式的设计

本文讨论冲裁件有约束最优剪切方式的设计问题 .阐明最优剪切排样方式的规范结构 ;采用分支定界法求解冲裁件无约束排样问题 ;将有约束排样问题转换为求解一系列的无约束排样问题 ,并通过对解的性质分析提高算法效率 .实验计算结果说明本文算法十分有效 .最后给出一例题的最优排样方式 .     

Revisit of Linear-Quadratic Optimal Control

The classical finite-dimensional linear-quadratic optimal control problem is revisited. A new linear-quadratic control problem with linear state penalty terms but without quadratic state penalty terms, is introduced. An optimal control exists and the closed-form optimal solution is given. It is remarkable that feedback action plays no role and state information does not feature in the optimal control. The optimal cost function, rather than being quadratic, is linear in the initial state.     

Interval optimal control problem in a Hilbert space

An optimal control problem for a system involving an interval parameter is considered. The concepts of a universal optimal state and a universal optimal control are introduced. The existence and uniqueness of a universal solution to the interval optimal control problem is proved, and an algorithm for its determination is presented. The interval optimal control problem for a system described by the boundary value problem for a second-order ordinary differential equation is solved as an example.     

OPTIMAL HARVESTING WITH DENSITY DEPENDENT RANDOM EFFECTS

We consider the effect of sudden large, randomly occurring density dependent disasters on the optimal harvest policy and optimal expected return for an exploited population. The population is assumed to grow logistically with disasters occurring on a time scale very short compared to the natural growth scale. The case of a density dependent disaster frequency is also treated. Stochastic dynamic programming is used in the optimization. For a set of realistic field data it is found that random effects typically have a significant effect on both optimal return and optimal effort levels. The effect of density dependence is far more pronounced for optimal return than for optimal effort levels.     

Sensitivity analysis of the optimal assignment

This paper concentrates on sensitivity analysis of the optimal solution for the assignment problem (AP). Due to the high degeneracy of the AP, traditional sensitivity analysis, which determines the range in which the current optimal basis remains optimal, is impractical. Thus, changing the optimal basis does not ensure that the optimal assignment will be changed. Herein we investigate the properties of the AP and then propose several lemmas to determine two other types of sensitivity range. The first type is used to determine the range in which the current optimal assignment remains optimal. We further discuss what is the new optimal assignment when the changes surpass the range. The second type of sensitivity range is to determine those values of assignment model parameters for which the rate of change of optimal value function remains constant. An example is presented in order to demonstrate that the approaches are useful in practice.     

Nonlinear optimal feedback control for lunar module soft landing

In this paper, the task of achieving the soft landing of a lunar module such that the fuel consumption and the flight time are minimized is formulated as an optimal control problem. The motion of the lunar module is described in a three dimensional coordinate system. We obtain the form of the optimal closed loop control law, where a feedback gain matrix is involved. It is then shown that this feedback gain matrix satisfies a Riccati-like matrix differential equation. The optimal control problem is first solved as an open loop optimal control problem by using a time scaling transform and the control parameterization method. Then, by virtue of the relationship between the optimal open loop control and the optimal closed loop control along the optimal trajectory, we present a practical method to calculate an approximate optimal feedback gain matrix, without having to solve an optimal control problem involving the complex Riccati-like matrix differential equation coupled with the original system dynamics. Simulation results show that the proposed approach is highly effective.     

Application of linear programming techniques for controlling linear dynamic plants in real time

The problem of controlling a linear dynamic plant in real time given its nondeterministic model and imperfect measurements of the inputs and outputs is considered. The concepts of current distributions of the initial state and disturbance parameters are introduced. The method for the implementation of disclosable loop using the separation principle is described. The optimal control problem under uncertainty conditions is reduced to the problems of optimal observation, optimal identification, and optimal control of the deterministic system. To extend the domain where a solution to the optimal control problem under uncertainty exists, a two-stage optimal control method is proposed. Results are illustrated using a dynamic plant of the fourth order.     

A numerical method for an optimal control problem with minimum sensitivity on coefficient variation

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.     

More on the Problem and the Solution of the Optimal Shape of a Javelin

The analogy between the optimal javelin problem and the problem of determining the optimal shape of the free rotating rod has been established and employed to determine the optimal shape of the javelin via Pontryagin's maximum principle. Five distinct variational principles are constructed for boundary value problem describing optimal shape of the javelin. The first integral for this nonlinear system is found. An a priori estimate of the cross-sectional area is obtained. The optimal shape of the javelin or free rotating rod is determined by numerical integration.     

一类半线性时变种群系统的最优捕获控制

讨论了年龄相关的半线性时变种群系统的最优捕获控制问题.根据微积分方程及泛函分析的知识证明了最优捕获控制的存在性,得到了捕获控制为最优的必要条件.     

需求中断下具有提前期的双渠道供应链的风险规避决策

讨论了由一个制造商和一个零售商所组成的双渠道供应链在需求中断下具有提前期的双渠道供应链的风险规避问题.给出了在需求中断前后的最优价格、最优提前期和最优生产决策.研究表明决策变化量是需求中断量的线性函数,在集中式下最优的决策和销售量与供应链的市场份额和需求中断有关,模型的最优生产体现了一定的稳健性.对于提前期来说,当市场份额较大时,最优提前期关于风险规避系数呈正比例,当市场份额较小时,最优提前期关于风险规避系数呈反比例.     

An optimality principle for Markovian decision processes

The following optimality principle is established for finite undiscounted or discounted Markov decision processes: If a policy is (gain, bias, or discounted) optimal in one state, it is also optimal for all states reachable from this state using this policy. The optimality principle is used constructively to demonstrate the existence of a policy that is optimal in every state, and then to derive the coupled functional equations satisfied by the optimal return vectors. This reverses the usual sequence, where one first establishes (via policy iteration or linear programming) the solvability of the coupled functional equations, and then shows that the solution is indeed the optimal return vector and that the maximizing policy for the functional equations is optimal for every state.     

Deterministic optimal maneuver strategy for multi-target missions

This paper presents an optimal strategy for making impulsive correction to a multi-target trajectory by a single maneuver. The concept of an optimal maneuver time is introduced. The choice of suitable weighting functions is explored to enable one to properly translate the subjective desire of mission success into an objective cost function whose minimization yields the optimal strategy. It is shown that a number of strategies previously formulated are derivable from one general expression. A number of other interesting properties of the optimal strategy are described. Numerical results are presented for a typical two-target mission. It is shown that the strategy formulated is optimal. For some perturbations, there exists an optimal maneuver time different from the time of initiation of the perturbation. That is, the physical properties of the trajectory can be exploited to select the optimal time of making a corrective maneuver.     

Finding the optimum domain of a nonlinear wave optimal control system by measures

We will explain a new method for obtaining the nearly optimal domain for optimal shape design problems associated with the solution of a nonlinear wave equation. Taking into account the boundary and terminal conditions of the system, a new approach is applied to determine the optimal domain and its related optimal control function with respect to the integral performance criteria, by use of positive Radon measures. The approach, say shape-measure, consists of two steps; first for a fixed domain, the optimal control will be identified by the use of measures. This function and the optimal value of the objective function depend on the geometrical variables of the domain. In the second step, based on the results of the previous one and by applying some convenient optimization techniques, the optimal domain and its related optimal control function will be identified at the same time. The existence of the optimal solution is considered and a numerical example is also given.     

分布参数最优控制的边界元共轭梯度算法

研究了一类线性椭圆型分布参数最优控制问题的数值解算法.得到最优控制对应的最优性方程组,在凸性条件下,证明了最优控制的唯一存在性问题.将最优控制问题化为以控制函数和状态函数为局中人的递阶式(Stackelberg)非合作对策问题,其平衡点是最优控制的解.进一步得到求平衡点的边界元共轭梯度算法.最后,研究算法中边界元离散的误差估计,以算例验证该算法.     

Infinite Horizon Sparse Optimal Control

A class of infinite horizon optimal control problems involving nonsmooth cost functionals is discussed. The existence of optimal controls is studied for both the convex case and the nonconvex case, and the sparsity structure of the optimal controls promoted by the nonsmooth penalties is analyzed. A dynamic programming approach is proposed to numerically approximate the corresponding sparse optimal controllers.     

Transient and steady-state analysis of a manufacturing system with setup changes

This paper deals with the optimal scheduling of a one-machine two-product manufacturing system with setup, operating in a continuous time dynamic environment. The machine is reliable. A known constant setup time is incurred when switching over from a part to the other. Each part has specified constant processing time and constant demand rate, as well as an infinite supply of raw material. The problem is formulated as a production flow control problem. The objective is to minimize the sum of the backlog and inventory costs incurred over a finite planning horizon. The global optimal solution, expressed as an optimal feedback control law, provides the optimal production rate and setup switching epochs as a function of the state of the system (backlog and inventory levels). For the steady-state, the optimal cyclic schedule (Limit Cycle) is determined. This is equivalent to solving a one-machine two-product Lot Scheduling Problem. To solve the transient case, the system's state space is partitioned into mutually exclusive regions such that with each region is associated an optimal control policy. A novel algorithm (Direction Sweeping Algorithm) is developed to obtain the optimal state trajectory (optimal policy that minimizes the sum of inventory and backlog costs) for this last case.     

Limiting behavior of bang-bang controls for Sobolev problems

We consider the limiting behavior of optimal bang-bang controls as a family of Sobolev equations formally converges to a wave equation. The weak-starlimit of the sequence of bang-bang controls is an optimal control for the wave equation problem. The associated optimal states converge strongly and, for the optimal time problem, the optimal times converge to the optimal time for the wave equation.This work was supported in part by the National Science Foundation, Grant No. MCS-79-02037.     

Hilbert空间中具无界控制的无限时区线性二次最优控制问题

本文研究了Hilbert空间中一类由解析半群支配的具无界控制的无限时区线性二次最优控制问题,其中指标中的控制项加权算子要求强制而状态项加权算子可允许为不定号.在指数能稳条件下,证明了任意的最优控制及其最优轨线必定连续,建立了正实引理作为此问题唯一可解的充要条件,并用代数Riccati方程的解给出了最优控制的闭环综合。