{"title":"活动集QP方法的复杂性证明及其在线性MPC中的应用","authors":"Daniel Arnstrom","doi":"10.3384/LIC.DIVA-173716","DOIUrl":null,"url":null,"abstract":"In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bo ...","PeriodicalId":303036,"journal":{"name":"Linköping Studies in Science and Technology. Licentiate Thesis","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On Complexity Certification of Active-Set QP Methods with Applications to Linear MPC\",\"authors\":\"Daniel Arnstrom\",\"doi\":\"10.3384/LIC.DIVA-173716\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bo ...\",\"PeriodicalId\":303036,\"journal\":{\"name\":\"Linköping Studies in Science and Technology. Licentiate Thesis\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linköping Studies in Science and Technology. Licentiate Thesis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3384/LIC.DIVA-173716\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linköping Studies in Science and Technology. Licentiate Thesis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3384/LIC.DIVA-173716","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Complexity Certification of Active-Set QP Methods with Applications to Linear MPC
In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bo ...
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
