群知能ヒューリスティクスによる障害物回避格子経路の学習:順序木への全単射の探求
Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees
格子経路上の障害物回避問題を根付き順序木への全単射を用いて1次元探索問題に変換し、10種の群知能アルゴリズムで衝突のない経路を効率的に生成できることを示した。
著者: Victor Parque
分類: cs.RO, cs.AI, cs.DM, cs.NE
原文アブストラクト
Lattice paths are functional entities that model efficient navigation in discrete/grid maps. This paper presents a new scheme to generate collision-free lattice paths with utmost efficiency using the bijective property to rooted ordered trees, rendering a one-dimensional search problem. Our computational studies using ten state-of-the-art and relevant nature-inspired swarm heuristics in navigation scenarios with obstacles with convex and non-convex geometry show the practical feasibility and efficiency in rendering collision-free lattice paths. We believe our scheme may find use in devising fast algorithms for planning and combinatorial optimization in discrete maps.
