...
首页> 外文期刊>IEEE Transactions on Automatic Control >On the Steady-State Control of Timed Event Graphs With Firing Date Constraints
【24h】

On the Steady-State Control of Timed Event Graphs With Firing Date Constraints

机译:具有触发日期约束的定时事件图的稳态控制

获取原文
获取原文并翻译 | 示例
           

摘要

Two algorithms for solving a specific class of steady-state control problems for Timed Event Graphs are presented. In the first, asymptotic convergence to the desired set is guaranteed. The second algorithm, which builds on from the recent developments in the spectral theory of min-max functions, guarantees Lyapunov stability since the distance between the actual state and the desired set never increases. Simulation results show the efficiency of the proposed approach in a problem of moderate complexity.
机译:提出了两种解决定时事件图特定类别的稳态控制问题的算法。首先,保证渐近收敛到期望的集合。第二种算法建立在最小-最大函数谱理论的最新发展基础上,可保证Lyapunov稳定性,因为实际状态与所需集合之间的距离不会增加。仿真结果表明了该方法在中等复杂度问题上的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号