4.7 Article

A fast method for obtaining convex combination coefficients

期刊

AUTOMATICA
卷 152, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2023.110975

关键词

Polytopes; Convex combination; Predictive control; Algorithms and software

向作者/读者索取更多资源

This technical communique presents a novel approach for fast computation of convex combination coefficients based on ray shooting. The proposed method provides up to seven-fold reductions in computation time compared to a state-of-the-art technique, in test cases involving polytopes of various dimensions and numbers of vertices.
This technical communique presents a novel approach for fast computation of convex combination coefficients based on ray shooting. Such a problem arises in the real-time implementation of many set -based control techniques, which require a computationally efficient solution to cope with systems of high dimension or fast dynamics. The proposed method poses no constraints on the polytope structure and requires only a list of vertices and boundary hyperplanes. In test cases involving polytopes of various dimensions and numbers of vertices, the proposed method provided up to seven-fold reductions in the 95% percentile of computation time, compared with a state-of-the-art technique. (c) 2023 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据