Approximating state sets using circumscribing polyhedron with fewer facets

Hian Suan Chew, Lawrence E. Holloway

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A polyhedron can be described using a set of linear constraints that bound the polyhedron. This paper considers the problem of approximating a polyhedron with a circumscribing polyhedron with fewer constraints. We discuss three methods to find such a circumscribing polyhedra, and compare the resulting approximation errors using sets of randomly generated polyhedra. The work is motivated by the problem of approximating state estimate sets for a class of uncertain dynamic systems.

Original languageEnglish
Title of host publicationProceedings - IEEE Southeastcon 1999
Subtitle of host publicationTechnology on the Brink of 2000
Number of pages7
ISBN (Electronic)0780352378
StatePublished - 1999
Event1999 IEEE Southeastcon - Lexington, United States
Duration: Mar 25 1999Mar 28 1999

Publication series

NameConference Proceedings - IEEE SOUTHEASTCON
ISSN (Print)0734-7502


Conference1999 IEEE Southeastcon
Country/TerritoryUnited States

Bibliographical note

Funding Information:
'Please address all correspondence to L. E. Holloway at the above address or email:, phone: (606) 257-6262 ext. 203. This work has been supported in part by USARO GRANT daah04-96-1-0399, Rockwell International, NSF grant ECS-9308737, and the Center for Manufacturing Systems at the University of Kentucky.

Publisher Copyright:
© 1999 IEEE.

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Signal Processing


Dive into the research topics of 'Approximating state sets using circumscribing polyhedron with fewer facets'. Together they form a unique fingerprint.

Cite this