{"title":"Control of discrete time hybrid systems with discrete inputs","authors":"B. Potocnik, G. Mušič, B. Zupančič","doi":"10.1109/EURCON.2003.1248038","DOIUrl":null,"url":null,"abstract":"The paper proposes a model predictive control approach to the hybrid systems with discrete inputs only. The algorithm, which takes into account a model of a hybrid system described as MLD (mixed logical dynamical) system, is based on performance driven reachability analysis. The algorithm abstracts the behavior of the hybrid system by building a tree of evolution. Nodes of the tree represent reachable states of a process, and the branches connect two nodes if a transition exists between the corresponding states. To each node a cost function value is associated and based on this value, the tree exploration is driven. As soon as the tree is explored, the corresponding input is applied to the system and the procedure is repeated.","PeriodicalId":337983,"journal":{"name":"The IEEE Region 8 EUROCON 2003. Computer as a Tool.","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The IEEE Region 8 EUROCON 2003. Computer as a Tool.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2003.1248038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The paper proposes a model predictive control approach to the hybrid systems with discrete inputs only. The algorithm, which takes into account a model of a hybrid system described as MLD (mixed logical dynamical) system, is based on performance driven reachability analysis. The algorithm abstracts the behavior of the hybrid system by building a tree of evolution. Nodes of the tree represent reachable states of a process, and the branches connect two nodes if a transition exists between the corresponding states. To each node a cost function value is associated and based on this value, the tree exploration is driven. As soon as the tree is explored, the corresponding input is applied to the system and the procedure is repeated.