非线性数据系统的可控性测试

IF 12.5 Q1 TRANSPORTATION Communications in Transportation Research Pub Date : 2024-11-04 DOI:10.1016/j.commtr.2024.100143
{"title":"非线性数据系统的可控性测试","authors":"","doi":"10.1016/j.commtr.2024.100143","DOIUrl":null,"url":null,"abstract":"<div><div>Controllability is a fundamental property of control systems, serving as the prerequisite for controller design. While controllability test is well established in modelic (i.e., model-driven) control systems, extending it to datatic (i.e., data-driven) control systems is still a challenging task due to the absence of system models. In this study, we propose a general controllability test method for nonlinear systems with datatic description, where the system behaviors are merely described by data. In this situation, the state transition information of a dynamic system is available only at a limited number of data points, leaving the behaviors beyond these points unknown. Different from traditional exact controllability, we introduce a new concept called <em>ϵ</em>-controllability, which extends the definition from point-to-point form to point-to-region form. Accordingly, our focus shifts to checking whether the system state can be steered to a closed state ball centered on the target state, rather than exactly at that target state. Given a known state transition sample, the Lipschitz continuity assumption restricts the one-step transition of all the points in a state ball to a small neighborhood of the subsequent state. This property is referred to as one-step controllability backpropagation, i.e., if the states within this neighborhood are <em>ϵ</em>-controllable, those within the state ball are also <em>ϵ</em>-controllable. On its basis, we propose a tree search algorithm called maximum expansion of controllable subset (MECS) to identify controllable states in the dataset. Starting with a specific target state, our algorithm can iteratively propagate controllability from a known state ball to a new one. This iterative process gradually enlarges the <em>ϵ</em>-controllable subset by incorporating new controllable balls until all <em>ϵ</em>-controllable states are searched. Besides, a simplified version of MECS is proposed by solving a special shortest path problem, called Floyd expansion with radius fixed (FERF). FERF maintains a fixed radius of all controllable balls based on a mutual controllability assumption of neighboring states. The effectiveness of our method is validated in three datatic control systems whose dynamic behaviors are described by sampled data.</div></div>","PeriodicalId":100292,"journal":{"name":"Communications in Transportation Research","volume":null,"pages":null},"PeriodicalIF":12.5000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Controllability test for nonlinear datatic systems\",\"authors\":\"\",\"doi\":\"10.1016/j.commtr.2024.100143\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Controllability is a fundamental property of control systems, serving as the prerequisite for controller design. While controllability test is well established in modelic (i.e., model-driven) control systems, extending it to datatic (i.e., data-driven) control systems is still a challenging task due to the absence of system models. In this study, we propose a general controllability test method for nonlinear systems with datatic description, where the system behaviors are merely described by data. In this situation, the state transition information of a dynamic system is available only at a limited number of data points, leaving the behaviors beyond these points unknown. Different from traditional exact controllability, we introduce a new concept called <em>ϵ</em>-controllability, which extends the definition from point-to-point form to point-to-region form. Accordingly, our focus shifts to checking whether the system state can be steered to a closed state ball centered on the target state, rather than exactly at that target state. Given a known state transition sample, the Lipschitz continuity assumption restricts the one-step transition of all the points in a state ball to a small neighborhood of the subsequent state. This property is referred to as one-step controllability backpropagation, i.e., if the states within this neighborhood are <em>ϵ</em>-controllable, those within the state ball are also <em>ϵ</em>-controllable. On its basis, we propose a tree search algorithm called maximum expansion of controllable subset (MECS) to identify controllable states in the dataset. Starting with a specific target state, our algorithm can iteratively propagate controllability from a known state ball to a new one. This iterative process gradually enlarges the <em>ϵ</em>-controllable subset by incorporating new controllable balls until all <em>ϵ</em>-controllable states are searched. Besides, a simplified version of MECS is proposed by solving a special shortest path problem, called Floyd expansion with radius fixed (FERF). FERF maintains a fixed radius of all controllable balls based on a mutual controllability assumption of neighboring states. The effectiveness of our method is validated in three datatic control systems whose dynamic behaviors are described by sampled data.</div></div>\",\"PeriodicalId\":100292,\"journal\":{\"name\":\"Communications in Transportation Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":12.5000,\"publicationDate\":\"2024-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Communications in Transportation Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S277242472400026X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TRANSPORTATION\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Transportation Research","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S277242472400026X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

摘要

可控性是控制系统的基本属性,是控制器设计的先决条件。虽然可控性测试已在模型(即模型驱动)控制系统中得到广泛应用,但由于缺乏系统模型,将其扩展到数据(即数据驱动)控制系统仍是一项具有挑战性的任务。在本研究中,我们提出了一种针对数据描述非线性系统的通用可控性测试方法,即系统行为仅由数据描述。在这种情况下,动态系统的状态转换信息只能在有限的数据点上获得,而这些点以外的行为则是未知的。与传统的精确可控性不同,我们引入了一个名为ϵ-可控性的新概念,它将定义从点到点形式扩展到点到区域形式。因此,我们的重点转移到检查系统状态是否能被引导到以目标状态为中心的闭合状态球上,而不是精确到目标状态。给定一个已知的状态转换样本,Lipschitz 连续性假设将状态球中所有点的一步转换限制在后续状态的一个小邻域内。这一特性被称为一步可控性反向传播,即如果该邻域内的状态是ϵ可控的,则状态球内的状态也是ϵ可控的。在此基础上,我们提出了一种名为 "可控子集最大扩展"(MECS)的树搜索算法,用于识别数据集中的可控状态。从一个特定的目标状态开始,我们的算法可以迭代地将可控性从一个已知的状态球传播到一个新的状态球。这一迭代过程通过加入新的可控状态球,逐渐扩大ϵ可控子集,直至搜索到所有ϵ可控状态。此外,还提出了一种简化版的 MECS,即求解一个特殊的最短路径问题,称为半径固定的 Floyd 扩展(FERF)。FERF 基于相邻状态的相互可控性假设,保持所有可控球的固定半径。我们在三个数据控制系统中验证了这一方法的有效性,这些系统的动态行为由采样数据描述。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Controllability test for nonlinear datatic systems
Controllability is a fundamental property of control systems, serving as the prerequisite for controller design. While controllability test is well established in modelic (i.e., model-driven) control systems, extending it to datatic (i.e., data-driven) control systems is still a challenging task due to the absence of system models. In this study, we propose a general controllability test method for nonlinear systems with datatic description, where the system behaviors are merely described by data. In this situation, the state transition information of a dynamic system is available only at a limited number of data points, leaving the behaviors beyond these points unknown. Different from traditional exact controllability, we introduce a new concept called ϵ-controllability, which extends the definition from point-to-point form to point-to-region form. Accordingly, our focus shifts to checking whether the system state can be steered to a closed state ball centered on the target state, rather than exactly at that target state. Given a known state transition sample, the Lipschitz continuity assumption restricts the one-step transition of all the points in a state ball to a small neighborhood of the subsequent state. This property is referred to as one-step controllability backpropagation, i.e., if the states within this neighborhood are ϵ-controllable, those within the state ball are also ϵ-controllable. On its basis, we propose a tree search algorithm called maximum expansion of controllable subset (MECS) to identify controllable states in the dataset. Starting with a specific target state, our algorithm can iteratively propagate controllability from a known state ball to a new one. This iterative process gradually enlarges the ϵ-controllable subset by incorporating new controllable balls until all ϵ-controllable states are searched. Besides, a simplified version of MECS is proposed by solving a special shortest path problem, called Floyd expansion with radius fixed (FERF). FERF maintains a fixed radius of all controllable balls based on a mutual controllability assumption of neighboring states. The effectiveness of our method is validated in three datatic control systems whose dynamic behaviors are described by sampled data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.20
自引率
0.00%
发文量
0
期刊最新文献
Harnessing multimodal large language models for traffic knowledge graph generation and decision-making Controllability test for nonlinear datatic systems Intelligent vehicle platooning transit A multi-functional simulation platform for on-demand ride service operations Traffic expertise meets residual RL: Knowledge-informed model-based residual reinforcement learning for CAV trajectory control
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1