作为动力系统模型的树的递归构造

[1991] Proceedings of the 30th IEEE Conference on Decision and Control Pub Date : 1991-12-11 DOI:10.1109/CDC.1991.261694

A. Isaksson, L. Ljung, J. Stromberg

{"title":"作为动力系统模型的树的递归构造","authors":"A. Isaksson, L. Ljung, J. Stromberg","doi":"10.1109/CDC.1991.261694","DOIUrl":null,"url":null,"abstract":"An issue that is of importance for control applications is discussed: how to construct the trees online, i.e. recursively, as more and more data become available. A theorem regarding recursive tree-building is stated and proved, and implementation issues are considered.<<ETX>>","PeriodicalId":344553,"journal":{"name":"[1991] Proceedings of the 30th IEEE Conference on Decision and Control","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On recursive construction of trees as models of dynamical systems\",\"authors\":\"A. Isaksson, L. Ljung, J. Stromberg\",\"doi\":\"10.1109/CDC.1991.261694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An issue that is of importance for control applications is discussed: how to construct the trees online, i.e. recursively, as more and more data become available. A theorem regarding recursive tree-building is stated and proved, and implementation issues are considered.<<ETX>>\",\"PeriodicalId\":344553,\"journal\":{\"name\":\"[1991] Proceedings of the 30th IEEE Conference on Decision and Control\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the 30th IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1991.261694\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 30th IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1991.261694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

讨论了一个对控制应用很重要的问题:如何在线构建树，即递归地，随着越来越多的数据变得可用。提出并证明了一个关于递归树构造的定理，并考虑了实现问题

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On recursive construction of trees as models of dynamical systems

An issue that is of importance for control applications is discussed: how to construct the trees online, i.e. recursively, as more and more data become available. A theorem regarding recursive tree-building is stated and proved, and implementation issues are considered.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991] Proceedings of the 30th IEEE Conference on Decision and Control

自引率

0.00%

发文量