Linear Hybrid System Falsification With Descent

Details Linear Hybrid System Falsification With Descent Linear Hybrid System Falsification With Descent

2011-05-09

arxiv.org/abs/1105.1733v4

Computer Science

Systems and Control

Tech report

Scientific paper

In this paper, we address the problem of local search for the falsification of hybrid automata with affine dynamics. Namely, if we are given a sequence of locations and a maximum simulation time, we return the trajectory that comes the closest to the unsafe set. In order to solve this problem, we formulate it as a differentiable optimization problem which we solve using Sequential Quadratic Programming. The purpose of developing such a local search method is to combine it with high level stochastic optimization algorithms in order to falsify hybrid systems with complex discrete dynamics and high dimensional continuous spaces. Experimental results indicate that indeed the local search procedure improves upon the results of pure stochastic optimization algorithms.

Affiliated with

Also associated with

No associations

Rating

Linear Hybrid System Falsification With Descent does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Hybrid System Falsification With Descent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Hybrid System Falsification With Descent will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334518