Obstacle-avoiding euclidean steiner trees by n-star bundles

Victor Parque Tenorio; Tomoyuki Miyashita

doi:10.1109/ICTAI.2018.00057

Obstacle-avoiding euclidean steiner trees by n-star bundles

Victor Parque Tenorio, Tomoyuki Miyashita

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 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 language	English
Title of host publication	Proceedings - 2018 IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018
Publisher	IEEE Computer Society
Pages	315-319
Number of pages	5
Volume	2018-November
ISBN (Electronic)	9781538674499
DOIs	https://doi.org/10.1109/ICTAI.2018.00057
Publication status	Published - 2018 Dec 13
Event	30th International Conference on Tools with Artificial Intelligence, ICTAI 2018 - Volos, Greece Duration: 2018 Nov 5 → 2018 Nov 7

Other

Other	30th International Conference on Tools with Artificial Intelligence, ICTAI 2018
Country	Greece
City	Volos
Period	18/11/5 → 18/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

Access to Document

10.1109/ICTAI.2018.00057

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

Cite this

Parque Tenorio, V & Miyashita, T 2018, Obstacle-avoiding euclidean steiner trees by n-star bundles. in Proceedings - 2018 IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018. vol. 2018-November, 8576055, IEEE Computer Society, pp. 315-319, 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018, Volos, Greece, 18/11/5. https://doi.org/10.1109/ICTAI.2018.00057

@inproceedings{e96aa4e0d6e5456482fc85edac7ae250,

title = "Obstacle-avoiding euclidean steiner trees by n-star bundles",

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.",

keywords = "Differential evolution, Edge bundling, Graphs, Minimal trees, Network optimization, Optimization, Path planning, Polygonal maps, Steiner trees",

author = "{Parque Tenorio}, Victor and Tomoyuki Miyashita",

year = "2018",

month = dec,

day = "13",

doi = "10.1109/ICTAI.2018.00057",

language = "English",

volume = "2018-November",

pages = "315--319",

booktitle = "Proceedings - 2018 IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018",

publisher = "IEEE Computer Society",

note = "30th International Conference on Tools with Artificial Intelligence, ICTAI 2018 ; Conference date: 05-11-2018 Through 07-11-2018",

}

TY - GEN

T1 - Obstacle-avoiding euclidean steiner trees by n-star bundles

AU - Parque Tenorio, Victor

AU - Miyashita, Tomoyuki

PY - 2018/12/13

Y1 - 2018/12/13

N2 - 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.

AB - 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.

KW - Differential evolution

KW - Edge bundling

KW - Graphs

KW - Minimal trees

KW - Network optimization

KW - Optimization

KW - Path planning

KW - Polygonal maps

KW - Steiner trees

UR - http://www.scopus.com/inward/record.url?scp=85060779670&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85060779670&partnerID=8YFLogxK

U2 - 10.1109/ICTAI.2018.00057

DO - 10.1109/ICTAI.2018.00057

M3 - Conference contribution

AN - SCOPUS:85060779670

VL - 2018-November

SP - 315

EP - 319

BT - Proceedings - 2018 IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018

PB - IEEE Computer Society

T2 - 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018

Y2 - 5 November 2018 through 7 November 2018

ER -