Method for Evaluating the Accessibility of Rail Stations Based on the Walking Surface

Abstract

The present application provides a method for evaluating the accessibility of rail transit stations based on the walking surface. S1: Determine the walking surface space of the target area; S2: Divide the walking space into grids according to a preset grid size and encode the grids; S3: Determine the special walking space of the target area and divide and encode the grids according to the method in S2; S4: Construct a walking accessibility range search model based on a preset distance (or time consumption); S4: Determine the walking accessibility range according to the accessibility range search model in step S4, and superimpose the walking accessibility range on the land parcel to determine the service range of the rail transit station. The method for evaluating the accessibility of rail transit stations provided by the present application starts from the entrances and exits of rail transit stations, searches based on the walking space surface, and evaluates the walking accessibility range of rail transit stations through a preset distance threshold or time consumption threshold; the method provided by the present application is applicable to the accessibility evaluation in various current and planned scenarios.

Description

Technical Field

[0001] The present invention relates to the technical field of evaluating the accessibility of rail transit stations, and particularly to a method for evaluating the accessibility of rail transit stations based on the walking surface. Background Art

[0002] Walking is the most important feeder mode for rail transit. Under the condition of a dense rail transit network in megacities, "rail transit + walking" will become the most common travel mode for residents. According to investigations, the acceptable walking time for residents to travel is about 10 minutes. At a normal flat and barrier-free walking speed of 1.2 - 1.4 m / s, the walking distance is about 800 meters. Therefore, the walking accessible range of rail transit stations is usually determined by a 10-minute walk or a distance of 800 meters. Existing methods for evaluating the accessibility of rail transit stations include: the radius buffer method, which usually takes the rail transit station as the center and a radius of 800 meters to demarcate a circular area. This method is simple, but it does not consider the distribution of the positions of rail transit entrances and exits, does not consider road networks, spatial barriers, walking speed, etc., and the analysis results have large errors. The web crawler method is based on Internet walking navigation data. A starting point is selected, and the accessible range is determined by traversing and searching with time or distance thresholds. This method can only be used to evaluate the current situation and cannot be used to evaluate the planned scenario, and it is difficult to reflect the benefits of planar walking spaces such as squares and open communities. Therefore, there is an urgent need for a method for analyzing the accessibility of rail transit stations that can not only evaluate the current situation but also the planned scenario, and can fully consider influencing factors such as station entrances and exits, real walking spaces, and walking speed. Summary of the Invention

[0003] In view of this, the present invention provides a method for evaluating the accessibility of rail transit stations based on the walking surface, which is characterized in that the method comprises the following steps:

[0004] S1: Determine the walking surface space of the target area;

[0005] S2: Divide the walking space into grids according to a preset grid size, determine the grid code of the grid, and at the same time put the grid into the walking space grid set W;

[0006] Wherein, the grids in the walking space grid set W are denoted as W i (g i ), W i represents a grid in the walking space grid set W, and g i represents the grid code.

[0007] S3: Determine the special walking space of the target area according to the positions of plane crosswalk facilities, three-dimensional crosswalk facilities, ramps, and stepped roads in the target area;

[0008] Among them, the plane crossing includes a crosswalk, and the overpass crossing includes a pedestrian overpass, a pedestrian underpass and an interchange area;

[0009] Meanwhile, grid division is performed on the special walking space according to a preset grid size, and the grid code of the special walking space grid is determined. The elevation and the walking speed reduction coefficient of the grid are initialized, and the initialized grid is put into the special walking space grid set S;

[0010] Among them, the grid in the special walking space grid set S is denoted as S i (g i ,e i ,r i ), S i represents a grid in the special walking space grid set S, g i represents the code of the grid, e i represents the elevation of the grid (the value 0 represents a non-interchange area, -1 represents the lower layer of the interchange, 1 represents the upper layer of the interchange, and 8 represents the overlapping area of the upper and lower layers), r i represents the walking speed reduction coefficient of the grid;

[0011] S4: Let the grid set to be traversed be P, and let the traversed set be R. The label of the grid in the set is denoted as P i (g i ,d i ,t i ,e i ,k i ), where P i represents a grid in the set P or R, g i represents the code of the grid, d i represents the distance from the grid to the nearest track entrance / exit, t i represents the time from the grid to the nearest track entrance / exit, e i represents the elevation of the grid, k i represents the number of the nearest track entrance / exit of the grid;

