Reduced-order output feedback controllers for discrete-time systems

This article considers the stabilization by output feedback controllers for discrete-time systems. The controller can place all of the closed-loop poles within a specified disk D(-α, 1/β), centred at (-α,0) with radius 1/β, where | - α|  + 1/β < 1. The design method involves the decomposition of the system into two portions. The first portion comprises of all of the poles that are lying outside of the specified disk. A reduced-order model is constructed for this portion. The second portion comprises of all of the remaining poles of the system and is characterized by an H_∞-norm bound. The controller design is then accomplished by using H_∞-control theory. It is shown that, subject to the solvability of an algebraic Riccati equation, output feedback controllers can be systematically derived. The order of the controller is low, and can be as low as the number of the open-loop poles that are lying outside of the specified disk. A step-by-step design algorithm is provided. Numerical examples are given to illustrate the attractiveness of the design method.

An analysis of update ordering in distributed replication systems

This paper analyses update ordering and its impact on the performance of a distributed replication system. We propose a model for update orderings and constraints and develop a number of algorithms for implementing different ordering constraints. A performance study is then carried out to analyse the update-ordering model. We show that our model allows the definition of an ordering constraint on each update operation, and the ordering implementation takes account of detailed inter-operation semantics denoted by commutative operations and causal operations to reduce unnecessary delay and results in a better response time for update requests.

Distributed power control in cellular mobile radio systems with time-varying link gains

A simple distributed power control algorithm for communication systems with mobile users and unknown time-varying link gains is proposed. We prove that the proposed algorithm is exponentially converging. Furthermore, we show that the algorithm significantly outperforms the well-known Foschini and Miljanic algorithm in the case of quickly moving mobile users.

Delay control and parallel admission algorithms for real-time anycast flow

An anycast flow is a flow that can be connected to any one of the members in a group of designated (replicated) servers (called anycast group). In this paper, we derive a set of formulas for calculating the end-to-end delay bound for the anycast flows and present novel admission control algorithms for anycast flows with real-time constraints. Given such an anycast group, our algorithms can effectively select the paths for anycast flows' admission and connection based on the least end-to-end delay bounds evaluated. We also present a parallel admission control algorithm that can effectively calculate the available paths with a short delay bound for different destinations in the anycast group so that a best path with the shortest delay bound can be chosen.

Bringing Japanese manufacturing systems to America: the feasibility of implementing just-in-time production in the United States

This paper addresses the feasibility of implementing Japanese manufacturing systems in the United States. The recent success of Japanese transplant companies suggests that Just-In-Time (JIT) production is possible within America's industrial environment. Once American workers receive proper training, they have little difficulty participating in rapid setup procedures and utilizing the kanban system. Japanese transplants are gradually developing Japanese-style relationships with their American supplier companies by initiating long-term, mutually beneficial agreements. They are also finding ways to cope with America's problem of distance, which is steadily decreasing as an obstacle to JIT delivery. American companies, however, encounter Significant problems in trying to convert traditionally organized, factories to the JIT system. This paper demonstrates that it is both feasible and beneficial for American manufacturers to implement JIT production techniques. Many of the difficulties manufacturers experience center around a general lack of information about JIT. Once a company realizes its potential for setup-time reduction, a prerequisite for the JIT system, workers and managers can work together to create a new process for handling equipment changeover. Significant results are possible with minimal investment. Also, supervisors often do not realize that the JIT method of ordering goods from suppliers is compatible with current systems. This "kanban system" not only enhances current systems but also reduces the amount of paperwork and scheduling involved. When arranging JlT delivery of supplier goods, American manufacturers tend to overlook important aspects of JIT supplier management. However, by making long-tenn commitments, initiating the open exchange of information, assisting suppliers in reaching new standards of performance, increasing the level of conununication, and relying more on suppliers' engineering capabilities, even American manufacturers can develop Japanese-style supplier relationships that enhance the effectiveness of the system.

Robust strictly positive real synthesis of polynomial segments for discrete time systems

By using the result of robust strictly positive real synthesis of polynomial segments for continuous time systems, it is proved that, for any two n-th order polynomials a(z) and b(z), the Schur stability of their convex combination is necessary and sufficient for the existence of an n-th order polynomial c(z) such that c(z)/a(z) and c(z)/b(z) are both strictly positive real. We also provide the construction method of c(z). Illustrative examples are provided to show the effectiveness of this method.

