default search action
Shahab Kaynama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j5]Jaime F. Fisac
, Anayo K. Akametalu
A General Safety Framework for Learning-Based Control in Uncertain Robotic Systems. IEEE Trans. Autom. Control. 64(7): 2737-2752 (2019) - 2017
- [i4]Jaime F. Fisac, Anayo K. Akametalu, Melanie Nicole Zeilinger, Shahab Kaynama, Jeremy H. Gillula, Claire J. Tomlin:
A General Safety Framework for Learning-Based Control in Uncertain Robotic Systems. CoRR abs/1705.01292 (2017) - 2015
- [j4]Shahab Kaynama, Ian M. Mitchell, Meeko M. K. Oishi
Scalable Safety-Preserving Robust Control Synthesis for Continuous-Time Linear Systems. IEEE Trans. Autom. Control. 60(11): 3065-3070 (2015) - [c10]Ian M. Mitchell, Shahab Kaynama:
An improved algorithm for robust safety analysis of sampled data systems. HSCC 2015: 21-30 - 2014
- [c9]Anayo K. Akametalu, Shahab Kaynama, Jaime F. Fisac, Melanie Nicole Zeilinger, Jeremy H. Gillula, Claire J. Tomlin:
Reachability-based safe learning with Gaussian processes. CDC 2014: 1424-1431 - [c8]Jeremy H. Gillula, Shahab Kaynama, Claire J. Tomlin:
Sampling-based approximation of the viability kernel for high-dimensional linear sampled-data systems. HSCC 2014: 173-182 - [c7]Charles Dabadie, Shahab Kaynama, Claire J. Tomlin:
A practical reachability-based collision avoidance algorithm for sampled-data systems: Application to ground robots. IROS 2014: 4161-4168 - [i3]Shahab Kaynama, Jeremy H. Gillula, Claire J. Tomlin:
A sampling-based approach to scalable constraint satisfaction in linear sampled-data systems - Part I: Computation. CoRR abs/1405.2363 (2014) - 2013
- [j3]John N. Maidens
Lagrangian methods for approximating the viability kernel in high-dimensional systems. Autom. 49(7): 2017-2029 (2013) - [j2]Shahab Kaynama, Meeko Oishi
A Modified Riccati Transformation for Decentralized Computation of the Viability Kernel Under LTI Dynamics. IEEE Trans. Autom. Control. 58(11): 2878-2892 (2013) - [i2]Shahab Kaynama, Meeko Oishi:
A Modified Riccati Transformation for Decentralized Computation of the Viability Kernel Under LTI Dynamics. CoRR abs/1302.5990 (2013) - [i1]Shahab Kaynama, Ian M. Mitchell, Meeko Oishi, Guy Albert Dumont:
Scalable Safety-Preserving Robust Control Synthesis for Continuous-Time Linear Systems. CoRR abs/1312.3399 (2013) - 2012
- [c6]Shahab Kaynama, Meeko M. K. Oishi, Ian M. Mitchell, Guy Albert Dumont:
Fixed-complexity piecewise ellipsoidal representation of the continual reachability set based on ellipsoidal techniques. ACC 2012: 2425-2430 - [c5]Shahab Kaynama, John N. Maidens
Computing the viability kernel using maximal reachable sets. HSCC 2012: 55-64 - 2011
- [j1]Shahab Kaynama, Meeko Oishi
Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems. Int. J. Control 84(1): 165-179 (2011) - [c4]Shahab Kaynama, Meeko Oishi
The continual reachability set and its computation using maximal reachability techniques. CDC/ECC 2011: 6110-6115 - 2010
- [c3]Shahab Kaynama, Osman Kukrer
A Suboptimal Discrete-time Predictive Current Controller for a Voltage-source Inverter. CCA 2010: 632-639 - [c2]Shahab Kaynama, Meeko Oishi:
Overapproximating the reachable sets of LTI systems through a similarity transformation. ACC 2010: 1874-1879
2000 – 2009
- 2009
- [c1]Shahab Kaynama, Meeko Oishi
Schur-based decomposition for reachability analysis of linear time-invariant systems. CDC 2009: 69-74
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: