Combined Feed
https://feeds.library.caltech.edu/people/Tierno-J-E/combined.rss
A Caltech Library Repository Feedhttp://www.rssboard.org/rss-specificationpython-feedgenenTue, 16 Apr 2024 16:07:20 +0000Unifying robustness analysis and system ID
https://resolver.caltech.edu/CaltechAUTHORS:20190319-105001140
Authors: {'items': [{'id': 'Doyle-J-C', 'name': {'family': 'Doyle', 'given': 'John'}, 'orcid': '0000-0002-1828-2486'}, {'id': 'Newlin-M-P', 'name': {'family': 'Newlin', 'given': 'Matthew'}}, {'id': 'Paganini-F', 'name': {'family': 'Paganini', 'given': 'Fernando'}}, {'id': 'Tierno-J-E', 'name': {'family': 'Tierno', 'given': 'Jorge'}}]}
Year: 1994
DOI: 10.1109/CDC.1994.411725
A unified systems analysis framework is presented, which includes conventional robustness analysis, model validation, and system identification as special cases and thus shows them to be instances of the same fundamental problem. A concrete version of this framework is developed for the linear case, based on a generalized structured singular value. This unification forms the basis for the use of common computational tools and and a more natural interplay between modeling, identification, and robustness analysis.https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/rgkq6-01g59Finite time horizon robust performance analysis
https://resolver.caltech.edu/CaltechAUTHORS:20190315-155217994
Authors: {'items': [{'id': 'Tierno-J-E', 'name': {'family': 'Tierno', 'given': 'Jorge E.'}}, {'id': 'Doyle-J-C', 'name': {'family': 'Doyle', 'given': 'John C.'}, 'orcid': '0000-0002-1828-2486'}]}
Year: 1994
DOI: 10.1109/CDC.1994.411312
Robust performance problems for linear time varying systems considered over a finite horizon, are reduced to the computation of the structured singular value of a finite matrix. Connections are established between the time domain and frequency domain tests.https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/9qztw-6ne04Numerically Efficient Robustness Analysis of Trajectory Tracking for Nonlinear Systems
https://resolver.caltech.edu/CaltechCDSTR:1995.CIT-CDS-95-032
Authors: {'items': [{'id': 'Tierno-J-E', 'name': {'family': 'Tierno', 'given': 'Jorge E.'}}, {'id': 'Murray-R-M', 'name': {'family': 'Murray', 'given': 'Richard M.'}, 'orcid': '0000-0002-5785-7481'}, {'id': 'Doyle-J-C', 'name': {'family': 'Doyle', 'given': 'John C.'}, 'orcid': '0000-0002-1828-2486'}, {'id': 'Gregory-I-M', 'name': {'family': 'Gregory', 'given': 'Irene M.'}}]}
Year: 1995
A numerical algorithm for computing necessary conditions for
performance specifications is developed for nonlinear uncertain systems
following a prescribed trajectory. This algorithm provides a computational
efficient means of evaluating the performance of a nonlinear system in the
presence of noise, real parametric uncertainty, and unmodeled dynamics. The
algorithm is similar in nature and behavior to the power algorithm for the mu
lower bound, and does not rely on a descent method. The algorithm is
applied to two flight control examples.https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/5fs0n-0vw05An efficient algorithm for performance analysis of nonlinear control systems
https://resolver.caltech.edu/CaltechAUTHORS:20190315-142359300
Authors: {'items': [{'id': 'Tierno-J-E', 'name': {'family': 'Tierno', 'given': 'Jorge E.'}}, {'id': 'Murray-R-M', 'name': {'family': 'Murray', 'given': 'Richard M.'}, 'orcid': '0000-0002-5785-7481'}, {'id': 'Doyle-J-C', 'name': {'family': 'Doyle', 'given': 'John C.'}, 'orcid': '0000-0002-1828-2486'}]}
Year: 1995
DOI: 10.1109/acc.1995.532342
A numerical algorithm for computing necessary conditions for performance specifications is developed for nonlinear uncertain systems. The algorithm is similar in nature and behavior to the power algorithm for the ยต lower bound, and does not rely on a descent method. The algorithm is applied to a practical example.https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/nzpt9-8h376Robust performance analysis for a class of uncertain nonlinear systems
https://resolver.caltech.edu/CaltechAUTHORS:20190315-142359062
Authors: {'items': [{'id': 'Tierno-J-E', 'name': {'family': 'Tierno', 'given': 'Jorge E.'}}, {'id': 'Murray-R-M', 'name': {'family': 'Murray', 'given': 'Richard M.'}, 'orcid': '0000-0002-5785-7481'}]}
Year: 1995
DOI: 10.1109/cdc.1995.480382
Performance analysis of a large class of nonlinear systems is proven to be equivalent to performance analysis of a constrained uncertain linear system, for which computable analysis methods have already been developed.https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/b4yer-qag47Control problems and the polynomial time hierarchy
https://resolver.caltech.edu/CaltechAUTHORS:20190319-100707731
Authors: {'items': [{'id': 'Tierno-J-E', 'name': {'family': 'Tierno', 'given': 'Jorge E.'}}, {'id': 'Doyle-J-C', 'name': {'family': 'Doyle', 'given': 'John C.'}, 'orcid': '0000-0002-1828-2486'}]}
Year: 1995
DOI: 10.1109/CDC.1995.478587
Classifies control problems by exhibiting their alternating quantifier structure. This classification allows the authors to relate these control problems to the computational complexity classes of the polynomial time hierarchy. A specific synthesis problem for uncertain systems is shown to be hard in the class II^p_2.https://authors.library.caltech.eduhttps://authors.library.caltech.edu/records/cc5j4-3d113