Method and device for planning touring route

Abstract

The invention provides a touring route planning method and device, and belongs to the technical field of route planning, and the method comprises the steps: 1, constructing a GIS map of an amusement place, and marking entrances and exits, intersections and amusement points as point locations with unique identifiers; 2, connecting the point locations to generate directed paths, wherein the directed paths comprise a one-way path and a two-way path; 3, calculating a shortest path between any two point locations by adopting a Floyd algorithm, and generating a shortest path set RS; and 4, receiving a starting point, an ending point and a traversal point position set input by the user, and generating a planning route through an optimal path point bridging and correction algorithm. According to the touring route planning method and device provided by the invention, the touring route which covers all specified point locations, is shortest in path and minimum in repetition and adapts to dynamic requirements can be quickly generated.

Description

Technical Field

[0001] The present invention relates to the technical field of path planning, and in particular to a tour route planning method and device. Background Art

[0002] Nowadays, more and more people take their families to amusement parks in their spare time.

[0003] Amusement parks, such as scenic spots and playgrounds, are often built near mountains and rivers, or with tall buildings. This determines the complexity of their route construction planning. In addition, there are many attractions in the venues, so it is often difficult for tourists to reasonably plan their own routes.

[0004] How to formulate appropriate tour routes based on the personalized needs of tourists is an urgent problem that needs to be solved. Summary of the Invention

[0005] The present invention provides a tour route planning method and device to solve the defects of the existing technology, such as the inability to efficiently plan the optimal path containing multiple necessary points, high computational complexity, path redundancy and insufficient practicality, and to quickly generate a tour route that covers all designated points, has the shortest path, minimizes repetitions and adapts to dynamic needs.

[0006] In a first aspect, the present invention provides a tour route planning method, comprising:

[0007] Step 1: Build a GIS map of the amusement park and mark the entrances, exits, intersections, and attractions as uniquely identified points;

[0008] Step 2: Connect each point to generate a directed path, which includes a unidirectional path and a bidirectional path;

[0009] Step 3: Use the Floyd algorithm to calculate the shortest path between any two points and generate the shortest path set RS;

[0010] Step 4: Receive the user's input of the starting point, end point, and traversal point set, and generate a planned route through the optimal path point bridging and correction algorithm, specifically including:

[0011] Step 401: Extract the shortest route R from the start point to the end point from the shortest route set RS. In the traversal point set, the points included in the waypoints of route R are traversed points, recorded as point set S1, and the points not included in the waypoints of route R are untraversed points, recorded as point set S2.

[0012] Step 402: Traverse all pairs of points in the set S2 to form a shortest path set RSTemp, and select the shortest path with the highest effective path rate and the lowest repeated path rate from the set RSTemp as the path to be bridged RT;

[0013] Step 403: Traverse all adjacent point pairs (P i ,P j ), where (P i ,P j ) does not include points that the user does not require to be traversed, and performs the following operations:

[0014] Insert the path RT to be bridged into point P i With point P j Generate candidate routes between them;

[0015] Calculate the optimization evaluation value of the candidate route according to the preset path optimization rules;

[0016] The adjacent point pair with the best optimization evaluation value is selected as the optimal bridge point pair, and a new route R is generated by inserting RT update, and it is iterated until all traversal points are covered;

[0017] Step 404: Perform duplicate path correction on the final generated route to remove directly repeated and indirectly repeated redundant sections.

[0018] A tour route planning method provided by the present invention further includes: superimposing the planned route on the GIS map for visual display.

[0019] A tour route planning method provided by the present invention further includes: differentially adjusting the path length based on the actual terrain.

[0020] According to a tour route planning method provided by the present invention, the calculation method of the repeated path rate K and the effective path rate V of each route in the set RSTemp is:

[0021] Effective route rate V = (route route points ∩ set S2) / route route points

[0022] Repeated path rate K = (route path points ∩ set S1) / number of route path points.

[0023] According to a tour route planning method provided by the present invention, an optimization evaluation value of a candidate route is calculated according to a preset path optimization rule, and an adjacent point pair with the best optimization evaluation value is selected as the optimal bridging point pair. Specifically, the difference between the total length of the candidate route and the total length of the original route R is calculated as the length increment; and the adjacent point pair with the smallest length increment is selected as the optimal bridging point pair.

