实时离散事件动态系统的状态行为与最速控制

基于Ｄ－自动机模型，通过广义状态谓词空间与半范数的概念，深入研究了实时ＤＥＤＳ的状态行为及最速控制问题，最后讨论了此类控制问题解的存在性。     

基于细化的对象分析和设计方法

面向对象的开发方法是一种很有前途的软件开发方法．它通过对应用系统的问题空间对象直接建模，然后将它们同态映射到解空间，使应用易理解、易维护．然而，对于大而复杂的应用系统，这种方法较难识别问题空间中的对象．本文在比较了功能化和面向对象的开发这两种方法后，提出了一种基于细化的对象分析和设计方法ＲＯＡＤ．     

离散事件系统的一种最优监控综合方法

本文基于ＤＥＳ的Ｄ－自动机模型，提出一种最优监控综合问题，然后讨论了该问题解的存在性，最后利用极小代数给出了求解该问题的方法。     

精确求解一类动态规划问题的神经网络

根据一类动态规划问题（ＤＦＤＰ）的特点，提出一种能够精确求解此问题的神经网络（ＬＤＰＮＮ）。ＬＤＰＮＮ具有结构简单、易于硬件实现、求解速度快并且能够求得精确最优解等优点，特别适合于大规模动态规划问题的求解。在复杂系统的实时优化与控制等方面具有广阔的应用前景。     

病态对象的鲁棒性能设计*

病态对象因为其高条件数的特点为系统的鲁棒性能设计带来困难，μ综合中Ｍ阵具有四块结构，适于求解这类病态问题，而且结构奇异值μ是鲁棒性能的充要判据。本文给出Ｄ－Ｋ迭代中初值Ｄ０阵的选取方法，可以较快地求得μ综合解，文中还以精馏塔鲁棒控制设计为例进行了说明。     

非线性时滞系统次优控制的逐次逼近法

对状态变量含有时滞的非线性系统的次优控制问题进行了研究，提出了一种次优控制的逐次逼近设计方法．针对由最优控制理论导出的既含有时滞项又含有超前项的非线性两点边值问题，构造了其解序列一致收敛于原问题最优解的非齐次线性两点边值问题序列．从而将两点边值问题解序列的有限次迭代结果作为系统的次优控制律．仿真结果表明了所提出方法的有效性．     

空速/高度精确解耦跟踪控制研究及仿真

飞行器空速／高度的精确解耦跟踪,控制本质上是非最小相位输出精确解耦跟踪控制问题,由于存在内动态不稳定性,经典逆系统方法无法使用。将稳定逆办法与滑模控制相结合来解决存在的问题。首先针对稳定逆非因果性带来的问题,给出了一种稳定逆因果近似解的求法,经计算证明了近似结果误差的渐近收敛特性;然后利用稳定逆困果近似解将输出跟踪问题转化为不确定系统的鲁棒镇定问题,并对滑模控制和干扰观测器设计了相应的反馈镇定控制器。经过仿真表明综合稳定逆因果近似解和滑模控制的方案既发挥了逆系统方法的动态解耦能力,又利用了滑模控制的鲁棒性实现飞行器空速／高度精确解耦跟踪控制,也可以很好的兼顾控制器的鲁棒性和抗干扰性。     

2－DRoesser模型的静态干扰解耦

本文讨论了２－ＤＲｏｅｓｓｅｒ模型［１］（ＲＭ）的静态干扰解耦问题［２］（简称为２－ＤＤＤＰ），即寻求２－Ｄ状态反馈使相应的闭环系统具有抗干扰的能力，得到了问题有解的充分条件和计算相应反馈阵的算法．     

带正弦干扰的线性时滞系统的次优控制

研究状态变量含有时滞的线性系统在正弦干扰下的前馈反馈次优减振控制问题，首先构造其解收敛于原时滞系统的无时滞系统序列；然后将时滞系统的最优控制问题化为无时滞系统的最优控制序列问题；最后通过截取最优控制序列解的有限项，得到系统的前馈反馈次优控制律，仿真结果表明，该方法抑制正弦干扰的鲁棒性优于经典反馈最优控制。     

精确求解一类动态规划问题的神经网络

根据一类动态规划问题的特点，提出一种能够精确求解此问题的神经网络。ＬＤＰＮＮ具有结构简单、易于硬件实现、求解速度快并且能够求得精确最优解等优点，特点适合于大规模动态规划问题的求解。在复杂系统的实时优化与控制等方面具有广阔的应用前景。     

Supervisory control and reactive synthesis: a comparative introduction

This paper presents an introduction to and a formal connection between synthesis problems for discrete event systems that have been considered, largely separately, in the two research communities of supervisory control in control engineering and reactive synthesis in computer science. By making this connection mathematically precise in a paper that attempts to be as self-contained as possible, we wish to introduce these two research areas to non-expert readers and at the same time to highlight how they can be bridged in the context of classical synthesis problems. After presenting general introductions to supervisory control theory and reactive synthesis, we provide a novel reduction of the basic supervisory control problem, non-blocking case, to a problem of reactive synthesis with plants and with a maximal permissiveness requirement. The reduction is for fully-observed systems that are controlled by a single supervisor/controller. It complements prior work that has explored problems at the interface of supervisory control and reactive synthesis. The formal bridge constructed in this paper should be a source of inspiration for new lines of investigation that will leverage the power of the synthesis techniques that have been developed in these two areas.     

