The problem of correctness and timing of reactions of an agent in interaction with a physical environment is addressed. To this end, a method based on composition of separate models of the software and the environment...
详细信息
The problem of correctness and timing of reactions of an agent in interaction with a physical environment is addressed. To this end, a method based on composition of separate models of the software and the environment...
详细信息
The problem of correctness and timing of reactions of an agent in interaction with a physical environment is addressed. To this end, a method based on composition of separate models of the software and the environment is used. To use available methods within the field of software verification, discrete representations of the continuous components are described systematically. A nontrivial case study within the domain of road traffic is used to illustrate the derivation of discrete models without losing information relevant to the verification task. The different modeling stages involved are shown first within an untimed formalism, and then in a formalism incorporating quantitative time.< >
作者:
Z. PanT. BaşarDecision and Control Laboratory
Coordinated Science Laboratory and the Department of Electrical and Computer Engineering University of Illinois Urbana IL 61801 USA
The optimal control of singularly perturbed stochastic linear systems with exponentiated quadratic cost is studied under perfect state measurements. Both finite and infinite horizon formulations are addressed, and par...
详细信息
The optimal control of singularly perturbed stochastic linear systems with exponentiated quadratic cost is studied under perfect state measurements. Both finite and infinite horizon formulations are addressed, and particular focus is given to the issues of robustness of the solution to unmodeled fast dynamics, and robustness to the precise value of a singular perturbation parameter (say, ∊). An ∊-independent control is constructed by solving two separate (slow and fast) optimal control problems, and combining the optimal controls of these two problems. It is shown that this composite controller achieves a performance level close to the optimal one whenever the full-order problem has a solution. The slow controller, on the other hand, achieves a finite performance level, with some degradation from the optimal one, whenever the fast subsystem is open-loop stable. It is further shown that if the intensity of the noise in the system dynamics decreases to zero, the slow controller also yields a performance close to the optimal one. The paper also delineates the link between this problem with a positively exponentiated cost and a class of deterministic singularly perturbed H ∞ -optimal control problems.
Introduced in this paper is a land-based automatic vehicle location (AVL) expert system in the city and the suburbs environment of Beijing, China. Some issues about the data structure and graphic display are taken int...
详细信息
Introduced in this paper is a land-based automatic vehicle location (AVL) expert system in the city and the suburbs environment of Beijing, China. Some issues about the data structure and graphic display are taken into account. A variety of expert knowledges and rules are stored in static or dynamic data bases for applications. A* algorithm is applied to determine the minimum cost route between the start and goal nodes. An example on route finding is given to show the effectiveness of A* algorithm. The route guidance functions are discussed in some detail. It is shown that the expert system of AVL developed in this paper is successful.< >
This paper describes the development of real-time control technology for the improvement of manufacturing characteristics of reactive ion etchers. A general control strategy is presented as well as supporting experime...
详细信息
This paper describes the development of real-time control technology for the improvement of manufacturing characteristics of reactive ion etchers. A general control strategy is presented as well as supporting experimental results.
It is difficult to recognize character strings from maps, which involve various figures. The authors describe a method for recognizing character strings from these topographical maps. The method consists of a bottom-u...
详细信息
It is difficult to recognize character strings from maps, which involve various figures. The authors describe a method for recognizing character strings from these topographical maps. The method consists of a bottom-up process and a top-down process. First, in the bottom-up process, character candidates are extracted from a map. Second, in the top-down process, these character candidates are grouped into strings using linguistic knowledge of strings. Through the top-down process, character strings are recognized correctly and efficiently from low precise character candidates extracted through the bottom-up process. The method was applied to 13 maps (512/spl times/512 pixels) involving 98 strings. As a result, 95% of 98 strings were extracted correctly.< >
In this paper, we consider the problem of robust pole placement using fixed-order compensation. It is assumed that the coefficients of the numerator and denominator polynomials of the uncertain plant depend muitilinea...
详细信息
In this paper, we consider the problem of robust pole placement using fixed-order compensation. It is assumed that the coefficients of the numerator and denominator polynomials of the uncertain plant depend muitilinearly on the "parameters" and that the design specifications are given in the form of a two-pole dominant model. We present a design methodology for choosing a fixed-order compensator which ensures that all the roots of the closed loop polynomial lie in the regions prescribed by the two-pole dominant model.
Obtains necessary and sufficient conditions for the existence of "approximate" saddle-point solutions in linear-quadratic zero-sum differential games when the state dynamics are defined on multiple (three) t...
详细信息
Obtains necessary and sufficient conditions for the existence of "approximate" saddle-point solutions in linear-quadratic zero-sum differential games when the state dynamics are defined on multiple (three) time scales. These different time scales are characterized in terms of two small positive parameters /spl epsiv//sub 1/ and /spl epsiv//sub 2/, and the terminology "approximate saddle-point solution" is used to refer to saddle-point policies that do not depend on /spl epsiv//sub 1/ and /spl epsiv//sub 2/, while providing cost levels within O(/spl epsiv//sub 1/) of the full-order game. It is shown in the paper that, under perfect state measurements, the original game can be decomposed into three subgames - slow, fast and fastest, the composite saddle-point solution of which make up the approximate saddle-point solution of the original game. Specifically, for the minimizing player, it is necessary to use a composite policy that uses the solutions of all three subgames, whereas for the maximizing player, it is sufficient to use a slow policy. In the finite-horizon case this slow policy could be a feedback policy, whereas in the infinite-horizon case it has to be chosen as an open-loop policy that is generated from the solution and dynamics of the slow subgame. These results have direct applications in the H/sup /spl infin//-optimal control of three-time scale singularly perturbed linear systems under perfect state measurements.< >
The main processes involved in the manufacture of integrated circuits are deposition, lithography, etching, and implantation. This paper describes results on identification and real-time control of reactive ion etcher...
详细信息
The main processes involved in the manufacture of integrated circuits are deposition, lithography, etching, and implantation. This paper describes results on identification and real-time control of reactive ion etchers. Experimental results show that significant disturbances to the etch rate can be attenuated with real-time feedback control.< >
For a given plant transfer function P ( s ) and cone size k, solutions to versions of the absolute stability problem boil down to finding a SPR multiplier Z ( s ) such that [ k ¯ - 1 + P ( s ) ] Z ( s ) is SPR. I...
详细信息
For a given plant transfer function P ( s ) and cone size k, solutions to versions of the absolute stability problem boil down to finding a SPR multiplier Z ( s ) such that [ k ¯ - 1 + P ( s ) ] Z ( s ) is SPR. In this paper, we consider an interval plant P ( s , q , r ) and prove that first order multiplierslead to vertex results when establishing the positive realnells of [ k ¯ - 1 + P ( s , q , r ) ] Z ( s ) . Additionally, we give an example of a second order multiplier and interval plant which fails to have this vertex property. These new results are then applied to the problem of robust stability of time-varying interval systems.
暂无评论