Safe 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 stopping time, the problem of learning optimal policy without violating safety constraints during the learning phase is yet to be addressed. To this end, we propose an algorithm based on linear programming that does not require a process model. We show that the learned policy is safe with high confidence. We also propose a method to compute a safe baseline policy, which is central in developing algorithms that do not violate the safety constraints. Finally, we provide simulation results to show the efficacy of the proposed algorithm. Further, we demonstrate that efficient exploration can be achieved by defining a subset of the state-space called proxy set.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Reinforcement Learning from Human Feedback with High-Confidence Safety Constraints
MermaidFlow: Redefining Agentic Workflow Generation via Safety-Constrained Evolutionary Programming
DISCOVER: Automated Curricula for Sparse-Reward Reinforcement Learning
ForesightNav: Learning Scene Imagination for Efficient Exploration
Disentangling Uncertainties by Learning Compressed Data Representation
Reward-Centered ReST-MCTS: A Robust Decision-Making Framework for Robotic Manipulation in High Uncertainty Environments
토론
이 논문과 연결된 포럼 글이 아직 없습니다.