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.
|Title of host publication||Proceedings - IEEE Southeastcon 1999|
|Subtitle of host publication||Technology on the Brink of 2000|
|Number of pages||7|
|State||Published - 1999|
|Event||1999 IEEE Southeastcon - Lexington, United States|
Duration: Mar 25 1999 → Mar 28 1999
|Name||Conference Proceedings - IEEE SOUTHEASTCON|
|Conference||1999 IEEE Southeastcon|
|Period||3/25/99 → 3/28/99|
Bibliographical noteFunding Information:
'Please address all correspondence to L. E. Holloway at the above address or email: firstname.lastname@example.org, 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.
© 1999 IEEE.
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
- Control and Systems Engineering
- Signal Processing