اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدInfinitesimal Perturbation Analysis of Stochastic Hybrid Systems: Application to Congestion Management in Traffic-Light Intersections
130
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper presents a new approach to congestion management at traffic-light intersections. The approach is based on controlling the relative lengths of red/green cycles in order to have the congestion level track a given reference. It uses an integral control with adaptive gains, designed to provide fast tracking and wide stability margins. The gains are inverse-proportional to the derivative of the plant-function with respect to the control parameter, and are computed by infinitesimal perturbation analysis. Convergence of this technique is shown to be robust with respect to modeling uncertainties, computing errors, and other random effects. The framework is presented in the setting of stochastic hybrid systems, and applied to a particular traffic-light model. This is but an initial study and hence the latter model is simple, but it captures some of the salient features of traffic-light processes. The paper concludes with comments on possible extensions of the proposed approach to traffic-light grids with realistic flow models.
قيم البحث
اقرأ أيضاً
We present a flow-control technique in traffic-light intersections, aiming at regulating queue lengths to given reference setpoints. The technique is based on multivariable integrators with adaptive gains, computed at each control cycle by assessing
the IPA gradients of the plant functions. Moreover, the IPA gradients are computable on-line despite the absence of detailed models of the traffic flows. The technique is applied to a two-intersection system where it exhibits robustness with respect to modeling uncertainties and computing errors, thereby permitting us to simplify the on-line computations perhaps at the expense of accuracy while achieving the desired tracking. We compare, by simulation, the performance of a centralized, joint two-intersection control with distributed control of each intersection separately, and show similar performance of the two control schemes for a range of parameters.
This paper presents a performance-regulation method for a class of stochastic timed event-driven systems aimed at output tracking of a given reference setpoint. The systems are either Discrete Event Dynamic Systems (DEDS) such as queueing networks or
Petri nets, or Hybrid Systems (HS) with time-driven dynamics and event-driven dynamics, like fluid queues and hybrid Petri nets. The regulator, designed for simplicity and speed of computation, is comprised of a single integrator having a variable gain to ensure effective tracking under time-varying plants. The gains computation is based on the Infinitesimal Perturbation Analysis (IPA) gradient of the plant function with respect to the control variable, and the resultant tracking can be quite robust with respect to modeling inaccuracies and gradient-estimation errors. The proposed technique is tested on examples taken from various application areas and modeled with different formalisms, including queueing models, Petri-net model of a production-inventory control system, and a stochastic DEDS model of a multicore chip control. Simulation results are presented in support of the proposed approach.
This paper studies stochastic boundedness of trajectories of a nonvanishing stochastically perturbed stable LTI system. First, two definitions on stochastic boundedness of stochastic processes are presented, then the boundedness is analyzed via Lyapu
nov theory. In this proposed theorem, it is shown that under a condition on the Lipchitz constant of the perturbation kernel, the trajectories remain stochastically bounded in the sense of the proposed definitions and the bounds are calculated. Also, the limiting behavior of the trajectories have been studied. At the end an illustrative example is presented, which shows the effectiveness of the proposed theory.
We study predictive control in a setting where the dynamics are time-varying and linear, and the costs are time-varying and well-conditioned. At each time step, the controller receives the exact predictions of costs, dynamics, and disturbances for th
e future $k$ time steps. We show that when the prediction window $k$ is sufficiently large, predictive control is input-to-state stable and achieves a dynamic regret of $O(lambda^k T)$, where $lambda < 1$ is a positive constant. This is the first dynamic regret bound on the predictive control of linear time-varying systems. Under more assumptions on the terminal costs, we also show that predictive control obtains the first competitive bound for the control of linear time-varying systems: $1 + O(lambda^k)$. Our results are derived using a novel proof framework based on a perturbation bound that characterizes how a small change to the system parameters impacts the optimal trajectory.
As most natural resources, fisheries are affected by random disturbances. The evolution of such resources may be modelled by a succession of deterministic process and random perturbations on biomass and/or growth rate at random times. We analyze the
impact of the characteristics of the perturbations on the management of natural resources. We highlight the importance of using a dynamic programming approach in order to completely characterize the optimal solution, we also present the properties of the controlled model and give the behavior of the optimal harvest for specific jump kernels.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