[0012] According to the coordinates and numbers of the entrances / exits of the target rail station, the entrance / exit grids are determined as the starting points of the traversal, and the d i =0, t i =0, e i =0 are initialized; the grids corresponding to the entrances / exits are denoted as P n (g n ,0,0,0,n), where n (n = 1, 2, 3...) represents the numbers of the entrances / exits of the rail station, and g n represents the grid code generated according to the coordinates of each entrance / exit; the generated entrance / exit grids P n are put into the set P and the set R;

[0013] S5: Based on a preset distance threshold or time consumption threshold, starting from each entrance / exit grid of the target orbital station, traverse the walking space to determine the reachable range;

[0014] S501: Determine whether the set P is empty. If it is, end. If not, take a grid P from the set P i , and remove the grid P i from the set P;

[0015] S502: According to the grid code g i of P i determine the grid codes g i of the eight adjacent grids P j of P, where j = 1, 2, 3... 8, and update the labels of each adjacent grid P j (g j , d j , t j , e j , k j );

[0016] S503: Determine whether j is greater than 8. If it is, go to step S501. If not, go to the next step;

[0017] S504: Determine whether the special walking space set S contains the grid with the grid number g j . If it does, take out the elevation e j corresponding to g j and the walking speed reduction coefficient r j . If not, default e j = 0, r j = 1.0;

[0018] S505: Determine whether P j is located in the due east or due west direction of P j . If it is, go to S5061. If not, determine whether P i is located in the due south or due north direction of P j . If it is, go to step S5062. If not, determine that P i is located in other directions of P j , and the other directions include northeast, northwest, southeast, and southwest, and go to S507;

[0019] S5061: d i = d j + the short side of the grid (2.36m), t i = t j + the short side of the grid (2.36m) * r i , k j = k j = ki ;

[0020] S5062: d j = d i + grid long side (3.09 m), t j = t i + grid long side (3.09 m) * r j , k j = k i ;

[0021] S507: d j = d i + grid diagonal (3.89 m), t j = t i + grid diagonal (3.89 m) * r j , k j = k i ;

[0022] S508: Determine the elevation e j of grid P j whether it is equal to 8, if so, then e j = e i , if not, then e j remains unchanged;

[0023] S509: Determine if |e j - e i | > 1 holds, if so, then j = j + 1, go to step S503, if not, then determine d j (or t j ) whether it is greater than the preset threshold, if so, then j = j + 1, go to step S503, if not, determine if P j has been traversed, if so, then determine t j >= t j # , (or d j >= d j # ) where t j # represents the time from P j to the nearest track entrance / exit after the most recent traversal, d j # represents the distance from P j to the nearest track entrance / exit after the most recent traversal, if so, go to step S503, if not, determine if grid P j in the walking space grid set W contains the grid with grid number g j , if not, go to step S503, if so, add P j to sets P and R, and go to step S503;

[0024] S6: After the traversal ends, take out the grid set of set R, and record the area covered by the grid as the walking reachable range under the given threshold.

[0025] Furthermore, the grid coding in steps S2 and S3 is determined by the following method:

[0026] S201: Determine the longitude and latitude λ of the position point at the lower left corner of the grid;

[0027] S202: Determine the grid number, row number m(a, c, e), and column number n(b, d, f) according to the longitude and latitude λ, where abcdef is determined by the following method:

[0028]

[0029] b = [λ / 6°] + 31 (1 - 2)

[0030]

[0031] d = [(λ - 6° * (b - 31)) / 1′52.5″] + 1 (1 - 4)

[0032]

[0033] f = [(λ - 6° * (b - 31) - 1′52.5″ * (d - 1)) / 0.5″] + 1 (1 - 6)

[0034] Among them, represents the longitude of the position point, and λ represents the latitude of the position point;

[0035] S203: Encode according to the row number m(a, c, e) and column number n(b, d, f). The grid coding has a total of 18 bits and is arranged as follows:

[0036]

[0037] Among them, if a is less than 2 bits, it is padded with 0 on the left; if b is less than 2 bits, it is padded with 0 on the left; if c is less than 3 bits, it is padded with 0 on the left; if d is less than 3 bits, it is padded with 0 on the left; if e is less than 4 bits, it is padded with 0 on the left; if f is less than 4 bits, it is padded with 0 on the left.

[0038] Furthermore, for the eight adjacent grids P i of grid P j in step S502, the grid coding g j (j = 1, 2, 3... 8) is determined by the following method:

[0039] S5021: Obtain the row number m(a i , c i , e i ) and column number n(b i , d i , f i ) of grid P according to the grid code g i of grid P i , and abbreviate the row and column numbers as (m, n); i

