
398 Model-Based Testing for Embedded Systems
In this section, we describe the extension of the RRT algorithm to hybrid system, which
we call the hRRT algorithm. The combination of the hRRT algorithm with the guiding tool
is explained in the next section.
The algorithm stores the visited states in a tree, the root of which corresponds to the
initial state. The construction of the tree is summarized in Algorithm 1.
Algorithm 1 Test generation algorithm hRRT
k =1
T
k
.init(s
init
) s
init
: initial state
repeat
s
goal
= Sampling(S) S: hybrid state space
s
k
near
= Neighbor(T
k
,s
k
goal
)
(s
k
new
,u
k
q
near
)=ContinuousSucc(s
k
near
,h) h: time step
DiscreteSucc(T
k
,s
k
new
)
k ++ ...