activity
20172026
most citedQ-Search Trees: An Information-Theoretic Approach Towards Hierarchical Abstractions for Agents with Computational Limitations

18 citations · 52 across the 8 of their papers we have counts for

collaborators

10 papers

eess.SY2026

Nonlinear Thermal Modeling and Predictive Control for Spacecraft Optical Temperature Regulation

Marcus C. Klupar, Daniel T. Larsson, Ewan S. Douglas

Maintaining a stable thermal environment is critical for spacecraft carrying precision optics, as temperature gradients and thermal expansion can alter the geometric alignment of o…

cs.RO2026

A Sample-Based Approach for Hierarchical Information-Theoretic Compression of Probabilistic Occupancy Grids

Zhenyu Jin, Daniel T. Larsson

We develop a sample-based framework for constructing information-driven hierarchical multi-resolution representations of probabilistic occupancy grids. Recent methods compute infor…

cs.IT2025

A Dual Approach for Hierarchical Information-Theoretic Tree Abstractions

Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras

In this paper, we consider establishing a formal connection between two distinct tree-abstraction problems inspired by the information-bottleneck (IB) method. Specifically, we cons…

cs.RO2025

Communication-aware Hierarchical Map Compression of Time-Varying Environments for Mobile Robots

Daniel T. Larsson, Dipankar Maity

In this paper, we develop a systematic framework for the time-sequential compression of dynamic probabilistic occupancy grids. Our approach leverages ideas from signal compression…

cs.RO2022

Information-theoretic Abstraction of Semantic Octree Models for Integrated Perception and Planning

Daniel T. Larsson, Arash Asgharivaskasi, Jaein Lim +2

In this paper, we develop an approach that enables autonomous robots to build and compress semantic environment representations from point-cloud data. Our approach builds a three-d…

cs.IT2022

A Linear Programming Approach for Resource-Aware Information-Theoretic Tree Abstractions

Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras

In this chapter, an integer linear programming formulation for the problem of obtaining task-relevant, multi-resolution, environment abstractions for resource-constrained autonomou…

cs.RO2021★ 6 cited

Information-Theoretic Abstractions for Resource-Constrained Agents via Mixed-Integer Linear Programming

Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras

In this paper, a mixed-integer linear programming formulation for the problem of obtaining task-relevant, multi-resolution, graph abstractions for resource-constrained agents is pr…

cs.RO2020★ 15 cited

Information-Theoretic Abstractions for Planning in Agents with Computational Constraints

Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras

In this paper, we develop a framework for path-planning on abstractions that are not provided to the agent a priori but instead emerge as a function of the available computational…

cs.RO2019★ 18 cited

Q-Search Trees: An Information-Theoretic Approach Towards Hierarchical Abstractions for Agents with Computational Limitations

Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras

In this paper, we develop a framework to obtain graph abstractions for decision-making by an agent where the abstractions emerge as a function of the agent's limited computational…

cs.AI2017★ 13 cited

Hierarchical State Abstractions for Decision-Making Problems with Computational Constraints

Daniel T. Larsson, Daniel Braun, Panagiotis Tsiotras

In this semi-tutorial paper, we first review the information-theoretic approach to account for the computational costs incurred during the search for optimal actions in a sequentia…