Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees

Victor Parque*

*この研究の対応する著者

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトル2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Conference Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781665467087
DOI
出版ステータスPublished - 2022
イベント2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Padua, Italy
継続期間: 2022 7月 182022 7月 23

出版物シリーズ

名前2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Conference Proceedings

Conference

Conference2022 IEEE Congress on Evolutionary Computation, CEC 2022
国/地域Italy
CityPadua
Period22/7/1822/7/23

ASJC Scopus subject areas

  • 人工知能
  • コンピュータ サイエンスの応用
  • 計算数学
  • 制御と最適化

フィンガープリント

「Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル