A new solution to the multipoint Markov-Dubins problem via iterative dynamic programming is herein presented. The shortest path problem connecting a sequence of given points in the plane while ...

On the other hand, backstepping with surface dynamic control actually reduces the computation complexity of ADP through constructing one part of the CLF by solving semidefinite programming using SOS.