[0024] According to the present invention, a tour route planning method is provided, which eliminates directly repeated redundant road sections, including: if a closed-loop sub-path consisting of at least two identical points X exists in the path, all intermediate nodes between the first repeated point X and the last repeated point X in the closed loop are deleted, and the last repeated point X and its subsequent path are retained.

[0025] According to the present invention, a tour route planning method is provided, which eliminates indirectly repeated redundant road sections, including: if there are at least three identical points X in a path, and the subpath between the first two points X is repeated after the subsequent point X, then all intermediate nodes between the first repeated point X and the second repeated point X are deleted, and the last repeated point X and its subsequent path are retained.

[0026] In a second aspect, the present invention further provides a tour route planning device, comprising:

[0027] The first processing module is used to construct a GIS map of the amusement park, marking the entrances, exits, intersections and attractions as points with unique identifiers;

[0028] The second processing module is used to connect the points to generate a directed path, wherein the directed path includes a unidirectional path and a bidirectional path;

[0029] The third processing module is used to calculate the shortest path between any two points using the Floyd algorithm to generate a shortest path set RS;

[0030] The fourth processing module is used to receive the starting point, end point, and traversal point set input by the user, and generate a planned route through the optimal waypoint bridging and correction algorithm, specifically including:

[0031] Extract the shortest route R from the starting point to the end point from the shortest route set RS. In the traversal point set, the points included in the waypoints of route R are traversed points, recorded as point set S1, and the points not included in the waypoints of route R are untraversed points, recorded as point set S2;

[0032] Traverse all the points in the set S2 that are combined with each other to form the shortest path set RSTemp. From the set RSTemp, select the shortest path with the highest effective path rate and the lowest repeated path rate as the path to be bridged RT.

[0033] Traverse all adjacent point pairs (P i ,P j ), do the following:

[0034] Insert the path RT to be bridged into point P i With point P j Generate candidate routes between them;

[0035] Calculate the optimization evaluation value of the candidate route according to the preset path optimization rules;

[0036] The adjacent point pair with the best optimization evaluation value is selected as the optimal bridge point pair, and a new route R is generated by inserting RT update, and it is iterated until all traversal points are covered;

[0037] The final generated route is corrected for duplicate paths to remove directly and indirectly repeated redundant sections.

[0038] In a third aspect, the present invention provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of any of the above-described tour route planning methods are implemented.

[0039] In a fourth aspect, the present invention further provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any of the above-described tour route planning methods.

[0040] The tour route planning method and device provided by the present invention have the following beneficial effects:

[0041] (1) The present invention can quickly generate a tour route that covers all designated points, has the shortest path, the least repetition, and adapts to dynamic needs.

[0042] (2) The present invention can generate an online map based on GIS, mark all tourist spots and intersections as points, connect the connected points to form directed paths, calculate the length of each path, and form basic geographic data.

[0043] (3) The present invention is compatible with opposite asymmetric paths generated based on terrain, which is more suitable for actual scenarios.

[0044] (4) The present invention provides an optimal waypoint bridging and correction algorithm based on the shortest path, which can plan at an extremely fast speed to meet the needs of users to visit some or all of the tourist spots in the venue using the shortest path. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction is given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0046] Figure 1 It is a flowchart of the tour route planning method provided by the present invention;

[0047] Figure 2 This is a schematic diagram of a marked map provided by the present invention;

[0048] Figure 3 It is a schematic diagram of the path basic data provided by the present invention;

[0049] Figure 4 It is a schematic diagram of the shortest route provided by the present invention;

[0050] Figure 5 Schematic diagram of the flow of the optimal path point bridging and correction algorithm provided by the present invention;

[0051] Figure 6 This is a schematic diagram of the route planning result provided by the present invention;

