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

Victor Parque*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Conference Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665467087
DOIs
Publication statusPublished - 2022
Event2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Padua, Italy
Duration: 2022 Jul 182022 Jul 23

Publication series

Name2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Conference Proceedings

Conference

Conference2022 IEEE Congress on Evolutionary Computation, CEC 2022
Country/TerritoryItaly
CityPadua
Period22/7/1822/7/23

Keywords

  • Catalan numbers
  • combinatorial objects
  • enumeration
  • lattice paths
  • ordered trees
  • path planning

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Computational Mathematics
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Learning Obstacle-Avoiding Lattice Paths using Swarm Heuristics: Exploring the Bijection to Ordered Trees'. Together they form a unique fingerprint.

Cite this