一种测试可控性和计算Brunovsky输出的商子空间算法

IEEE Conference on Decision and Control Pub Date : 1900-01-01 DOI:10.1109/CDC.2004.1430368

P. Müllhaupt

{"title":"一种测试可控性和计算Brunovsky输出的商子空间算法","authors":"P. Müllhaupt","doi":"10.1109/CDC.2004.1430368","DOIUrl":null,"url":null,"abstract":"An algorithm is proposed for testing controllability and computing the Brunovsky output of a single input system. Rather than computing explicitly the controllability matrix, it operates by building successive images of the input matrix in specific quotient subspaces. The algorithm can be used to test controllability to a higher degree of numerical accuracy than standard controllability tests.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"408 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A quotient subspace algorithm for testing controllability and computing Brunovsky's outputs\",\"authors\":\"P. Müllhaupt\",\"doi\":\"10.1109/CDC.2004.1430368\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm is proposed for testing controllability and computing the Brunovsky output of a single input system. Rather than computing explicitly the controllability matrix, it operates by building successive images of the input matrix in specific quotient subspaces. The algorithm can be used to test controllability to a higher degree of numerical accuracy than standard controllability tests.\",\"PeriodicalId\":411031,\"journal\":{\"name\":\"IEEE Conference on Decision and Control\",\"volume\":\"408 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2004.1430368\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2004.1430368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种测试单输入系统的可控性和计算布鲁诺夫斯基输出的算法。它不是显式地计算可控性矩阵，而是通过在特定的商子空间中构建输入矩阵的连续图像来操作。该算法可用于可控性测试，比标准可控性测试具有更高的数值精度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A quotient subspace algorithm for testing controllability and computing Brunovsky's outputs

An algorithm is proposed for testing controllability and computing the Brunovsky output of a single input system. Rather than computing explicitly the controllability matrix, it operates by building successive images of the input matrix in specific quotient subspaces. The algorithm can be used to test controllability to a higher degree of numerical accuracy than standard controllability tests.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Conference on Decision and Control

自引率

0.00%

发文量

期刊最新文献

Consensus Problems on Clustered Networks Breaker page A Sufficient Condition for the Almost Global Stability of Nonlinear Switched Systems with Average Dwell Time Affine systems on Lie groups and invariance entropy Fast nonsingular integral terminal sliding mode control for nonlinear dynamical systems