Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Impact Angle Guidance via First-Order Optimization under Nonconvex Constraints (2310.00398v2)

Published 30 Sep 2023 in math.OC, cs.RO, cs.SY, and eess.SY

Abstract: Most of the optimal guidance problems can be formulated as nonconvex 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 nonconvex problems. In this paper, we propose a computational optimal guidance approach that directly handles the nonconvex constraints encountered in formulating the guidance problems. The proposed computational guidance approach alternately solves the least squares problems and projects the solution onto nonconvex 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 under state dependent maneuver vector constraints, and it is demonstrated that the proposed algorithm provides superior guidance performance than conventional techniques.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. A. Domahidi, E. Chu, and S. Boyd, “ECOS: An SOCP solver for embedded systems,” in Proc. of European Control Conference (ECC), Zurich, Switzerland, 2013, pp. 3071–3076.
  2. D. Kim and J. A. Fessler, “Optimized first-order methods for smooth convex minimization,” Mathematical Programming, vol. 159, no. 1-2, pp. 81–107, 2016.
  3. B. Açıkmeşe, J. Carson, and L. Blackmore, “Lossless convexification of nonconvex control bound and pointing constraints of the soft landing optimal control problem,” IEEE Transactions on Control Systems Technology, vol. 21, no. 6, pp. 2104–2113, 2013.
  4. Y. Mao, D. Dueri, M. Szmuk, and B. Açıkmeşe, “Successive convexification of non-convex optimal control problems with state constraints,” IFAC-PapersOnLine, vol. 50, no. 1, pp. 4063–4069, 2017.
  5. I. Rusnak and L. Meir, “Modern guidance law for high-order autopilot,” Journal of Guidance, Control, and Dynamics, vol. 14, no. 5, pp. 1056–1058, 1991.
  6. C.-K. Ryoo, H. Cho, and M.-J. Tahk, “Optimal guidance laws with terminal impact angle constraint,” Journal of Guidance, Control, and Dynamics, vol. 28, no. 4, pp. 724–732, 2005.
  7. B. Açıkmeşe and L. Blackmore, “Lossless convexification of a class of optimal control problems with non-convex control constraints,” Automatica, vol. 47, no. 2, pp. 341–347, 2011.
  8. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends in Machine Learning, vol. 3, no. 1, pp. 1–122, 2011.
  9. J. Choi and J.-H. Kim, “A first-order method with expansive projection for optimal powered descent guidance,” arXiv preprint arXiv:2310.00397, 2023.
  10. Y. Wang, W. Yin, and J. Zeng, “Global convergence of ADMM in nonconvex nonsmooth optimization,” Journal of Scientific Computing, vol. 78, no. 1, pp. 29–63, 2019.
  11. R. Nishihara, L. Lessard, B. Recht, A. Packard, and M. Jordan, “A general analysis of the convergence of ADMM,” in Proc. of International Conference on Machine Learning, Lille, France, 2015, pp. 343–352.
Citations (1)

Summary

We haven't generated a summary for this paper yet.