An efficient method for multiobjective optimal control and optimal control subject to integral constraints

32Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

Abstract

We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a "budget" remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian "marching" method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced "weighted sum" based algorithm for the same problem [25]. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers. © 2010 by AMSS, Chinese Academy of Sciences.

Cite

CITATION STYLE

APA

Kumar, A., & Vladimirsky, A. (2010). An efficient method for multiobjective optimal control and optimal control subject to integral constraints. Journal of Computational Mathematics, 28(4), 517–551. https://doi.org/10.4208/jcm.1003-m0015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free