Reach set computations using real quantifier elimination

68Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Reach set computations are of fundamental importance in control theory. We consider the reach set problem for open-loop systems described by parametric inhomogeneous linear differential systems and use real quantifier elimination methods to get exact and approximate solutions. The method employs a reduction of the forward and back- ward reach set and control parameter set problems to the transcendental implicitization problems for the components of special solutions of simpler non-parametric systems. For simple elementary functions we give an exact calculation of the cases where exact semialgebraic transcendental implicitization is possible. For the negative cases we provide approximate alternating using discrete point checking or safe estimations of reach sets and control parameter sets. Examples are computed using the redlog and qepcad packages.

Cite

CITATION STYLE

APA

Anai, H., & Weispfenning, V. (2001). Reach set computations using real quantifier elimination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2034, pp. 63–76). Springer Verlag. https://doi.org/10.1007/3-540-45351-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free