{"title":"仿射动力系统的符号/数值控制算法","authors":"A. Rondepierre, J. Dumas","doi":"10.1145/1073884.1073923","DOIUrl":null,"url":null,"abstract":"We consider a general linear dynamical system and want to control its behavior. The goal is to reach a given target by minimizing a cost function. We provide a new generic algorithm with together exact, symbolic and numerical modules. In particular new efficient methods computing a block Kalman canonical exact decomposition and the optimal solutions are presented. We also propose a new numerical algorithm under-approximating the controllable domain in view of its analytical resolution in the context of singular sub-arcs.","PeriodicalId":311546,"journal":{"name":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Algorithms for symbolic/numeric control of affine dynamical systems\",\"authors\":\"A. Rondepierre, J. Dumas\",\"doi\":\"10.1145/1073884.1073923\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a general linear dynamical system and want to control its behavior. The goal is to reach a given target by minimizing a cost function. We provide a new generic algorithm with together exact, symbolic and numerical modules. In particular new efficient methods computing a block Kalman canonical exact decomposition and the optimal solutions are presented. We also propose a new numerical algorithm under-approximating the controllable domain in view of its analytical resolution in the context of singular sub-arcs.\",\"PeriodicalId\":311546,\"journal\":{\"name\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2005 international symposium on Symbolic and algebraic computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1073884.1073923\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2005 international symposium on Symbolic and algebraic computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1073884.1073923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algorithms for symbolic/numeric control of affine dynamical systems
We consider a general linear dynamical system and want to control its behavior. The goal is to reach a given target by minimizing a cost function. We provide a new generic algorithm with together exact, symbolic and numerical modules. In particular new efficient methods computing a block Kalman canonical exact decomposition and the optimal solutions are presented. We also propose a new numerical algorithm under-approximating the controllable domain in view of its analytical resolution in the context of singular sub-arcs.