5 accepted papers
In this letter, we develop a systematic framework for the time-sequential compression of dynamic probabilistic occupancy grids. Our approach leverages ideas from signal compression theory to formulate an optimization problem that searches for a multi-resolution hierarchical encoder that balances the
This paper addresses the problem of optimizing communicated information among heterogeneous, resourceaware robot teams to facilitate their navigation. In such operations, a mobile robot compresses its local map to assist another robot in reaching a target within an uncharted environment. The primary
This paper addresses the problem of the communication of optimally compressed information for mobile robot path-planning. In this context, mobile robots compress their current local maps to assist another robot in reaching a target in an unknown environment. We propose a framework that sequentially…
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 resources. We show how a path-planning problem in an environment can be systematically approximated by solving a sequenc
We formulate a scenario in which an autonomous defender is tasked with intercepting an intruder that tries to reach a circular target region. This is a variant of the target defense problem proposed by Isaacs as a pursuit-evasion game. Unlike the original target guarding problem and its various exte…