ロボット探査アルゴリズムにおける動的グラフの学習ベース間引き
Learning-Based Sparsification of Dynamic Graphs in Robotic Exploration Algorithms
ロボット探査で用いる動的グラフを強化学習(PPO)で間引き、冗長な情報を削減する手法を提案。RRTによるフロンティア探査のシミュレーションでグラフサイズを最大96%削減し、探索の一貫性が向上することを示した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Adithya V. Sastry, Bibek Poudel, Weizi Li
分類: cs.RO, cs.LG
原文アブストラクト
Many robotic exploration algorithms rely on graph structures for frontier-based exploration and dynamic path planning. However, these graphs grow rapidly, accumulating redundant information and impacting performance. We present a transformer-based framework trained with Proximal Policy Optimization (PPO) to prune these graphs during exploration, limiting their growth and reducing the accumulation of excess information. The framework was evaluated on simulations of a robotic agent using Rapidly Exploring Random Trees (RRT) to carry out frontier-based exploration, where the learned policy reduces graph size by up to 96%. We find preliminary evidence that our framework learns to associate pruning decisions with exploration outcomes despite sparse, delayed reward signals. We also observe that while intelligent pruning achieves a lower rate of exploration compared to baselines, it yields the lowest standard deviation, producing the most consistent exploration across varied environments. To the best of our knowledge, these results are the first suggesting the viability of RL in sparsification of dynamic graphs used in robotic exploration algorithms.
