未知の安全制約下での安全強化学習アルゴリズムSNO-MDP
Safe Reinforcement Learning in Constrained Markov Decision Processes
未知の安全制約を持つマルコフ決定過程において、安全領域を拡大しながら制約を学習し、その後に累積報酬を最適化するSNO-MDPを提案し、理論保証と実験で有効性を示した論文。
著者: Akifumi Wachi, Yanan Sui
分類: cs.LG, cs.AI, cs.RO
原文アブストラクト
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 Markov decision processes under unknown safety constraints. Specifically, we take a stepwise approach for optimizing safety and cumulative reward. In our method, the agent first learns safety constraints by expanding the safe region, and then optimizes the cumulative reward in the certified safe region. We provide theoretical guarantees on both the satisfaction of the safety constraint and the near-optimality of the cumulative reward under proper regularity assumptions. In our experiments, we demonstrate the effectiveness of SNO-MDP through two experiments: one uses a synthetic data in a new, openly-available environment named GP-SAFETY-GYM, and the other simulates Mars surface exploration by using real observation data.
