Search Results for author: Daniel Straub

Found 6 papers, 3 papers with code

An investigation of belief-free DRL and MCTS for inspection and maintenance planning

no code implementations22 Dec 2023 Daniel Koutas, Elizabeth Bismut, Daniel Straub

We propose a novel Deep Reinforcement Learning (DRL) architecture for sequential decision processes under uncertainty, as encountered in inspection and maintenance (I&M) planning.

POMDP inference and robust solution via deep reinforcement learning: An application to railway optimal maintenance

1 code implementation16 Jul 2023 Giacomo Arcieri, Cyprien Hoelzl, Oliver Schwery, Daniel Straub, Konstantinos G. Papakonstantinou, Eleni Chatzi

The POMDP with uncertain parameters is then solved via deep RL techniques with the parameter distributions incorporated into the solution via domain randomization, in order to develop solutions that are robust to model uncertainty.

Decision Making Reinforcement Learning (RL)

Bridging POMDPs and Bayesian decision making for robust maintenance planning under model uncertainty: An application to railway systems

1 code implementation15 Dec 2022 Giacomo Arcieri, Cyprien Hoelzl, Oliver Schwery, Daniel Straub, Konstantinos G. Papakonstantinou, Eleni Chatzi

We present a framework to estimate POMDP transition and observation model parameters directly from available data, via Markov Chain Monte Carlo (MCMC) sampling of a Hidden Markov Model (HMM) conditioned on actions.

Decision Making

Value of information from vibration-based structural health monitoring extracted via Bayesian model updating

no code implementations12 Mar 2021 Antonios Kamariotis, Eleni Chatzi, Daniel Straub

We quantify this value by adaptation of the Bayesian decision analysis framework.

Applications Systems and Control Systems and Control

Cross-entropy-based importance sampling with failure-informed dimension reduction for rare event simulation

1 code implementation9 Jun 2020 Felipe Uribe, Iason Papaioannou, Youssef M. Marzouk, Daniel Straub

Although some existing parametric distribution families are designed to perform efficiently in high dimensions, their applicability within the cross-entropy method is limited to problems with dimension of O(1e2).

Computation

Sparse Polynomial Chaos expansions using Variational Relevance Vector Machines

no code implementations23 Dec 2019 Panagiotis Tsilifis, Iason Papaioannou, Daniel Straub, Fabio Nobile

The challenges for non-intrusive methods for Polynomial Chaos modeling lie in the computational efficiency and accuracy under a limited number of model simulations.

Compressive Sensing Computational Efficiency +1

Cannot find the paper you are looking for? You can Submit a new open access paper.