{"title":"相关误差环境下盲OBE的性能研究","authors":"T. Lin, M. Nayeri, J. Deller","doi":"10.1109/ACSSC.1996.599114","DOIUrl":null,"url":null,"abstract":"Conventional optimal bounding ellipsoid (OBE) algorithms require a priori knowledge of error bounds which is unknown in most applications. The OBE algorithm with automatic bound estimation (OBE-ABE) is shown to be consistently convergent without a priori knowledge of error bounds in correlated-error environments. Computationally efficient versions for both time-invariant and time-varying systems are presented. The new algorithms are compared to the conventional OBE by simulation.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance of blind OBE in a correlated-error environment\",\"authors\":\"T. Lin, M. Nayeri, J. Deller\",\"doi\":\"10.1109/ACSSC.1996.599114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Conventional optimal bounding ellipsoid (OBE) algorithms require a priori knowledge of error bounds which is unknown in most applications. The OBE algorithm with automatic bound estimation (OBE-ABE) is shown to be consistently convergent without a priori knowledge of error bounds in correlated-error environments. Computationally efficient versions for both time-invariant and time-varying systems are presented. The new algorithms are compared to the conventional OBE by simulation.\",\"PeriodicalId\":270729,\"journal\":{\"name\":\"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.1996.599114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.1996.599114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance of blind OBE in a correlated-error environment
Conventional optimal bounding ellipsoid (OBE) algorithms require a priori knowledge of error bounds which is unknown in most applications. The OBE algorithm with automatic bound estimation (OBE-ABE) is shown to be consistently convergent without a priori knowledge of error bounds in correlated-error environments. Computationally efficient versions for both time-invariant and time-varying systems are presented. The new algorithms are compared to the conventional OBE by simulation.