Computational network design from functional specifications

Chi Han Peng, Yong Liang Yang, Fan Bao, Daniel Fink, Dong Ming Yan, Peter Wonka, Niloy J. Mitra

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Connectivity and layout of underlying networks largely determine agent behavior and usage in many environments. For example, transportation networks determine the flow of traffic in a neighborhood, whereas building floorplans determine the flow of people in a workspace. Designing such networks from scratch is challenging as even local network changes can have large global effects. We investigate how to computationally create networks starting from only high-level functional specifications. Such specifications can be in the form of network density, travel time versus network length, traffic type, destination location, etc. We propose an integer programming-based approach that guarantees that the resultant networks are valid by fulfilling all the specified hard constraints and that they score favorably in terms of the objective function. We evaluate our algorithm in two different design settings, street layout and floorplans to demonstrate that diverse networks can emerge purely from high-level functional specifications.

Original languageEnglish (US)
Article numbera131
JournalACM Transactions on Graphics
Volume35
Issue number4
DOIs
StatePublished - Jul 11 2016

Fingerprint

Specifications
Integer programming
Travel time

Keywords

  • Computational design
  • Functional specifications
  • Network layout
  • Optimization
  • Urban planning

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Peng, C. H., Yang, Y. L., Bao, F., Fink, D., Yan, D. M., Wonka, P., & Mitra, N. J. (2016). Computational network design from functional specifications. ACM Transactions on Graphics, 35(4), [a131]. https://doi.org/10.1145/2897824.2925935

Computational network design from functional specifications. / Peng, Chi Han; Yang, Yong Liang; Bao, Fan; Fink, Daniel; Yan, Dong Ming; Wonka, Peter; Mitra, Niloy J.

In: ACM Transactions on Graphics, Vol. 35, No. 4, a131, 11.07.2016.

Research output: Contribution to journalArticle

Peng, CH, Yang, YL, Bao, F, Fink, D, Yan, DM, Wonka, P & Mitra, NJ 2016, 'Computational network design from functional specifications', ACM Transactions on Graphics, vol. 35, no. 4, a131. https://doi.org/10.1145/2897824.2925935
Peng CH, Yang YL, Bao F, Fink D, Yan DM, Wonka P et al. Computational network design from functional specifications. ACM Transactions on Graphics. 2016 Jul 11;35(4). a131. https://doi.org/10.1145/2897824.2925935
Peng, Chi Han ; Yang, Yong Liang ; Bao, Fan ; Fink, Daniel ; Yan, Dong Ming ; Wonka, Peter ; Mitra, Niloy J. / Computational network design from functional specifications. In: ACM Transactions on Graphics. 2016 ; Vol. 35, No. 4.
@article{e68a243f8ce6432794fca1d05db2c6e9,
title = "Computational network design from functional specifications",
abstract = "Connectivity and layout of underlying networks largely determine agent behavior and usage in many environments. For example, transportation networks determine the flow of traffic in a neighborhood, whereas building floorplans determine the flow of people in a workspace. Designing such networks from scratch is challenging as even local network changes can have large global effects. We investigate how to computationally create networks starting from only high-level functional specifications. Such specifications can be in the form of network density, travel time versus network length, traffic type, destination location, etc. We propose an integer programming-based approach that guarantees that the resultant networks are valid by fulfilling all the specified hard constraints and that they score favorably in terms of the objective function. We evaluate our algorithm in two different design settings, street layout and floorplans to demonstrate that diverse networks can emerge purely from high-level functional specifications.",
keywords = "Computational design, Functional specifications, Network layout, Optimization, Urban planning",
author = "Peng, {Chi Han} and Yang, {Yong Liang} and Fan Bao and Daniel Fink and Yan, {Dong Ming} and Peter Wonka and Mitra, {Niloy J.}",
year = "2016",
month = "7",
day = "11",
doi = "10.1145/2897824.2925935",
language = "English (US)",
volume = "35",
journal = "ACM Transactions on Graphics",
issn = "0730-0301",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Computational network design from functional specifications

AU - Peng, Chi Han

AU - Yang, Yong Liang

AU - Bao, Fan

AU - Fink, Daniel

AU - Yan, Dong Ming

AU - Wonka, Peter

AU - Mitra, Niloy J.

PY - 2016/7/11

Y1 - 2016/7/11

N2 - Connectivity and layout of underlying networks largely determine agent behavior and usage in many environments. For example, transportation networks determine the flow of traffic in a neighborhood, whereas building floorplans determine the flow of people in a workspace. Designing such networks from scratch is challenging as even local network changes can have large global effects. We investigate how to computationally create networks starting from only high-level functional specifications. Such specifications can be in the form of network density, travel time versus network length, traffic type, destination location, etc. We propose an integer programming-based approach that guarantees that the resultant networks are valid by fulfilling all the specified hard constraints and that they score favorably in terms of the objective function. We evaluate our algorithm in two different design settings, street layout and floorplans to demonstrate that diverse networks can emerge purely from high-level functional specifications.

AB - Connectivity and layout of underlying networks largely determine agent behavior and usage in many environments. For example, transportation networks determine the flow of traffic in a neighborhood, whereas building floorplans determine the flow of people in a workspace. Designing such networks from scratch is challenging as even local network changes can have large global effects. We investigate how to computationally create networks starting from only high-level functional specifications. Such specifications can be in the form of network density, travel time versus network length, traffic type, destination location, etc. We propose an integer programming-based approach that guarantees that the resultant networks are valid by fulfilling all the specified hard constraints and that they score favorably in terms of the objective function. We evaluate our algorithm in two different design settings, street layout and floorplans to demonstrate that diverse networks can emerge purely from high-level functional specifications.

KW - Computational design

KW - Functional specifications

KW - Network layout

KW - Optimization

KW - Urban planning

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

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

U2 - 10.1145/2897824.2925935

DO - 10.1145/2897824.2925935

M3 - Article

VL - 35

JO - ACM Transactions on Graphics

JF - ACM Transactions on Graphics

SN - 0730-0301

IS - 4

M1 - a131

ER -