ATRS: 共有ニューラルポリシーによる適応的軌道再分割と並列最適化
ATRS: Adaptive Trajectory Re-splitting via a Shared Neural Policy for Parallel Optimization
ADMMによる並列軌道最適化において、停滞するセグメントを強化学習で適応的に再分割するフレームワークATRSを提案。共有ポリシーによりセグメント数変化や未知環境への一般化を実現。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Jiajun Yu, Guodong Liu, Li Wang, Pengxiang Zhou, Wentao Liu, Yin He, Chao Xu, Fei Gao, Yanjun Cao
分類: cs.RO
原文アブストラクト
Parallel trajectory optimization via the Alternating Direction Method of Multipliers (ADMM) has emerged as a scalable approach to long-horizon motion planning. However, existing frameworks typically decompose the problem into parallel subproblems based on a predefined fixed structure. Such structural rigidity often causes optimization stagnation in highly constrained regions, where a few lagging subproblems delay global convergence. A natural remedy is to adaptively re-split these stagnating segments online. Yet, deciding when, where, and how to split exceeds the capability of rule-based heuristics. To this end, we propose ATRS, a novel framework that embeds a shared Deep Reinforcement Learning policy into the parallel ADMM loop. We formulate this adaptive adjustment as a Multi-Agent Shared-Policy Markov Decision Process, where all trajectory segments act as homogeneous agents and share a unified neural policy network. This parameter-sharing architecture endows the system with size invariance, enabling it to handle dynamically changing segment counts during re-splitting and generalize to arbitrary trajectory lengths. Furthermore, our formulation inherently supports zero-shot generalization to unseen environments, as our network relies solely on the internal states of the numerical solver rather than on the geometric features of the environment. To ensure solver stability, a Confidence-Based Election mechanism selects only the most stagnating segment for re-splitting at each step. Extensive simulations demonstrate that ATRS accelerates convergence, reducing the number of iterations by up to 26.0% and the computation time by up to 19.1%. Real-world experiments further confirm its applicability to both large-scale offline global planning and real-time onboard replanning within 35 ms per cycle, with no sim-to-real degradation.
関連論文
- ScaleMPA: グリッドネイティブ表現によるスケーラブルなRRT*加速の再考モーションプランニング
- 劣駆動システムの高速計画のための信頼できる多面体アクションセットモーションプランニング
- 惑星環境での安全なナビゲーションのための不確実性下におけるリスク考慮のキノダイナミックモーション計画モーションプランニング
- ベクトル化による高速漸近最適キノダイナミックプランニングモーションプランニング
- ホモトピーを考慮した参照経路不要のコリドー生成モーションプランニング
- パラメトリック不確実性を考慮した倹約的な外乱対応最小時間計画モーションプランニング
