可変タスクを持つマルチロボットシステムのためのパラメータ化トポロジカル複雑度
Parametrized Topological Complexity for a Multi-Robot System with Variable Tasks
未知の障害物がある空間で複数の自律ロボットが異なる数の目標を順に訪問する運動計画問題をトポロジカル複雑度の枠組みで定式化し、その不変量を奇数・偶数次元空間で決定した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Gopal Chandra Dutta, Amit Kumar Paul, Subhankar Sau
分類: math.AT, cs.RO
原文アブストラクト
We study a generalized motion planning problem involving multiple autonomous robots navigating in a $d$-dimensional Euclidean space in the presence of a set of obstacles whose positions are unknown a priori. Each robot is required to visit sequentially a prescribed set of target states, with the number of targets varying between robots. This heterogeneous setting generalizes the framework considered in the prior works on sequential parametrized topological complexity by Farber and the second author of this article. To determine the topological complexity of our problem, we formulate it mathematically by constructing an appropriate fibration. Our main contribution is the determination of this invariant in the generalized setting, which captures the minimal algorithmic instability required for designing collision-free motion planning algorithms under parameter-dependent constraints. We provide a detailed analysis for both odd and even-dimensional ambient spaces, including the essential cohomological computations and explicit constructions of corresponding motion planning algorithms.