[0040] S5022: The row and column numbers of eight adjacent grids are as follows: (m, n + 1) in the due east direction, (m, n - 1) in the due west direction, (m - 1, n) in the due south direction, (m + 1, n) in the due north direction, (m + 1, n + 1) in the northeast direction, (m - 1, n + 1) in the southeast direction, (m + 1, n - 1) in the northwest direction, and (m - 1, n - 1) in the southwest direction;

[0041] Calculate the row and column numbers of each adjacent grid according to the current grid row number m(a i , c i , e i ) and column number n(b i , d i , f i );

[0042] Among them, m + 1(a j , c j , e j ) is calculated by the following method:

[0043] e j = e i + 1;

[0044] If e j > 750, e j = e j % 750, c j = c i + 1;

[0045] If c j > 192, c j = c j % 192, a j = a i + 1;

[0046] % is the remainder operation

[0047] Among them, m - 1(a j , c j , e j ) is calculated by the following method:

[0048] e​j = e i - 1

[0049] If e j <= 0, e j = 750, c j = c i - 1;

[0050] If c j <= 0, c j = 192, a j = a i - 1;

[0051] Where n + 1(b j , d j , f j ) is calculated by the following method:

[0052] f j = f i + 1

[0053] If f j > 1125, f j = f j % 1125 d j = d i + 1;

[0054] If d j > 192, d j = d j % 192 b j = b i + 1;

[0055] % is the modulo operation

[0056] Where n - 1(b j , d j , f j ) is calculated by the following method:

[0057] f j = f i - 1

[0058] If f j <= 0, f j = 1125, d j = d i - 1;

[0059] If d j <= 0, d j = 192, b j = b i - 1.

[0060] Advantageous technical effects of the present invention: The method for evaluating the accessibility of rail transit stations provided in this application starts from the entrances and exits of rail transit stations, and based on the search of the walking surface space, evaluates the walking accessible range of rail transit stations through a preset distance threshold or time threshold; the method provided in this application is based on real walking paths and walking time consumption, and can effectively consider planar walking spaces such as squares and open plots, as well as multi-layer walking spaces in interchange areas, and factors such as slopes, steps, overpass crossings, and signalized crossings, and is applicable to the evaluation of the accessibility of rail transit stations in various current and planned scenarios. Description of the Drawings

[0061] The present invention will be further described below in conjunction with the drawings and embodiments:

[0062] Figure 1 It is a flowchart for determining accessibility according to the time threshold of this application.

[0063] Figure 2 It is a flowchart for determining accessibility according to the distance threshold of this application.

[0064] Figure 3 It is a schematic diagram of the path search by the grid method of this application.

[0065] Figure 4 It is a schematic diagram of the walking space of this application.

[0066] Figure 5 It is a schematic diagram of the elevation setting in the interchange area. Detailed Embodiments

[0067] The present invention will be further described below in conjunction with the accompanying drawings of the specification:

[0068] The present invention provides a method for evaluating the accessibility of rail transit stations based on the walking surface, characterized in that: the method includes the following steps:

[0069] S1: Determine the walking surface space of the target area; this step is completed manually, and the walking space is screened out in the target area by manual work and made into a GIS (Geographic Information System) surface element vector layer.

[0070] The walking space refers to the space that pedestrians can directly pass through, mainly composed of sidewalks and pedestrian crossing facilities on traffic roads, living roads, pedestrian streets and special footpaths, walkable spaces inside open plots, building setbacks, etc., as shown in Table 1. The walking road can only represent the walking accessible range at the "line" level, while the walking space can represent the open space at the "surface" level, which is closer to the real situation. Figure 4 It is a schematic diagram of the walking space of a constructed local area.

[0071] Table 1 Composition of the walking space

[0072]

[0073] S2: Divide the walking space into grids according to a preset grid size, determine the grid code of the grid, and at the same time put the grid into the walking space grid set W; in this embodiment, the preset grid size is longitude difference of 0.1 second (about 2.36 meters) * latitude difference of 0.1 second (about 3.09 meters).

[0074] The grid division rules are as follows:

[0075] Based on the 1:5000 topographic map sheet division of the country (each 1:5000 topographic map has a longitude difference of 1 minute and 52.5 seconds and a latitude difference of 1 minute and 15 seconds), subdivide each 1:5000 topographic map, divide it into 75 rows according to a latitude difference of 0.1 second, and divide it into 1125 columns according to a longitude difference of 0.1 second.

[0076] In this application, the grid coding method is as follows: 18 digits

[0077]