一个安全可靠的远程组态监控系统的设计与实现

针对国内外现有监控软件系统远程监控部分的不足,本文分析并有效地解决了在设计实现远程监控与组态系统中的几个关键问题,尤其是系统的安全性问题,在此基础上详细描述了一个实际系统iCon21的体系结构、功能组成及应用评价。     

Decentralized supervisory control with communicating controllers

The decentralized control problem for discrete-event systems addressed in this paper is that of several communicating supervisory controllers, each with different information, working in concert to exactly achieve a given legal sublanguage of the uncontrolled system's language model. A novel information structure model is presented for dealing with this class of problems. Existence results are given for the cases of when controllers do and do not anticipate future communications, and a synthesis procedure is given for the case when controllers do not anticipate communications. Several conditions for optimality of communication policies are presented, and it is shown that the synthesis procedure yields solutions, when they exist for this class of controllers, that are optimal with respect to one of these conditions     

The infimal closed controllable superlanguage and its applicationin supervisory control

The supervisory control of discrete-event systems is investigated for the case in which nonblocking solutions are deemed inadequate because they are too conservative. For this purpose the infimal closed controllable superlanguage of a given language is studied. Two characterizations of the superlanguage are given, some of its properties are presented, and algorithms for its computation in the general case and in the regular case are proposed. An algorithm for the computation of the supremal controllable sublanguage is presented. It is shown that the computation of the infimal closed controllable superlanguage plays a central role in problems that involve a tradeoff between satisficing and blocking. The completely satisficing solution in supervisory control is characterized, and a general control problem called the supervisory control problem with blocking is introduced     

Model matching for finite-state machines

The problem of model matching for finite state machines (FSMs) consists of finding a controller for a given open-loop system so that the resulting closed-loop system matches a desired input-output behavior. In this paper, a set of model matching problems is addressed: strong model matching (where the reference model and the plant are deterministic FSMs and the initial conditions are fixed), strong model matching with measurable disturbances (where disturbances are present in the plant), and strong model matching with nondeterministic reference model (where any behavior out of those in the reference model has to be matched by the closed-loop system). Necessary and sufficient conditions for the existence of controllers for all these problems are given. A characterization of all feasible control laws is derived and an efficient synthesis procedure is proposed. Further, the well-known supervisory control problem for discrete-event dynamical systems (DEDSs) formulated in its basic form is shown to be solvable as a strong model matching problem with measurable disturbances and nondeterministic reference model     

The computational complexity of decentralized discrete-eventcontrol problems

Computational complexity results are obtained for decentralized discrete-event control problems. These results generalize the earlier work of Tsitsiklis (1989), who showed that for a special class of centralized supervisory control problems under partial observation, there is an algorithm for determining in polynomial time whether or not a solution exists. The negative complexity results associated with Tsitsiklis work also carry over to the decentralized case, so that solution existence for the more general class is not decidable in polynomial time, nor does there exist a polynomial-time algorithm for producing supervisor solutions when such solutions exist     

Supervisory control of (max,+) automata: extensions towards applications

In this paper, supervisory control of (max,+) automata is studied. The synthesis of maximally permissive and just-in-time supervisor, as well as the synthesis of minimally permissive and just-after-time supervisor, are proposed. Results are also specialised to non-decreasing solutions, because only such supervisors can be realised in practice. The inherent issue of rationality raised recently is discussed. An illustration of concepts and results is presented through an example of a flexible manufacturing system.     

Supervisory control of modular systems with global specification languages

The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synthesized for each module separately and the supervisory control consists of the parallel composition of the modular supervisory controls. The general case of the specification that is indecomposable and not necessarily contained in the plant language, which is often the case in practice, is considered. The usual assumption that all shared events are controllable is relaxed by introducing two new structural conditions relying on the global mutual controllability condition. The novel concept used as a sufficient structural condition is strong global mutual controllability. The main result uses a weaker condition called global mutual controllability together with local consistency of the specification. An example illustrates the approach.     

面向对象远程监控系统框架研究

针对目前远程监控系统开发成本高、大量冗余局部解决方案的现状 ,提出了可复用远程监控系统框架的通用解决方案 .通过抽取远程监控系统的基本逻辑模型 ,建立了易于扩展、可复用的远程监控系统基本框架 ,从而在大大减少重复劳动、提高劳动生产率的同时 ,促进各方面性能都比较优越的远程监控系统的诞生 .并通过某小型变电站应用实例验证了本方案的可行性以及应用前景     

Characterization of the smoothness of optimal periodic control problem solutions

Optimal periodic control problems with integrable or square-integrable control variables are considered. Necessary conditions for optimality, specific features of the set of feasible solutions and the system complex structure are exploited to characterize the smoothness of optimal solutions or all feasible solutions. It is shown that the above devices and the Hardy-Littlewood theorems on Lipschitz classes allow the integral characterization of the control and state continuity for basic practical situations. The importance of such characterization for the trigonometric approximation of optimal periodic control problems is emphasized. The theoretical considerations are illustrated by examples of control problems from the field of chemical engineering.