Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Reach Set Computations Using Real Quantifier Elimination
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2034/2001
Book
Hybrid Systems: Computation and Control
DOI
10.1007/3-540-45351-2
Copyright
2001
ISBN
978-3-540-41866-5
DOI
10.1007/3-540-45351-2_9
Pages
63-76
Subject Collection
Computer Science
SpringerLink Date
Monday, January 01, 2001
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (195.5 KB)
Free Preview
Reach Set Computations Using Real Quantifier Elimination
Hirokazu Anai
7
and Volker Weispfenning
8
(7)
Computer System Laboratories, Fujitsu Laboratories Ltd, Kamikodanaka 4-1-1, Nakahara-ku Kawasaki 211-8588, Japan
(8)
Fakultät für Mathematik und Informatik, Universität Passau, D-94030 Passau, Germany
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 backward 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.
Hirokazu
Anai
Email:
anai@jp.fujitsu.com
Volker
Weispfenning
Email:
weispfen@uni-passau.de
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Referenced by
1 newer article
Prajna, Stephen (2007) .
IEEE Transactions on Automatic Control
52(8)
[CrossRef]
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.107 • Server: mpweb18
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)