[0078] The 1st - 4th digits are the topographic map sheet numbers of the 1:1,000,000 scale of the country. Among them, the row number a is in the front and the column number b is in the back.

[0079] The 5th - 10th digits are the topographic map sheet numbers of the 1:5000 scale of the country. Among them, the row number c is in the front and the column number d is in the back.

[0080] The 11th - 18th digits are the numbers of the subdivided grids. Among them, the row number e is in the front and the column number f is in the back.

[0081] The determination methods of abcdef are as follows:

[0082] Row number a of the 1:1,000,000 map sheet: Refer to "Map Sheet Division and Numbering of National Basic Scale Topographic Maps GB / T 13989 - 2012"

[0083] Column number b of the 1:1,000,000 map sheet: Refer to "Map Sheet Division and Numbering of National Basic Scale Topographic Maps GB / T 13989 - 2012"

[0084] Row number c and column number d of the 1:5000 topographic map after the 1:1,000,000 topographic map number: Refer to "Map Sheet Division and Numbering of National Basic Scale Topographic Maps GB / T 13989 - 2012"

[0085] Row number e and column number f of the subdivided grid after the 1:5000 topographic map number: Adopt the following grid coding method:

[0086] S201: Determine the longitude and latitude λ of the position point at the lower left corner of the grid;

[0087] S202: Determine the grid row number m(a, c, e) and column number n(b, d, f) according to the longitude and latitude. Among them, abcdef are determined by the following method:

[0088]

[0089] b = [λ / 6°] + 31 (1 - 2)

[0090]

[0091] d = [(λ - 6°*(b - 31)) / 1′52.5″] + 1 (1 - 4)

[0092]

[0093] f = [(λ - 6°*(b - 31) - 1′52.5″*(d - 1)) / 0.5″] + 1 (1 - 6)

[0094] Among them, represents the longitude of the position point, and λ represents the latitude of the position point;

[0095] S203: Encode according to the row number m(a, c, e) and column number n(b, d, f). The grid encoding has a total of 18 bits and is arranged as follows:

[0096]

[0097] Among them, if a is less than 2 bits, it is padded with 0 on the left; if b is less than 2 bits, it is padded with 0 on the left; if c is less than 3 bits, it is padded with 0 on the left; if d is less than 3 bits, it is padded with 0 on the left; if e is less than 4 bits, it is padded with 0 on the left; if f is less than 4 bits, it is padded with 0 on the left.

[0098] S3: Determine the special walking space according to the positions of the plane crossing facilities (crosswalks), three-dimensional crossing facilities (pedestrian overpasses, pedestrian underpasses, interchange areas), ramps, and step roads within the target area; perform grid division on the special walking space according to the preset grid size (the method is the same as step S2), and determine the grid encoding of the grid. Initialize the elevation and walking speed reduction coefficient of the grid, and put the grid into the special walking space grid set S;

[0099] Among them, the grids in the special walking space grid set S are denoted as S i (g i , e i , r i ), S i represents a grid in the special walking space grid set S, g i represents the encoding of the grid, e i represents the elevation of the grid, r iIndicates the reduction coefficient of walking speed for the grid;

[0100] In this embodiment, this step is completed manually. Manually screen out special walking spaces in the target area and create them into a GIS (Geographic Information System) surface feature vector layer.

[0101] In this embodiment, the elevation is processed in the following manner:

[0102] For non-interchange areas, project all walkable ranges onto a plane to construct the walking space. For interchange areas, the upper and lower pedestrian spaces cannot be directly connected. If the method of projecting the walking space of the interchange area onto a plane is still used, it will cause the plane projections of the upper and lower pedestrian spaces to overlap and be connected to each other, which does not conform to the actual situation. Therefore, for each elevation layer of the interchange area, corresponding elevation labels and connection rules need to be set for distinction. The specific process is as follows:

[0103] (1) Set the elevation and elevation value-taking rules

[0104] As Figure 5 As shown in the elevation setting schematic diagram of the interchange area: The elevation of the non-interchange area is set to 0. For the upper and lower pedestrian spaces of the interchange area, the elevation of the upper area is set to +1, the elevation of the lower area is set to -1, and the elevation of the area where the upper and lower projection planes overlap is set to ±1. In this embodiment, for the sake of easy representation, the number 8 is used to replace ±1. Those skilled in the art can choose any number to replace ±1 according to actual needs.

[0105] When performing the reachable range search, dynamically determine the final elevation value of the overlapping area based on the walking path. If walking from the upper area (elevation +1) to the overlapping area, the elevation of the overlapping area takes +1; if walking from the lower area (-1) to the overlapping area, the elevation takes -1.

