اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNo Switching Policy is Optimal for a Positive Linear System with a Bottleneck Entrance
105
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a nonlinear SISO system that is a cascade of a scalar bottleneck entrance and an arbitrary Hurwitz positive linear system. This system entrains i.e. in response to a $T$-periodic inflow every solution converges to a unique $T$-periodic solution of the system. We study the problem of maximizing the averaged throughput via controlled switching. The objective is to choose a periodic inflow rate with a given mean value that maximizes the averaged outflow rate of the system. We compare two strategies: 1) switching between a high and low value, and 2) using a constant inflow equal to the prescribed mean value. We show that no switching policy can outperform a constant inflow rate, though it can approach it asymptotically. We describe several potential applications of this problem in traffic systems, ribosome flow models, and scheduling at security checks.
قيم البحث
اقرأ أيضاً
Sadeghi et al. considered a bottleneck system with periodic inflow rate, and proved that a constant-rate input maximizes the time-averaged output rate among all periodic inflow rates. Here we provide a short and elementary proof of this result, witho
ut use of optimal control theory. The new approach developed here allows us to prove an extension of the result to the case of a general non-periodic inflow rate.
The design of an efficient curing policy, able to stem an epidemic process at an affordable cost, has to account for the structure of the population contact network supporting the contagious process. Thus, we tackle the problem of allocating recovery
resources among the population, at the lowest cost possible to prevent the epidemic from persisting indefinitely in the network. Specifically, we analyze a susceptible-infected-susceptible epidemic process spreading over a weighted graph, by means of a first-order mean-field approximation. First, we describe the influence of the contact network on the dynamics of the epidemics among a heterogeneous population, that is possibly divided into communities. For the case of a community network, our investigation relies on the graph-theoretical notion of equitable partition; we show that the epidemic threshold, a key measure of the network robustness against epidemic spreading, can be determined using a lower-dimensional dynamical system. Exploiting the computation of the epidemic threshold, we determine a cost-optimal curing policy by solving a convex minimization problem, which possesses a reduced dimension in the case of a community network. Lastly, we consider a two-level optimal curing problem, for which an algorithm is designed with a polynomial time complexity in the network size.
We study the synthesis of mode switching protocols for a class of discrete-time switched linear systems in which the mode jumps are governed by Markov decision processes (MDPs). We call such systems MDP-JLS for brevity. Each state of the MDP correspo
nds to a mode in the switched system. The probabilistic state transitions in the MDP represent the mode transitions. We focus on finding a policy that selects the switching actions at each mode such that the switched system that follows these actions is guaranteed to be stable. Given a policy in the MDP, the considered MDP-JLS reduces to a Markov jump linear system (MJLS). {We consider both mean-square stability and stability with probability one. For mean-square stability, we leverage existing stability conditions for MJLSs and propose efficient semidefinite programming formulations to find a stabilizing policy in the MDP. For stability with probability one, we derive new sufficient conditions and compute a stabilizing policy using linear programming. We also extend the policy synthesis results to MDP-JLS with uncertain mode transition probabilities.
In this paper we study the optimization problem of an economic agent who chooses a job and the time of retirement as well as consumption and portfolio of assets. The agent is constrained in the ability to borrow against future income. We transform th
e problem into a dual two-person zero-sum game, which involves a controller, who is a minimizer and chooses a non-increasing process, and a stopper, who is a maximizer and chooses a stopping time. We derive the Hamilton-Jacobi- Bellman quasi-variational inequality(HJBQV) of a max-min type arising from the game. We provide a solution to the HJBQV and verification that it is the value of the game. We establish a duality result which allows to derive the optimal strategies and value function of the primal problem from those of the dual problem.
We consider the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows, to minimize the sum of customer waiting time and server overtime costs. Since appointments need to be scheduled ahead of
time we refer to this problem as an optimization problem rather than a dynamic control one. We study this optimization problem in fluid and diffusion scales and identify asymptotically optimal schedules in both scales. In fluid scale, we show that it is optimal to schedule appointments so that the system is in critical load; thus heavy-traffic conditions are obtained as a result of optimization rather than as an assumption. In diffusion scale, we solve this optimization problem in the large horizon limit. Our explicit stationary solution of the corresponding Brownian Optimization Problem translates the customer-delay versus server-overtime tradeoff to a tradeoff between the state of a reflected Brownian motion in the half-line and its local time at zero. Motivated by work on competitive ratios, we also consider a reference model in which an oracle provides the decision maker with the complete randomness information. The difference between the values of the scheduling problem for the two models, to which we refer as the stochasticity gap (SG), quantifies the degree to which it is harder to design a schedule under uncertainty than when the stochastic primitives (i.e., the no-shows and service times) are known in advance. In the fluid scale, the SG converges to zero, but in the diffusion scale it converges to a positive constant that we compute.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
