{"title":"State estimation for constant-time labeled automata under dense time","authors":"","doi":"10.1016/j.automatica.2024.111874","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we focus on <em>state estimation</em> for <em>constant-time labeled automata</em> in a dense time context, i.e., the time constraints of the automata can be given according to real numbers. Given a sequence of timed observations (i.e., pairs of logical observations with their time stamps) collected from a system within a finite time window, a state estimation method is proposed to find the set of states in which the system might reside by the end of the time window. By using both labeling and timing information as well as the structure of the system, we can express any finite time evolution from one state to another into <em>constraint satisfaction problems</em> (CSPs). This structural analysis is independent of all collected sequences of timed observations and can be achieved offline, although its cost is exponential with respect to the number of states in the system. Consequently, two algorithms are designed to perform state estimation under a single observation and no observation, respectively, by solving a finite number of CSPs generated according to the system’s structural information. Both algorithms can be jointly used in an iterative approach to perform state estimation for any sequence of timed observations. In such a case, the number of generated CSPs in the algorithms increases linearly with respect to the length of the observed sequence.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automatica","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0005109824003686","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we focus on state estimation for constant-time labeled automata in a dense time context, i.e., the time constraints of the automata can be given according to real numbers. Given a sequence of timed observations (i.e., pairs of logical observations with their time stamps) collected from a system within a finite time window, a state estimation method is proposed to find the set of states in which the system might reside by the end of the time window. By using both labeling and timing information as well as the structure of the system, we can express any finite time evolution from one state to another into constraint satisfaction problems (CSPs). This structural analysis is independent of all collected sequences of timed observations and can be achieved offline, although its cost is exponential with respect to the number of states in the system. Consequently, two algorithms are designed to perform state estimation under a single observation and no observation, respectively, by solving a finite number of CSPs generated according to the system’s structural information. Both algorithms can be jointly used in an iterative approach to perform state estimation for any sequence of timed observations. In such a case, the number of generated CSPs in the algorithms increases linearly with respect to the length of the observed sequence.
期刊介绍:
Automatica is a leading archival publication in the field of systems and control. The field encompasses today a broad set of areas and topics, and is thriving not only within itself but also in terms of its impact on other fields, such as communications, computers, biology, energy and economics. Since its inception in 1963, Automatica has kept abreast with the evolution of the field over the years, and has emerged as a leading publication driving the trends in the field.
After being founded in 1963, Automatica became a journal of the International Federation of Automatic Control (IFAC) in 1969. It features a characteristic blend of theoretical and applied papers of archival, lasting value, reporting cutting edge research results by authors across the globe. It features articles in distinct categories, including regular, brief and survey papers, technical communiqués, correspondence items, as well as reviews on published books of interest to the readership. It occasionally publishes special issues on emerging new topics or established mature topics of interest to a broad audience.
Automatica solicits original high-quality contributions in all the categories listed above, and in all areas of systems and control interpreted in a broad sense and evolving constantly. They may be submitted directly to a subject editor or to the Editor-in-Chief if not sure about the subject area. Editorial procedures in place assure careful, fair, and prompt handling of all submitted articles. Accepted papers appear in the journal in the shortest time feasible given production time constraints.