Qianchuan Zhao

Opportunistic Spectrum Access via Periodic Channel Sensing

The problem of opportunistic access of parallel channels occupied by primary users is considered. Under a continuous-time Markov chain modeling of the channel occupancy by the primary users, a slotted transmission protocol for secondary users using a periodic sensing strategy with optimal dynamic access is proposed. To maximize channel utilization while limiting interference to primary users, a framework of constrained Markov decision processes is presented, and the optimal access policy is derived via a linear program. Simulations are used for performance evaluation. It is demonstrated that periodic sensing yields negligible loss of throughput when the constraint on interference is tight.

Optimal Dynamic Spectrum Access via Periodic Channel Sensing

The problem of dynamically accessing a set of parallel channels occupied by primary users is considered. The secondary user is allowed to sense and to transmit in a single channel. By exploiting idle periods between bursty transmissions of primary users, and by using a periodic sensing strategy, optimal dynamic access is achieved by maximizing the throughput of the secondary user while constraining collision probability with the primary user. The optimal dynamic spectrum access problem can then be formulated within the framework of constrained Markov decision processes (CMDPs). The optimal control policy is identified via a linear program, and its performance is analyzed numerically and through Monte Carlo simulations. Finally, we compare the optimal scheme to an ideal benchmark case when simultaneous sensing of all channels is assumed.

Optimal Dynamic Voltage Scaling in Energy-Limited Nonpreemptive Systems with Real-Time Constraints

Dynamic voltage scaling is used in energy-limited systems as a means of conserving energy and prolonging their life. We consider a setting in which the tasks performed by such a system are nonpreemptive and aperiodic. Our objective is to control the processing rate over different tasks so as to minimize energy subject to hard real-time processing constraints. Under any given task scheduling policy, we prove that the optimal solution to the offline version of the problem can be efficiently obtained by exploiting the structure of optimal sample paths, leading to a new dynamic voltage scaling algorithm termed the critical task decomposition algorithm (CTDA). The efficiency of the algorithm rests on the existence of a set of critical tasks that decompose the optimal sample path into decoupled segments within which optimal processing times are easily determined. The algorithm is readily extended to an online version of the problem as well. Its worst-case complexity of both offline and online problems is O(N2)

Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints

The problem of cognitive access of channels of primary users by a secondary user is considered. The transmissions of primary users are modeled as independent continuous-time Markovian on-off processes. A secondary cognitive user employs slotted transmissions, and it senses one of the possible channels before transmission. The objective of the cognitive user is to maximize its throughput subject to collision constraints imposed by the primary users. The optimal access strategy is in general a solution of a constrained partially observable Markov decision process, which involves a constrained optimization in an infinite dimensional functional space. It is shown in this paper that, when the collision constraints are tight, the optimal access strategy can be implemented by a simple memoryless access policy with periodic channel sensing. Numerical results are presented to validate and extend the analysis for different practical scenarios.

A Structure Property of Optimal Policies for Maintenance Problems WithSafety-Critical Components

The maintenance problem with safety-critical components is significant for the economical benefit of companies. Motivated by a practical asset maintenance project, a new joint replacement maintenance problem is introduced in this paper. The dynamics of the problem are modelled as a Markov decision process, whose action space increases exponentially with the number of safety-critical components in the asset. To deal with the curse of dimensionality, we identify a key property of the optimal solution: the optimal performance can always be achieved in a class of policies which satisfy the so-called shortest-remaining-lifetime-first (SRLF) rule. It reduces the action space from 0(2n) to O(n), where n is the number of safety-critical components. To further speed up the optimization procedure, some interesting properties of the optimal policy are derived. Combining the SRLF rule and the neuro-dynamic programming (NDP) methodology, we develop an efficient on-line algorithm to optimize this maintenance problem. This algorithm can handle the difficulties of large state space and large action space. Besides the theoretical proof, the optimality and efficiency of the SRLF rule and the properties of the optimal policy are also illustrated by numerical examples. This work can shed some insights to the maintenance problems in a more general situation.

Optimal dynamic voltage scaling in power-limited systems with real-time constraints

