Integrated optimization of maintenance interventions and spare part selection for a partially observable multi-component system

Advanced technical systems are typically composed of multiple critical components whose failure cause a system failure. Often, it is not technically or economically possible to install sensors dedicated to each component, which means that the exact condition of each component cannot be monitored, but a system level failure or defect can be observed. The service provider then needs to implement a condition based maintenance policy that is based on partial information on the systems condition. Furthermore, when the service provider decides to service the system, (s)he also needs to decide which spare part(s) to bring along in order to avoid emergency shipments and part returns. We model this problem as an infinite horizon partially observable Markov decision process. In a set of numerical experiments, we first compare the optimal policy with preventive and corrective maintenance policies: The optimal policy leads on average to a 28% and 15% cost decrease, respectively. Second, we investigate the value of having full information, i.e., sensors dedicated to each component: This leads on average to a 13% cost decrease compared to the case with partial information. Interestingly, having full information is more valuable for cheaper, less reliable components than for more expensive, more reliable components

Energy Efficient Delay Sensitive Optimization in SWIPT-MIMO

In this paper, we consider joint antenna selection and optimal beamforming for energy efficient delay minimization. We assume multiple-input multi-output (MIMO) system with full duplex simultaneous wireless information and power transfer (FD-SWIPT) where each sensor is equipped with a power splitting (PS) system and can simultaneously receive both energy and information from the aggregator (AGG). We show that the antenna selection and beamforming power control policies are adaptive to the energy state information (ESI), the queue state information (QSI) and the channel state information (CSI). We develop an analytical framework for energy efficient delay-optimal control problem based on the theory of infinite horizon partially observable Markov decision process (POMDP). The infinite-horizon POMDP problem is transformed into an equivalent value Bellman program and solved by near-optimal point-based Heuristic Search Value Iteration (PB-HSVI) method under specific standard conditions. The proposed solution outcome is a set of sub-optimal antenna selection and beamforming control policies. Simulation results reveal an effective trade-off between the contradictory objectives (i.e. delay and power consumption) and show the enhancement in delay by using FD-SWIPT systems in comparison to Half Duplex (HD)-SWIPT systems

An Index Policy for Minimizing the Uncertainty-of-Information of Markov Sources

This paper focuses on the information freshness of finite-state Markov sources, using the uncertainty of information (UoI) as the performance metric. Measured by Shannon's entropy, UoI can capture not only the transition dynamics of the Markov source but also the different evolutions of information quality caused by the different values of the last observation. We consider an information update system with M finite-state Markov sources transmitting information to a remote monitor via m communication channels. Our goal is to explore the optimal scheduling policy to minimize the sum-UoI of the Markov sources. The problem is formulated as a restless multi-armed bandit (RMAB). We relax the RMAB and then decouple the relaxed problem into M single bandit problems. Analyzing the single bandit problem provides useful properties with which the relaxed problem reduces to maximizing a concave and piecewise linear function, allowing us to develop a gradient method to solve the relaxed problem and obtain its optimal policy. By rounding up the optimal policy for the relaxed problem, we obtain an index policy for the original RMAB problem. Notably, the proposed index policy is universal in the sense that it applies to general RMABs with bounded cost functions.Comment: 55 page

Data-Driven and Game-Theoretic Approaches for Privacy

abstract: In the past few decades, there has been a remarkable shift in the boundary between public and private information. The application of information technology and electronic communications allow service providers (businesses) to collect a large amount of data. However, this ``data collection" process can put the privacy of users at risk and also lead to user reluctance in accepting services or sharing data. This dissertation first investigates privacy sensitive consumer-retailers/service providers interactions under different scenarios, and then focuses on a unified framework for various information-theoretic privacy and privacy mechanisms that can be learned directly from data. Existing approaches such as differential privacy or information-theoretic privacy try to quantify privacy risk but do not capture the subjective experience and heterogeneous expression of privacy-sensitivity. The first part of this dissertation introduces models to study consumer-retailer interaction problems and to better understand how retailers/service providers can balance their revenue objectives while being sensitive to user privacy concerns. This dissertation considers the following three scenarios: (i) the consumer-retailer interaction via personalized advertisements; (ii) incentive mechanisms that electrical utility providers need to offer for privacy sensitive consumers with alternative energy sources; (iii) the market viability of offering privacy guaranteed free online services. We use game-theoretic models to capture the behaviors of both consumers and retailers, and provide insights for retailers to maximize their profits when interacting with privacy sensitive consumers. Preserving the utility of published datasets while simultaneously providing provable privacy guarantees is a well-known challenge. In the second part, a novel context-aware privacy framework called generative adversarial privacy (GAP) is introduced. Inspired by recent advancements in generative adversarial networks, GAP allows the data holder to learn the privatization mechanism directly from the data. Under GAP, finding the optimal privacy mechanism is formulated as a constrained minimax game between a privatizer and an adversary. For appropriately chosen adversarial loss functions, GAP provides privacy guarantees against strong information-theoretic adversaries. Both synthetic and real-world datasets are used to show that GAP can greatly reduce the adversary's capability of inferring private information at a small cost of distorting the data.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

Active Sensing for Partially Observable Markov Decision Processes

Context information on a smart phone can be used to tailor applications for specific situations (e.g. provide tailored routing advice based on location, gas prices and traffic). However, typical context-aware smart phone applications use very limited context information such as user identity, location and time. In the future, smart phones will need to decide from a wide range of sensors to gather information from in order to best accommodate user needs and preferences in a given context. In this thesis, we present a model for active sensor selection within decision-making processes, in which observational features are selected based on longer-term impact on the decisions made by the smart phone. This thesis formulates the problem as a partially observable Markov decision process (POMDP), and proposes a non-myopic solution to the problem using a state of the art approximate planning algorithm Symbolic Perseus. We have tested our method on a 3 small example domains, comparing different policy types, discount factors and cost settings. The experimental results proved that the proposed approach delivers a better policy in the situation of costly sensors, while at the same time provides the advantage of faster policy computation with less memory usage