Research Article
A GIS Based Unsteady Network Model and System Applications for Intelligent Mine Ventilation
Table 3
The algorithm for GIS Based Unsteady Network Model.
| Algorithm 1. Algorithm steps for GIS based unsteady network model |
| Step 1: Establish the ventilation network graph, initialize the geospatial and attribute data for laneways and nodes. | Step 2: Generate the topological relation for the ventilation network graph and stored as point-line indexed structure and basic incidence matrix. | Step 3: Sort the laneway branches according to wind drag, and generate the minimum spanning tree based on Dijkstra shortest path algorithm. | Step 4: Search the cotree branches, generate the independent loop and loop matrix. | Step 5: Main iteration based on Runge-Kutta algorithm; see equations (7)–(11). | Step 6: Save the results as time series air volume for each laneway branch based on point-line indexed structure. |
|
|