Voronoi progressive widening: efficient online solvers for continuous state, action, and observation POMDPs

MH Lim, CJ Tomlin, ZN Sunberg - 2021 60th IEEE conference …, 2021 - ieeexplore.ieee.org
This paper introduces Voronoi Progressive Widening (VPW), a generalization of Voronoi
optimistic optimization (VOO) and action progressive widening to partially observable …

A discrete partially observable Markov decision process model for the maintenance optimization of oil and gas pipelines

E Wari, W Zhu, G Lim - Algorithms, 2023 - mdpi.com
Corrosion is one of the major causes of failure in pipelines for transporting oil and gas
products. To mitigate the impact of this problem, organizations perform different …

BetaZero: Belief-state planning for long-horizon POMDPs using learned approximations

RJ Moss, A Corso, J Caers… - arXiv preprint arXiv …, 2023 - arxiv.org
Real-world planning problems, including autonomous driving and sustainable energy
applications like carbon storage and resource exploration, have recently been modeled as …

PRISM: Recurrent neural networks and presolve methods for fast mixed-integer optimal control

A Cauligi, A Chakrabarty… - … for Dynamics and …, 2022 - proceedings.mlr.press
While mixed-integer convex programs (MICPs) arise frequently in mixed-integer optimal
control problems (MIOCPs), current state-of-the-art MICP solvers are often too slow for real …

Towards sequential sensor placements on a wind farm to maximize lifetime energy and profit

A Yildiz, J Mern, MJ Kochenderfer, MF Howland - Renewable Energy, 2023 - Elsevier
The optimal design of a wind farm which maximizes energy production depends on the
spatially variable wind flow field. However, due to the complexity associated with modeling …

Multiagent Reinforcement Learning: Rollout and Policy Iteration for POMDP with Application to Multi-Robot Problems

S Bhattacharya, S Kailas, S Badyal… - IEEE Transactions …, 2023 - ieeexplore.ieee.org
In this article, we consider the computational and communication challenges of partially
observable multiagent sequential decision-making problems. We present algorithms that …

Achieving mouse-level strategic evasion performance using real-time computational planning

G Espinosa, GE Wink, AT Lai, DA Dombeck… - arXiv preprint arXiv …, 2022 - arxiv.org
Planning is an extraordinary ability in which the brain imagines and then enacts evaluated
possible futures. Using traditional planning models, computer scientists have attempted to …

A Partially Observable Monte Carlo Planning Algorithm Based on Path Modification

Q Wang, F Liu, B Luo - Asian Conference on Machine …, 2024 - proceedings.mlr.press
Balancing exploration and exploitation has long been recognized as an important theme in
the online planning algorithms for POMDP problems. Explorative actions on one hand …

Improving Online POMDP Planning Algorithms with Decaying Q Value

Q Wang, F Liu, X Wang, B Luo - 2023 IEEE 35th International …, 2023 - ieeexplore.ieee.org
Online POMDP solvers search for the optimal policy based on multiple simulations. When
scaling to large problems, more simulations typically lead to better results, but also more …

[图书][B] Sequential Decision Making under Uncertainty: Optimality Guarantees, Compositional Learning, and Applications to Robotics and Ecology

HJ Lim - 2023 - search.proquest.com
Sequential decision making under uncertainty problems often deal with partially observable
Markov decision processes (POMDPs). POMDPs mathematically capture making decisions …