An Information-Theoretic Approach for Path Planning in Agents with Computational Constraints
Preprint
Abstract
In this paper, we develop a framework for path-planning on abstractions that are not provided to the system a-priori but instead emerge as a function of the agent's available computational resources. We show how a path-planning problem in an environment can be systematically approximated by solving a sequence of easier to solve problems on abstractions of the original space. The properties of the problem are analyzed, and supporting theoretical results presented and discussed. A numerical example is presented to show the utility of the approach and to corroborate the theoretical findings. We conclude by providing a discussion of the results and their interpretation relating to anytime algorithms and bounded rationality.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Q-Tree Search: An Information-Theoretic Approach Toward Hierarchical Abstractions for Agents With Computational LimitationsIEEE Transactions on Robotics, 2020
- Feature-based aggregation and deep reinforcement learning: a survey and some new implementationsIEEE/CAA Journal of Automatica Sinica, 2018
- Environment model adaptation for mobile robot explorationAutonomous Robots, 2017
- Hierarchical motion planning with kinodynamic feasibility guarantees: Local trajectory planning via model predictive control2012
- Multiresolution Hierarchical Path-Planning for Small UAVs Using Wavelet DecompositionsJournal of Intelligent & Robotic Systems, 2011
- Information Theory of Decisions and Actions2010
- Past-future information bottleneck in dynamical systemsPhysical Review E, 2009
- Probabilistic quadtrees for variable-resolution mapping of large environmentsIFAC Proceedings Volumes, 2004
- Planning under time constraints in stochastic domainsArtificial Intelligence, 1995
- Planning in a hierarchy of abstraction spacesArtificial Intelligence, 1974