• Home
  • Search
  • Simplified decision making in the belief space using belief sparsification
  • Open Access IconOpen Access
  • Cite Icon19
  • https://doi.org/10.1177/02783649221076381Copy DOI Icon

Simplified decision making in the belief space using belief sparsification

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this work, we introduce a new and efficient solution approach for the problem of decision making under uncertainty, which can be formulated as decision making in a belief space, over a possibly high-dimensional state space. Typically, to solve a decision problem, one should identify the optimal action from a set of candidates, according to some objective. We claim that one can often generate and solve an analogous yet simplified decision problem, which can be solved more efficiently. A wise simplification method can lead to the same action selection, or one for which the maximal loss in optimality can be guaranteed. Furthermore, such simplification is separated from the state inference and does not compromise its accuracy, as the selected action would finally be applied on the original state. First, we present the concept for general decision problems and provide a theoretical framework for a coherent formulation of the approach. We then practically apply these ideas to decision problems in the belief space, which can be simplified by considering a sparse approximation of their initial belief. The scalable belief sparsification algorithm we provide is able to yield solutions which are guaranteed to be consistent with the original problem. We demonstrate the benefits of the approach in the solution of a realistic active-SLAM problem and manage to significantly reduce computation time, with no loss in the quality of solution. This work is both fundamental and practical and holds numerous possible extensions.

Similar Papers
  • PDF
  • Research Article
  • Citations268

Finding Approximate POMDP solutions Through Belief Compression

  • Jan 01, 2005
  • Journal of Artificial Intelligence Research
  • N Roy +2
  • Conference Article
  • Citations1

ConstrainedZero: Chance-Constrained POMDP Planning Using Learned Probabilistic Failure Surrogates and Adaptive Safety Constraints

  • Aug 01, 2024
  • Chao Xu +3
  • Conference Article
  • Citations2

Reinforcement learning in multi-dimensional state-action space using random rectangular coarse coding and gibbs sampling

  • Sep 01, 2007
  • Hajime Kimura
  • Book Chapter

Plausibility Considerations on Steganalysis as a Security Mechanism – Discussions on the Example of Audio Steganalysis

  • Jan 01, 2012
  • Christian Kraetzer +1
  • Conference Article
  • Citations1

Material Recovery Facility Location and Waste Flow Assignment Problem Based on Scatter Search

  • Jan 01, 2007
  • Hai-Jie Yu +2
  • Research Article
  • Citations28

When architecture meets AI: A deep reinforcement learning approach for system of systems design

  • Apr 01, 2023
  • Advanced Engineering Informatics
  • Menglong Lin +4
  • Research Article
  • Citations4

Product-mix decision in a mixed-yield wafer fabrication scenario

  • Mar 24, 2006
  • The International Journal of Advanced Manufacturing Technology
  • M.-C Wu +2
  • Research Article
  • Citations66

Real‐time decision support for integration of airline flight cancellations and delays Part II: algorithm and computational experiments

  • Mar 01, 1997
  • Transportation Planning and Technology
  • Jia‐Ming Cao +1
  • Conference Article
  • Citations128

Unified Conversational Recommendation Policy Learning via Graph-based Reinforcement Learning

  • Jul 11, 2021
  • Yang Deng +4
  • Research Article
  • Citations36

A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

  • May 01, 2013
  • INFORMS Journal on Computing
  • Defu Zhang +3
  • Research Article
  • Citations46

A Two-Stage Integer Linear Programming-Based Droplet Routing Algorithm for Pin-Constrained Digital Microfluidic Biochips

  • Feb 01, 2011
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Tsung-Wei Huang +1
  • Research Article
  • Citations3

Approximately optimal construction of parallel algorithm portfolios by evolutionary intelligence

  • Aug 03, 2022
  • SCIENTIA SINICA Technologica
  • Shengcai Liu +2
  • Research Article
  • Citations8

Interval-valued fuzzy multiple criteria decision-making methods based on dual optimistic/pessimistic estimations in averaging operations

  • Sep 02, 2014
  • Applied Soft Computing
  • Ting-Yu Chen
  • Conference Article
  • Citations20

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

  • Jun 14, 2009
  • Joseph Rios +1
  • Research Article
  • Citations4

A Memetic Algorithm for High-Speed Railway Train Timetable Rescheduling

  • May 20, 2022
  • Journal of Advanced Computational Intelligence and Intelligent Informatics
  • Shuxin Ding +6
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.