データ効率の良い深層強化学習によるUASミッション再計画のためのマルチスタートチームオリエンテーリング問題
Multi-Start Team Orienteering Problem for UAS Mission Re-Planning with Data-Efficient Deep Reinforcement Learning
燃料や時間の制約下で複数車両が収益を最大化するミッション再計画問題に対し、自己注意とエンコーダ・デコーダ注意を用いた方策ネットワークと、局所ミニバッチベースラインによる改良REINFORCEアルゴリズムを提案した。
著者: Dong Ho Lee, Jaemyung Ahn
分類: cs.LG, cs.RO, math.OC
原文アブストラクト
In this paper, we study the Multi-Start Team Orienteering Problem (MSTOP), a mission re-planning problem where vehicles are initially located away from the depot and have different amounts of fuel. We consider/assume the goal of multiple vehicles is to travel to maximize the sum of collected profits under resource (e.g., time, fuel) consumption constraints. Such re-planning problems occur in a wide range of intelligent UAS applications where changes in the mission environment force the operation of multiple vehicles to change from the original plan. To solve this problem with deep reinforcement learning (RL), we develop a policy network with self-attention on each partial tour and encoder-decoder attention between the partial tour and the remaining nodes. We propose a modified REINFORCE algorithm where the greedy rollout baseline is replaced by a local mini-batch baseline based on multiple, possibly non-duplicate sample rollouts. By drawing multiple samples per training instance, we can learn faster and obtain a stable policy gradient estimator with significantly fewer instances. The proposed training algorithm outperforms the conventional greedy rollout baseline, even when combined with the maximum entropy objective.
関連論文
- 深層強化学習による短時間高高度気球の季節別定位置保持強化学習/経路計画
- 低視界環境における強化学習ベースの避難経路生成強化学習/経路計画
- 自律型車両による距離のみの水中目標位置推定のための強化学習経路計画手法強化学習/経路計画
- 深層強化学習による自律表面艇の経路追従と衝突回避の制御強化学習/経路計画
