Construction road route design device, construction road route design method, and program
Patent Information
- Application Number
- MYPI2025000738
- Authority / Receiving Office
- MY · MY
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2022-08-08
- Publication Date
- 2024-02-08
AI Technical Summary
Manual route planning for temporary roads at construction sites is time-consuming and inefficient, taking around one week to one month, and it is difficult for even experienced supervisors to determine the optimal route without knowing if it is the best option.
A construction road route design device that acquires topographic and design terrain data, calculates the cost of construction soil for various routes, and selects the route that minimizes the determined cost using a route search unit, allowing for the optimization of road route planning.
Enables anyone to design an optimal road route quickly, reducing planning time and ensuring the shortest road route with minimal construction soil usage, automatically balancing cut and fill amounts.
Smart Images

Figure PI2025000738_DRAWING_001 
Figure PI2025000738_DRAWING_002 
Figure PI2025000738_DRAWING_003
Abstract
Description
Construction road route design device, construction road route design method and program
[0001] The present invention relates to a construction road route design device, a construction road route design method, and a program.
[0002] Conventionally, the route of a temporary road at a construction site is planned manually by a site supervisor, taking into consideration the fit with the final design surface, the boundary of the construction area, the slope gradient, the amount of cut and fill soil, whether the road will be easy to maintain until the end, etc. Patent Document 1 discloses that a user sets a two-dimensional soil transportation route by using an input device such as a mouse or a touch pen to draw a desired route on two-dimensional current topography data displayed on the display screen of a PC or tablet device.
[0003] Japanese Patent Application Laid-Open No. 2021-149395
[0004] However, when planning routes manually, it currently takes about one week to one month, and even experienced supervisors find it difficult to design an optimal route. Furthermore, even if a route is designed after careful consideration, it is unclear whether it is optimal.
[0005] The present invention has been made in view of the above circumstances, and has an object to enable anyone to design an optimal route.
[0006] In order to achieve the above-mentioned object, the construction road route design device of the present invention comprises: a current terrain data acquisition unit that acquires terrain data indicating the current terrain of the construction site; a designed terrain data acquisition unit that acquires terrain data indicating the designed terrain of the construction site; a road edge acquisition unit that acquires two or more road edges that serve as the start and end points of the construction road; and a route search unit that searches for routes between the multiple road edges, wherein the route search unit selects multiple nodes that exist between the multiple road edges, and for multiple routes that lead to the multiple road edges via the selected nodes, calculates the cost based on the construction soil volume of the construction road from the terrain data of the current terrain and the designed terrain, and selects the route that minimizes the calculated cost.
[0007] According to the present invention, it is possible for anyone to design an optimal route.
[0008] 1 is a diagram showing the functional configuration of a construction road route design device according to a first embodiment of the present invention. FIG. 2 is a diagram showing the hardware configuration of a construction road route design device according to a first embodiment of the present invention. FIG. 3 is a flowchart showing the operation of road route design processing according to the first embodiment of the present invention. FIG. 4 is a diagram showing the current topography of a construction site. FIG. 5 is an IVB-IVB cross-sectional view showing a cross section between IVB-IVB. FIG. 6 is a diagram showing a map generated by a map generation unit according to the first embodiment of the present invention. FIG. 7 is a flowchart showing the operation of route search processing according to the first embodiment of the present invention. FIG. 8 is a diagram showing the arrangement of nodes in the xy plane. FIG. 9 is a diagram showing the arrangement of nodes in the z-axis direction. FIG. 10 is a diagram showing a specific example of a route search method according to the first embodiment of the present invention. FIG. 11 is a diagram showing a specific example of a route search method according to the first embodiment of the present invention. FIG. 12 is a diagram showing a specific example of a route search method according to the first embodiment of the present invention. FIG. 13 is a diagram showing a specific example of a route search method according to the first embodiment of the present invention. FIG. 14 is a diagram showing a specific example of a route search method according to the first embodiment of the present invention. Fig. 10 is a flowchart showing the operation of an additional branch point determination process according to a third embodiment of the present invention. Fig. 11 is a topographical map showing a route connecting three road edges and a branch point. Fig. 12 is a topographical map enclosing an area including two adjacent road edges and a branch point. Fig. 13 is a topographical map showing an additional branch point and a route. Fig. 14 is a topographical map enclosing an area including another two adjacent road edges and a branch point. Fig. 15 is a topographical map showing an additional branch point and a route. Fig. 16 is a topographical map enclosing an area including another two adjacent road edges and a branch point. Fig. 17 is a topographical map showing an additional branch point and a route. Fig. 18 is a diagram showing an example in which nodes are arranged at a plurality of locations in a three-dimensional space.
[0009] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A construction road route design device, a construction road route design method, and a program according to an embodiment of the present invention will be described in detail below with reference to the accompanying drawings.
[0010] 1, a construction road route design device 1 includes a control unit 2 and a storage unit 3. The control unit 2 includes a current terrain data acquisition unit 21 that acquires terrain data indicating the current terrain of a land development construction site before construction, a designed terrain data acquisition unit 22 that acquires terrain data indicating the designed terrain of the land development construction site, a road edge acquisition unit 23 that acquires the positions of road start points and road end points that indicate the road edges that are entrances and exits of construction roads for construction vehicles to travel within the construction site, a map generation unit 24 that generates a map of construction earth volumes such as the amount of cut earth and the amount of fill earth required for construction from the current terrain data and the designed terrain data, and a route search unit 25 that searches for a route for the construction road.
[0011] The current terrain data acquisition unit 21 reads two-dimensional or three-dimensional terrain data showing the current terrain of the planned construction site before construction from a terrain DB (database) 31 (described later) to acquire the necessary current terrain data. The current terrain data is used when searching for the route of the construction road.
[0012] The designed terrain data acquisition unit 22 reads two-dimensional or three-dimensional drawing data showing the final design surface of the proposed construction site from a design DB (database) 32 (described later) and acquires the necessary designed terrain data. The designed terrain data is used together with the current terrain data when searching for the route of the construction road.
[0013] The road edge acquisition unit 23 acquires the positions of the start and end points of the road, which are the road edges when designing a construction road. The start and end points are acquired by the user inputting them via a keyboard, mouse, etc. Once these start and end points, current topography data, and designed topography data have been acquired, a search for the optimal route for the construction road begins.
[0014] The map generation unit 24 divides the construction site into predetermined regions and generates a map of the construction earthwork volumes, such as the cut and fill volumes, required for construction in each region based on the current topography data and the design topography data. The map generation unit 24 includes a cut volume calculation unit 241 that calculates the cut volume, a fill volume calculation unit 242 that calculates the fill volume, an overfill volume calculation unit 243 that calculates the overfill volume, an overcut volume calculation unit 244 that calculates the overcut volume, a cut and fill volume calculation unit 245 that calculates the difference between the cut volume and the fill volume, and a remaining distance calculation unit 246 that calculates the remaining distance to the end point. The cut volume calculation unit 241 calculates the volume of cut earth required to level the current topography to the road surface when the current topography is higher than the road surface of the construction road. If the cut volume is large, the amount of excavation work increases, thereby increasing the cost of constructing the road. The fill volume calculation unit 242 calculates the volume of fill earth required to level the current topography to the road surface when the current topography is lower than the road surface. If the amount of fill is large, the amount of fill work increases accordingly, resulting in higher road construction costs. The overfill amount calculation unit 243 calculates the overfill amount, which is the amount of fill required in excess of the amount required to form the design surface, when the road surface of the construction road is formed higher than the design surface, which is the final topography. If the amount of overfill is large, the amount of fill work required to form the road surface increases accordingly, and further excavation work is required to form the final topography, resulting in higher construction costs. The overcut amount calculation unit 244 calculates the overcut amount, which is the amount of cut soil required in excess of the amount required to form the design surface, when the road surface of the construction road is formed lower than the design surface, which is the final topography. If the amount of overcut is large, the amount of excavation work required to form the road surface increases accordingly, and further excavation work is required to form the final topography, resulting in higher construction costs. The cut and fill amount calculation unit 245 calculates the difference between the amount of cut soil for that area calculated by the cut amount calculation unit 241 and the amount of fill soil for that area calculated by the fill amount calculation unit 242. If the difference between the amount of earth cut and the amount of earth filled is large, the excess soil must be transported to another location, or the missing soil must be brought in from another location, which increases the cost of constructing the road.
[0015] The storage unit 3 includes a topography DB 31, a design DB 32, and a map storage unit 33. The topography DB 31 is a database storing current topography data. The design DB 32 is a database storing designed topography data. The map storage unit 33 is a database storing maps of construction earth volumes, such as cut volumes and fill volumes, required for construction in each area of the construction site, generated by the map generation unit 24.
[0016] The route search unit 25 searches for the optimal route for the construction road from the road start point to the road end point. When searching for a route for the construction road connecting the road start point and the road end point, the route search unit 25 selects nodes, which are intermediate points that the route passes through. A node is a location where a meridian and a latitude line are intersected at a predetermined interval (in the case of three dimensions, a location where a meridian and a latitude line are intersected at a predetermined interval at a predetermined altitude), and a route is formed by tracing the nodes. Once the nodes are selected, the route search unit 25 calculates the cost based on the construction earthwork volume for the construction road between each node. Once the cost is calculated, the route search unit 25 calculates the sum of the costs from the start point to the end point, and selects the route with the smallest sum of costs as the optimal route.
[0017] As shown in FIG. 2 , the construction road route design device 1 includes, in terms of hardware, a processor 41 that processes data according to a control program, a main memory 42 that functions as the processor's work area, an auxiliary memory 43 for long-term data storage, an input / output unit 44 that accepts data input and outputs the data, an operation unit 45, a display unit 46, a communication unit 47 that communicates with other devices, and a bus that interconnects these elements. The auxiliary memory 43 stores the control program executed by the processor 41. The operation unit 45 is a device for inputting various instructions to the control unit 2 and includes a keyboard, operation buttons, etc. The display unit 46 displays screens showing the execution results of various processes, operation screens, etc. The processor 41 functions as the current topography data acquisition unit 21, the designed topography data acquisition unit 22, the road edge acquisition unit 23, the map generation unit 24, and the route search unit 25 shown in FIG. 1 by loading the program stored in the auxiliary memory 43 into the main memory 42 and executing it. The auxiliary storage unit 43 also functions as a topographical DB 31 , a design DB 32 , and a map storage unit 33 .
[0018] 3 is a flowchart showing the road route design process. As shown in FIG. 3, in step S101, the current terrain data acquisition unit 21 of the control unit 2 accesses the terrain DB 31 of the storage unit 3 to acquire current terrain data for the site where the construction road is to be designed. Next, in step S102, the design terrain data acquisition unit 22 of the control unit 2 accesses the design DB 32 of the storage unit 3 to acquire final design surface data for the site. Next, in step S103, the road edge acquisition unit 23 of the control unit 2 acquires the start and end points of the construction road based on input from the user. Once the current terrain data and final design surface data have been acquired, the map generation unit 24 of the control unit 2 generates a map of the construction earthwork volumes, such as the cut and fill volumes, required for construction, from the acquired current terrain data and final design surface data (step S104).
[0019] Here, we will explain how to generate the map. The current topographical data and the final design surface data are overlaid, and the topographical data incorporates a two-dimensional or three-dimensional grid. Once the grid is incorporated, data on the volume of cut and fill required when a road is constructed between adjacent grid points is calculated. Specifically, the following data is calculated: cut volume, fill volume, overcut volume, overfill volume, and cut and fill volume difference. Figures 4A and 4B illustrate the case where a two-dimensional grid is incorporated, excluding the height direction. Figure 4A shows the current topography of the construction site. In Figure 4A, nodes are drawn at the positions corresponding to the grid points of the square grid. The upper left corner of Figure 4A indicates the start point of the road to be set, and the lower right corner indicates the end point of the road. Figure 4B is the IVB-IVB cross section showing the cross section between IVB-IVB on Figure 4A. Figure 4B also includes a cross section of the final design surface in addition to the current topography. In Figure 4B, there are some places where the current topography is higher than the final design surface, and some places where it is lower. If the location is high, that part needs to be cut, and if the location is low, that part needs to be filled. Figure 5 shows a map generated by calculating the amount of cut and fill for the current topography based on the final design surface. Figure 5 shows the cut amount, fill amount, overfill amount, overcut amount, and cut / fill amount difference (cut amount - fill amount) for each area including each point on the construction site. When searching for a route, the above map is used to calculate the cost of each route. Note that the map is not generated during the route design process, but may be generated before the route design process and stored in the storage unit 3 in advance.
[0020] 3, once the map is generated in step S104, the route search unit 25 of the control unit 2 executes a route search process to determine the optimal route (step S105). Once the optimal route is determined, the process ends.
[0021] Next, the route search process will be described in detail. Fig. 6 is a flowchart showing the road route determination process executed by the route search unit 25. As shown in Fig. 6, in step S201, the route search unit 25 selects candidate routes from the road start point to the road end point based on the topographical data. The route search unit 25 first determines each of a plurality of nodes present within a predetermined distance from the road start point as a candidate for the first point (n = 1) through which the road passes, and selects a plurality of routes from the road start point to each of these plurality of nodes as candidate routes to the first point (n = 1).
[0022] Here, the selection of multiple node candidates within a predetermined distance when selecting a route candidate will be described with reference to Figures 7A and 7B. Figures 7A and 7B show multiple nodes arranged in three dimensions on a topographical map of the construction site, with Figure 7A showing an x-y plan view of the construction site from above, and Figure 7B showing a cross-sectional view of the construction site in the z-axis direction, which is the elevation direction. As shown in Figure 7B, multiple levels of nodes are arranged in the height direction at positions with the same longitude and latitude. Now, assume that a route to the node at point n has been determined, and node candidates are selected to determine the route continuing from the node at point n. In Figure 7A, a circle with a radius a is drawn in the x-y plane, centered on the node at point n. Of the nodes within this radius a, nodes within a semicircle that extends 180 degrees in the positive direction of the x-axis are selected as node candidates. In the figure, nodes marked with diagonal lines are node candidates that satisfy the above conditions. Furthermore, in Figure 7B, a circle with a radius a is drawn in the height (z) direction, centered on the node at point n. Of the nodes within this radius a, those that are within a semicircle that is 180 degrees in the positive direction of the x-axis and that are within the range of the maximum allowable gradient are selected as node candidates. Here, the maximum allowable gradient refers to the maximum gradient angle that can be tolerated for the gradient of a road extending from the node at point n, and includes both the maximum allowable gradient for uphill and downhill gradients. In the figure, the shaded nodes are node candidates that satisfy the above conditions. That is, among the sphere of radius a centered on the node at point n, those that are within the hemispherical circle of the search progression method and that are within the range of the maximum allowable gradient are selected as node candidates. For the selected node candidates, the route search process from step S202 onwards is executed.
[0023] In step S202, the route search unit 25 calculates an evaluation function for each of the multiple candidates from the soil volume data obtained from the map in FIG. 5. If multiple nodes exist in the z-axis direction, which is the height direction, the map in FIG. 5 exists for each height. The evaluation function is a cost function in the A* algorithm and is expressed by the following equation (1): f(n) = g(n) + h(n) (1) g(n) is the cost from the start point to point n and is an earth volume function indicating the amount of cut or fill soil. h(n) is the expected cost from point n to the end point and is a distance function indicating the remaining distance to the end point of the road. Since g(n) and h(n) are parameters with units different from soil volume and distance, they are normalized. Normalization allows the fluctuation ranges of g(n) and h(n) in the road route evaluation process to be approximately the same. Since the weights of the normalized g(n) and h(n) are approximately the same, the evaluation function f(n) can be expressed as in equation (1). The normalization makes the construction volume function g(n) and the distance function h(n) dimensionless, and therefore the evaluation function f(n) is a dimensionless quantity.
[0024] Specifically, g(n) is expressed by the following equation (2): g(n)=V (切土量) / V (全切土量) +V (盛土量) / V (全盛土量) +V (オーバフィル量) / V (全オーバフィル量) +V (オーバカット量) / V (全オーバカット量) +V (切盛土量差分) / V (全切盛土量差分) (2) V (切土量) is the amount of excavation required to level the current topography at that node to the road surface. (全切土量) is the predicted amount of excavation required to level the current terrain to the road surface on the shortest route from the start point to the end point. (盛土量) is the amount of earth that needs to be filled to level the current topography to the road surface. (全盛土量) is the predicted amount of embankment required to level the current terrain to the road surface on the shortest route from the start point to the end point. (オーバフィル量) is the overfill volume, which is the volume of earth that needs to be filled from the final design surface to form a road at point n.(全オーバフィル量) is the predicted value of the overfill volume, which is the volume of earth that is required to fill up from the final design surface to form the road on the shortest route from the start point to the end point. (オーバカット量) is the overcut amount, which is the amount of excavation required in the opposite direction from the current topography to the final design surface in order to form a road at point n. (全オーバカット量) is the predicted value of the overcut amount, which is the amount of excavation required in the direction opposite to the direction from the current topography to the final design surface in order to form a road on the shortest route from the start point to the end point. (切盛土量差分) is the difference between the amount of cutting and the amount of filling required to level the road surface from the current topography. (全切盛土量) is the predicted difference between the amount of cut and the amount of fill required to level the current terrain to the road surface on the shortest route from the start point to the end point.
[0025] The distance function h(n) is expressed by the following equation (3): h(n)=L (終了点までの距離実績) / L (全距離) (3) L (終了点までの距離実績) is the remaining distance, which is the shortest distance from point n to the end point. (全距離) is the shortest distance from the start point to the end point of the road.
[0026] In step S203, the route search unit 25 determines the road route to point n as the one that minimizes the evaluation function f(n) from among the multiple candidates.
[0027] In step S204, the route search unit 25 determines whether the node determined after route determination is an end point, i.e., whether the route has reached the end point. If the node at the end of the determined route is not the end point (step S204: No), the process returns to step S201, where the route search unit 25 determines a subsequent road route. If the determined node is the end point (step S204: Yes), the route search unit 25 determines the route to the determined node as the road route (step S205), and ends the road route determination process. In other words, the route search unit 25 repeats determining the road route until it reaches the road end point.
[0028] Next, a specific example of a route search method by the route search unit 25 will be described. Below, for simplicity of explanation, a case will be described in which node candidates are selected only in the x-y direction without consideration of the height (z-axis) direction, and the candidate radius a is set to a radius that includes only nodes adjacent to the node at point n. Figures 8A to 8F are diagrams showing a specific example of a route search method. As shown in Figure 8A, in the initial state, route determination has not yet begun, so the construction earthwork volume function g(n) = 0.
[0029] Next, the route search unit 25 selects the node candidate N i,j as the node candidate N i,j on the first route from the starting point. 1,3 , N 2,3 , N 2,4 and calculates the evaluation function f(n) for each. As described above, the method of determining the candidates is to select a road route that minimizes the sum of the construction earthwork volume function consisting of the cut earthwork volume, fill earthwork volume, overfill earthwork volume, overcut earthwork volume, and cut and fill earthwork volume difference required for road construction, and the distance function indicating the remaining distance to the end point. For example, referring to FIG. 5, the node candidate N is selected as the cut earthwork volume, fill earthwork volume, overfill earthwork volume, overcut earthwork volume, and cut and fill earthwork volume difference. 1,3 Then, the construction earthwork volume function g(1) = g1(1) + g2(1) + g3(1) + g4(1) + g5(1) = 4.6 / 54.1 + 6.7 / 49.6 + 0 / 3.2 + 2.5 / 16.7 + 2.1 / 41.7 = 0.42, and h(1) = 5.4 / 7.2 = 0.75. Node candidate N 2,3 Then, the construction earthwork volume function g(1) = g1(1) + g2(1) + g3(1) + g4(1) + g5(1) = 13.9 / 54.1 + 5.2 / 49.6 + 0 / 3.2 + 7.2 / 16.7 + 8.7 / 41.7 = 1.01, and h(1) = 4.5 / 7.2 = 0.63. Node candidate N 2,4 Then, the construction earth volume function g(1) = g1(1) + g2(1) + g3(1) + g4(1) + g5(1) = 2.7 / 54.1 + 13.7 / 49.6 + 0.5 / 3.2 + 0 / 16.7 + 11 / 41.7 = 0.75, and h(1) = 5 / 7.2 = 0.69. Therefore, regarding the construction earth volume, the node candidate N 1,3 On the other hand, the remaining distance is the smallest. 2,3is the smallest. Also, the node candidate N 1,3 In this case, the evaluation function f(1) is 1.17, and the node candidate N 2,3 In this case, the evaluation function f(1) is 1.64, and the node candidate N 2,4 In this case, the evaluation function f(1) is 1.44. Therefore, the path search unit 25 selects the node candidate N with the smallest evaluation function f(1) among the node candidates. 1,3 The route to the first point (n=1) is determined as the route to the determined node N. 1,3 Since is not the end point, then, node N 1,3 A path extending from the point n to the second point (n=2) is searched for.
[0030] As shown in FIG. 8B, the route search unit 25 selects node candidate N as a node candidate on the route to the second point (n=2). 1,2 , N 2,2 , N 2,3 and calculate the evaluation function f(n) for each node candidate N 1,2 Then, the construction earthwork volume function g(2) = g1(2) + g2(2) + g3(2) + g4(2) + g5(2) + g(1) = 5.3 / 54.1 + 2.7 / 49.6 + 1.5 / 3.2 + 0 / 16.7 + 2.6 / 41.7 + 0.42 = 1.1, and h(2) = 5.1 / 7.2 = 0.71. Node candidate N 2,2 Then, the construction earthwork volume function g(2) = g1(2) + g2(2) + g3(2) + g4(2) + g5(2) + g(1) = 9.3 / 54.1 + 6.4 / 49.6 + 0.7 / 3.2 + 0 / 16.7 + 2.9 / 41.7 + 0.42 = 1.01, and h(2) = 4.1 / 7.2 = 0.57. Node candidate N 2,3 Then, the construction earthwork volume function g(2) = g1(2) + g2(2) + g3(2) + g4(2) + g5(2) + g(1) = 13.9 / 54.1 + 5.2 / 49.6 + 0 / 3.2 + 7.2 / 16.7 + 8.7 / 41.7 + 0.42 = 1.42, and h(2) = 4.5 / 7.2 = 0.63. Therefore, regarding the construction earthwork volume, the node candidate N 2,2 On the other hand, the remaining distance is the smallest. 2,2 is the smallest. Also, the node candidate N 1,2 In this case, the evaluation function f(2) is 1.81, and the node candidate N2,2 In this case, the evaluation function f(2) is 1.58, and the node candidate N 2,3 In this case, the evaluation function f(2) is 2.05. Therefore, the path search unit 25 selects the node candidate N with the smallest evaluation function f(2) among the candidates. 2,2 The route to the second point (n=2) is determined as the route to the determined node N. 2,2 Since is not the end point, then, node N 2,2 A path extending from the point to the third point (n=3) is searched for.
[0031] As shown in FIG. 8C, the route search unit 25 selects a node candidate N as a route candidate to the third point (n=3). 2,1 , node candidate N 3,1 , node candidate N 3,2 , node candidate N 3,3 and calculate the evaluation function f(n) for each node candidate N 2,1 In this case, the construction earthwork volume function g(3) = 1.71, h(3) = 4 / 7.2 = 0.56. 3,1 In this case, the construction earthwork volume function g(3) = 1.63, h(3) = 3 / 7.2 = 0.42. 3,2 In this case, the construction earthwork volume function g(3) = 1.57, h(3) = 3.2 / 7.2 = 0.44. 3,3 In this case, the construction earthwork volume function g(3) = 2.03, h(3) = 3.6 / 7.2 = 0.5. Therefore, regarding the construction earthwork volume, the node candidate N 3,2 In addition, the remaining distance is the smallest. 3,1 is the smallest. Also, the node candidate N 2,1 In this case, the evaluation function f(3) is 2.27, and the node candidate N 3,1 In this case, the evaluation function f(3) is 2.05, and the node candidate N 3,2 In this case, the evaluation function f(3) is 2.01, and the node candidate N 3,3 In the candidate, the evaluation function f(3) is 2.53. Therefore, the path search unit 25 selects the node candidate N with the smallest evaluation function f(3) among the candidates. 3,2 The route to the third point (n=3) is determined as the route to the determined node N. 3,2Since is not the end point, then, node N 3,2 A path extending from to the fourth point (n=4) is searched for.
[0032] As shown in FIG. 8D, the route search unit 25 selects a node candidate N as a route candidate to the fourth point (n=4). 3,1 , node candidate N 4,1 , node candidate N 4,2 , node candidate N 4,3 , node candidate N 3,3 and calculate the evaluation function f(n) for each node candidate N 3,1 In this case, the construction earthwork volume function g(4) = 2.20, h(4) = 3 / 7.2 = 0.42. 4,1 In this case, the construction earthwork volume function g(4) = 2.17, h(4) = 2 / 7.2 = 0.28. 4,2 In this case, the construction earthwork volume function g(4) = 2.23, h(4) = 2.2 / 7.2 = 0.31. 4,3 In this case, the construction earthwork volume function g(4) = 2.44, h(4) = 2.8 / 7.2 = 0.39. 3,3 In this case, the construction earthwork volume function g(4) = 2.59, h(4) = 3.6 / 7.2 = 0.5. Therefore, regarding the construction earthwork volume, the node candidate N 4,1 In addition, the remaining distance is also the smallest. 4,1 is the smallest. Also, the node candidate N 3,1 In this case, the evaluation function f(4) is 2.62, and the node candidate N 4,1 In this case, the evaluation function f(4) is 2.45, and the node candidate N 4,2 In this case, the evaluation function f(4) is 2.54, and the node candidate N 4,3 In this case, the evaluation function f(4) is 2.83, and the node candidate N 3,3 In this case, the evaluation function f(4) is 3.09. Therefore, the path search unit 25 selects the node candidate N with the smallest evaluation function f(4) among the candidates. 4,1 The route to the fourth point (n=4) is determined as the route to the fourth point (n=4). 4,1 Since is not the end point, then, node N 4,1 A path extending from to the fifth point (n=5) is searched for.
[0033] As shown in FIG. 8E, the route search unit 25 selects a node candidate N as a route candidate to the fifth point (n=5). 5,1 , node candidate N 5,2 , node candidate N 4,2 and calculate the evaluation function f(n) for each node candidate N 5,1 In this case, the construction earthwork volume function g(5) = 2.83, h(5) = 1 / 7.2 = 0.14. 5,2 In this case, the construction earthwork volume function g(5) = 3.06, h(5) = 1.4 / 7.2 = 0.19. 4,2 In this case, the construction earthwork volume function g(5) = 2.83, h(5) = 2.2 / 7.2 = 0.31. Therefore, regarding the construction earthwork volume, the node candidate N 5,1 , node candidate N 4,2 In addition, the remaining distance is the smallest. 5,1 is the smallest. Also, the node candidate N 5,1 In this case, the evaluation function f(5) is 2.97, and the node candidate N 5,2 In this case, the evaluation function f(5) is 3.25, and the node candidate N 4,2 In this case, the evaluation function f(5) is 3.14. Therefore, the path search unit 25 selects the node candidate N with the smallest evaluation function f(5) among the candidates. 5,1 The route to the fifth point (n=5) is determined as the route to the fifth point (n=5). 5,1 Since is not the end point, then, node N 5,1 A path extending from to the sixth point (n=6) is searched for.
[0034] As shown in FIG. 8F, the route search unit 25 selects a node candidate N as a route candidate to the sixth point (n=6). 6,1 , node candidate N 5,2 , node candidate N 6,2 , and calculate the respective evaluation functions f(n). 6,1 In this case, the construction earthwork function g(6) = 3.66, h(6) = 0 / 7.2 = 0. Node candidate N 5,2 In this case, the construction earthwork volume function g(6) = 3.72, h(6) = 1.4 / 7.2 = 0.19. 6,2In this case, the construction earthwork volume function g(6) = 3.61, h(6) = 1 / 7.2 = 0.14. Therefore, regarding the construction earthwork volume, the node candidate N 6,2 In addition, the remaining distance is the smallest. 6,1 is the smallest. Also, the node candidate N 6,1 In this case, the evaluation function f(6) is 3.66, and the node candidate N 5,2 In this case, the evaluation function f(6) is 3.91, and the node candidate N 6,2 In this case, the evaluation function f(6) is 3.75. Therefore, the path search unit 25 selects the node candidate N with the smallest evaluation function f(6) among the candidates. 6,1 The route to the sixth point (n=6) is determined as the route to the selected node N 6,1 is the same as the end point, the selected route reaches the end point, and the route from the start point to the end point is determined.
[0035] As described above, the route search unit 25 searches for a route from the starting point to node N 1,3 , node N 2,2 , node N 3,2 , node N 4,1 , node N 5,1 Pass through the end node N 6,1 The route to the designated location is determined as the optimum route for the construction road. Note that traceback may be performed in the process of determining the route.
[0036] As described above, according to the construction road route design device of this embodiment, the candidate that minimizes the evaluation function f(n) from among multiple candidates for the road route is determined as the road route by the route search unit 25. Therefore, there is no need to plan the route manually, and it is possible for anyone to plan the optimal route.
[0037] The evaluation function f(n) includes a construction volume function g(n), which indicates the volume of earthwork required to construct the road, and a distance function h(n), which indicates the remaining distance to the end point. This allows the shortest road route to be determined using a small volume of earthwork. Furthermore, the construction volume parameters include the volume of cut earth, the volume of fill earth, the volume of overfill earth, the volume of overcut earth, and the difference between the volume of cut and fill earth. The system automatically derives a road route that achieves a balanced implementation of these parameters.
[0038] Second Embodiment In the above embodiment, the case where a road has two ends, a road start point and a road end point, has been described. In contrast to this, a method for determining the most appropriate branch point when a road has three or more ends, i.e., when a road has a branch point, will be described.
[0039] Next, a specific example of a branch point determination method by the route search unit 25 will be described. FIGS. 9A to 9C are diagrams showing a specific example of a branch point determination method. In this example, an example will be described in which there are three road edges and one branch point. As shown in FIG. 9A, road edges 1, 2, and 3 are set as on-site road edges at the three corners of the construction area. Once the road edges are set, a search algorithm to each road edge is executed using each grid point, or node, within the construction area as a branch point candidate to determine the optimal route. The search algorithm utilizes the evaluation function f(n) used in the above-described embodiment. In the initial state when route search begins from each branch point candidate, route determination has not yet begun, so the construction earthwork volume function g(n) = 0.
[0040] First, the route search unit 25 selects branch point 1 as the first branch point candidate, and determines the road route for which the evaluation function f(n) is minimum for the optimal route from branch point 1 to road edge 1. The route search unit 25 also determines the road route for which the evaluation function f(n) is minimum for the optimal route from branch point 1 to road edge 2 and the optimal route to road edge 3. FIG. 9A shows the determined routes from branch point 1 to road edge 1, road edge 2, and road edge 3, and the calculated value of the evaluation function f(n). The calculated cost from branch point 1 to road edge 1 is f 1-1 (n) = 2.01, and the cost from the branch point 1 to the road end 2 is f1-2 (n) = 3.66, and the cost from the branch point 1 to the road end 3 is f 1-3 (n) = 2.97. Therefore, the cost of the road route connecting road ends 1, 2, and 3 when the branch point is branch point 1 is f 1 (n) = f 1-1 (n) + f 1-2 (n) + f 1-3 (n) = 2.01 + 3.66 + 2.97 = 8.64.
[0041] Next, the route search unit 25 selects the branch point 2 as the second branch point candidate, and determines the road route for which the evaluation function f(n) is smallest for the optimal route from the branch point 2 to the road ends 1, 2, and 3. FIG. 9B shows the determined route from the branch point 2 to the road end 1, road end 2, and road end 3, and the calculated value of the evaluation function f(n). The calculated cost from the branch point 2 to the road end 1 is f 2-1 (n) = 1.58, and the cost from the branch point 2 to the road end 2 is f 2-2 (n) = 3.15, and the cost from the branch point 2 to the road end 3 is f 2-3 (n) = 2.88. Therefore, the cost of the road route connecting road ends 1, 2, and 3 when the branch point is branch point 2 is f 2 (n) = f 2-1 (n) + f 2-2 (n) + f 2-3 (n) = 1.58 + 3.15 + 2.88 = 7.61.
[0042] Next, as shown in FIG. 9C, the remaining nodes are branch points 3 to n, and optimal routes connecting road ends 1, 2, and 3 and costs are sequentially calculated for branch points 3 to n in the same manner as above.
[0043] When the optimal route and cost are calculated up to the branch point n, the calculated cost f 1 (n) to f n The route connecting road ends 1, 2, and 3 that passes through the optimal branch point has already been determined, so this route is adopted as the optimal route.
[0044] In the above example, there are three road edges, but the number of road edges may be four or more. In this case, the calculation of the optimal route from the branch point candidate to each road edge increases only by the number of added road edges, and the calculation of the optimal branch point and the route passing through the optimal branch point is the same as above.
[0045] In the above embodiment, the case where there is one branch point has been described. In contrast to this, in this embodiment, a case where an additional branch point is added to set multiple branch points will be described, and the optimal branch point location and a route passing through the multiple optimal branch points will be determined.
[0046] FIG. 10 illustrates the process of determining an additional branch point. The route search unit 25 selects two adjacent road edges (step S301). The route search unit 25 determines whether an additional branch point needs to be set in the area between the selected two adjacent road edges and the generated branch point (step S302). As an example, FIGS. 11A to 11C and 12A to 12D illustrate an example of the process of determining an additional branch point when three road edges, road edge 1, road edge 2, and road edge 3, are set and branch point 1 has already been set as a branch point. FIG. 11A illustrates a topographical map showing a route including three road edges and branch point 1, where road edge 1 and road edge 2, road edge 2 and road edge 3, and road edge 3 and road edge 1 are adjacent to each other. Assume that road edge 1 and road edge 2 are selected in step S301. As shown in FIG. 11B , the route search unit 25 draws a line around the area between road edge 1, road edge 2, and the generated branch point 1, displays the topographical map shown in FIG. 11B on the display unit 46, and also displays a message on the display unit 46 instructing the user to select whether or not an additional branch point is required within the enclosed area. In response to this, the user operates the operation unit 45 to input whether or not an additional branch point is required, and the route search unit 25 makes a determination in step S302. If an additional branch point is required (step S302: Yes), the route search unit 25 executes the branch point search algorithm described above to search for the additional branch point (step S303). In the example of FIG. 11B , the route search unit 25 calculates the optimal route and cost to road edge 1, the optimal route and cost to road edge 2, and the optimal route and cost to branch point 1, with each node within the enclosed area considered to be an additional branch point candidate, and then adds up these costs to determine the cost of each additional branch point candidate. The costs of each additional branch point candidate are compared, and the branch point candidate with the smallest cost is determined as the additional branch point (step S304). Figure 11C shows the determined additional branch point and the route from the additional branch point.Once the additional branch point is determined, the route search unit 25 inquires of the user as to whether or not an additional branch point is necessary by displaying the inquiry on the display unit 46. In response to this, the user inputs whether or not an additional branch point is necessary through the operation unit 45, and the route search unit 25 determines whether or not an additional branch point is necessary (step S305). If the route search unit 25 determines that an additional branch point is necessary (step S305: Yes), the process returns to step S303, where a search for an additional branch point is performed. If the route search unit 25 determines that an additional branch point is not necessary (step S305: No), the process proceeds to step S306. Similarly, if the route search unit 25 determines that an additional branch point is not necessary in step S302 (step S302: No), the process also proceeds to step S306.
[0047] In step S306, the route search unit 25 determines whether or not there are two other adjacent road edges. In the example of Fig. 10, in the previous step, it was determined whether or not an additional branch point is required for road edge 1 and road edge 2, which are two adjacent road edges. However, there are other combinations of road edge 2 and road edge 3, and road edge 3 and road edge 1, which are two adjacent road edges. Therefore, the route search unit 25 determines that there are two other adjacent road edges (step S306: Yes) and selects, for example, road edge 2 and road edge 3 as the other two adjacent road edges (step S307). After the other two adjacent road edges have been selected, the process returns to step S302, where it determines whether or not an additional branch point is required in the area between the new two road edges and the branch point. As shown in FIG. 12A , the route search unit 25 draws a line around the area between road edge 2, road edge 3, and branch point 1, displays the line on the display unit 46, and queries the user about whether an additional branch point is required within the circled area, thereby making a determination in step S302. If an additional branch point is required (step S302: Yes), the route search unit 25 searches for the additional branch point (step S303). As shown in FIG. 12B , the determined additional branch point and the route from the additional branch point are displayed (step S304). After the additional branch point is determined, the route search unit 25 determines whether or not a further additional branch point is required (step S305). If the route search unit 25 determines that a further additional branch point is required (step S305: Yes), the process returns to step S303 and searches for the additional branch point. If the route search unit 25 determines that a further additional branch point is not required (step S305: No), the process proceeds to step S306. Furthermore, if it is determined in step S302 that no additional branch points are required within the enclosed area (step S302: No), the process also proceeds to step S306.
[0048] 12A and 12B , since there is another pair of adjacent road edges, road edge 3 and road edge 1, the route search unit 25 determines that there are two other adjacent road edges (step S306: Yes), selects road edge 2 and road edge 3 (step S307), and returns to step S302 to determine whether an additional branch point is required in the area between the new two road edges and the branch point. As shown in FIG. 12C , the route search unit 25 surrounds the area between road edge 2, road edge 3, and branch point 1 with a line, displays it on the display unit 46, and queries the user about whether an additional branch point is required within the surrounded area, thereby making the determination in step S302. If an additional branch point is required (step S302: Yes), the route search unit 25 searches for the additional branch point (step S303). As shown in FIG. 12D , the determined additional branch point and a route from the additional branch point are displayed (step S304). When the additional branch point is determined, the route search unit 25 determines whether or not a further additional branch point is required (step S305). If it determines that a further additional branch point is required (step S305: Yes), the process returns to step S303 to search for the further additional branch point. If it determines that a further additional branch point is not required (step S305: No), the process proceeds to step S306. Similarly, if it determines in step S302 that no further branch point is required within the enclosed area (step S302: No), the process proceeds to step S306.
[0049] In step S306, if there are no other two adjacent road edges (step S306: No), the route search unit 25 ends the process. In the examples of Figures 11A to 11C and 12A to 12D, there are no other two adjacent road edges, so the process ends.
[0050] In the above embodiment, the optimum positions of a plurality of branch points can be determined, and therefore the optimum route can be designed in accordance with the user's wishes.
[0051] In the above embodiment, the nodes are set in two dimensions. That is, only one node is set for a position with the same longitude and latitude. However, nodes may be set in multiple locations in three dimensions. For example, as an example of node placement, as shown in FIG. 13, the nodes can be set in multiple levels in the height direction. This makes it possible to search for an optimal route, including the height direction.
[0052] In the above embodiment, the cut volume, fill volume, overfill volume, overcut volume, cut and fill volume difference, and route length are used as items for cost calculation, but items other than these can also be added. For example, items such as slope gradient, boundary conditions of the workable area, and the percentage of road remaining until the end may be added. These items may also be selectively added depending on the construction site. Items, including those used in the above embodiment, may be replaced or deleted as needed. Furthermore, since the impact of some items on costs may differ depending on the item, and since some users may want to place more importance on certain items, each item may be multiplied by an importance coefficient.
[0053] Furthermore, the functions of the construction road route design device 1 can be realized by dedicated hardware or by an ordinary computer system.
[0054] For example, a device that executes the above-described processing can be configured by storing and distributing the program executed by the processor 41 on a non-transitory computer-readable recording medium and installing the program on a computer. Examples of such recording media include flexible disks, CD-ROMs (Compact Disc Read-Only Memory), DVDs (Digital Versatile Discs), and MOs (Magneto-Optical Discs).
[0055] Alternatively, the program may be stored in a disk device of a server device on a communication network such as the Internet, and may be downloaded to a computer by superimposing the program on a carrier wave, for example.
[0056] The above process can also be achieved by starting and executing the program while transferring it via a communication network.
[0057] Furthermore, the above-described processing can also be achieved by executing all or part of the program on a server device, and executing the program while the computer sends and receives information about the processing via a communications network.
[0058] In addition, when the above-mentioned functions are shared and realized by the OS (Operating System) or by the OS working together with an application, only the parts other than the OS may be stored on a medium and distributed, or may be downloaded to a computer.
[0059] Furthermore, the means for realizing the functions of the construction road route design device 1 is not limited to software, and some or all of the functions may be realized by dedicated hardware including circuits.
[0060] The present invention allows various embodiments and modifications without departing from the broad spirit and scope of the present invention. Furthermore, the above-described embodiments are intended to illustrate the present invention and do not limit the scope of the present invention. In other words, the scope of the present invention is defined by the claims, not the embodiments. Various modifications made within the scope of the claims and within the meaning of the disclosure equivalent thereto are considered to be within the scope of the present invention.
[0061] The present invention can be widely applied to road route design devices that design road routes.
[0062] 1 Construction road route design device, 2 Control unit, 3 Memory unit, 21 Current terrain data acquisition unit, 22 Design terrain data acquisition unit, 23 Road edge acquisition unit, 24 Map generation unit, 25 Route search unit, 31 Terrain DB, 32 Design DB, 33 Map memory unit, 41 Processor, 42 Main memory unit, 43 Auxiliary memory unit, 44 Input / output unit, 45 Operation unit, 46 Display unit, 47 Communication unit, 241 Cut volume calculation unit, 242 Fill volume calculation unit, 243 Overfill volume calculation unit, 244 Overcut volume calculation unit, 245 Cut and fill volume calculation unit, 246 Remaining distance calculation unit.
Claims
1. An earthwork road route design device comprising: a current terrain data acquisition unit that acquires terrain data indicating the current terrain of the construction site; a designed terrain data acquisition unit that acquires terrain data indicating the designed terrain of the construction site; a road end acquisition unit that acquires two or more road ends that are the starting point and the ending point of the construction road; and a route search unit that searches for a route between the plurality of road ends, wherein the route search unit selects nodes existing between the plurality of road ends, and for a plurality of routes leading to the plurality of road ends via the selected nodes, obtains a cost based on the earthwork volume of the construction road from the terrain data of the current terrain and the designed terrain, and selects a route with the minimum obtained cost.
2. The earthwork road route design device according to claim 1, wherein the route search unit obtains a cost based on the earthwork volume of the construction road for each of between the plurality of adjacent road ends and nodes and between two adjacent nodes in the routes, and selects a route with the minimum sum of the obtained costs.
3. The earthwork road route design device according to claim 1, wherein the route search unit obtains a cost based on the earthwork volume of the construction road and a cost based on the remaining distance to the ending point for each of between the plurality of adjacent road ends and nodes and between two adjacent nodes in the routes, and selects a route with the minimum sum of the cost based on the earthwork volume of the construction road and the cost based on the remaining distance to the ending point.
4. The earthwork road route design device according to any one of claims 1 to 3, wherein the earthwork volume includes the amount of cut soil and the amount of filled soil.
5. The earthwork road route design device according to claim 4, wherein the earthwork volume further includes the amount of overfill and the amount of overcut.
6. The earthwork road route design device according to claim 4, wherein the earthwork volume further includes the difference between the amount of cut soil and the amount of filled soil.
7. When the road end acquisition unit acquires three or more road ends as the plurality of road ends, the route search unit obtains a cost based on the earthwork volume of the construction road between a branch point leading to each of the plurality of road ends and each of the plurality of road ends from the branch point, and selects the branch point and the route passing through the branch point with the minimum sum of the obtained costs. The earthwork road route design device according to claim 1.
8. When the route search unit determines that an additional branch point is necessary, it obtains the cost based on the construction earthwork volume of the construction road between each of the two adjacent road ends among the plurality of road ends and the branch point and the additional branch point to each of the two adjacent road ends, and between the additional branch point and the branch point, and selects the additional branch point and the route passing through the additional branch point where the sum of the obtained costs is minimized. The construction road route design device according to claim 7.
9. A construction road route design method comprising: a step of obtaining terrain data indicating the actual terrain of the construction site; a step of obtaining terrain data indicating the designed terrain of the construction site; a step of obtaining two or more road ends that are the start point and the end point of the construction road; a step of selecting a node existing between the plurality of road ends, and obtaining, from the terrain data of the actual terrain and the designed terrain, the cost based on the construction earthwork volume of the construction road for a plurality of routes leading to the plurality of road ends via the selected node, and selecting the route with the minimum obtained cost to search for a route between the plurality of road ends.
10. A program for causing a computer to execute: a step of obtaining terrain data indicating the actual terrain of the construction site; a step of obtaining terrain data indicating the designed terrain of the construction site; a step of obtaining two or more road ends that are the start point and the end point of the construction road; a step of selecting a node existing between the plurality of road ends, and obtaining, from the terrain data of the actual terrain and the designed terrain, the cost based on the construction earthwork volume of the construction road for a plurality of routes leading to the plurality of road ends via the selected node, and selecting the route with the minimum obtained cost to search for a route between the plurality of road ends.