[0106] (2) Define the connection rules for different elevation layers

[0107] The same elevation layer can be connected (0 to 0, 1 to 1, -1 to -1)

[0108] One can walk from the plane (0) to the upper area (+1);

[0109] One can walk from the plane (0) to the lower area (-1);

[0110] One cannot walk directly from the upper area (+1) to the lower area (-1).

[0111] One cannot walk directly from the lower area (-1) to the upper area (+1).

[0112] In this embodiment, the reduction of walking speed is processed in the following manner:

[0113] When calculating the reachable range according to time, the walking speed needs to be considered. In addition to being affected by the physical fitness of pedestrians (such as age and health), the walking speed of pedestrians is also affected by the walking environment, including the road slope, waiting for the red light at crosswalks, waiting or decelerating due to avoiding pedestrians and vehicles, etc. When there is no obstacle on a flat slope, the walking speed is about 1.2 - 1.4 m / s, and it needs to be reduced to varying degrees when affected by the external environment, as shown in Table 2. According to the facility type, assign values to the walking speed correction coefficients of the special walking space grid according to Table 2.

[0114] Step 1: Create a vector layer of GIS surface elements for objects such as pedestrian overpasses, pedestrian underpasses, plane crossings, long ramps, and stepped roads.

[0115] Step 2: Generate grids for various surface elements in sequence, and set the elevation and walking speed correction coefficient of the grid. The walking speed correction coefficient is shown in Table 2.

[0116] Table 2 Values of walking speed reduction coefficients

[0117]

[0118] S4: Let the set of grids to be traversed be P, and let the set of traversed grids be R. The label of the grids in the set is denoted as P i (g i ,d i ,t i ,e i ,k i ), where P i represents a grid in set P or R, g i represents the code of the grid, d i represents the distance from the grid to the nearest track entrance, t i represents the time from the grid to the nearest track entrance, e i represents the elevation of the grid, k i represents the number of the nearest track entrance of the grid;

[0119] According to the coordinates and numbers of each entrance of the target rail station, determine the entrance grids as the starting points of traversal, and initialize d i = 0, t i = 0, e i = 0. Denote the grids of each entrance as P n (g n ,0,0,0,n), where n (n = 1, 2, 3...) represents the numbers of each entrance of the rail station, and g n represents the grid code generated according to the coordinates of each entrance. Put the generated grids P n of each entrance into set P and set R;

[0120] S5: According to the preset distance threshold or time consumption threshold, starting from each entrance and exit grid of the target orbital station, traverse the walking space to determine the reachable range; as Figure 3 shown in the grid search schematic diagram, starting from the entrance and exit grid of the orbital station, explore in 8 adjacent directions simultaneously according to the divided grids. When encountering an area where walking is not reachable (non-walking space range), such as a closed community, greenery, water area, building, non-crossable road, etc., stop exploring in this direction until the distance from the starting point exceeds the 800-meter threshold (or the time consumption from the starting point exceeds the 10-minute threshold) and stop exploring.

[0121] (1) Model input: Vector file of point elements at the entrance and exit of the orbital station, vector file of surface elements of the walking space, special walking space surface element files such as plane crosswalks (pedestrian crosswalks), overpasses (pedestrian overpasses, pedestrian underpasses, interchange areas), ramps, and stepped roads.

[0122] (2) Fishing net construction: Construct the walking space and special walking spaces into grids with a longitude difference of 0.1 seconds (about 2.36 meters) * latitude difference of 0.1 seconds (about 3.09 meters).

[0123] (3) Search path: Search for the path according to the grid method, as Figure 3 shown. Among them, if within the given distance (or time) threshold range, starting from multiple entrances and exits, a certain grid can be reached, then take the shortest path distance (or time consumption) from them.

[0124] As Figure 1 and Figure 2 shown:

[0125] S501: Judge whether the set P is empty. If it is, end. If not, take a grid P i from the set P, and i delete the grid P

[0126] S502: According to the grid code g i of P i determine the grid codes g i of the eight adjacent grids P j of P j , where j = 1, 2, 3... 8, and update the labels of each adjacent grid P j (g j , d j , t j , e j , k j );

[0127] In step S502, the grid codes g i of the eight adjacent grids P j of Pj (j = 1, 2, 3…8) is determined by the following method:

[0128] S5021: According to the grid code g i of grid P i , obtain the row number m(a i , c i , e i ) and column number n(b i , d i , f i ) of grid P. The row and column numbers are briefly recorded as (m, n); i )