[0052] Figure 7 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0053] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0054] It should be noted that in the description of the embodiments of the present invention, the terms "comprise," "include," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, article, or apparatus comprising a series of elements includes not only those elements but also other elements not explicitly listed, or elements inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprises a..." does not preclude the presence of additional identical elements in the process, method, article, or apparatus comprising the element. Terms such as "upper" and "lower" indicate positions or location relationships based on those shown in the accompanying drawings and are intended solely for ease of description and simplification of the present invention. They are not intended to indicate or imply that the device or element referred to must have a specific orientation, be constructed, or operate in a specific orientation, and are therefore not to be construed as limiting the present invention. Unless otherwise expressly specified or limited, the terms "mounted," "connected," and "connected" should be broadly construed, for example, to mean a fixed connection, a detachable connection, or an integral connection; a mechanical connection or an electrical connection; a direct connection or an indirect connection through an intermediate medium; or internal communication between two elements. For those skilled in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0055] The terms "first," "second," and the like in this application are used to distinguish similar objects, and are not used to describe a particular order or precedence. It should be understood that the terms used in this manner are interchangeable where appropriate, so that the embodiments of this application can be implemented in orders other than those illustrated or described herein. Furthermore, the objects distinguished by "first," "second," and the like generally refer to a class of objects and do not limit the number of objects. For example, the first object may be one or more.

[0056] The following combination Figure 1-Figure 7 The tour route planning method and device provided by the embodiments of the present invention are described.

[0057] Figure 1 It is a flow chart of the tour route planning method provided by the present invention, such as Figure 1 As shown, including but not limited to the following steps:

[0058] Step 1: Build a GIS map of the amusement park and mark the entrances, exits, intersections, and attractions as uniquely identified points;

[0059] Step 2: Connect each point to generate a directed path, which includes a unidirectional path and a bidirectional path;

[0060] Step 3: Use the Floyd algorithm to calculate the shortest path between any two points and generate the shortest path set RS;

[0061] Step 4: Receive the user's input of the starting point, end point, and traversal point set, and generate a planned route through the optimal path point bridging and correction algorithm, specifically including:

[0062] Step 401: Extract the shortest route R from the start point to the end point from the shortest route set RS. In the traversal point set, the points included in the waypoints of route R are traversed points, recorded as point set S1, and the points not included in the waypoints of route R are untraversed points, recorded as point set S2.

[0063] Step 402: Traverse all pairs of points in the set S2 to form a shortest path set RSTemp, and select the shortest path with the highest effective path rate and the lowest repeated path rate from the set RSTemp as the path to be bridged RT;

[0064] Step 403: Traverse all adjacent point pairs (Pi, Pj) in the shortest route R, where (P i ,P j ) does not include points that the user does not require to be traversed, and performs the following operations:

[0065] Insert the path to be bridged RT between point Pi and point Pj to generate a candidate route;

[0066] Calculate the optimization evaluation value of the candidate route according to the preset path optimization rules;

[0067] The adjacent point pair with the best optimization evaluation value is selected as the optimal bridge point pair, and a new route R is generated by inserting RT update, and it is iterated until all traversal points are covered;

[0068] Step 404: Perform duplicate path correction on the final generated route to remove directly repeated and indirectly repeated redundant sections.

[0069] The present invention provides a tour route planning method, which can quickly generate a tour route that covers all designated points, has the shortest path, minimizes repetitions, and adapts to dynamic needs.

[0070] The above technical solution is described below in conjunction with specific embodiments.

[0071] (1) Generate an online map of the amusement park based on aerial topographic maps or by connecting to existing manufacturer map services.

[0072] (2) Mark tourist spots, intersections, and entrances and exits as points.

[0073] Any point is named using a letter + number format, where the letter E represents the entrance and exit, C represents the intersection, P represents the tourist spot, and the number represents the serial number.

[0074] When a certain point is both an intersection and a tourist attraction, the tourist attraction shall prevail.

[0075] (3) Mark the path, calculate the path length, and correct the data.

[0076] Figure 2 This is a schematic diagram of a marked map provided by the present invention, such as Figure 2 As shown, the paths include: one-way paths, where you can only walk in the direction of the arrow; and two-way paths, where you can walk back and forth.

[0077] Calculate the length of each path based on geographic coordinate data.

[0078] Based on the actual terrain, the path length is adjusted differently. For example, the length of the path up and down the mountain is the same, but the physical effort and time consumed are different. Here, the distance data is lengthened or shortened to make it easier to calculate. Figure 2 The path between P9 and P10, and the path between P10 and P11.

[0079] (4) Generate basic path data.

[0080] Each bidirectional arrow generates two paths; each unidirectional arrow generates one path. Figure 3 As shown, Figure 3 It is a schematic diagram of the path basic data provided by the present invention.

