CaltechAUTHORS
  A Caltech Library Service

A new solution approach to polynomial LPV system analysis and synthesis

Wu, Fen and Prajna, Stephen (2005) A new solution approach to polynomial LPV system analysis and synthesis. In: Proceedings of the 2004 American Control Conference, ACC, June 30-July 2, 2004, Boston Sheraton Hotel, Boston, Massachusetts. Vol.2. IEEE , Los Alamitos, CA, pp. 1362-1367. ISBN 0-7803-8335-4 http://resolver.caltech.edu/CaltechAUTHORS:WUFacc04

[img]
Preview
PDF
See Usage Policy.

448Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:WUFacc04

Abstract

Based on sum-of-squares (SOS) decomposition, we propose a new solution approach for polynomial LPV system analysis and control synthesis problems. Instead of solving matrix variables over a positive definite cone, the SOS approach tries to find a suitable decomposition to verify the positiveness of given polynomials. The complexity of the SOS-based numerical method is polynomial of the problem size. This approach also leads to more accurate solutions to LPV systems than most existing relaxation methods. Several examples have been used to demonstrate benefits of the SOS-based solution approach.


Item Type:Book Section
Additional Information:© Copyright 2004 IEEE. Reprinted with permission.
Subject Keywords:computational complexity; Control system analysis; control system synthesis; linear systems; matrix decomposition; polynomials; relaxation theory
Record Number:CaltechAUTHORS:WUFacc04
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:WUFacc04
Alternative URL:http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=30162&arnumber=1386764&count=166&index=67
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:4743
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:05 Sep 2006
Last Modified:26 Dec 2012 09:01

Repository Staff Only: item control page