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

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. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers.

The final version accepted by J. Comp. Math. : 41 pages, 14 figures. Since the previous version: typos fixed, formatting improved, one mistake in bibliography corrected

Cited by in corpus (7)

• Optimizing adaptive cancer therapy: dynamic programming and evolutionary game theory
• Deterministic control of randomly-terminated processes
• A bi-criteria path planning algorithm for robotics applications
• Piecewise-Deterministic Optimal Path Planning
• Corner cases, singularities, and dynamic factoring
• A Hamilton-Jacobi equation for the continuum limit of non-dominated sorting
• Optimal control with reset-renewable resources