Abstract

In the motion planning of robot, nonlinear dynamic constraints and obstacle avoidance constraints make the problem highly non-convex and difficult to solve. In this paper, a general algorithmic framework for trajectory optimization is proposed based on alternating direction method of multipliers (ADMM) and convex feasible set algorithm (CFS). The ADMM framework decomposes the original problem into an optimal control sub-problem with only dynamic constraints and a subproblem with only obstacle avoidance constraints, while the sub-problem with obstacle avoidance constraints is solved via CFS based on the geometric properties of the feasible region. The convergence of proposed algorithm is proven, and the simulation results in different cases verify the feasibility and effectiveness of proposed algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.