共查询到20条相似文献,搜索用时 15 毫秒
1.
Discrete event dynamic systems are studied within the framework of perturbation analysis in this paper. Perturbation is extended from the event times only to both event times and queue lengths. An approximate technique, full-state perturbation analysis (PA), is developed as an extension of the PA approach. Full-state PA is able to deal with problems involving queue length perturbations which often defy existing PA methods, while it still retains all the advantages of existing PA. Full-state PA is used to calculate the throughput sensitivity to the number of customers in closed queueing networks and the throughput sensitivity to routing change. Numerical examples are given. Experimental results verify the validity and accuracy.This work is supported in part by the National High Technology Project and by Southeast University Research Funds for Young Teachers. 相似文献
2.
利用更新过程理论和向量马氏过程方法全面考察了可修排队系统GI/G(M/G)/1的结构,得到了所有感兴趣的指标,并证明了服务台的可靠性指标只与系统的忙期、闲期和忙期循环时间有关. 相似文献
3.
4.
Li Xia 《Asian journal of control》2014,16(6):1735-1743
In the theory of event‐based optimization (EBO), the decision making is triggered by events, which is different from the traditional state‐based control in Markov decision processes (MDP). In this paper, we propose a policy gradient approach of EBO. First, an equation of performance gradient in the event‐based policy space is derived based on a fundamental quantity called Q‐factors of EBO. With the performance gradient, we can find the local optimum of EBO using the gradient‐based algorithm. Compared to the policy iteration approach in EBO, this policy gradient approach does not require restrictive conditions and it has a wider application scenario. The policy gradient approach is further implemented based on the online estimation of Q‐factors. This approach does not require the prior information about the system parameters, such as the transition probability. Finally, we use an EBO model to formulate the admission control problem and demonstrate the main idea of this paper. Such online algorithm provides an effective implementation of the EBO theory in practice. 相似文献
5.
Rita de Cassia M. Rodrigues & Solon V. de Carvalho 《International Transactions in Operational Research》2001,8(2):235-248
We study a queueing system where both inter-arrival and service times are distributed according to phase-type distributions. This system is modeled as a Markov decision process with full and partial information. The objective is to minimize the long-run average cost of the system. Numerical results are presented. 相似文献
6.
7.
8.
9.
The sample-path perturbation analysis technique is extended to include finite (and possibly large) perturbations typically introduced by changes in queue sizes or other parameters. It is shown that there is a natural hierarchy of perturbation analysis which takes care of increasingly large perturbations. Experiments with zero (infinitesimal) and first order (finite) perturbation analysis show that significant accuracy improvement can be obtained with small increase in computational effort. 相似文献
10.
11.
In Dai and Ho (1994) we developed a method, referred to asstructural infinitesimal perturbation analysis (SIPA), to address the need for derivative estimation with respect to a special type of parameter. However, it was not clear how much computational effort is required to implement this method. Derivative estimation via SIPA can be complicated in implementation. Such computational problems, also arise in several other derivative estimation methods. In this paper we take SIPA as a typical method and apply it to a special class of DEDS-several variations of single-server queues, focusing on the issue of implementation. We demonstrate that SIPA can be efficiently implemented. In some cases, it can be as simple as theinfinitesimal perturbation analysis (IPA), method which is considered to be the most efficient method available so far. The main approach we take is to combine SIPA with finite perturbation analysis and cut-and-paste techniques. Explicit formulae are given to various problems, some being impossible to solve using the traditional IPA method. Numerical examples are employed to illustrate the results. 相似文献
12.
13.
14.
15.
混杂系统(HDS)是由连续变量动态系统(CVDS)与离散事件动态系统(DEDS)共同组成的大型动态系统。随着CIMS的兴起与发展,人们应该关注HDS的建模、分析与优化运行。本文通过分析实例介绍了HDS的存在、特征与研究前景。 相似文献
16.
本文研究一个典型的批到达可修排队系统^x/(/)1.记号(/)表服务台寿命服从指数分布,而其修理时间为一连续型分布。利用向量马氏过程方法,我们得到了它的瞬态解。特别是发现了服务台的可靠性指标仅依赖于可修排队系统的空闲概率,或等价地仅依赖于它的忙期和忙循环。 相似文献
17.
Strong consistency of infinitesimal perturbation analysis for the sojourn times in a class of tandem queueing networks is proved. Service times at the queues are correlated, and they are affine functions of the variable parameters. Differentiability of the average sojourn times is not assumed, but proved. The analysis is not based on assumptions of regenerative cycles of the networks but on stability and ergodicity of the queueing processes involved. The proof of strong consistency is based on a set of abstract conditions, described in terms of properties of the sample performance functions. These conditions are first shown to be sufficient for strong consistency, and then their validity for the networks in question is proved.Research supported in part by the NSF under grants Nos. ECS85-15449 and CDR-8803012, under ONR contract nos. N00014-90-K-1093 and N00014-89-J-1023, and under Army contract no. DAAL-03-83-K-0171. This author is now with the Department of Manufacturing Engineering, Boston University, Boston, MA 02215. 相似文献
18.
近年来,强化学习与自适应动态规划算法的迅猛发展及其在一系列挑战性问题(如大规模多智能体系统优化决策和最优协调控制问题)中的成功应用,使其逐渐成为人工智能、系统与控制和应用数学等领域的研究热点.鉴于此,首先简要介绍强化学习和自适应动态规划算法的基础知识和核心思想,在此基础上综述两类密切相关的算法在不同研究领域的发展历程,着重介绍其从应用于单个智能体(控制对象)序贯决策(最优控制)问题到多智能体系统序贯决策(最优协调控制)问题的发展脉络和研究进展.进一步,在简要介绍自适应动态规划算法的结构变化历程和由基于模型的离线规划到无模型的在线学习发展演进的基础上,综述自适应动态规划算法在多智能体系统最优协调控制问题中的研究进展.最后,给出多智能体强化学习算法和利用自适应动态规划求解多智能体系统最优协调控制问题研究中值得关注的一些挑战性课题. 相似文献
19.
本文将离散事件动态系统(DEDS)监控方法中的控制综合问题作了系统的分类,得到了六种控制综合问题,并将它们表示成泛函极值问题,讨论了它们的可行解,最优解的存在性,可生解集的结构以及相互之间的关系。 相似文献