[0081] (5) Using the Floyd algorithm, the shortest route between any two points is obtained, a route set RS is formed, and stored.

[0082] Among them, the Floyd algorithm, also known as the insertion point method, is an algorithm that uses the idea of dynamic programming to find the shortest path between multiple source points in a given weighted graph.

[0083] The waypoints are the set of points on the shortest route from the starting point to the end point, including the starting point and the end point, and are composed of several tourist points P, intersections C, and entrances and exits E. Figure 4 As shown, Figure 4 It is a schematic diagram of the shortest route provided by the present invention.

[0084] (6) According to your own needs, input the starting point Start, the end point End, and several other points you want to pass through (recorded as the traversal point set Pass), and use the optimal path point bridging and correction algorithm to obtain the planned route.

[0085] Figure 5 This is a flow chart of the optimal path point bridging and correction algorithm provided by the present invention, see Figure 5 , we can see that the calculation process of the optimal path point bridging and correction algorithm is as follows:

[0086] 1. From the shortest route set RS, find the shortest route between the starting point Start and the end point End (if the starting point is the end point, the waypoint is the end point and the length is 0), and record it as route R.

[0087] 2. In the traversed point set Pass, the points included in the waypoints of route R are traversed points, recorded as point set S1, and the points not included in the waypoints of route R are untraversed points, recorded as point set S2.

[0088] 3. From the untraversed point set S2, randomly select two points, such as X and Y, with X as the starting point and Y as the end point, and obtain the shortest path from X to Y from the shortest path set RS.

[0089] Permutations and Combinations Obtain the shortest paths RTemp(X, Y) between all two points in S2. These shortest paths constitute the set RSTemp.

[0090] Calculate the effective path rate and repeated path rate for each route in RSTemp:

[0091] Effective path rate V = (route path points ∩ untraversed point set S2) / number of route path points, that is, the number of points covering set S2 in each route / total number of path points of each route.

[0092] Repeated path rate K = (route path points ∩ traversed point set S1) / number of route path points, that is, the number of points covering set S1 in each route / the total number of path points of each route.

[0093] 4. Calculate and obtain the route in RSTemp with the highest effective path rate V and the lowest repeated path rate K as the route to be bridged RT.

[0094] 5. Get the waypoints from route R. Before calculation, exclude the points that are not in the traversal point set Pass. Then select two adjacent points in sequence, i.e., adjacent point pairs (P i ,P j ), bridge RT and calculate the length increment.

[0095] The bridging method is: for example, for P1 and P2, cut off all connections between P1 and P2, then connect P1 to the starting point of the route to be bridged RT, and connect P2 to the end point of the route to be bridged RT to form a new route. Calculate the length of the new route (candidate route), subtract the length of R, and get the length increment of P1 and P2 after bridging RT.

[0096] Calculate P1 and P2, P2 and P3 in sequence until the last two adjacent points P n-1 and P n The length increment after bridging RT is to take the two adjacent points with the minimum length increment as the adjacent points for actual bridging, and then bridge them to finally form a new route R.

[0097] 6. Check whether the waypoints of the new route R contain all the traversal points. If so, return. Otherwise, repeat steps 2, 3, 4, and 5 until R contains all the traversal points.

[0098] 7. Correction of route R, eliminating duplicate routes in route R.

[0099] There are two types of repetition.

[0100] Direct repetition: A path between two identical points repeats after the second point. Specifically, if a closed-loop subpath exists consisting of at least two identical points X, all intermediate nodes between the first and last repeated points X in the closed loop are removed, retaining the last repeated point X and its subsequent paths. For example, in ABCABCEF, if the point (BC) between two A's repeats after the second A, the ABC including the first A should be removed to form ABCEF.

[0101] Indirect repetition: A route has three identical points, and the point between the first and second points repeats after the third point. This is an indirect repetition. Specifically, if there are at least three identical points X in a route, and the subpath between the first two points X repeats after the subsequent point X, all intermediate nodes between the first and second repeated points X are deleted, retaining the last repeated point X and its subsequent paths. For example, in ABCAEFABC, the point between the first and second points A (i.e., the intermediate node BC) repeats after the third point A. Therefore, ABC, including the first point A, needs to be removed to form AEFABC.

[0102] (7) Online map display of route planning results.

[0103] I hope to enter the park from E1, exit from E3, and pass through all tourist attractions.

