| 发明名称 |
Systems and Methods for Evaluating Stability of Software Code for Control Systems |
| 摘要 |
In one embodiment, a method of evaluating stability of software code for a control system includes receiving a set of initial trajectories by a semidefinite programming solver module, and determining one or more candidate Lyapunov functions based on the set of initial trajectories. The method further includes performing a plurality of simulations using a model of the control system to create a set of discovered trajectories, and evaluating the set of discovered trajectories to determine one or more counterexample trajectories that violate one or more Lyapunov conditions. If one or more counterexample trajectories are discovered, then the method includes inputting the set of discovered trajectories including the one or more counterexample trajectories into the semidefinite programming solver module, and determining, by the semidefinite programming solver module, one or more additional candidate Lyapunov functions from the set of initial trajectories and the set of discovered trajectories. |
| 申请公布号 |
US2014201723(A1) |
申请公布日期 |
2014.07.17 |
| 申请号 |
US201313760407 |
申请日期 |
2013.02.06 |
| 申请人 |
Engineering & Manufacturing North America, Inc. Toyota Motor |
发明人 |
Kapinski James P.;Deshmukh Jyotirmoy V. |
| 分类号 |
G06F11/36 |
主分类号 |
G06F11/36 |
| 代理机构 |
|
代理人 |
|
| 主权项 |
1. A method of evaluating stability of software code for a control system, the method comprising:
receiving a set of initial trajectories; determining, by a semidefinite programming solver module, one or more candidate Lyapunov functions based on the set of initial trajectories; performing a plurality of simulations using a model of the control system to create a set of discovered trajectories; and evaluating the set of discovered trajectories to determine one or more counterexample trajectories that violate one or more Lyapunov conditions, wherein if one or more counterexample trajectories are discovered:
inputting the set of discovered trajectories including the one or more counterexample trajectories into the semidefinite programming solver module; anddetermining, by the semidefinite programming solver module, one or more additional candidate Lyapunov functions based on the set of initial trajectories and the set of discovered trajectories. |
| 地址 |
US |
