{"title":"动态系统无环网络拓扑的重构","authors":"D. Materassi","doi":"10.1109/ACC.2011.5991335","DOIUrl":null,"url":null,"abstract":"The paper deals with the problem of unveiling the link structure of a network of linear dynamical systems. A technique is provided guaranteeing the exact detection of the links for networks with no undirected cycles (Linear Dynamic Polytrees). The result extends previous work that was limited to a more restricted class (Linear Cascade Model Trees).","PeriodicalId":225201,"journal":{"name":"Proceedings of the 2011 American Control Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Reconstruction of topologies for acyclic networks of dynamical systems\",\"authors\":\"D. Materassi\",\"doi\":\"10.1109/ACC.2011.5991335\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper deals with the problem of unveiling the link structure of a network of linear dynamical systems. A technique is provided guaranteeing the exact detection of the links for networks with no undirected cycles (Linear Dynamic Polytrees). The result extends previous work that was limited to a more restricted class (Linear Cascade Model Trees).\",\"PeriodicalId\":225201,\"journal\":{\"name\":\"Proceedings of the 2011 American Control Conference\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2011 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACC.2011.5991335\",\"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 2011 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.2011.5991335","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reconstruction of topologies for acyclic networks of dynamical systems
The paper deals with the problem of unveiling the link structure of a network of linear dynamical systems. A technique is provided guaranteeing the exact detection of the links for networks with no undirected cycles (Linear Dynamic Polytrees). The result extends previous work that was limited to a more restricted class (Linear Cascade Model Trees).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
