日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

強化学習arXiv:2102.10063

強化学習中の時相論理制約の確率的保証付き充足

Probabilistically Guaranteed Satisfaction of Temporal Logic Constraints During Reinforcement Learning

シェア:XThreadsFacebookLINEはてブBluesky

強化学習の各エピソードで時相論理制約を所望の確率で満たすため、オートマトン理論に基づき制約充足確率の下界を計算して探索行動を調整する手法を提案し、ドローンの定期配送タスクで実証した。

著者: Derya Aksaray, Yasin Yazicioglu, Ahmet Semi Asarkaya

分類: cs.RO, cs.SY, eess.SY

原文アブストラクト

We propose a novel constrained reinforcement learning method for finding optimal policies in Markov Decision Processes while satisfying temporal logic constraints with a desired probability throughout the learning process. An automata-theoretic approach is proposed to ensure the probabilistic satisfaction of the constraint in each episode, which is different from penalizing violations to achieve constraint satisfaction after a sufficiently large number of episodes. The proposed approach is based on computing a lower bound on the probability of constraint satisfaction and adjusting the exploration behavior as needed. We present theoretical results on the probabilistic constraint satisfaction achieved by the proposed approach. We also numerically demonstrate the proposed idea in a drone scenario, where the constraint is to perform periodically arriving pick-up and delivery tasks and the objective is to fly over high-reward zones to simultaneously perform aerial monitoring.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2newmoとKDDIが資本業務提携 2028年に堺市で自動運転タクシー商用化目指す提携・買収
  3. 3NVIDIA、CoRLでGR00T 2とIsaac Lab 3.0を発表新製品・発表
  4. 4GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開
  5. 5Google DeepMind、ロボット向けAIを発表新製品・発表

PR・アフィリエイト広告

MINISFORUM(ミニPC)

MINISFORUM(ミニPC)の公式広告バナーMINISFORUM公式ストアを見る ↗
PR本紙発行元 EmplifAI