• International Journal of Reliability and Applications
• /
• 제10권1호
• /
• pp.33-42
• /
• 2009

In most of literatures of age replacement policy, the authors consider the case that a new item starts operating at time zero and is to be replaced by new one at time T. It is, however, often to purchase used items because of the limited budget. In this paper, we consider age replacement policy of a used item whose age is $t_0$. The mathematical formulas of the expected cost rate per unit time are derived for both infinite-horizon case and finite-horizon case. For each case, we show that the optimal replacement age exists and is finite and investigate the effect of the age of the used item.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.15-15
• /
• 2003

We provide some recent results of approximation algorithms for solving Markov Games and discuss their applications to problems that arise in Computer Science. We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with an infinite horizon discounted cost criterion. We present error bounds from the optimal equilibrium value of the game when both players take “correlated” receding horizon policies that are based on exact or approximate solutions of receding finite horizon subgames. Motivated by the worst-case optimal control of queueing systems by Altman, we then analyze error bounds when the minimizer plays the (approximate) receding horizon control and the maximizer plays the worst case policy. We give two heuristic examples of the approximate receding horizon control. We extend “parallel rollout” and “hindsight optimization” into the Markov game setting within the framework of the approximate receding horizon approach and analyze their performances. From the parallel rollout approach, the minimizing player seeks to combine dynamically multiple heuristic policies in a set to improve the performances of all of the heuristic policies simultaneously under the guess that the maximizing player has chosen a fixed worst-case policy. Given $\varepsilon$>0, we give the value of the receding horizon which guarantees that the parallel rollout policy with the horizon played by the minimizer “dominates” any heuristic policy in the set by $\varepsilon$, From the hindsight optimization approach, the minimizing player makes a decision based on his expected optimal hindsight performance over a finite horizon. We finally discuss practical implementations of the receding horizon approaches via simulation and applications.

• International Journal of Reliability and Applications
• /
• 제12권2호
• /
• pp.131-143
• /
• 2011

In most of literatures of age replacement policy, the authors consider the case that a new item starts operating at time zero and is to be replaced by new one at time T. It is, however, often to purchase used items because of the limited budget. In this paper, we consider age replacement policy of a used item whose age is $t_0$. The mathematical formulas of the expected cost rate per unit time are derived for both infinite-horizon case and finite-horizon case. For each case, we show that the optimal replacement age exists and is finite and investigate the effect of the age of the used item.

• Journal of Communications and Networks
• /
• 제16권3호
• /
• pp.293-300
• /
• 2014

As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on computing an expected threshold, performs close to optimal on a wide range of example energy harvest patterns. Moreover, it achieves higher throughput values for a given delay, than throughput-optimal online policies developed based on infinite-horizon formulations in recent literature. The solution is extended to include ergodic time-varying (fading) channels, and a corresponding low complexity policy is proposed and evaluated for this case as well.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1901-1904
• /
• 2003

MPC or model predictive control is representative of control methods which are able to handle physical constraints. Closed-loop stability can therefore be ensured only locally in the presence of constraints of this type. However, if the system is neutrally stable, and if the constraints are imposed only on the input, global aymptotic stability can be obtained; until recently, use of infinite horizons was thought to be inevitable in this case. A globally stabilizing finite-horizon MPC has lately been suggested for neutrally stable continuous-time systems using a non-quadratic terminal cost which consists of cubic as well as quadratic functions of the state. The idea originates from the so-called small gain control, where the global stability is proven using a non-quadratic Lyapunov function. The newly developed finite-horizon MPC employs the same form of Lyapunov function as the terminal cost, thereby leading to global asymptotic stability. A discrete-time version of this finite-horizon MPC is presented here. The proposed MPC algorithm is also coded using an SQP (Sequential Quadratic Programming) algorithm, and simulation results are given to show the effectiveness of the method.

• Transactions on Control, Automation and Systems Engineering
• /
• 제3권4호
• /
• pp.289-292
• /
• 2001

This paper concerns with a receding horizon estimator (RHE) for discrete-time linear systems subject to constraints on the estimate. In solving the optimization for every horizons, the past all measurement data outside the horizon is discarded and thus the arrival cost is not considered. The RHE in the current work is a finite impulse response (FIR) structure which has some good inherent properties. The proposed RHE can be represented in the simple matrix form for the unconstrained case. Various numerical examples demonstrate how including constraints in the RHE can improve estimation performance. Especially, in the application to the unknown input estimation, it will be shown how the FIR structure in the RHE can improve the estimation speed.

• 한국국방경영분석학회지
• /
• 제4권1호
• /
• pp.113-123
• /
• 1978

Consider a series system of two units, named 1 and 2, respectively. Two units are observed at the beginning of discrete time periods t=0,1,2, $cdots$ and classified as being in one of a countable number of states. Let (i, r) be a state of the system at time t, when the state of unit 1 is i and state of unit 2 is r at time t, Under some conditions, the opportunistic replacement policy that minimizes the expected total discounted cost or the average cost of maintenance is shown to be characterized by the control limits $i^{*}(r)$ (a function of r) and $r^{*}(i)$ (a function of i) : (a) in observed state (i, r), the optimal policy for unit 1 is to replace if $i{\ge}i^{*}(r)$ and no action otherwise; (b) in observed state (i, r), the optimal policy for unit 2 is to replace if $r{\ge}r^{*}(i)$ and no action otherwise. In addition, this paper also develops optimal policy in the finite time horizon case, where time horizon is fixed or a finite integer valued r.v. with known pmf.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4372-4394
• /
• 2020

The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1120-1123
• /
• 1996

DMC(Dynamic Matrix Control) algorithm has been successfully used in industries for more than a decade. It can handle constraints and easily extended to MIMO case. The application of DMC, however, is limited to the open loop stable process because it uses the FIR(Finite Impulse Response) or FSR(Finite Step Response) model. Integrating process widely used in chemical process industry, is the representative open loop unstable process. The disturbance rejection of DMC is relatively poor due to the assumption that the current disturbance is equivalent to the future disturbance. We propose the IDMC(Improved Dynamic Matrix Control) for the integrating process, as well as non-integrating process. IDMC has shown better disturbance rejection using multi-step ahead predictor for the disturbance.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.542-547
• /
• 2003

A new approach to design of a discrete-time robust $H_{\infty}$ filter in finite horizon case is proposed. It is shown that robust $H_{\infty}$ filtering problem can be cast into the minimization problem of an indefinite quadratic form, which can be solved by implementing the Kalman filter defined in Krein space. The proposed filter is readily derived by simply augmenting the state space model and has the robustness property against the parameter uncertainties of a given system.