[0104] After calculation, the optimal route planning is obtained:

[0105] E1 to E3, length: 4282, waypoints:

[0106] E1->P1->C1->P18->C1->C2->P2->C5->P3->P4->P5->C8->C9->P6->C9->P7->C9->P8->P9->P10->P11->P12->C11->C10->P 14->P15->P16->P17->C7->C12->P13->C12->C7->P19->P21->C4->P23->C4->C3->P22->C3->C4->P21->P19->P20->C13->E3

[0107] The effect is shown in 6. Figure 6 This is a schematic diagram of the route planning result provided by the present invention.

[0108] On the other hand, the present invention also provides a tour route planning device, comprising:

[0109] The first processing module is used to construct a GIS map of the amusement park, marking the entrances, exits, intersections and attractions as points with unique identifiers;

[0110] The second processing module is used to connect the points to generate a directed path, wherein the directed path includes a unidirectional path and a bidirectional path;

[0111] The third processing module is used to calculate the shortest path between any two points using the Floyd algorithm to generate a shortest path set RS;

[0112] The fourth processing module is used to receive the starting point, end point, and traversal point set input by the user, and generate a planned route through the optimal waypoint bridging and correction algorithm, specifically including:

[0113] Extract the shortest route R from the starting point to the end point from the shortest route set RS. In the traversal point set, the points included in the waypoints of route R are traversed points, recorded as point set S1, and the points not included in the waypoints of route R are untraversed points, recorded as point set S2;

[0114] Traverse all the points in the set S2 that are combined with each other to form the shortest path set RSTemp. From the set RSTemp, select the shortest path with the highest effective path rate and the lowest repeated path rate as the path to be bridged RT.

[0115] Traverse all adjacent point pairs (P i ,P j ), do the following:

[0116] Insert the path RT to be bridged into point P i With point P j Generate candidate routes between them;

[0117] Calculate the optimization evaluation value of the candidate route according to the preset path optimization rules;

[0118] The adjacent point pair with the best optimization evaluation value is selected as the optimal bridge point pair, and a new route R is generated by inserting RT update, and it is iterated until all traversal points are covered;

[0119] The final generated route is corrected for duplicate paths to remove directly and indirectly repeated redundant sections.

[0120] The tour route planning method and device provided by the present invention have the following beneficial effects:

[0121] (1) The present invention can quickly generate a tour route that covers all designated points, has the shortest path, the least repetition, and adapts to dynamic needs.

[0122] (2) The present invention can generate an online map based on GIS, mark all tourist spots and intersections as points, connect the connected points to form directed paths, calculate the length of each path, and form basic geographic data.

[0123] (3) The present invention is compatible with opposite asymmetric paths generated based on terrain, which is more suitable for actual scenarios.

[0124] (4) The present invention provides an optimal waypoint bridging and correction algorithm based on the shortest path, which can plan at an extremely fast speed to meet the needs of users to visit some or all of the tourist spots in the venue using the shortest path.

[0125] It should be noted that the tour route planning device provided in the embodiment of the present invention can execute the tour route planning method described in any of the above embodiments during specific operation, which will not be described in detail in this embodiment.

[0126] Figure 7 Schematic diagram of the structure of the electronic device provided by the present invention, such as Figure 7 As shown, the electronic device may include: a processor 710, a communication interface 720, a memory 730, and a communication bus 740, wherein the processor 710, the communication interface 720, and the memory 730 communicate with each other via the communication bus 740. The processor 710 may call logic instructions in the memory 730 to execute the tour route planning method.

[0127] In addition, the logic instructions in the above-mentioned memory 730 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0128] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the computer program is executed by a processor to execute the tour route planning method provided in the above embodiments.

[0129] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, or of course, by hardware. Based on this understanding, the essence of the above technical solution or the part that contributes to the existing technology can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or certain parts of the embodiments.