Performance optimization for energy-aware adaptive checkpointing in embedded real-time systems

Using additional store-checkpoinsts (SCPs) and compare-checkpoints (CCPs), we present an adaptive checkpointing for double modular redundancy (DMR) in this paper. The proposed approach can dynamically adjust the checkpoint intervals. We also design methods to calculate the optimal numbers of checkpoints, which can minimize the average execution time of tasks. Further, the adaptive checkpointing is combined with the DVS (dynamic voltage scaling) scheme to achieve energy reduction. Simulation results show that, compared with the previous methods, the proposed approach significantly increases the likelihood of timely task completion and reduces energy consumption in the presence of faults.

Distributed power control in cellular mobile radio systems with time-varying link gains

A simple distributed power control algorithm for communication systems with mobile users and unknown timevarying link gains is proposed. We prove that the proposed algorithm is exponentially converging. Furthermore, we show that the algorithm significantly outperforms the well-known
Foschini and Miljanic algorithm in the case of quickly moving mobile users.

Robust filtering for uncertain discrete-time systems with uncertain noise covariance and uncertain observations

The use of Kalman filtering is very common in state estimation problems. The problem with Kalman filters is that they require full prior knowledge about the system modeling. It is also assumed that all the observations are fully received. In real applications, the previous assumptions are not true all the time. It is hard to obtain the exact system model and the observations may be lost due to communication problems. In this paper, we consider the design of a robust Kalman filter for systems subject to uncertainties in the state and white noise covariances. The systems under consideration suffer from random interruptions in the measurements process. An upper bound for the estimation error covariance is proposed. The proposed upper bound is further minimized by selection of optimal filter parameters. Simulation example shows the effectiveness of the proposed filter.

Robust finite-time consensus tracking algorithm for multirobot systems

This paper studies the finite-time consensus tracking control for multirobot systems. We prove that finite-time consensus tracking of multiagent systems can be achieved on the terminal sliding-mode surface. Also, we show that the proposed error function can be modified to achieve relative state deviation between agents. These results are then applied to the finite-time consensus tracking control of multirobot systems with input disturbances. Simulation results are presented to validate the analysis.

Adaptive fast finite time control of a class of uncertain nonlinear systems

This paper concerns the adaptive fast finite time control of a class of nonlinear uncertain systems of which the upper bounds of the system uncertainties are unknown. By using the fast non-smooth control Lyapunov function and the method of so-called adding a power integrator merging with adaptive technique, a recursive design procedure is provided, which guarantees the fast finite time stability of the closed-loop system. It is proved that the control input is bounded, and a simulation example is given to illustrate the effectiveness of the theoretical results.

Prototyping real-time systems using Petri net and object-oriented models

The objective of the research for this thesis is to develop techniques in order to build an executable model of a real-time system. This model is to be used early in the development of the system not only to detect errors in the specification of the system but also to validate expectations of the developer as to the operation of the system. A graphical specification of a real-time system called the transformation schema was chosen to be used to build the model. Two executable models of a real-time system are described.

Real-time early infectious outbreak detection systems using emerging technologies

The use of emerging technologies ( such as RFID - Radio Frequency Identification and remote sensing) can be employed to reduce health care costs and also to facilitate the automatic streamlining of infectious disease outbreak detection and monitoring processes in local health departments. It can assist medical practitioners with fast and accurate diagnosis and treatments. In this paper we outline the design and application of a real-time RFID and sensor-base Early Infectious (e.g., cholera) Outbreak Detection and Monitoring (IODM) system for health care.

Fast finite-time consensus of a class of high-order uncertain nonlinear systems

This paper poses and solves a new problem of consensus control where the task is to make the fixed-topology multi-agent network, with each agent described by an uncertain nonlinear system in chained form, to reach consensus in a fast finite time. Our development starts with a set of new sliding mode surfaces. It is proven that, on these sliding mode surfaces, consensus can be achieved if the communication graph has the proposed directed spanning tree. Next, we introduce the multi-surface sliding mode control to drive the sliding variables to the sliding mode surfaces in a fast finite time. The control Lyapunov function for fast finite time stability, motivated by the fast terminal sliding mode control, is used to prove the reachability of the sliding mode surface. A recursive design procedure is provided, which guarantees the boundedness of the control input.