合理的な動き:環境制約下での移動軌跡計算のための一般的なASP基盤
Reasonable Motion: A General ASP Foundation for Environment Constrained Movement Trajectory Computation
移動物体の環境制約下での分岐軌跡を計算するための、Answer Set Programmingに基づくハイブリッド定量的・定性的手法を提案し、実世界の自動運転データで検証した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Julius Monsen, Jakob Suchan, Mehul Bhatt, Lars Karlsson
分類: cs.AI, cs.HC, cs.RO
原文アブストラクト
We present a general answer set programming based hybrid quantitative-qualitative method for computing constrained branching trajectory modes for moving objects in real-world settings. The method performs constrained traversal of an environment graph, enumerating geometrically admissible motion behaviours as stable models, each constituting a distinct trajectory mode characterised by both domain-dependent and independent factors such as derived event sequence, map topology, and domain norms. The hybrid trajectory computation method is generally applicable across motion characteristics typically encountered in diverse dynamic domains with moving objects, e.g., autonomous driving. We demonstrate applicability and highlight how computed trajectories are traceable to their underlying stable model, thereby affording verifiable interpretability that purely learned approaches cannot provide. We also perform an empirical evaluation with Argoverse 2, a large-scale real-world autonomous driving benchmark representative of the class of dynamic domains within the scope of the proposed method.
