default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael H. Lim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j1]Michael H. Lim, Tyler J. Becker, Mykel J. Kochenderfer
, Claire J. Tomlin, Zachary N. Sunberg:
Optimality Guarantees for Particle Belief Approximation of POMDPs. J. Artif. Intell. Res. 77: 1591-1636 (2023)
Conference and Workshop Papers
- 2024
- [c6]Michael H. Lim, Tyler J. Becker, Mykel J. Kochenderfer, Claire J. Tomlin, Zachary Sunberg:
Optimality Guarantees for Particle Belief Approximation of POMDPs (Abstract Reprint). IJCAI 2024: 8481 - 2023
- [c5]Anish Muthali, Haotian Shen, Sampada Deglurkar, Michael H. Lim, Rebecca Roelofs, Aleksandra Faust, Claire J. Tomlin:
Multi-Agent Reachability Calibration with Conformal Prediction. CDC 2023: 6596-6603 - [c4]Sampada Deglurkar, Michael H. Lim, Johnathan Tucker, Zachary N. Sunberg, Aleksandra Faust, Claire J. Tomlin:
Compositional Learning-based Planning for Vision POMDPs. L4DC 2023: 469-482 - 2022
- [c3]Michael H. Lim, Andy Zeng, Brian Ichter, Maryam Bandari, Erwin Coumans, Claire J. Tomlin, Stefan Schaal, Aleksandra Faust:
Multi-Task Learning with Sequence-Conditioned Transporter Networks. ICRA 2022: 2489-2496 - 2021
- [c2]Michael H. Lim, Claire J. Tomlin, Zachary N. Sunberg:
Voronoi Progressive Widening: Efficient Online Solvers for Continuous State, Action, and Observation POMDPs. CDC 2021: 4493-4500 - 2020
- [c1]Michael H. Lim, Claire J. Tomlin, Zachary N. Sunberg:
Sparse Tree Search Optimality Guarantees in POMDPs with Continuous Observation Spaces. IJCAI 2020: 4135-4142
Informal and Other Publications
- 2023
- [i7]Anish Muthali, Haotian Shen, Sampada Deglurkar, Michael H. Lim, Rebecca Roelofs, Aleksandra Faust, Claire J. Tomlin:
Multi-Agent Reachability Calibration with Conformal Prediction. CoRR abs/2304.00432 (2023) - 2022
- [i6]Benjamin W. Blonder, Michael H. Lim, Zachary Sunberg, Claire J. Tomlin:
Navigation between states in ecological communities by taking shortcuts, with application to control. CoRR abs/2204.07629 (2022) - [i5]Michael H. Lim, Tyler J. Becker, Mykel J. Kochenderfer, Claire J. Tomlin, Zachary N. Sunberg:
Generalized Optimality Guarantees for Solving Continuous Observation POMDPs through Particle Belief MDP Approximation. CoRR abs/2210.05015 (2022) - 2021
- [i4]Michael H. Lim, Andy Zeng, Brian Ichter, Maryam Bandari, Erwin Coumans, Claire J. Tomlin, Stefan Schaal, Aleksandra Faust:
Multi-Task Learning with Sequence-Conditioned Transporter Networks. CoRR abs/2109.07578 (2021) - [i3]Sampada Deglurkar, Michael H. Lim, Johnathan Tucker, Zachary N. Sunberg, Aleksandra Faust, Claire J. Tomlin:
Visual Learning-based Planning for Continuous High-Dimensional POMDPs. CoRR abs/2112.09456 (2021) - 2020
- [i2]Michael H. Lim, Claire J. Tomlin, Zachary N. Sunberg:
Voronoi Progressive Widening: Efficient Online Solvers for Continuous Space MDPs and POMDPs with Provably Optimal Components. CoRR abs/2012.10140 (2020) - 2019
- [i1]Michael H. Lim, Claire J. Tomlin, Zachary N. Sunberg:
Sparse tree search optimality guarantees in POMDPs with continuous observation spaces. CoRR abs/1910.04332 (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-30 21:31 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:
