Software for simulating stepwise undirected network growth

• Computational network models are critical to the development of robust, efficient, and sustainable transport systems around the world. However, no networking algorithm exists that enables stepwise user customizability and true transport applicability, so cities are designed without fundamental design principles.
• This results in mass operational inefficiencies and in economic, well-being, and productivity losses.  
• This technology introduces a method and model for simulating general multi-phase network growth, inspired by the simplified, stepwise behaviours of a unicellular slime mould.
• Borrowing inspiration from nature, this technology integrates mathematically-definable principles of growth that have evolved over hundreds of millions of years in biology into the design of our urban infrastructure.
• This technology currently exists as a computer program (algorithm, TRL 7) that can be fed a set of nodes (i.e., train stations) over which a network must span, and a set of constraints (i.e., minimum efficiency) to which a network must adhere. The algorithm has been used to propose a range of alternate network designs for existing urban infrastructure.
• The generalizability of the technology makes it relevant for implementation at any scale (i.e., building to city to country), and in any world region (i.e., developed versus developing).
• The technology’s computational algorithm treats an initial particle deposition phase and a secondary particle connectivity phase separately. In the first phase, the model releases seed nuclei to forage across a domain, searching for points of interest. In the second phase, the model works to refine the mesh that has been developed in the prior phase, with input (restrictions) from the designer.

BENEFITS

• This technology helps to democratize algorithmic and intelligent urban/transport network design, providing users/clients with tunable design control at intermediate stages of computational network development, for precise output flexibility.
• Specifically, it allows users/clients (city designers, developers, engineers), for the first time, to specify a set of spatial constrains (i.e., locations for stations or hubs), financial constraints (i.e., maximum amount of track distance), and efficiency constraints (i.e., minimum level of network connectivity) toward producing an optimal urban network solution for a given set of nodes (i.e., stations), independent of scale.
• Compared to alternative algorithms, this technology foremost promotes accessibility and flexibility for planners/engineers/designers.

APPLICATIONS

• This technology can be used to design (from scratch) or to modify/upgrade transport networks of all types (e.g., roadways, railways, indoor and outdoor footpaths, wastewater systems, electrical systems) in urban environments.
• This technology is particularly relevant for urban design scenarios wherein central stations/hubs/points-of-interest have been spatially predetermined, and a transport network is required to facilitate their connection.
• The market for innovative urban design strategies is rapidly growing, as infrastructural development dramatically expands, particularly in developing countries. Moreover, with increasing urban density, the demand for more spatially-efficient and cost-effective design principles for moving goods and people around cities is greatly increasing.

STATUS

• Pre-patent 
• Future R&D will focus on improved usability (user interface design) and more complex functionality (e.g., incorporating the possibility of introducing anti-attractants in addition to attractants).
• Seeking partnerships with private planning firms and public governments, interested in licensing the technology to aid in the design and (re)development of new and renewed master plans, for entire town regions, neighbourhoods, or individual building complexes.