• DocumentCode
    989428
  • Title

    Upper bounds and approximate solutions for multidisk problems

  • Author

    Ting, Thomas ; Poolla, Kameshwar

  • Author_Institution
    Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
  • Volume
    33
  • Issue
    8
  • fYear
    1988
  • fDate
    8/1/1988 12:00:00 AM
  • Firstpage
    783
  • Lastpage
    786
  • Abstract
    Approximate solutions of multiobjective H-optimization problems, also referred to as multidisk problems, are considered. The main result is an algorithm that makes it possible to compute an upper bound for linear two-disk problems and also a (suboptimal) controller that achieves this bound. The algorithm involves some graphical techniques which can also be used to demonstrate explicitly the design tradeoffs inherent in problems involving competing objectives. The results can be generalized to multidisk problems
  • Keywords
    optimisation; approximate solutions; multidisk problems; multiobjective H-optimization; upper bound; Algorithm design and analysis; Filtering algorithms; Filters; High performance computing; Merging; Smoothing methods; State estimation; Stochastic processes; Time factors; Timing;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/9.1300
  • Filename
    1300