[0129] S5022: The row and column numbers of the eight adjacent grids are respectively: due east direction is (m, n + 1), due west direction is (m, n - 1), due south direction is (m - 1, n), due north direction is (m + 1, n), northeast direction is (m + 1, n + 1), southeast direction is (m - 1, n + 1), northwest direction is (m + 1, n - 1), southwest direction is (m - 1, n - 1); The offset rules of the row and column numbers of the adjacent grids are shown in Table 3.

[0130] Table 3 Offset Rules of Row and Column Numbers of Adjacent Grids

[0131] (m+1,n-1) (m+1,n) (m+1,n+1) (m,n-1) (m,n) (m,n+1) (m-1,n-1) (m-1,n) (m-1,n+1)

[0132] According to the current grid row number m(a i , c i , e i ) and column number n(b i , d i , f i ), calculate the row and column numbers of each adjacent grid.

[0133] Among them, m + 1(a j , c j , e j ) is calculated by the following method:

[0134] e j = e i + 1;

[0135] If e j > 750, e j = e j % 750, c j = c i + 1;

[0136] If c j > 192, c j = c j % 192, a j = a i + 1;

[0137] % is the modulo operation

[0138] where m-1(a j , c j , e j ) is calculated as follows:

[0139] e j = e i - 1

[0140] If e j <= 0, e j = 750, c j = c i - 1;

[0141] If c j <= 0, c j = 192, a j = a i - 1;

[0142] where n+1(b j , d j , f j ) is calculated as follows:

[0143] f j = f i + 1

[0144] If f j > 1125, f j = f j % 1125 d j = d i + 1;

[0145] If d j > 192, d j = d j % 192 b j = b i + 1;

[0146] % is the modulo operation

[0147] where n-1(b j , d j , f j ) is calculated as follows:

[0148] f j = f i - 1

[0149] If f j <= 0, f j = 1125, d j = di -1;

[0150] If d j <= 0, d j = 192, b j = b i - 1.

[0151] S503: Determine whether j is greater than 8. If so, go to step S501; if not, go to the next step;

[0152] S504: Determine whether the special walking space set S contains the grid with grid number g j . If so, take out the elevation e j corresponding to g j and the walking speed reduction coefficient r j . If not, default e j = 0, r j = 1.0;

[0153] S505: Determine whether P j is located due east or due west of P i . If so, go to S5061; if not, determine whether P j is located due south or due north of P i . Go to step S5062; if not, determine that P j is located in other directions (northeast, northwest, southeast, southwest) of P i and go to S507;

[0154] S5061: d j = d i + short side of the grid (2.36 m), t j = t i + short side of the grid (2.36 m) * r j , k j = k i ;

[0155] S5062: d j = d i + long side of the grid (3.09 m), t j = t i + long side of the grid (3.09 m) * r j , k j = k i ;

[0156] S507: d j = d i + diagonal of the grid (3.89 m), t j = t i + diagonal of the grid (3.89 m) * rj , k j = k i ;

[0157] S508: Determine whether the elevation e of grid P j is equal to 8. If so, then e j = e j , if not, then e i remains unchanged; j Keep it unchanged;

[0158] Set the elevation of the non - interchange area to 0. For the upper and lower pedestrian spaces in the interchange area, set the elevation of the upper area to +1, the elevation of the lower area to -1, and the elevation of the area where the upper and lower projection planes overlap to ±1. In this embodiment, for the sake of representation, the number 8 is used to replace ±1. Those skilled in the art can choose any number to replace ±1 according to actual needs.

[0159] For the area where the projection planes overlap, that is, the area with an elevation of 8, during the search, dynamically correct the elevation of the grid in the overlapping area according to the elevation of the previous grid:

[0160] If the elevation of the current grid is -1 and the elevation of the next adjacent grid is 8, then during the traversal, dynamically correct the elevation of the next adjacent grid to -1;

[0161] If the elevation of the current grid is 1 and the elevation of the next adjacent grid is 8, then dynamically correct the elevation of the next adjacent grid to 1.

[0162] S509: Determine whether |e j - e i |> 1 holds. If so, then j = j + 1 and enter step S503. If not, then determine whether d j (or t j ) is greater than the preset threshold. If so, then j = j + 1 and enter step S503. If not, determine whether P j has been traversed. If so, then determine whether t j >= t j # , (or d j >= d j # ) where t j # represents the time from P j to the nearest track entrance / exit after the most recent traversal, and d j # represents the distance from P j to the nearest track entrance / exit after the most recent traversal. If so, then enter step S503. If not, determine whether grid P j in the walking space grid set W contains the grid number g jIf not, go to step S503; if so, add P j to set P and set R, and go to step S503;

