An alternative approach for non-linear optimal control problems based on the method of moments

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.     

Nonparametric estimation and adaptive control in a class of finite Markov decision chains

We consider a class of Markov decision processes withfinite state and action spaces which, essentially, is determined by the following condition: The state space isirreducible under the action of any stationary policy. However, except by this restriction, the transition law iscompletely unknown to the controller. In this context, we find a set of policies under which thefrequency estimators of the transition law are strongly consistent and then, this result is applied to constructadaptive asymptotically discount-optimal policies.Dedicated to Professor Truman O. Lewis, on the occasion of his sixtieth birthdayThis research was supported in part by the Third World Academy of Sciences (TWAS) under Grant TWAS RG MP 898-152, and in part by the Consejo Nacional de Ciencia y Tecnología (CONACYT) under Grant A128CCOEO550 (MT-2).     

B－ISDN中的拥塞控制技术

Ｂ－ＩＳＤＮ是现代电信网的发展方向，拥塞控制技术则是其中的一个重要问题。由于Ｂ－ＩＳＤＮ采用新的信息传递方式──ＡＴＭ，使传统的拥塞控制方法不再适用。本文依据ＩＴＵ－Ｔ有关建议的最新内容对Ｂ－ＩＳＤＮ拥塞控制的基本思想、工作机制以及其中的主要功能作了较为详细的分析讨论，并提出了一些Ｂ－ＩＳＤＮ拥塞控制技术中尚需进一步研究的问题。     

Optimal production control of a dynamic two-product manufacturing system with setup costs and setup times

This paper deals with the optimal control of a one-machine two-product manufacturing system with setup changes, operating in a continuous time dynamic environment. The system is deterministic. When production is switched from one product to the other, a known constant setup time and a setup cost are incurred. Each product has specified constant processing time and constant demand rate, as well as an infinite supply of raw material. The problem is formulated as a feedback control problem. The objective is to minimize the total backlog, inventory and setup costs incurred over a finite horizon. The optimal solution 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 is determined. To solve the transient case, the system's state space is partitioned into mutually exclusive regions such that with each region, the optimal control policy is determined analytically.     

实时专家智能控制系统与外部控制过程的数据通信

本文介绍一个实时专家智能控制系统EICS.文中着重简述了专家系统与控制过程的数据通信方法、程序接口.     

多功能滚齿机的数字控制系统

本文叙述了以ＳＴＤＰＣ／ＸＴ（或ＰＣ／ＡＴ）机为主要核心构成的滚齿机数字控制系统的结构，软件设计和特点，系统采用混合语言编程，极大地提高了软件设计的灵活性与快速性，也分析了ＣＮＣ系统的加工过程，提出了加工中的软件预处理控制方法，并给出了轴伺服控制的并行算法分析与实现。     

128kb／s电视电话系统中数码率缓存器的控制策略研究

本文探讨了电视电话／会议电视的Ｈ，２６１建议中低码率时（ｐ＝２）数码率缓存器的控制问题，提出一种既有宏观预分配又有微观分割的控制策略（简称ＧＡＬＳ），并用测试图像序列进行了计算机模拟。将本文方法与ＲＭ８中有关策略作了比较，实验结果表明图像的主观质量有所改善。     

On the departure process of a leaky bucket system with long-range dependent input traffic

Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range dependence, it is important to study the possible implications that such traffic may have for the design and performance of these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite variance, and a regularly varying tail, i.e., P(τ >К) ~ К^-Lα L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination. We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

GDDP: Generalized Dual Dynamic Programming Theory

This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7].     

Optimal control problems with applications to the elimination of substrate diffusing and convecting through immobilized enzyme

Some optimization problems concerning a substrate in a fluid are considered. The concentration of the substrate is affected by diffusion, convection, and elimination by enzymes, and the problem is to find the optimal distribution of enzymes. In this paper, the rate of elimination and the transmission coefficient are optimized. Mathematically, these problems are optimal control problems, and they are analyzed by means of Pontryagin's maximum principle.