Optimal Impact Angle Guidance via Numerical Optimization Under Non-convex Constraints

Citations

SCOPUS

2

초록

Many optimal guidance problems can be formulated as non-convex optimization problems, which can be solved indirectly by relaxation, convexification, or linearization. Although these methods are guaranteed to converge to the global optimum of the modified problems, the obtained solution may not guarantee global optimality or even the feasibility of the original non-convex problems. In this paper, we propose an ADMM-based optimal guidance law that directly handles the non-convex constraints encountered in formulating the guidance problems. The proposed ADMM-based guidance law alternatingly solves the least square problems and projects the solution onto non-convex feasible sets, which rapidly converges to feasible suboptimal solutions or sometimes to the globally optimal solutions. The proposed algorithm is verified via a series of numerical simulations on impact angle guidance problems, and it is demonstrated that the proposed algorithm provides better guidance performance than conventional techniques. © ICROS 2023.

키워드

alternating direction method of multiplierseuclidean projectionimpact angle control guidancenon-convex optimization
제목
Optimal Impact Angle Guidance via Numerical Optimization Under Non-convex Constraints
저자
Park, GyubinJeong, Da HoonKim, Jong-Han
DOI
10.5302/J.ICROS.2023.23.0075
발행일
2023
유형
Article
저널명
제어.로봇.시스템학회 논문지
29
8
페이지
679 ~ 685