Obstacle-avoiding euclidean steiner trees by n-star bundles

    研究成果: Conference contribution

    2 被引用数 (Scopus)

    抄録

    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.

    本文言語English
    ホスト出版物のタイトルProceedings - 2018 IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018
    出版社IEEE Computer Society
    ページ315-319
    ページ数5
    2018-November
    ISBN(電子版)9781538674499
    DOI
    出版ステータスPublished - 2018 12 13
    イベント30th International Conference on Tools with Artificial Intelligence, ICTAI 2018 - Volos, Greece
    継続期間: 2018 11 52018 11 7

    Other

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

    ASJC Scopus subject areas

    • Software
    • Artificial Intelligence
    • Computer Science Applications

    フィンガープリント 「Obstacle-avoiding euclidean steiner trees by n-star bundles」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル