Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems
Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems
复制标题
计算增强有限转换系统以合成多项式切换系统的切换协议
DOI：
10.1109/acc.2013.6580816
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
R. Murray
中科院分区：
文献类型：
--
作者：
N. Ozay;Jun Liu;P. Prabhakar;R. Murray
这项工作的动机是连续时间多项式切换系统的模式序列综合问题，以确保系统的轨迹满足以线性时序逻辑表示的某些高级规范。我们使用增广有限转移系统作为连续切换系统的抽象模型。增广有限转移系统配备了活性性质，可用于根据潜在的动力学来强制进展。然后，我们引入了抽象和精化关系，它们在这类有限转移系统上诱导了一个预序。通过构造，得到的前序尊重综合问题的可行性(即，可实现性)。因此，对于这些抽象的有限转移系统之一，离散切换策略的存在保证了连续系统的模式序列的存在，使得它的所有轨迹都满足规范。我们还提出了一种算法，可以用基于平方和的松弛来实现，以一种计算容易的方式来计算这样的高保真抽象模型。最后，通过一个实例说明了这些思想。
This work is motivated by the problem of synthesizing mode sequences for continuous-time polynomial switched systems in order to guarantee that the trajectories of the system satisfy certain high-level specifications expressed in linear temporal logic. We use augmented finite transition systems as abstract models of continuous switched systems. Augmented finite transition systems are equipped with liveness properties that can be used to enforce progress in accordance with the underlying dynamics. We then introduce abstraction and refinement relations that induce a preorder on this class of finite transition systems. By construction, the resulting preorder respects the feasibility (i.e., realizability) of the synthesis problem. Hence, existence of a discrete switching strategy for one of these abstract finite transition systems guarantees the existence of a mode sequence for the continuous system such that all of its trajectories satisfy the specification. We also present an algorithm, which can be implemented using sum-of-squares based relaxations, to compute such high fidelity abstract models in a computationally tractable way. Finally, these ideas are illustrated on an example.
DOI：
10.1007/978-3-642-28756-5_47
发表时间：
2012
期刊：
--
影响因子：
--
作者：
Basler G
通讯作者：
Basler G