default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel T. Larsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Daniel T. Larsson:
An Information-Theoretic Framework for Resource-Aware Abstraction and Planning for Autonomous Agents. Georgia Institute of Technology, Atlanta, GA, USA, 2023- [c5]Daniel T. Larsson, Arash Asgharivaskasi, Jaein Lim, Nikolay Atanasov, Panagiotis Tsiotras:
Information-theoretic Abstraction of Semantic Octree Models for Integrated Perception and Planning. ICRA 2023: 6937-6943 - 2022
- [j3]Daniel T. Larsson
, Dipankar Maity, Panagiotis Tsiotras:
A Generalized Information-Theoretic Framework for the Emergence of Hierarchical Abstractions in Resource-Limited Systems. Entropy 24(6): 809 (2022) - [i6]Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras:
A Linear Programming Approach for Resource-Aware Information-Theoretic Tree Abstractions. CoRR abs/2208.04220 (2022) - [i5]Daniel T. Larsson, Arash Asgharivaskasi, Jaein Lim, Nikolay Atanasov, Panagiotis Tsiotras:
Information-theoretic Abstraction of Semantic Octree Models for Integrated Perception and Planning. CoRR abs/2209.10035 (2022) - 2021
- [j2]Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras:
Information-Theoretic Abstractions for Planning in Agents With Computational Constraints. IEEE Robotics Autom. Lett. 6(4): 7651-7658 (2021) - [c4]Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras:
Information-theoretic abstractions for resource-constrained agents via mixed-integer linear programming. CAADCPS@CPSIoTWeek 2021: 1-6 - [i4]Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras:
Information-Theoretic Abstractions for Resource-Constrained Agents via Mixed-Integer Linear Programming. CoRR abs/2102.10015 (2021) - 2020
- [j1]Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras:
Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational Limitations. IEEE Trans. Robotics 36(6): 1669-1685 (2020) - [i3]Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras:
An Information-Theoretic Approach for Path Planning in Agents with Computational Constraints. CoRR abs/2005.09611 (2020)
2010 – 2019
- 2019
- [i2]Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras:
Q-Search Trees: An Information-Theoretic Approach Towards Hierarchical Abstractions for Agents with Computational Limitations. CoRR abs/1910.00063 (2019) - 2018
- [c3]Daniel T. Larsson, Georgios Kotsalis, Panagiotis Tsiotras:
Nash and Correlated Equilibria for Pursuit-Evasion Games Under Lack of Common Knowledge. CDC 2018: 3579-3584 - 2017
- [c2]Daniel T. Larsson, Daniel Braun, Panagiotis Tsiotras:
Hierarchical state abstractions for decision-making problems with computational constraints. CDC 2017: 1138-1143 - [c1]George K. Karavas, Daniel T. Larsson, Panagiotis K. Artemiadis:
A hybrid BMI for control of robotic swarms: Preliminary results. IROS 2017: 5065-5075 - [i1]Daniel T. Larsson, Daniel Braun, Panagiotis Tsiotras:
Hierarchical State Abstractions for Decision-Making Problems with Computational Constraints. CoRR abs/1710.07990 (2017)
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:04 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:
