default search action
María Svorenová
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j3]Morteza Lahijanian, María Svorenová, Akshay A. Morye, Brian Yeomans, Dushyant Rao, Ingmar Posner, Paul Newman, Hadas Kress-Gazit, Marta Kwiatkowska:
Resource-Performance Tradeoff Analysis for Mobile Robots. IEEE Robotics Autom. Lett. 3(3): 1840-1847 (2018) - 2016
- [j2]María Svorenová, Marta Kwiatkowska:
Quantitative verification and strategy synthesis for stochastic games. Eur. J. Control 30: 15-30 (2016) - [c6]Eva Tesarova, María Svorenová, Jiri Barnat, Ivana Cerna:
Optimal observation mode scheduling for systems under temporal constraints. ACC 2016: 1099-1104 - [i6]Eva Tesarova, María Svorenová, Jiri Barnat, Ivana Cerná:
Optimal Observation Mode Scheduling for Systems under Temporal Constraints. CoRR abs/1602.08260 (2016) - [i5]María Svorenová, Morteza Lahijanian, Akshay A. Morye, Dushyant Rao, Ingmar Posner, Paul Newman, Hadas Kress-Gazit, Marta Kwiatkowska:
Resource-Performance Trade-off Analysis for Mobile Robots. CoRR abs/1609.04888 (2016) - 2015
- [j1]María Svorenová, Ivana Cerna, Calin Belta:
Optimal Temporal Logic Control for Deterministic Transition Systems With Probabilistic Penalties. IEEE Trans. Autom. Control. 60(6): 1528-1541 (2015) - [c5]María Svorenová, Martin Chmelik, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal logic motion planning using POMDPs with parity objectives: case study paper. HSCC 2015: 233-238 - [c4]María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. HSCC 2015: 259-268 - 2014
- [i4]María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. CoRR abs/1410.5387 (2014) - 2013
- [c3]María Svorenová, Ivana Cerná, Calin Belta:
Optimal receding horizon control for finite deterministic systems with temporal logic constraints. ACC 2013: 4399-4404 - [c2]María Svorenová, Ivana Cerna, Calin Belta:
Optimal control of MDPs with temporal logic constraints. CDC 2013: 3938-3943 - [i3]María Svorenová, Ivana Cerna, Calin Belta:
Optimal Control of MDPs with Temporal Logic Constraints. CoRR abs/1303.1942 (2013) - [i2]María Svorenová, Ivana Cerná, Calin Belta:
Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints. CoRR abs/1303.3533 (2013) - 2012
- [c1]María Svorenová, Jana Tumova, Jiri Barnat, Ivana Cerna:
Attraction-based receding horizon path planning with temporal logic constraints. CDC 2012: 6749-6754 - [i1]María Svorenová, Jana Tumova, Jiri Barnat, Ivana Cerna:
Attraction-Based Receding Horizon Path Planning with Temporal Logic Constraints. CoRR abs/1208.5855 (2012)
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-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint