“…Now, this problem is similar to the previous one except that the control u is now replaced by a perturbation ω, and we can use the same method. In 2 s, we obtain the approximation illustrated by Figure 12 Let us find the set X of all points corresponding to a path that starts from A, avoids B, and reaches C. It corresponds to a path planning problem [54,55] for which interval analysis has been shown to be particularly efficient [56][57][58]. We have…”