{"title":"高阶开关布尔控制网络的可控性","authors":"Lequn Zhang, Jun‐e Feng, Min Meng","doi":"10.1109/ASCC.2013.6606357","DOIUrl":null,"url":null,"abstract":"This paper investigates controllability of higher order switched Boolean control networks (SBCNs). First, by using semi-tensor product (STP) method, two algebraic forms of higher order SBCNs are derived. And a necessary and sufficient condition of controllability for higher order SBCNs is obtained. Then based on the second algebraic form, the corresponding control and switching-law which drive a point to a given reachable point are designed. Finally, an illustrative example is given to show the validity of the main result.","PeriodicalId":6304,"journal":{"name":"2013 9th Asian Control Conference (ASCC)","volume":"48 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Controllability of higher order switched boolean control networks\",\"authors\":\"Lequn Zhang, Jun‐e Feng, Min Meng\",\"doi\":\"10.1109/ASCC.2013.6606357\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper investigates controllability of higher order switched Boolean control networks (SBCNs). First, by using semi-tensor product (STP) method, two algebraic forms of higher order SBCNs are derived. And a necessary and sufficient condition of controllability for higher order SBCNs is obtained. Then based on the second algebraic form, the corresponding control and switching-law which drive a point to a given reachable point are designed. Finally, an illustrative example is given to show the validity of the main result.\",\"PeriodicalId\":6304,\"journal\":{\"name\":\"2013 9th Asian Control Conference (ASCC)\",\"volume\":\"48 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 9th Asian Control Conference (ASCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASCC.2013.6606357\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 9th Asian Control Conference (ASCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASCC.2013.6606357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Controllability of higher order switched boolean control networks
This paper investigates controllability of higher order switched Boolean control networks (SBCNs). First, by using semi-tensor product (STP) method, two algebraic forms of higher order SBCNs are derived. And a necessary and sufficient condition of controllability for higher order SBCNs is obtained. Then based on the second algebraic form, the corresponding control and switching-law which drive a point to a given reachable point are designed. Finally, an illustrative example is given to show the validity of the main result.