Efficient and Safe Exploration in Deterministic Markov Decision Processes with Unknown Transition Models
We propose a safe exploration algorithm for deterministic Markov Decision Processes with unknown transition models. Our algorithm guarantees safety by leveraging Lipschitz-continuity to ensure that no unsafe states are visited during exploration. Unlike many other existing techniques, the provided safety guarantee is deterministic. Our algorithm is optimized to reduce the number of actions needed for exploring the safe space. We demonstrate the performance of our algorithm in comparison with baseline methods in simulation on navigation tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
Safe ExplorationSimilar Papers 제목 키워드 기반
Safe Exploration for Interactive Machine Learning
In Interactive Machine Learning (IML), we iteratively make decisions and obtain noisy observations of an unknown function. While IML methods, e.g., Bayesian optimization and active learning, have been successful in appli…
Active LearningBayesian OptimizationBIG-bench Machine LearningSafe ExplorationSafe Exploration in Markov Decision Processes
In environments with uncertain dynamics exploration is necessary to learn how to perform well. Existing reinforcement learning algorithms provide strong exploration guarantees, but they tend to rely on an ergodicity assu…
Safe ExplorationSafe Exploration in Markov Decision Processes with Time-Variant Safety using Spatio-Temporal Gaussian Process
In many real-world applications (e.g., planetary exploration, robot navigation), an autonomous agent must be able to explore a space with guaranteed safety. Most safe exploration algorithms in the field of reinforcement …
Reinforcement LearningRobot NavigationSafe ExplorationSafe Reinforcement Learning in Constrained Markov Decision Processes
Safe reinforcement learning has been a promising approach for optimizing the policy of an agent that operates in safety-critical applications. In this paper, we propose an algorithm, SNO-MDP, that explores and optimizes …
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Safe Reinforcement LearningSafe Reinforcement Learning for Constrained Markov Decision Processes with Stochastic Stopping Time
In this paper, we present an online reinforcement learning algorithm for constrained Markov decision processes with a safety constraint. Despite the necessary attention of the scientific community, considering stochastic…
Efficient ExplorationSafe Reinforcement Learning