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