Abstract
Continuation methods provide a solution to the initial guess problem that numerical root solvers and shooting methods often face by iteratively transforming an auxiliary solution into a desired solution through differential corrections. While seemingly straightforward, designing an automated continuation strategy that starts at the auxiliary problem and successfully terminates at the desired problem with minimal user intervention is often challenging especially for optimal trajectory-planning problems with nonlinear motion models subject to state/path and control constraints. One scenario where the auxiliary problem does not connect to the desired problem occurs when the intermediate problems are ill posed (i.e., infeasible). This paper presents a two-layered Jacobian conditioned stabilized continuation algorithm that circumvents these infeasible zones along a user-defined continuation path with little designer intervention. The efficacy of this approach is evaluated in the context of several prototype problems including quadratic root-solving, optimal path planning with a Dubins model, an optimal orbit transfer problem, and an optimal high-speed vehicle trajectory generation problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.