Reach set computation using optimal control

被引:0
|
作者
Varaiya, P [1 ]
机构
[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Reach set computation is a basic component of many verification and control synthesis procedures. Effective computation schemes are available for discrete systems described by finite state machines and continuous-variable systems described by linear differential inequalities. This paper suggests an approach based on the Pontryagin maximum principle of optimal control theory. The approach is elaborated for linear systems, and it may prove useful for more general continuous-variable systems.
引用
收藏
页码:323 / 331
页数:3
相关论文
共 50 条