Skip to main content
Article thumbnail
Location of Repository

Averaging and linear programming in some singularly perturbed problems of optimal control

By Vladimir Gaitsgory and Sergey Rossomakhine

Abstract

Article made available in accordance with publisher policy.The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples

Topics: Optimisation, Linear programming, Control systems
Publisher: Springer Verlag
Year: 2014
DOI identifier: 10.1007/s00245-014-9257-1
OAI identifier: oai:dspace.flinders.edu.au:2328/35620
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.springer.com/gp/ope... (external link)
  • http://purl.org/au-research/gr... (external link)
  • http://hdl.handle.net/2328/356... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.