default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLening Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Lening Li
, Haoxiang Ma, Abhishek Ninad Kulkarni, Jie Fu:
Dynamic Hypergames for Synthesis of Deceptive Strategies With Temporal Logic Objectives. IEEE Trans Autom. Sci. Eng. 20(1): 334-345 (2023)- [c7]Lening Li, Haoxiang Ma, Shuo Han, Jie Fu:
Synthesis of Proactive Sensor Placement In Probabilistic Attack Graphs. ACC 2023: 3415-3421 - [c6]Lening Li, Hazhar Rahmani, Jie Fu:
Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives. IJCAI 2023: 189-198 - [i5]Lening Li, Zhentian Qian:
Topological Guided Actor-Critic Modular Learning of Continuous Systems with Temporal Objectives. CoRR abs/2304.10041 (2023) - [i4]Lening Li, Hazhar Rahmani, Jie Fu:
Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives. CoRR abs/2304.11641 (2023) - 2022
- [i3]Lening Li, Haoxiang Ma, Shuo Han, Jie Fu:
Synthesis of Proactive Sensor Placement In Probabilistic Attack Graphs. CoRR abs/2210.07385 (2022) - 2021
- [i2]Lening Li, Jie Fu:
Policy Synthesis for Metric Interval Temporal Logic with Probabilistic Distributions. CoRR abs/2105.04593 (2021) - 2020
- [j2]Zhilu Chen, Lening Li, Xinming Huang:
Building an Autonomous Lane Keeping Simulator Using Real-World Data and End-to-End Learning. IEEE Intell. Transp. Syst. Mag. 12(1): 47-59 (2020) - [i1]Lening Li, Haoxiang Ma, Abhishek Ninad Kulkarni, Jie Fu:
Dynamic Hypergames for Synthesis of Deceptive Strategies with Temporal Logic Objectives. CoRR abs/2007.15726 (2020)
2010 – 2019
- 2019
- [c5]Lening Li, Jie Fu:
Approximate Dynamic Programming with Probabilistic Temporal Logic Constraints. ACC 2019: 1696-1703 - [c4]Lening Li, Jie Fu:
Topological Approximate Dynamic Programming under Temporal Logic Constraints. CDC 2019: 5330-5337 - 2017
- [j1]Mathew DeDonato, Felipe Polido, Kevin Knoedler, Benzun P. Wisely Babu, Nandan Banerjee, Christoper P. Bove, Xiongyi Cui, Ruixiang Du, Perry Franklin, Joshua P. Graff, Peng He, Aaron Jaeger, Lening Li, Dmitry Berenson, Michael A. Gennert, Siyuan Feng, Chenggang Liu, X. Xinjilefu, Joohyung Kim, Christopher G. Atkeson, Xianchao Long, Taskin Padir:
Team WPI-CMU: Achieving Reliable Humanoid Behavior in the DARPA Robotics Challenge. J. Field Robotics 34(2): 381-399 (2017) - [c3]Lening Li, Jie Fu:
Sampling-based approximate optimal temporal logic planning. ICRA 2017: 1328-1335 - 2016
- [c2]Lening Li, Xianchao Long, Michael A. Gennert:
BiRRTOpt: A combined sampling and optimizing motion planner for humanoid robots. Humanoids 2016: 469-476 - 2015
- [c1]Christopher G. Atkeson, Benzun P. Wisely Babu, Nandan Banerjee, Dmitry Berenson, Christoper P. Bove, Xiongyi Cui, Mathew DeDonato, Ruixiang Du, Siyuan Feng, Perry Franklin, Michael A. Gennert, Joshua P. Graff, Peng He, Aaron Jaeger, Joohyung Kim, Kevin Knoedler, Lening Li, Chenggang Liu, Xianchao Long, Taskin Padir, Felipe Polido, G. G. Tighe, X. Xinjilefu:
No falls, no resets: Reliable humanoid behavior in the DARPA robotics challenge. Humanoids 2015: 623-630
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-09-22 00:39 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:
