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)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Proceedings - IEEE Southeastcon 1999
Subtitle of host publication	Technology on the Brink of 2000
Pages	14-20
Number of pages	7
ISBN (Electronic)	0780352378
DOIs	https://doi.org/10.1109/SECON.1999.766080
State	Published - 1999
Event	1999 IEEE Southeastcon - Lexington, United States Duration: Mar 25 1999 → Mar 28 1999

Publication series

Name	Conference Proceedings - IEEE SOUTHEASTCON
Volume	1999-March
ISSN (Print)	1091-0050
ISSN (Electronic)	1558-058X

Conference

Conference	1999 IEEE Southeastcon
Country/Territory	United States
City	Lexington
Period	3/25/99 → 3/28/99

Bibliographical note

Publisher Copyright:
© 1999 IEEE.

Funding

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

Funders	Funder number
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

Access to Document

10.1109/SECON.1999.766080

Cite this

@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",

}

Approximating state sets using circumscribing polyhedron with fewer facets. / Chew, Hian Suan; Holloway, Lawrence E.
Proceedings - IEEE Southeastcon 1999: Technology on the Brink of 2000. 1999. p. 14-20 (Conference Proceedings - IEEE SOUTHEASTCON; Vol. 1999-March).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

Abstract

Publication series

Conference

Bibliographical note

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this