Path planning on hierarchical bundles with differential evolution

Victor Parque*, Tomoyuki Miyashita

*Corresponding author for this work

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

6 Citations (Scopus)


Computing hierarchical routing networks in polygonal maps is significant to realize the efficient coordination of agents, robots and systems in general; and the fact of considering obstacles in the map, makes the computation of efficient networks a relevant need for cluttered environments. In this paper, we present an approach to compute the minimal-length hierarchical topologies in polygonal maps by Differential Evolution and Route Bundling Concepts. Our computational experiments in scenarios considering convex and non-convex configuration of polygonal maps show the feasibility of the proposed approach.

Original languageEnglish
Title of host publicationAdvances in Swarm Intelligence - 9th International Conference, ICSI 2018, Proceedings
EditorsYing Tan, Yuhui Shi, Qirong Tang
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783319938141
Publication statusPublished - 2018
Event9th International Conference on Swarm Intelligence, ICSI 2018 - Shanghai, China
Duration: 2018 Jun 172018 Jun 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10941 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other9th International Conference on Swarm Intelligence, ICSI 2018


  • Hierarchical network design
  • Minimal trees
  • Route bundling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Path planning on hierarchical bundles with differential evolution'. Together they form a unique fingerprint.

Cite this