default search action
Lars Blackmore
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j10]Nanaz Fathpour, Lars Blackmore, Yoshiaki Kuwata, Christopher Assad, Michael T. Wolf, Claire Newman, Alberto Elfes, Kim Reh:
Feasibility Studies on Guidance and Global Path Planning for Wind-Assisted Montgolfière in Titan. IEEE Syst. J. 8(4): 1112-1125 (2014) - [i1]Masahiro Ono, Brian C. Williams, Lars Blackmore:
Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk. CoRR abs/1402.0579 (2014) - 2013
- [j9]Masahiro Ono, Brian C. Williams, Lars Blackmore:
Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk. J. Artif. Intell. Res. 46: 511-577 (2013) - [j8]Behçet Açikmese, John M. Carson III, Lars Blackmore:
Lossless Convexification of Nonconvex Control Bound and Pointing Constraints of the Soft Landing Optimal Control Problem. IEEE Trans. Control. Syst. Technol. 21(6): 2104-2113 (2013) - [c18]Masahiro Ono, Brian C. Williams, Lars Blackmore:
Paper Summary: Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk. ICAPS 2013 - 2012
- [j7]Lars Blackmore, Behçet Açikmese, John M. Carson III:
Lossless convexification of control constraints for a class of nonlinear optimal control problems. Syst. Control. Lett. 61(8): 863-870 (2012) - [c17]Lars Blackmore, Behçet Açikmese, John M. Carson III:
Lossless convexification of control constraints for a class of nonlinear optimal control problems. ACC 2012: 5519-5525 - 2011
- [j6]Behçet Açikmese, Lars Blackmore:
Lossless convexification of a class of optimal control problems with non-convex control constraints. Autom. 47(2): 341-347 (2011) - [j5]Lars Blackmore, Masahiro Ono, Brian C. Williams:
Chance-Constrained Optimal Path Planning With Obstacles. IEEE Trans. Robotics 27(6): 1080-1094 (2011) - [c16]John M. Carson III, Behçet Açikmese, Lars Blackmore:
Lossless convexification of Powered-Descent Guidance with non-convex thrust bound and pointing constraints. ACC 2011: 2651-2656 - 2010
- [j4]Lars Blackmore, Masahiro Ono, Askar Bektassov, Brian C. Williams:
A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive Control. IEEE Trans. Robotics 26(3): 502-517 (2010) - [c15]Behçet Açikmese, Lars Blackmore:
Lossless convexification of a class of non-convex optimal control problems for linear systems. ACC 2010: 776-781 - [c14]Masahiro Ono, Lars Blackmore, Brian C. Williams:
Chance constrained finite horizon optimal control with nonconvex constraints. ACC 2010: 1145-1152 - [c13]Insu Chang, Soon-Jo Chung, Lars Blackmore:
Cooperative control with adaptive graph Laplacians for spacecraft formation flying. CDC 2010: 4926-4933 - [c12]Michael T. Wolf, Lars Blackmore, Yoshiaki Kuwata, Nanaz Fathpour, Alberto Elfes, Claire Newman:
Probabilistic motion planning of balloons in strong, uncertain wind fields. ICRA 2010: 1123-1129 - [c11]Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, Christopher Assad, Nanaz Fathpour, Claire Newman, Alberto Elfes:
Global reachability and path planning for planetary exploration with montgolfiere balloons. ICRA 2010: 3581-3588
2000 – 2009
- 2009
- [j3]Kelly Cohen, Fernando Figueroa, Ella M. Atkins, Michel D. Ingham, Richard J. Doyle, Sanjay Garg, Irene Gregory, Shigeru Obayashi, Nhan Ngyuen, Lars Blackmore, Walt Truszkowski:
Introduction: Enhancing Intelligence in Aerospace Systems. J. Aerosp. Comput. Inf. Commun. 6(3): 121-122 (2009) - [c10]Yoshiaki Kuwata, Lars Blackmore, Michael T. Wolf, Nanaz Fathpour, Claire Newman, Alberto Elfes:
Decomposition algorithm for global reachability analysis on a time-varying graph with an application to planetary exploration. IROS 2009: 3955-3960 - 2008
- [j2]Lars Blackmore, Stanislav Funiak, Brian C. Williams:
A combined stochastic and greedy hybrid estimation capability for concurrent hybrid models with autonomous mode transitions. Robotics Auton. Syst. 56(2): 105-129 (2008) - [j1]Lars Blackmore, Senthooran Rajamanoharan, Brian C. Williams:
Active Estimation for Jump Markov Linear Systems. IEEE Trans. Autom. Control. 53(10): 2223-2236 (2008) - 2007
- [c9]Lars Blackmore, Brian C. Williams:
Optimal, Robust Predictive Control of Nonlinear Systems under Probabilistic Uncertainty using Particles. ACC 2007: 1759-1761 - [c8]Lars Blackmore, Stephanie Gil, Seung Chung, Brian C. Williams:
Model learning for switching linear systems with autonomous mode transitions. CDC 2007: 4648-4655 - [c7]Lars Blackmore, Askar Bektassov, Masahiro Ono, Brian C. Williams:
Robust, Optimal Predictive Control of Jump Markov Linear Systems Using Particles. HSCC 2007: 104-117 - 2006
- [c6]Lars Blackmore, Brian Williams:
Optimal manipulator path planning with obstacles using disjunctive programming. ACC 2006: 1-3 - [c5]Lars Blackmore, Hui Li, Brian Williams:
A probabilistic approach to optimal robust path planning with obstacles. ACC 2006: 1-7 - [c4]Lars Blackmore, Senthooran Rajamanoharan, Brian C. Williams:
Active Estimation for Switching Linear Dynamic Systems. CDC 2006: 137-144 - [c3]Lars Blackmore, Brian Charles Williams:
Finite Horizon Control Design for Optimal Discrimination between Several Models. CDC 2006: 1147-1152 - 2005
- [c2]Lars Blackmore, Stanislav Funiak, Brian C. Williams:
Combining Stochastic and Greedy Search in Hybrid Estimation. AAAI 2005: 282-287 - [c1]Lars Blackmore, Brian Williams:
Finite Horizon Control Design for Optimal Model Discrimination. CDC/ECC 2005: 3795-3802
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:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint