历史查询   



 为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法，我们为您准备了出自英文原文的大量英语例句，供您参考。 
All secondary structure read in as lower case in CLUSTAL format gets the reduced terminal penalty.


The asymptotic stability properties are relaxed from the terminal constraint to a terminal penalty.




 Proposed an MinMax model predictive control for discrete uncertain timedelay systems with input and states constraints. The infinite horizon cost is transformed to a finite horizon one by approximating the robust performance criterion after the terminal time with penalty that is obtained by offline involving linear matrix inequality (LMI), which makes the MinMax optimization problem easy to solve and the robust stability preserved. Presented the sufficient conditions of stability and proof. Simulation results... Proposed an MinMax model predictive control for discrete uncertain timedelay systems with input and states constraints. The infinite horizon cost is transformed to a finite horizon one by approximating the robust performance criterion after the terminal time with penalty that is obtained by offline involving linear matrix inequality (LMI), which makes the MinMax optimization problem easy to solve and the robust stability preserved. Presented the sufficient conditions of stability and proof. Simulation results verified the effectiveness of the proposed method.  对于状态和输入有约束的离散不确定时滞系统,提出MinMax预测控制方法,将有限预测时域以后的鲁棒性能指标用终端惩罚近似,而终端惩罚用线性矩阵不等式(LMI)离线求解,因此无限时域的代价转化为有限时域代价,使得MinMax优化问题求解简单,保留原有的鲁棒稳定性.给出了该方法稳定性的充分条件,通过仿真验证了此方法的有效性.  A rolling horizon strategy for the singlemachine scheduling problems with incomplete global information was presented. A terminal penalty function was appended to the objective function of each subproblem in the rolling scheduling strategy. The global performances were analyzed. The global procedural performance was estimated based on a virtual schedule for unknown jobs using FIFO rule. When information of partial jobs is obtained, the partial virtual schedule is specified, locally scheduling is made based... A rolling horizon strategy for the singlemachine scheduling problems with incomplete global information was presented. A terminal penalty function was appended to the objective function of each subproblem in the rolling scheduling strategy. The global performances were analyzed. The global procedural performance was estimated based on a virtual schedule for unknown jobs using FIFO rule. When information of partial jobs is obtained, the partial virtual schedule is specified, locally scheduling is made based on known jobs, and a partition of the local schedule is implemented. It is concluded that while the decision time is being put forward, the estimation of the global performance is getting close to the ultimately implemented actual cost and getting better and better step by step. It is assured that global performance is consistently not worse than that of FIFO anyway. This kind of rolling scheduling strategy is more advantageous when jobs release rapidly.  针对全局信息不完全的一种单机的动态调度模型,设计了局部调度子问题带终端惩罚函数的滚动调度策略,并对这种滚动调度策略下的全局性能进行了分析.通过对未知工件按FIFO规则进行虚拟调度,对滚动调度进程中的全局性能进行评估,证明了在所给滚动调度策略下,随着工件信息的逐步获取,全局调度中的虚拟调度逐步变为已知调度,并经过滚动局部调度而部分实现,决策时刻向前推进,对全局性能指标的估计越来越接近将实现的实际值,逐步实现的全局调度性能相对历次的估计值不断改善.终端罚函数滚动调度策略可以保证滚动调度进程中全局性能的稳定性,当工件到达较快时,文中的滚动调度策略更有优势.  A rolling horizon procedure (RHP) is used in solving a kind of singlemachine dynamic scheduling problems with release times. An improved subproblem for the RHP is proposed. A terminal penalty function is appended to the objective of each subproblem, in which both the local objective and the global objective are considered. It is proved that an existing branch and bound can be revised to solve the improved subproblem. Computational results demonstrate that the improved RHP performs better than the best dispatching... A rolling horizon procedure (RHP) is used in solving a kind of singlemachine dynamic scheduling problems with release times. An improved subproblem for the RHP is proposed. A terminal penalty function is appended to the objective of each subproblem, in which both the local objective and the global objective are considered. It is proved that an existing branch and bound can be revised to solve the improved subproblem. Computational results demonstrate that the improved RHP performs better than the best dispatching rule on most cases.  将滚动时域方法用于一类单机动态调度问题,对其调度子问题进行改进.在子问题的目标函数中增加一个终端惩罚项,在优化局部目标的同时兼顾全局目标,证明了已有分枝定界算法经适当修正可用于求解改进的调度子问题.仿真计算结果表明,在绝大多数情况下,改进滚动时域方法的调度质量优于最好的规则调度方法.   << 更多相关文摘 
相关查询  