[0163] In addition, those skilled in the art can also set a preset walking distance threshold according to actual needs. In this embodiment, the walking distance is 800 meters, and the reachable range is within 10 minutes. In the actual application of this method, different reachable ranges can be determined by directly modifying the threshold of dj.

[0164] S6: After the traversal is completed, take out the grid set of set R, and record the area covered by the grid as the walking reachable range under the given threshold.

[0165] For the already built rail stations, the accessibility analysis tool can be used to evaluate the optimization plan for the surrounding walking connections, and further improve the walking accessibility of the stations; for the planned stations, the accessibility analysis tool can be used to evaluate the planning plan for the stations and the surrounding areas, and assist in the preparation of the planning plan.

[0166] This application can also overlay the walking reachable range with the plot space to obtain the walking service range of the rail station. For a plot, if there is at least one plot entrance point within the walking reachable range or adjacent to the walking reachable range, the entire plot is considered to be within the walking service range of the rail station. If a plot is located within the service ranges of multiple adjacent rail stations, the plot belongs to the service range of the nearest rail station according to the distance to each rail station.

[0167] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the present invention can be modified or equivalently replaced without departing from the spirit and scope of the technical solutions of the present invention, and they should all be covered within the scope of the claims of the present invention.

Claims

1. A method for evaluating the accessibility of rail transit stations based on the walking surface, characterized in that: The method includes the following steps: S1: Determine the walking space of the target area; S2: Divide the walking space into grids according to the preset grid size, determine the grid code of the grids, and put the grids into the walking space grid set W; Among them, the grids in the walking space grid set W are denoted as W i (g i ), W i represents a grid in the walking space grid set W, and g i represents the code of the grid. S3: Determine the special walking space of the target area according to the positions of plane crossing facilities, overpass facilities, ramps, and stepped roads in the target area; Among them, the plane crossing includes crosswalks, and the overpass crossing includes pedestrian overpasses, pedestrian underpasses, and interchange areas; At the same time, divide the special walking space into grids according to the preset grid size, determine the grid code of the special walking space grids, initialize the elevation and walking speed reduction coefficient of the grids, and put the initialized grids into the special walking space grid set S; Among them, the grids in the special walking space grid set S are denoted as S i (g i ,e i ,r i ), S i represents a grid in the special walking space grid set S, g i represents the code of the grid, e i represents the elevation of the grid (the value 0 represents a non-overpass area, -1 represents the lower layer of the overpass, 1 represents the upper layer of the overpass, and 8 represents the overlapping area of the upper and lower layers), r i represents the walking speed reduction coefficient of the grid; S4: Let the set of grids to be traversed be P, and the set of traversed grids be R. The label of the grids in the set is denoted as P i (g i ,d i ,t i ,e i ,k i ), where P i represents a grid in the set P or R, g i represents the code of the grid, d i represents the distance from the grid to the nearest track entrance / exit, t i represents the time from the grid to the nearest track entrance / exit, e i represents the elevation of the grid, k i represents the number of the nearest track entrance / exit of the grid; Determine the entrance and exit grid based on the coordinates and numbers of each entrance and exit of the target orbital station, use it as the starting point for traversal, and initialize d i = 0, t i = 0, e i = 0; Denote the entrance and exit grids as P n (g n , 0, 0, 0, n), where n (n = 1, 2, 3...) represents the numbers of each entrance and exit of the orbital station, and g n represents the grid code generated according to the coordinates of each entrance and exit; Put the generated entrance and exit grids P n into set P and set R; S5: According to the preset distance threshold or time consumption threshold, starting from the grids of each entrance and exit of the target rail transit station, traverse the walking space to determine the reachable range; S501: Determine whether the set P is empty. If it is, end. If not, take a grid P from the set P i , and remove the grid P i from the set P; S502: Determine, according to the trellis code g of P i of P i the eight adjacent trellises P i of P j and their trellis codes g j , where j = 1, 2, 3... 8, and update the labels P of each adjacent trellis j (g j , d j , t j , e j , k j ); S503: Judge whether j is greater than 8. If so, enter step S501. If not, enter the next step; S504: Determine whether the grid with grid number g is included in the special walking space set S j If so, take out g j and the corresponding elevation e j and the walking speed reduction coefficient r j If not, by default, e j = 0, r j = 1.0; S505: Determine P j Is it located due east or due west of P i If so, proceed to S5061; if not, determine whether P j Is it located due south or due north of P i If so, proceed to step S5062; if not, then determine that P j Is located in i Other directions of P, where the other directions include northeast, northwest, southeast, and southwest, and proceed to S507; S5061: d j = d i + short side of the grid, t j = t i + short side of the grid * r j , k j = k i ; S5062: d j = d i + long side of the grid, t j = t i + long side of the grid * r j , k j = k i ; S507: d j = d i + grid diagonal, t j = t i + grid diagonal * r j , k j = k i ; S508: Determine grid P j for its elevation e j to see if it equals 8. If so, then e j = e i ; if not, then e j remains unchanged; S509: Judgment |e j -e i |>1 is true, if so, then j=j+1, go to step S503, if not, then determine d j (or t j ) is greater than the preset threshold, if so, then j=j+1, go to step S503, if not, determine P j Has it been traversed? If so, judge t j >=t j # OR j >=d j # Is there a satisfying condition where t j # Indicates the most recent traversal after P j Time to the nearest track entrance or exit, d j # Indicates the most recent traversal after P j The distance to the nearest track entrance and exit, if yes, proceed to step S503, if no, determine P j Does the walking space grid set W contain the grid number g? j If not, then go to step S503, if yes, then P j Add set P and set R, and go to step S503; S6: After the traversal is completed, take out the grid set of set R, and record the area covered by the grids as the walking reachable range under the given threshold.

