Abstract
This paper addresses the problem of finding an approximation to the minimal element set of the objective space for the class of multiobjective deterministic finite horizon optimal control problems. The objective space is assumed to be partially ordered by a pointed convex cone containing the origin. The approximation procedure consists of a two-step discretization in time and state space. Following the first-order time discretization, the dynamic programming principle is used to find the multiobjective discrete dynamic programming equation equivalent to the resulting discrete multiobjective optimal control problem. The multiobjective discrete dynamic programming equation is finally discretized in the state space. The convergence of the approximation for both discretization steps is discussed.
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 callDisclaimer: 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.
