Obstacle-avoiding euclidean steiner trees by n-star bundles

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

5 Citations (Scopus)

Abstract

Optimal topologies in networked systems is of relevant interest to integrate and coordinate multi-agency. Our interest in this paper is to compute the root location and the topology of minimal-length tree layouts given n nodes in a polygonal map, assuming an n-star network topology. Computational experiments involving 600 minimal tree planning scenarios show the feasibility and efficiency of the proposed approach.

Original languageEnglish
Title of host publicationProceedings - 2018 IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018
PublisherIEEE Computer Society
Pages315-319
Number of pages5
ISBN (Electronic)9781538674499
DOIs
Publication statusPublished - 2018 Dec 13
Event30th International Conference on Tools with Artificial Intelligence, ICTAI 2018 - Volos, Greece
Duration: 2018 Nov 52018 Nov 7

Publication series

NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
Volume2018-November
ISSN (Print)1082-3409

Other

Other30th International Conference on Tools with Artificial Intelligence, ICTAI 2018
Country/TerritoryGreece
CityVolos
Period18/11/518/11/7

Keywords

  • Differential evolution
  • Edge bundling
  • Graphs
  • Minimal trees
  • Network optimization
  • Optimization
  • Path planning
  • Polygonal maps
  • Steiner trees

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Obstacle-avoiding euclidean steiner trees by n-star bundles'. Together they form a unique fingerprint.

Cite this