2. The method for evaluating the accessibility of rail transit stations based on the walking surface according to claim 1, characterized in that: The grid code in step S2 or step S3 is determined by the following method: S201: Determine the longitude of the position point at the lower left corner of the grid and latitude λ; S202: Determine the grid row number m(a, c, e) and column number n(b, d, f) according to the longitude and latitude λ, where abcdef are determined by the following method: b = [λ / 6°]+31(1 - 2) d = [(λ - 6°*(b - 31)) / 1 ′ 52.5 ″ + 1(1 - 4) f=[(λ - 6°*(b - 31) - 1 ′ 52.5 ″ *(d - 1)) / 0.5″] + 1(1 - 6) Among them, represents the longitude of the location point, and λ represents the latitude of the location point; S203: Encode according to the row number m(a, c, e) and column number n(b, d, f). The grid code has a total of 18 bits and is arranged as follows: Among them, if a is less than 2 bits, it is padded with 0 on the left. If b is less than 2 bits, it is padded with 0 on the left. If c is less than 3 bits, it is padded with 0 on the left. If d is less than 3 bits, it is padded with 0 on the left. If e is less than 4 bits, it is padded with 0 on the left. If f is less than 4 bits, it is padded with 0 on the left.

3. The method for evaluating the accessibility of rail transit stations based on the walking surface according to claim 1, characterized in that: In step S502, grid P i and its eight adjacent grids P j with grid code g j (j = 1, 2, 3... 8) are determined by the following method: S5021: According to grid P i 's grid code g i , obtain the row number m(a i , c i , e i ) and column number n(b i , d i , f i ) of grid P i , and the row and column numbers are briefly recorded as (m, n); S5022: The row and column numbers of the eight adjacent grids are: due east direction is (m, n + 1), due west direction is (m, n - 1), due south direction is (m - 1, n), due north direction is (m + 1, n), northeast direction is (m + 1, n + 1), southeast direction is (m - 1, n + 1), northwest direction is (m + 1, n - 1), southwest direction is (m - 1, n - 1); According to the current grid row number m(a i ,c i ,e i ), column number n(b i ,d i ,f i ), calculate the row and column numbers of each adjacent grid; where m + 1(a j , c j , e j ) is calculated by the following method: e j = e i + 1; If e j > 750, e j = e j % 750, c j = c i + 1; If c j > 192, c j = c j % 192, a j = a i + 1; % is the remainder operation where, m-1(a j ,c j ,e j ) is calculated by the following method: e j = e i -1 If e j <= 0, e j = 750, c j = c i -1; If c j <= 0, c j = 192, a j = a i - 1; Among them, n + 1(b j , d j , f j ) is calculated by the following method: f j = f i + 1 If f j > 1125, f j = f j % 1125d j = d i + 1; If d j > 192, d j = d j % 192b j = b i + 1; % is the remainder operation Among them, n - 1(b j , d j , f j ) is calculated by the following method: f j = f i -1 If f j <= 0, f j = 1125, d j = d i - 1; If d j <= 0, d j = 192, b j = b i - 1.

Images