Online Safety Under Multiple Constraints and Input Bounds Using gatekeeper: Theory and Applications

IF 2 Q2 AUTOMATION & CONTROL SYSTEMS
Devansh R. Agrawal;Dimitra Panagou
{"title":"Online Safety Under Multiple Constraints and Input Bounds Using gatekeeper: Theory and Applications","authors":"Devansh R. Agrawal;Dimitra Panagou","doi":"10.1109/LCSYS.2025.3599718","DOIUrl":null,"url":null,"abstract":"This letter presents an approach to guarantee online safety of a cyber-physical system under multiple state and input constraints. Our proposed framework, called <monospace>gatekeeper</monospace>, recursively guarantees the existence of an infinite-horizon trajectory that satisfies all constraints and system dynamics. Such trajectory is constructed using a backup controller, which we define formally in this letter. <monospace>gatekeeper</monospace> relies on a small number of verifiable assumptions, and is computationally efficient since it requires optimization over a single scalar variable. We make two primary contributions in this letter. (A) First, we develop the theory of <monospace>gatekeeper</monospace>: we derive a sub-optimality bound relative to a full nonlinear trajectory optimization problem, and show how this can be used in runtime to validate performance. This also informs the design of the backup controllers and sets. (B) Second, we demonstrate in detail an application of <monospace>gatekeeper</monospace> for multi-agent formation flight, where each Dubins agent must avoid multiple obstacles and weapons engagement zones, both of which are nonlinear, nonconvex constraints.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"9 ","pages":"2309-2314"},"PeriodicalIF":2.0000,"publicationDate":"2025-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Control Systems Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11127175/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This letter presents an approach to guarantee online safety of a cyber-physical system under multiple state and input constraints. Our proposed framework, called gatekeeper, recursively guarantees the existence of an infinite-horizon trajectory that satisfies all constraints and system dynamics. Such trajectory is constructed using a backup controller, which we define formally in this letter. gatekeeper relies on a small number of verifiable assumptions, and is computationally efficient since it requires optimization over a single scalar variable. We make two primary contributions in this letter. (A) First, we develop the theory of gatekeeper: we derive a sub-optimality bound relative to a full nonlinear trajectory optimization problem, and show how this can be used in runtime to validate performance. This also informs the design of the backup controllers and sets. (B) Second, we demonstrate in detail an application of gatekeeper for multi-agent formation flight, where each Dubins agent must avoid multiple obstacles and weapons engagement zones, both of which are nonlinear, nonconvex constraints.
多约束和输入边界下的网络安全:理论与应用
这封信提出了一种在多状态和输入约束下保证网络物理系统在线安全的方法。我们提出的框架,称为看门人,递归地保证存在一个无限视界轨迹,满足所有约束和系统动力学。这样的轨迹是使用备份控制器构造的,我们在这封信中正式定义了备份控制器。Gatekeeper依赖于少量可验证的假设,并且计算效率很高,因为它需要对单个标量变量进行优化。我们在这封信中做了两个主要贡献。(A)首先,我们发展了看门人理论:我们推导了一个相对于完整非线性轨迹优化问题的次最优性界限,并展示了如何在运行时使用它来验证性能。这也通知了备份控制器和集的设计。(B)其次,我们详细展示了一个多智能体编队飞行中的看门人应用,其中每个Dubins智能体必须避开多个障碍物和武器交战区域,这两者都是非线性的,非凸约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Control Systems Letters
IEEE Control Systems Letters Mathematics-Control and Optimization
CiteScore
4.40
自引率
13.30%
发文量
471
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信