...
首页> 外文期刊>IEEE Transactions on Automatic Control >Approximate explicit constrained linear model predictive control via orthogonal search tree
【24h】

Approximate explicit constrained linear model predictive control via orthogonal search tree

机译:正交搜索树的近似显式约束线性模型预测控制

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

摘要

Solutions to constrained linear model predictive control problems can be precomputed off-line in an explicit form as a piecewise linear state feedback on a polyhedral partition of the state-space, avoiding real-time optimization. We suggest an algorithm that can determine an approximate explicit piecewise linear state feedback by imposing an orthogonal search tree structure on the partition. This leads to a real-time computational complexity that is logarithmic in the number of regions in the partition, and the algorithm yields guarantees on the suboptimality, asymptotic stability and constraint fulfillment.
机译:约束线性模型预测控制问题的解决方案可以以显式形式离线离线预先计算,作为状态空间的多面体分区上的分段线性状态反馈,从而避免了实时优化。我们建议一种可以通过在分区上施加正交搜索树结构来确定近似显式分段线性状态反馈的算法。这导致实时计算复杂度在分区中的区域数上是对数的,并且该算法为次优性,渐近稳定性和约束满足提供了保证。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号