Direct multiple shooting method for solving approximate shortest path problems
The authors use the idea of the direct multiple shooting method to introduce an algorithm for solving some approximate shortest path problems in motion planning. The algorithm is based on a direct multiple shooting discretization that includes a collinear condition, multiple shooting structure, and approximation conditions.
scientific article; zbMATH DE number 6138047