[0130] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A tour route planning method, characterized in that: include: Step 1: Build a GIS map of the amusement park and mark the entrances, exits, intersections, and attractions as uniquely identified points; Step 2: Connect each point to generate a directed path, which includes a unidirectional path and a bidirectional path; Step 3: Use the Floyd algorithm to calculate the shortest path between any two points and generate the shortest path set RS; Step 4: Receive the user's input of the starting point, end point, and traversal point set, and generate a planned route through the optimal path point bridging and correction algorithm, specifically including: Step 401: Extract the shortest route R from the start point to the end point from the shortest route set RS. In the traversal point set, the points included in the waypoints of route R are traversed points, recorded as point set S1, and the points not included in the waypoints of route R are untraversed points, recorded as point set S2. Step 402: Traverse all pairs of points in the set S2 to form a shortest path set RSTemp, and select the shortest path with the highest effective path rate and the lowest repeated path rate from the set RSTemp as the path to be bridged RT; Step 403: Traverse all adjacent point pairs (P i ,P j ), where (P i ,P j ) does not include points that the user does not require to be traversed, and performs the following operations: Insert the path RT to be bridged into point P i With point P j Generate candidate routes between them; Calculate the optimization evaluation value of the candidate route according to the preset path optimization rules; The adjacent point pair with the best optimization evaluation value is selected as the optimal bridge point pair, and a new route R is generated by inserting RT update, and it is iterated until all traversal points are covered; Step 404: Perform duplicate path correction on the final generated route to remove directly repeated and indirectly repeated redundant sections.

2. The tour route planning method according to claim 1, characterized in that: Also includes: The planned route is superimposed on the GIS map for visual display.

3. The tour route planning method according to claim 1, characterized in that: Also includes: The path length is adjusted differently based on the actual terrain.

4. The tour route planning method according to claim 1, characterized in that: The calculation method of the repeated path rate K and effective path rate V of each line in the set RSTemp is: Effective route rate V = (route route points ∩ set S2) / route route points Repeated path rate K = (route path points ∩ set S1) / number of route path points.

5. The tour route planning method according to claim 1, characterized in that: The optimization evaluation value of the candidate route is calculated according to the preset path optimization rules, and the adjacent point pair with the best optimization evaluation value is selected as the optimal bridge point pair, specifically: Calculate the difference between the total length of the candidate route and the total length of the original route R as the length increment; The adjacent point pair with the smallest length increment is selected as the optimal bridging point pair.

6. The tour route planning method according to claim 1, characterized in that: Methods for eliminating directly repeated redundant road sections include: If there is a closed-loop sub-path consisting of at least two identical points X in the path, all intermediate nodes between the first duplicate point X and the last duplicate point X in the closed loop are deleted, and the last duplicate point X and its subsequent path are retained.

7. The tour route planning method according to claim 1, characterized in that: Methods for eliminating indirectly repeated redundant road sections include: If there are at least three identical points X in the path, and the subpath between the first two points X is repeated after the subsequent point X, then all intermediate nodes between the first repeated point X and the second repeated point X are deleted, and the last repeated point X and its subsequent path are retained.

8. A tour route planning device, characterized in that: include: The first processing module is used to construct a GIS map of the amusement park and mark the entrances, exits, intersections and attractions as points with unique identifiers; The second processing module is used to connect the points to generate a directed path, wherein the directed path includes a unidirectional path and a bidirectional path; The third processing module is used to calculate the shortest path between any two points using the Floyd algorithm to generate a shortest path set RS; The fourth processing module is used to receive the starting point, end point, and traversal point set input by the user, and generate a planned route through the optimal waypoint bridging and correction algorithm, specifically including: Extract the shortest route R from the starting point to the end point from the shortest route set RS. In the traversal point set, the points included in the waypoints of route R are traversed points, recorded as point set S1, and the points not included in the waypoints of route R are untraversed points, recorded as point set S2; Traverse all the points in the set S2 that are combined with each other to form the shortest path set RSTemp. From the set RSTemp, select the shortest path with the highest effective path rate and the lowest repeated path rate as the path to be bridged RT. Traverse all adjacent point pairs (P i ,P j ), do the following: Insert the path RT to be bridged into point P i With point P j Generate candidate routes between them; Calculate the optimization evaluation value of the candidate route according to the preset path optimization rules; The adjacent point pair with the best optimization evaluation value is selected as the optimal bridge point pair, and a new route R is generated by inserting RT update, and it is iterated until all traversal points are covered; The final generated route is corrected for duplicate paths to remove directly and indirectly repeated redundant sections.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the steps of the tour route planning method according to any one of claims 1 to 7 are implemented.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the tour route planning method according to any one of claims 1 to 7 are implemented.

Images