Dynamic voltage scaling is used in power-limited systems such as sensor networks as a means of conserving energy and prolonging their life. We consider a setting in which the tasks performed by such a system are nonpreemptive, aperiodic and have uncertain arrival times. Our objective is to control the processing rate over different tasks so as to minimize energy subject to hard real-time processing constraints. We prove that the solution to this problem reduces to two simpler problems which can be efficiently solved, leading to a new on-line dynamic voltage scaling algorithm. This algorithm is shown to have low complexity and, unlike similar state-of-the-art approaches, it involves no solution of nonlinear programming problems and is independent of the specific physical characteristics of the system. Both off-line and on-line versions of the algorithm are analyzed.

Generating test inputs for embedded control systems

Embedded control systems are growing rapidly, and there is a need for short design cycles. As a result, there is increasing interest in effective methods for automatic test generation. The authors present a new method for leveraging existing simulation models, involving genetic algorithms, for embedded control system designs to generate test inputs automatically, thereby eliminating the time-consuming task of creating them manually.

Corrective Line Switching With Security Constraints for the Base and Contingency Cases

Following a line outage, the fast corrective operations of transmission line switching might be used to regain N-1 security of the system without generation re-dispatch or load shedding. The problem to find feasible switching operations can be formulated as a Constraint Satisfaction Problem (CSP). Feasibility checking, however, is difficult since changes in load flows caused by line switching operations are discontinuous, and many contingency cases need to be examined. In this paper, DC flow is considered for simplicity, and variables include binary line statuses and continuous phase angles. Security constraints for the base case, N-1 and selected N-2 cases are formulated in a unified way by using a separate set of phase angles for each case. The problem is solved by using Constraint Programming (CP), and a tree search procedure is developed. Since it is time consuming to handle continuous variables in the tree search, only binary variables are branched on. Once reaching a leaf node where the topology is fixed, the constraints become linear DC flow feasibility conditions and are examined by solving a Linear Programming problem. Effectiveness of the method is demonstrated on IEEE 30-bus and 118-bus systems.

Optimization of Group Elevator Scheduling With Advance Information

Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improve elevator systems is to collect advance traffic information. Nevertheless, it remains a challenge to develop new scheduling methods which can effectively utilize such information. This paper is to solve the group elevator scheduling problem with advance traffic information. This problem is difficult due to various traffic patterns, complicated car dynamics, and combinatorial explosion of the search space. A two-level formulation is developed with passenger-to-car assignment at the high-level and single car dispatching that is innovatively formulated as passenger-to-trip assignment at the low-level. Detailed car dynamics are embedded in simulation models for performance evaluation. Taking advantage of advance information, a new door action control method is suggested to increase the flexibility of elevators. In view of the hierarchical problem structure, a two-level optimization framework is established. Key problem characteristics are exploited to develop an effective trip-based heuristic for single car dispatching, and a hybrid nested partitions and genetic algorithm method for passenger-to-car assignment which can be extended to solve a generic class of sequential decision problems. Numerical results demonstrate solution quality, computational efficiency, benefit of advance information and the new door action control method, and values of new features in our hybrid method.

A Simulation-Based Tool for Energy Efficient Building Design for a Class of Manufacturing Plants

This paper explores energy efficient building design for manufacturing plants. Many efforts have been directed into the field of building design optimization concerning building energy performance, but most of the studies focus on residential buildings or public buildings. Very limited research results studying plants buildings have been reported. However, plants buildings have certain unique features that make the design problem more challenging. Furthermore, the approaches presented in the current publications could not guarantee the performance of their designs if the computation capacity is limited. This paper attempts to address these two issues. First, an EnergyPlus-integrated overall energy consumption estimation framework is developed for a class of manufacturing plants, where the environmental conditions would not affect the energy consumption of the production processes. Based on that, the building design problem for this type of manufacturing plants is formulated as a stochastic programming problem concerning uncertainties arising from the future weather conditions and energy prices, where seasonal production scheduling optimizing is incorporated when estimating the performance of building designs. Second, Ordinal Optimization (OO) method is introduced to solve the problem so as to quantitatively guarantee a high probability of finding satisfactory designs while reducing the computation burden. A numerical example is provided, showing our solution method performs effectively in finding a satisfactory design.