Abstract
This letter is concerned with decision making under uncertainty in problems involving high dimensional state spaces. Inspired by conservative information fusion techniques, we propose a novel paradigm where decision making is performed over a conservative rather than the original information space. The key idea is that regardless of the sparsity pattern of the latter, one can always calculate a sparse conservative information space, which admits computationally efficient decision making. In this letter, we take this concept to the extreme and consider a conservative approximation that decouples the state variables, leading to a conservative diagonal information matrix. As a result, the computational complexity involved with evaluating impact of a candidate action is reduced to O(n), for an n-dimensional state, as the calculations do not involve any correlations. Importantly, we show that for measurement observation models involving arbitrary single state variables, this concept yields exactly the same results compared to using the original information matrix. We demonstrate applicability of this concept to a sensor deployment problem.
Original language | English |
---|---|
Article number | 7383252 |
Pages (from-to) | 407-414 |
Number of pages | 8 |
Journal | IEEE Robotics and Automation Letters |
Volume | 1 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2016 |
Keywords
- AI Reasoning Methods
- Autonomous Agents
- Optimization and Optimal Control
- SLAM
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Biomedical Engineering
- Human-Computer Interaction
- Mechanical Engineering
- Computer Vision and Pattern Recognition
- Computer Science Applications
- Control and Optimization
- Artificial Intelligence