Approximating state sets using circumscribing polyhedron with fewer facets

Hian Suan Chew; Lawrence E. Holloway

doi:10.1109/SECON.1999.766080

Approximating state sets using circumscribing polyhedron with fewer facets

Hian Suan Chew
, Lawrence E. Holloway

Institute for Sustainable Manufacturing (ISM)

Producción científica: Conference contribution › revisión exhaustiva

Resumen

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.

Idioma original	English
Título de la publicación alojada	Proceedings - IEEE Southeastcon 1999
Subtítulo de la publicación alojada	Technology on the Brink of 2000
Páginas	14-20
Número de páginas	7
ISBN (versión digital)	0780352378
DOI	https://doi.org/10.1109/SECON.1999.766080
Estado	Published - 1999
Evento	1999 IEEE Southeastcon - Lexington, United States Duración: mar 25 1999 → mar 28 1999

Serie de la publicación

Nombre	Conference Proceedings - IEEE SOUTHEASTCON
Volumen	1999-March
ISSN (versión impresa)	1091-0050
ISSN (versión digital)	1558-058X

Conference

Conference	1999 IEEE Southeastcon
País/Territorio	United States
Ciudad	Lexington
Período	3/25/99 → 3/28/99

Nota bibliográfica

Publisher Copyright:
© 1999 IEEE.

Financiación

'Please address all correspondence to L. E. Holloway at the above address or email: [email protected], 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.

Financiadores	Número del financiador
Center for Robotics and Manufacturing Systems
Rockwell International Corporation
USARO	GRANT daah04-96-1-0399
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China	ECS-9308737
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China
University of Kentucky

ASJC Scopus subject areas

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

Acceder al documento

10.1109/SECON.1999.766080

Otros archivos y enlaces

Citar esto

@inproceedings{6b7facaefada4a5a9b0e0cefdd672400,

title = "Approximating state sets using circumscribing polyhedron with fewer facets",

abstract = "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.",

author = "Chew, \{Hian Suan\} and Holloway, \{Lawrence E.\}",

note = "Publisher Copyright: {\textcopyright} 1999 IEEE.; 1999 IEEE Southeastcon ; Conference date: 25-03-1999 Through 28-03-1999",

year = "1999",

doi = "10.1109/SECON.1999.766080",

language = "English",

series = "Conference Proceedings - IEEE SOUTHEASTCON",

pages = "14--20",

booktitle = "Proceedings - IEEE Southeastcon 1999",

}

TY - GEN

T1 - Approximating state sets using circumscribing polyhedron with fewer facets

AU - Chew, Hian Suan

AU - Holloway, Lawrence E.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0033326370

UR - https://www.scopus.com/pages/publications/0033326370#tab=citedBy

U2 - 10.1109/SECON.1999.766080

DO - 10.1109/SECON.1999.766080

M3 - Conference contribution

AN - SCOPUS:0033326370

T3 - Conference Proceedings - IEEE SOUTHEASTCON

SP - 14

EP - 20

BT - Proceedings - IEEE Southeastcon 1999

T2 - 1999 IEEE Southeastcon

Y2 - 25 March 1999 through 28 March 1999

ER -

Approximating state sets using circumscribing polyhedron with fewer facets

Resumen

Serie de la publicación

Conference

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto