default search action
Michael Hibbard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j7]Ege C. Kaya, Michael Hibbard, Takashi Tanaka, Ufuk Topcu, Abolfazl Hashemi:
Randomized greedy methods for weak submodular sensor selection with robustness considerations. Autom. 171: 111984 (2025) - 2024
- [j6]Yagiz Savas
, Christos K. Verginis
On Minimizing Total Discounted Cost in MDPs Subject to Reachability Constraints. IEEE Trans. Autom. Control. 69(9): 6466-6473 (2024) - [i6]Ege C. Kaya, Michael Hibbard, Takashi Tanaka, Ufuk Topcu, Abolfazl Hashemi:
Randomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations. CoRR abs/2404.03740 (2024) - 2023
- [j5]Michael Hibbard, Takashi Tanaka, Ufuk Topcu:
Simultaneous perception-action design via invariant finite belief sets. Autom. 155: 111140 (2023) - [j4]Michael Hibbard
Safely: Safe Stochastic Motion Planning Under Constrained Sensing via Duality. IEEE Trans. Robotics 39(5): 3464-3478 (2023) - [c5]Michael Hibbard, Abolfazl Hashemi, Takashi Tanaka, Ufuk Topcu:
Randomized Greedy Algorithms for Sensor Selection in Large-Scale Satellite Constellations. ACC 2023: 4276-4283 - 2022
- [j3]Kyle Dunlap
Comparing Run Time Assurance Approaches for Safe Spacecraft Docking. IEEE Control. Syst. Lett. 6: 1849-1854 (2022) - [j2]Yagiz Savas
Entropy Maximization for Partially Observable Markov Decision Processes. IEEE Trans. Autom. Control. 67(12): 6948-6955 (2022) - [c4]Michael Hibbard, Ufuk Topcu, Kerianne Hobbs:
Guaranteeing Safety via Active-Set Invariance Filters for Multi-Agent Space Systems with Coupled Dynamics*. ACC 2022: 430-436 - [i5]Michael Hibbard, Abraham P. Vinod, Jesse Quattrociocchi, Ufuk Topcu:
Safely: Safe Stochastic Motion Planning Under Constrained Sensing via Duality. CoRR abs/2203.02816 (2022) - 2021
- [j1]Michael Hibbard
Point-Based Value Iteration and Approximately Optimal Dynamic Sensor Selection for Linear-Gaussian Processes. IEEE Control. Syst. Lett. 5(6): 2192-2197 (2021) - [c3]Michael Hibbard, Kirsten Tuggle, Takashi Tanaka:
Point-Based Value Iteration and Approximately Optimal Dynamic Sensor Selection for Linear-Gaussian Processes. ACC 2021: 2625-2630 - [i4]Michael Hibbard, Takashi Tanaka, Ufuk Topcu:
Simultaneous Perception-Action Design via Invariant Finite Belief Sets. CoRR abs/2109.05073 (2021) - [i3]Kyle Dunlap, Michael Hibbard, Mark Mote, Kerianne Hobbs:
Comparing Run Time Assurance Approaches for Safe Spacecraft Docking. CoRR abs/2110.00447 (2021) - 2020
- [c2]Michael Hibbard, Yasuaki Wasa
Path Integral Control for Stochastic Dynamic Traffic Routing Problems. CDC 2020: 261-267 - [i2]Michael Hibbard, Kirsten Tuggle, Takashi Tanaka:
Point-Based Value Iteration and Approximately Optimal Dynamic Sensor Selection for Linear-Gaussian Processes. CoRR abs/2012.12842 (2020)
2010 – 2019
- 2019
- [c1]Michael Hibbard, Yagiz Savas, Bo Wu, Takashi Tanaka, Ufuk Topcu
Unpredictable Planning Under Partial Observability. CDC 2019: 2271-2277 - [i1]Michael Hibbard, Yagiz Savas, Zhe Xu
Minimizing the Information Leakage Regarding High-Level Task Specifications. CoRR abs/1911.09889 (2019)
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-10-31 20:18 CET 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: