为抽象方法优化状态空间网格
Optimized State Space Grids for Abstractions
AI总结:
本文提出通过优化超区间比例减少抽象计算量,解决如何选择超区间大小以获得可计算且有用抽象的问题。
摘要:
基于抽象控制器合成方法的实际影响受限于获取抽象的计算成本,本文聚焦于一种新方法,通过超区间覆盖被控系统的状态空间来计算抽象。如何选择超区间大小以获得可计算且有用的抽象问题尚未解决。本文提供了双重要贡献:首先,我们提出一个函数来预测抽象计算的成本;其次,我们提出一种方法,当超区间的体积固定时,选择超区间的长宽比以最小化预测的抽象转换次数,从而减少计算成本。为此,我们推导出一个函数,该函数在长宽比依赖下预测转换次数。该函数需在适当约束下最小化。我们证明了相应优化问题的唯一解性,并证明在适当假设下,该问题转化为等价的凸问题,具有严格凸目标函数。后者可通过标准数值方法全局求解。我们通过一个例子展示了我们的方法。
英文摘要:
The practical impact of abstraction-based controller synthesis methods is currently limited by the immense computational effort for obtaining abstractions. In this note we focus on a recently proposed method to compute abstractions whose state space is a cover of the state space of the plant by congruent hyper-intervals. The problem of how to choose the size of the hyper-intervals so as to obtain computable and useful abstractions is unsolved. This note provides a twofold contribution towards a solution. Firstly, we present a functional to predict the computational effort for the abstraction to be computed. Secondly, we propose a method for choosing the aspect ratio of the hyper-intervals when their volume is fixed. More precisely, we propose to choose the aspect ratio so as to minimize a predicted number of transitions of the abstraction to be computed, in order to reduce the computational effort. To this end, we derive a functional to predict the number of transitions in dependence of the aspect ratio. The functional is to be minimized subject to suitable constraints. We characterize the unique solvability of the respective optimization problem and prove that it transforms, under appropriate assumptions, into an equivalent convex problem with strictly convex objective. The latter problem can then be globally solved using standard numerical methods. We demonstrate our approach on an example.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。