離散抽象化を用いないマルチロボット時相論理最適制御合成
An Abstraction-Free Method for Multi-Robot Temporal Logic Optimal Control Synthesis
ロボット移動の離散抽象化を必要とせず、サンプリングで積状態空間を探索する木を構築し、LTLタスクを満たす最適計画を合成する手法を提案した。
著者: Xusheng Luo, Yiannis Kantaros, Michael M. Zavlanos
分類: cs.RO
原文アブストラクト
The majority of existing Linear Temporal Logic (LTL) planning methods rely on the construction of a discrete product automaton, that combines a discrete abstraction of robot mobility and a B$\ddot{\text{u}}$chi automaton that captures the LTL specification. Representing this product automaton as a graph and using graph search techniques, optimal plans that satisfy the LTL task can be synthesized. However, constructing expressive discrete abstractions makes the synthesis problem computationally intractable. In this paper, we propose a new sampling-based LTL planning algorithm that does not require any discrete abstraction of robot mobility. Instead, it incrementally builds trees that explore the product state-space, until a maximum number of iterations is reached or a feasible plan is found. The use of trees makes data storage and graph search tractable, which significantly increases the scalability of our algorithm. To accelerate the construction of feasible plans, we introduce bias in the sampling process which is guided by transitions in the B$\ddot{\text{u}}$chi automaton that belong to the shortest path to the accepting states. We show that our planning algorithm, with and without bias, is probabilistically complete and asymptotically optimal. Finally, we present numerical experiments showing that our method outperforms relevant temporal logic planning methods.
関連論文
- 神経記号的役割分担によるマルチロボットタスク計画マルチロボット計画
- 晩秋:LLMエージェントが汎用マルチロボットプランナを単一倉庫向けに特化マルチロボット計画
- GPS非依存環境における協調測位のための不確実性制約付きマルチロボット計画マルチロボット計画
- 確率的スキルを考慮したマルチロボット・マルチゴール動作計画マルチロボット計画
- 拡散モデルによるマルチロボット動作計画のための軌道レベルモード誘導マルチロボット計画
- MR. POP: ほぼ確実に漸近最適なマルチロボット並列最適化プランナマルチロボット計画
