Slow traffic path guidance method, computing device and storage medium

By calculating the index values ​​of road traffic environment influencing factors and comprehensively scoring, the problem of neglecting traffic safety and travel preferences in the existing technology is solved, and the effect of slow traffic path induction is improved, and the diversified needs of slow travelers are met.

CN118968800APending Publication Date: 2024-11-15亿雅捷交通系统(北京)有限公司 +2
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411052813.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-02
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

The prior art ignores factors such as traffic safety, travel environment and travel preferences in the induction of slow traffic paths, resulting in the search results being unable to meet the needs of slow traffic subjects.

Method used

By obtaining user travel information, calculating the index values ​​of road traffic environment influencing factors, and performing consistency and dimensionless processing, comprehensively scoring the travel path, and selecting the path with the highest score or the shortest itinerary time as the target travel path.

Benefits of technology

It has achieved the ability to meet the different travel needs of slow travelers and improve the slow travel experience while considering various road traffic environment factors.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118968800A_ABST
    Figure CN118968800A_ABST
Patent Text Reader

Abstract

The invention provides a slow traffic path guidance method, a computing device and a storage medium. The slow traffic path guidance method comprises the following steps: acquiring user travel information; obtaining all travel paths based on the travel information; calculating index values of the road traffic environment influence factors of all the travel paths; carrying out unification and dimensionless processing on the index values; respectively calculating comprehensive scores of all the travel paths; when there is one path with the highest score, taking the path as a target travel path; or, when the number of the paths with the highest scores is at least two, taking the path with the shortest travel time as the target travel path. According to the method, the problem that the requirements of a slow travel subject for traffic safety, travel environments, travel preferences and the like cannot be met due to the fact that a path searching method is simple is solved, slow travel route planning under various road traffic environments is completed by a user through travel preference selection, and slow travel experience is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of intelligent transportation technology, and in particular to a slow-moving traffic path induction method, computing device and storage medium. Background Art

[0002] In recent years, my country has attached increasing importance to the construction of a slow-moving transportation environment. The Green Travel Action Plan (2019-2022) proposes to optimize the services of the slow-moving transportation system and requires the construction of a safe, continuous and comfortable urban slow-moving system; the Guiding Opinions on Comprehensively Promoting the Construction of an Urban Integrated Transportation System proposes to accelerate the construction of a green urban slow-moving transportation system, requiring residents to meet their daily shopping, activities, fitness and other needs, and to improve the continuity, safety and comfort of slow-moving transportation facilities. At the same time, various regions have also formulated relevant plans to strengthen the construction of urban slow-moving transportation systems.

[0003] The construction and optimization of slow traffic systems are more focused on improving static resources such as infrastructure, while dynamic path planning and guidance are often less involved. Although some studies have been conducted on slow traffic path guidance, most of them focus on travel efficiency as the optimization goal, ignoring the requirements of slow traffic for traffic safety, travel environment, travel preferences and other factors; or the path search method is simply explained and cannot realize path search under the real road network. Summary of the invention

[0004] The purpose of this application is to provide a slow-moving traffic path induction method, computing device and storage medium, which are used to solve the technical problem in the prior art that the search results caused by the simple path search method cannot meet the needs of slow-moving traffic entities for factors such as traffic safety, travel environment and travel preferences.

[0005] To achieve the above objectives, this application provides the following solutions:

[0006] In a first aspect, the present application provides a slow traffic path induction method, the slow traffic path induction method comprising:

[0007] Obtain user travel information;

[0008] Acquire all travel routes based on the travel information;

[0009] Calculating the index values ​​of the road traffic environment influencing factors of all the travel routes;

[0010] The index values ​​are made consistent and dimensionless;

[0011] Calculate the comprehensive scores of all the travel paths respectively;

[0012] When there is only one path with the highest score, the path is used as the target travel path; or,

[0013] When there are at least two paths with the highest scores, the path with the shortest travel time is selected as the target travel path.

[0014] Preferably, before the step of acquiring all travel paths based on the travel information, the method further comprises:

[0015] Build a slow-moving traffic network;

[0016] Corresponding road traffic environment influencing factors are added to the road sections in the slow traffic network.

[0017] Preferably, the step of calculating the index value of the road traffic environment influencing factor of all travel paths based on the travel information includes:

[0018] Determine the factors affecting the road traffic environment for each road section in each travel route;

[0019] An index value of the road traffic environment influencing factor of each travel route is obtained by calculation based on the road traffic environment influencing factor.

[0020] Preferably, the travel information includes at least one of the following:

[0021] Travel mode, including at least one of: walking, bicycle and electric bicycle;

[0022] Travel preferences, including at least one of the following: commuting, school, travel, activities, and a combination;

[0023] Travel information;

[0024] Address, including: starting address and target address.

[0025] Preferably, the road traffic environment influencing factors include at least one or more of the following:

[0026] Length of road;

[0027] Green-to-signal ratio at intersections;

[0028] The effective width of roads that meet the standards, including the effective width of sidewalks and non-motorized vehicle lanes that meet the standards;

[0029] The proportion of road mileage with non-physical isolation of vehicles;

[0030] Road tree-lined ratio, including: sidewalk tree-lined ratio and non-motorized lane tree-lined ratio;

[0031] The percentage of road miles with roadside parking;

[0032] Opening ratio of motor vehicle entrances and exits along the road;

[0033] The proportion of buses occupying non-motorized vehicle lanes for parking;

[0034] The number of internet celebrity check-in spots on both sides of the road;

[0035] Road traffic, including pedestrian traffic and non-motor vehicle traffic.

[0036] Preferably, the calculation expression of the effective width compliance rate of the road is as follows:

[0037]

[0038] Wherein, β is the road type, and the road type is one of a sidewalk and a non-motorized vehicle lane; is the effective width compliance rate of the β-type roads in path x; is the mileage of section i that meets the effective width of category β road; L x is the mileage of path x;

[0039] The calculation expression for the proportion of road mileage with non-physical isolation is as follows:

[0040]

[0041] in, is the proportion of road mileage with non-physical isolation for path x; is the mileage of the non-physical isolation section i; L x is the mileage of path x;

[0042] Preferably, the calculation expression of the road tree-lined ratio is as follows:

[0043]

[0044] Wherein, β is the road type, and the road type is one of a sidewalk and a non-motorized vehicle lane; is the tree-lined ratio of type β roads in path x; is the tree-shaded area of ​​the β-type road on section i; is the area of ​​the β-type road on section i.

[0045] The calculation expression of the road mileage ratio of roadside parking is as follows:

[0046]

[0047] Among them, P x is the percentage of road miles with roadside parking in route x; is the mileage of road section i with roadside parking; L x is the mileage of path x;

[0048] The calculation expression of the opening ratio of motor vehicle entrances and exits along the road is as follows:

[0049]

[0050] Among them, E x is the motor vehicle entrance and exit opening ratio of path x; is the number of motor vehicle entrances and exits on road section i; L x is the mileage of path x;

[0051] The calculation expression for the proportion of buses occupying non-motorized vehicle lanes is as follows:

[0052]

[0053] in, is the proportion of buses occupying non-motorized vehicle lanes in route x; is the number of bus stops occupying non-motorized vehicle lanes on road section i; L x is the mileage of path x;

[0054] The expression for calculating the travel time of each travel path is as follows:

[0055]

[0056] Wherein, α is the travel mode, and the travel mode is one of walking, bicycle and electric bicycle; is the travel time of path x under travel mode α; L i is the mileage of section i; V α is the travel speed of travel mode α; C j is the signal period of signalized intersection j; g j is the green light time of signalized intersection j.

[0057] Preferably, the step of performing uniform and dimensionless processing on the indicators comprises:

[0058] Classifying the factors affecting the road traffic environment, wherein the classification includes: positive index classification and negative index classification;

[0059] The index values ​​of the classified road traffic environment influencing factors are consistent and dimensionless.

[0060] Among them, the expression for the consistent processing of positive index classification is as follows:

[0061]

[0062] The expression for the consistent treatment of negative index classification is as follows:

[0063]

[0064] The dimensionless expression is as follows:

[0065]

[0066] in, is the consistent value of the road traffic environment influencing factor index i in path x; is the value of the road traffic environment influencing factor index i in path x; Max i It is the maximum value of the road traffic environment influencing factor index i among all travel routes; Min i It is the minimum value of the road traffic environment influencing factor index i among all travel routes; is the dimensionless value of the road traffic environment influencing factor index i in path x; n is the number of travel paths.

[0067] Preferably, the step of respectively calculating the comprehensive scores of all the travel paths comprises:

[0068] determining a weight of the index value based on the travel information;

[0069] A comprehensive score of the travel path is calculated based on the weight and the index value.

[0070] In a second aspect, the present application provides a computing device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the slow traffic path induction method as described in any one of the above.

[0071] In a third aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the slow traffic path induction method as described in any one of the above.

[0072] According to the specific embodiments provided in this application, this application discloses the following technical effects:

[0073] The present application provides a slow traffic path induction method, a computing device and a storage medium. The present application scheme takes into account that the current slow traffic navigation mostly aims at the shortest travel time, ignoring factors such as user travel preferences and travel environment. The simple path search method cannot meet the needs of slow traffic travelers for traffic safety, travel environment and travel preferences. This application scheme realizes the different travel needs of slow travelers to be met through travel preference selection while considering various road traffic environment influencing factors, thereby improving the slow travel experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0074] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0075] Figure 1 A schematic diagram of a flow chart of a slow-moving traffic path induction method provided in an embodiment of the present application;

[0076] Figure 2 A schematic diagram of a process for constructing a slow-moving traffic network system provided in an embodiment of the present application;

[0077] Figure 3 A schematic diagram of a process for calculating the index values ​​of road traffic environment influencing factors of all travel paths provided in an embodiment of the present application;

[0078] Figure 4 A schematic diagram of a slow-moving traffic network provided in an embodiment of the present application;

[0079] Figure 5 A schematic diagram of a chronic traffic network with two optimal paths provided in an embodiment of the present application.

[0080] The realization of the purpose, functional features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. The above-mentioned drawings have shown clear embodiments of this application, which will be described in more detail later. These drawings and textual descriptions are not intended to limit the scope of the concept of this application in any way, but to illustrate the concept of this application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0081] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0082] It should be noted that, in this article, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "includes a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element. In addition, components, features, and elements with the same name in different embodiments of the present application may have the same meaning or different meanings, and their specific meanings need to be determined by their explanation in the specific embodiment or further combined with the context of the specific embodiment.

[0083] It should be understood that, although the terms first, second, third, etc. may be used to describe various information in this article, these information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of this article, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein can be interpreted as "at the time of" or "when" or "in response to determination". Furthermore, as used in this article, the singular forms "one", "one" and "the" are intended to also include plural forms, unless there is an opposite indication in the context. It should be further understood that the terms "comprising" and "including" indicate that there are the described features, steps, operations, elements, components, projects, kinds, and / or groups, but do not exclude the existence, occurrence or addition of one or more other features, steps, operations, elements, components, projects, kinds, and / or groups. The terms "or", "and / or", "including at least one of the following" etc. used in this application can be interpreted as inclusive, or mean any one or any combination. For example, “comprising at least one of the following: A, B, C” means “any of the following: A; B; C; A and B; A and C; B and C; A and B and C”, and for another example, “A, B or C” or “A, B and / or C” means “any of the following: A; B; C; A and B; A and C; B and C; A and B and C”. An exception to this definition will only occur when a combination of elements, functions, steps or operations are inherently mutually exclusive in some manner.

[0084] It should be understood that, although the various steps in the flowchart in the embodiment of the present application are displayed in sequence according to the indication of the arrows, these steps are not necessarily performed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and it can be performed in other orders. Moreover, at least a portion of the steps in the figure may include a plurality of sub-steps or a plurality of stages, and these sub-steps or stages are not necessarily performed at the same time, but can be performed at different times, and their execution order is not necessarily performed in sequence, but can be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

[0085] As used herein, the words "if" and "if" may be interpreted as "at the time of" or "when" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrases "if it is determined" or "if (stated condition or event) is detected" may be interpreted as "when it is determined" or "in response to determining" or "when detecting (stated condition or event)" or "in response to detecting (stated condition or event)", depending on the context.

[0086] It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0087] In the subsequent description, the suffixes such as "module", "component" or "unit" used to represent elements are only used to facilitate the description of the present application, and have no specific meanings. Therefore, "module", "component" or "unit" can be used in a mixed manner.

[0088] refer to Figure 1 As shown, the present application provides a slow traffic path induction method, and the slow traffic path induction method comprises:

[0089] Obtain user travel information;

[0090] In an embodiment of the present application, before starting the slow traffic path induction, it is necessary to obtain the user's travel information. In an exemplary scenario, the travel information includes the user's travel mode. Since the technical solution of the present application is for slow traffic, the user's travel mode can be walking, riding a bicycle, riding an electric vehicle, or multiple of the above three modes. For example, the user first walks, then rides a bicycle, and then rides an electric bicycle to reach the destination. In an exemplary scenario, the travel information includes the user's travel preferences. Since each user has a different travel purpose, everyone's preferences are different during the travel process. For example: office workers' travel preferences are usually tight commuting; students' travel preferences are relatively safer commuting to school; tourists' travel preferences are usually tourism mode, that is, stop-and-go mode; activists' travel preferences are usually activity mode; and other travel preferences are classified as comprehensive modes. In an exemplary scenario, the travel information includes travel time. For example, the travel time can be the morning peak period, the evening peak period, and the non-peak period; for another example, the travel time can also be during the day and at night; for another example, the travel time can also be the morning period, the noon period, the afternoon period, and so on. In this example, when obtaining the user's travel time, it can be that when receiving the travel information input by the user, the user's current time is used as the travel time; it can also be that when the user enters the travel information, the user's planned travel time is also entered. In an exemplary scenario, the travel information includes the starting address and the destination address, etc. The above is only an exemplary description. Other travel information communicated based on this application is also within the scope of protection of this application, and will not be repeated here one by one.

[0091] Acquire all travel routes based on the travel information;

[0092] In an embodiment of the present application, after obtaining the user's travel information, a depth-first search algorithm is used to traverse and calculate all road sections in the city based on the user's travel information, for example, the starting address and the target address of the trip, so as to obtain all possible travel paths of the user. For another example, based on the user's travel method, such as walking or riding a bicycle, all road sections in the city are traversed and calculated in combination with the user's starting address and the target address, so as to obtain all possible travel paths of the user. For another example, based on the user's travel preferences, such as when the user's travel preference is commuting, based on the user's travel method and the starting address and the target address, possible commuting travel paths are obtained by calculation and traversal.

[0093] In this embodiment, when all travel paths are obtained according to the user's travel information, all travel paths are obtained after traversing and calculating all road sections based on the user's travel information through a depth-first search algorithm. In the embodiment of the present application, the above-mentioned depth-first search algorithm is only an exemplary description and cannot be used as a limitation on the protection scope of the present application. Other traversal algorithms based on the communication of this application, such as the breadth-first search algorithm, the best-first algorithm, etc. are all within the protection scope of the present application and will not be described in detail here.

[0094] Calculating the index values ​​of the road traffic environment influencing factors of all the travel routes;

[0095] In an embodiment of the present application, after obtaining all the travel paths of the user, the index values ​​of the road traffic environment influencing factors of all the travel paths are further calculated based on the travel information of the user. For example, according to the walking travel mode of the user and the travel preference for commuting, the index values ​​of the road traffic environment influencing factors of all the travel paths are determined by calculating the effective sidewalk width compliance rate of each road section on all the travel paths, the green signal ratio of the intersection, etc.

[0096] The index values ​​are made consistent and dimensionless;

[0097] In an embodiment of the present application, after all possible travel paths are obtained, the index values ​​of the road traffic environment influencing factors on all the travel paths are further processed so that they can be used to calculate the comprehensive score of the travel path. In an exemplary embodiment, when the index values ​​are uniformly processed, the index values ​​of the road traffic environment influencing factors that enhance the user's traffic perception can be classified as positive indicators, such as: effective width of sidewalks, effective width of non-motorized vehicle lanes, mileage of roads with non-physical isolation of machines and non-machines, tree-lined ratio of sidewalks, tree-lined ratio of non-motorized vehicle lanes, network check-in points on both sides of the road, etc.; the road traffic environment influencing factors that affect the user's traffic perception are classified as negative indicators, such as: road length, road mileage for roadside parking, the number of motor vehicle entrances and exits along the road, the number of bus stops where buses occupy non-motorized vehicle lanes, pedestrian flow on sidewalks, and non-motor vehicle flow, etc.; and the indicators of the same road traffic environment influencing factors are dimensionlessly processed. Among them:

[0098] The expression for the consistent processing of positive index classification is as follows:

[0099]

[0100] The expression for the consistent processing of negative index classification is as follows:

[0101]

[0102] The dimensionless expression of the indicator is as follows:

[0103]

[0104] in, is the consistent value of the road traffic environment influencing factor index i in path x; is the value of the road traffic environment influencing factor index i in path x; Max i It is the maximum value of the road traffic environment influencing factor index i among all travel routes; Min i It is the minimum value of the road traffic environment influencing factor index i among all travel routes; is the dimensionless value of the road traffic environment influencing factor index i in path x; n is the number of travel paths.

[0105] The comprehensive scores of all the travel paths are calculated respectively.

[0106] In an embodiment of the present application, after obtaining the index values ​​of the road traffic environment influencing factors of all travel routes, all travel routes are further scored in combination with the user's travel information and the index values ​​of the road traffic environment influencing factors.

[0107] When there is only one path with the highest score, the path is used as the target travel path; or,

[0108] When there are at least two paths with the highest scores, the path with the shortest travel time is selected as the target travel path.

[0109] In an embodiment of the present application, after calculating the scores of all travel paths, the travel path with the highest score is selected as the target travel path. In an exemplary scenario, when there are multiple target paths determined based on the scores, further, the travel time of each path can be calculated, and the target travel path can be determined according to the travel time, and the target travel path can be used as the final target path. In another exemplary scenario, when there are multiple target paths determined based on the scores, further, the final target path can be determined according to the user's selection.

[0110] refer to Figure 2 As shown, before the step of obtaining all travel paths based on the travel information, the method includes:

[0111] Build a slow-moving traffic network;

[0112] Corresponding road traffic environment influencing factors are added to the road sections in the slow traffic network.

[0113] In an embodiment of the present application, before starting to guide the slow traffic path based on the user's travel information, it is first necessary to communicate the slow traffic network. Specifically, a vector and directed slow traffic network diagram covering trails, non-motorized vehicle lanes and crossing facilities is constructed based on the geographic system software ArcGIS. After completing the topological check and modification of the slow traffic network diagram, an adjacency matrix is ​​established. Further, the road traffic environment influencing factors on the actual road section are added to the road section in the slow traffic network of the corresponding section, thereby increasing the attribute information of each road section in the slow traffic network. For example, by actually obtaining the road length of the road section, the intersection green letter ratio of the road intersection, the effective width of the sidewalk, the effective width of the non-motorized vehicle lane, the road mileage of the machine-non-entity isolation, the sidewalk tree-lined rate, the non-motorized vehicle lane tree-lined rate, the road mileage of the roadside parking, the number of motor vehicle entrances and exits along the road, the number of bus stops where buses occupy non-motorized vehicle lanes, the number of Internet celebrity check-in places on both sides of the road, the pedestrian flow of the road, and the non-motorized vehicle flow of the road, etc. The above factors affecting the road traffic environment are only exemplary. Other environmental factors based on the concept of this application, such as the number of street lights along the road, the road grade, etc., are within the scope of protection of this application and will not be repeated here.

[0114] In an exemplary embodiment, for some environmental factors whose index values ​​are updated slowly, such as the effective width of the sidewalk, the effective width of the non-motorized vehicle lane, the mileage of the road with non-physical separation, etc., when adding the attributes of the road traffic environment influencing factors to each road section, further, through periodic collection, the corresponding values ​​are added to the corresponding attributes. In one example, the environment collection equipment is regularly updated, such as the effective width of the sidewalk, the effective width of the non-motorized vehicle lane, the mileage of the road with non-physical separation, the mileage of the road with roadside parking, the number of motor vehicle entrances and exits along the road, and the number of bus stops where buses occupy non-motorized vehicle lanes. It is regularly updated by applying remote sensing imaging equipment, such as the tree-lined ratio of the sidewalk and the tree-lined ratio of the non-motorized vehicle lane. The pedestrian flow and non-motorized vehicle flow of the road are collected in real time by applying traffic collection equipment. The green-signal ratio of each intersection is obtained through the road system or manual survey. The number of Internet celebrity check-in places on both sides of the road is collected by applying big data.

[0115] refer to Figure 3 As shown, the step of calculating the index value of the road traffic environment influencing factor of all travel paths includes:

[0116] Determine the factors affecting the road traffic environment for each road section in each travel route;

[0117] An index value of the road traffic environment influencing factor of each travel route is obtained by calculation based on the road traffic environment influencing factor.

[0118] In an embodiment of the present application, after all travel routes are determined based on the user's travel information, the road traffic environment influencing factors of each road section in each travel route are further determined based on the user's travel information. For example, if the user travels by walking, the road traffic influencing factors of each road section only need to confirm environmental influencing factors such as the length of the effective width of the sidewalk, the shaded area of ​​the sidewalk, and the pedestrian flow of the sidewalk, rather than those related to non-motor vehicles, such as the length of the effective width of the non-motor vehicle lane, the non-motor vehicle flow, etc. After determining the environmental influencing factors of each road section in each travel route, the index value of the road traffic environment influencing factors of each travel route is further calculated based on the corresponding attribute values.

[0119] In the embodiment of the present application, the calculation expression of the road effective width compliance rate is as follows:

[0120]

[0121] Wherein, β is the road type, and the road type is one of a sidewalk and a non-motorized vehicle lane; is the effective width compliance rate of the β-type roads in path x; is the mileage of section i that meets the effective width of category β road; L x is the mileage of path x.

[0122] In this embodiment, the type of road selected by the user when traveling is determined by the user's travel mode. For example, when the user travels by walking, the compliance rate of the effective width of the sidewalk is calculated; and when the user travels by bicycle or electric bicycle, the compliance rate of the effective width of the non-motorized lane is calculated. In an exemplary scenario, when there are multiple sections in a path x, the mileage of the effective width of the β-type road of all sections in the path is first accumulated, and the mileage of the effective width of the β-type road obtained after the accumulation is divided by the total mileage of the path x to obtain the compliance rate of the effective width of the β-type road.

[0123] In an embodiment of the present application, the calculation expression of the road mileage ratio of the non-physical isolation of the machine is as follows:

[0124]

[0125] in, is the proportion of road mileage with non-physical isolation for path x; is the mileage of the non-physical isolation section i; L x is the mileage of path x.

[0126] In this embodiment, non-physical isolation between motor vehicles refers to the isolation between motor vehicle lanes and non-motor vehicle lanes through specific entities, such as guardrails, green belts, etc. When calculating the percentage of road mileage with non-physical isolation, first, the road mileage with non-physical isolation between motor vehicles in all sections of path x is accumulated, and then the accumulated road mileage with non-physical isolation between motor vehicles is divided by the total mileage of path x to obtain the percentage of road mileage with non-physical isolation between motor vehicles. In this embodiment, the higher the percentage of road mileage with non-physical isolation between motor vehicles, the higher the isolation between users and motor vehicles during the travel of path x, thereby reducing the danger from motor vehicles.

[0127] In the embodiment of the present application, the calculation expression of the road tree-lined ratio is as follows:

[0128]

[0129] Wherein, β is the road type, and the road type is one of a sidewalk and a non-motorized vehicle lane; is the tree-lined ratio of type β roads in path x; is the tree-shaded area of ​​the β-type road on section i; is the area of ​​the β-type road on section i.

[0130] In this embodiment, the user experience of path x can be obtained by calculating the tree-lined ratio of the road corresponding to the user's travel mode. For example, the higher the tree-lined ratio, the larger the tree-lined coverage area, and the better the user experience of traveling on path x. Conversely, the worse the experience. Specifically, when calculating the tree-lined ratio, the tree-lined area on each road section and the area of ​​each road section are obtained through remote sensing images, and then the tree-lined area of ​​each road section in path x is accumulated, the area of ​​each road section in path x is accumulated, and the tree-lined area is divided by the area of ​​path x to obtain the tree-lined ratio in path x. In an exemplary scenario, when calculating the tree-shade ratio, it can be further calculated based on the direction of the road and the time of the user's travel. For example, when the road section in the path is north-south, the tree-shade area of ​​the sidewalk or non-motorized vehicle lane will change over time. For example, in the morning, the shade of the sidewalk on the east side of the road section will be reduced because the sun shines on the west, while in the afternoon, the shade area of ​​the non-motorized vehicle lane will be reduced due to the sun shining on the east. Therefore, when the user travels in the morning or afternoon, the tree-shade area of ​​the north-south section needs to be adjusted accordingly.

[0131] In an embodiment of the present application, the calculation expression of the road mileage ratio of roadside parking is as follows:

[0132]

[0133] Among them, P x is the percentage of road miles with roadside parking in route x; is the mileage of road section i with roadside parking; L x is the mileage of path x.

[0134] In this embodiment, when the user's travel mode is a bicycle or an electric bicycle, when calculating the index value of the road traffic environment influencing factor, it is also necessary to calculate the road mileage ratio of roadside parking. The higher the road mileage ratio of roadside parking, the worse the user's riding experience, and the higher the risk during riding. On the contrary, the user experience will increase and the risk will decrease accordingly. Specifically, when calculating the road mileage ratio of roadside parking, firstly, the roadside parking mileage of each road section in path x is accumulated, and then the accumulated roadside parking mileage is divided by the mileage of path x to obtain the road mileage ratio of roadside parking.

[0135] In an embodiment of the present application, the calculation expression of the opening ratio of the motor vehicle entrances and exits along the road is as follows:

[0136]

[0137] Among them, E x is the motor vehicle entrance and exit opening ratio of path x; is the number of motor vehicle entrances and exits on road section i; L x is the mileage of path x.

[0138] In this embodiment, when the user's mode of travel is a bicycle or an electric bicycle, when calculating the index value of the road traffic environment influencing factors, it is also necessary to calculate the opening rate of the motor vehicle entrances and exits along the road. The higher the opening rate of the motor vehicle entrances and exits along the road, the worse the user's riding experience, and the risk level during riding will also increase accordingly. On the contrary, the user experience will increase and the risk level will decrease accordingly. Specifically, when calculating the opening rate of the motor vehicle entrances and exits along the road, first, the number of entrances and exits of each section in the path x is accumulated, and then the accumulated number of entrances and exits is divided by the mileage of the path x to obtain the opening rate of the motor vehicle entrances and exits along the road.

[0139] In an embodiment of the present application, the calculation expression for the proportion of buses occupying non-motorized vehicle lanes is as follows:

[0140]

[0141] in, is the proportion of buses occupying non-motorized vehicle lanes in route x; is the number of bus stops occupying non-motorized vehicle lanes on road section i; L x is the mileage of path x.

[0142] In this embodiment, when the user's mode of travel is a bicycle or an electric bicycle, when calculating the index value of the road traffic environment influencing factor, it is also necessary to calculate the proportion of buses occupying non-motorized vehicle lanes. By calculating the proportion of buses occupying non-motorized vehicle lanes, the user's risk level during riding will increase accordingly. Conversely, the user's risk level will decrease accordingly. Specifically, when calculating the proportion of buses occupying non-motorized vehicle lanes, firstly, the number of bus stops on each road section in path x is accumulated, and then the accumulated number of bus stops is divided by the mileage of path x to obtain the proportion of buses occupying non-motorized vehicle lanes.

[0143] In an embodiment of the present application, the expression for calculating the travel time of each travel path is as follows:

[0144]

[0145] Wherein, α is the travel mode, and the travel mode is one of walking, bicycle and electric bicycle; is the travel time of path x under travel mode α; L i is the mileage of section i; V α is the travel speed of travel mode α; C j is the signal period of signalized intersection j; g j is the green light time of signalized intersection j.

[0146] In this embodiment, when the user travels, the user's mileage time also needs to be calculated based on the user's travel preference. For example, when the user's travel preference is commuting, the shorter the commuting mileage time, the better the user experience. The length of the traffic light signal cycle at each intersection in the path will directly affect the commuting time on the user's path. Specifically, when calculating the commuting time of each path, first calculate the user's travel time on each section of the path, then accumulate the travel time on each section, and then accumulate the signal time waiting for the traffic light at each intersection, and then sum the accumulated travel time with the accumulated signal time to obtain the user's travel time.

[0147] In an embodiment of the present application, when scoring travel routes, it is necessary to determine the index value of the road traffic environment influencing factors corresponding to each route based on different travel modes, and then combine the user's travel mode and the determined road traffic environment influencing factors to determine the weight information of each road traffic environment influencing factor, and use the index value of the road traffic environment influencing factor and the weight of the index value to score each route.

[0148] In an exemplary embodiment, the calculation formula for scoring the travel path when the travel mode is walking and the travel preference is going to school is as follows:

[0149]

[0150] Among them, C is the travel path score, is the travel time of path x under travel mode α, is the effective width compliance rate of β-type roads in path x, E x is the motor vehicle entrance and exit opening ratio of path x, σ 1 , σ 2 , σ 3 are the corresponding weights respectively.

[0151] In an exemplary embodiment, the calculation formula for scoring the travel path for which the travel mode is a bicycle or an electric bicycle and the travel preference is going to school is as follows:

[0152]

[0153] Among them, C is the travel path score, is the travel time of path x under travel mode α, is the effective width compliance rate of the β-type roads in path x, is the proportion of non-physical isolation road mileage of path x, P x is the percentage of road mileage with roadside parking in route x, is the proportion of buses occupying non-motorized vehicle lanes in route x, E x is the motor vehicle entrance and exit opening ratio of path x, where μ 1 , μ 2 , μ 3 , μ 4 , μ 5 , μ 6 are the corresponding weights respectively.

[0154] In an exemplary embodiment, the calculation formula for scoring a travel path whose travel mode is walking and whose travel preference is traveling is as follows:

[0155]

[0156] Among them, Tour x is the proportion of Internet celebrity check-in spots in path x, is the tree-lined ratio of type β roads in path x, is the travel time of path x under travel mode α, is the effective width compliance rate of the β-type roads in path x, E x is the motor vehicle entrance and exit opening ratio of path x, where are the corresponding weights respectively.

[0157] In an exemplary embodiment, the calculation formula for scoring the travel path of a bicycle or an electric bicycle and a travel preference of tourism is as follows:

[0158]

[0159] Among them, Tour x is the proportion of Internet celebrity check-in spots in path x, is the tree-lined ratio of type β roads in path x, is the travel time of path x under travel mode α, is the effective width compliance rate of the β-type roads in path x, is the proportion of non-physical isolation road mileage of path x, P x is the percentage of road mileage with roadside parking in route x, is the proportion of buses occupying non-motorized vehicle lanes in route x, E x is the motor vehicle entrance and exit opening ratio of path x, where ω 1 ,ω 2 ,ω 3 ,ω 4 ,ω 5 ,ω 6 ,ω 7 ,ω 8 are the corresponding weights respectively.

[0160] In an exemplary embodiment, the calculation formula for scoring a travel path whose travel mode is walking and whose travel preference is activity is as follows:

[0161]

[0162] in, is the effective width compliance rate of the β-type roads in path x, is the tree-lined ratio of type x roads in path x, is the flow rate of the β-type road in the path x, Tour x is the proportion of the number of Internet celebrity check-in places in path x, E x is the motor vehicle entrance and exit opening ratio of path x, where γ 1 , γ 2 , γ 3 , γ 4 , γ 5 are the corresponding weights respectively.

[0163] In an exemplary embodiment, the calculation formula for scoring a travel path where the travel mode is a bicycle or an electric bicycle and the travel preference is an activity is as follows:

[0164]

[0165] in, is the effective width compliance rate of the β-type roads in path x, is the tree-lined ratio of type β roads in path x, is the flow of the β-type road in the path x, Tour x is the proportion of Internet celebrity check-in spots in path x, is the proportion of non-physical isolation road mileage of path x, P x is the percentage of road mileage with roadside parking in route x, is the proportion of buses occupying non-motorized vehicle lanes in route x, E x is the motor vehicle entrance and exit opening ratio of path x, where δ 1 ,δ 2 ,δ 3 ,δ 4 ,δ 5 ,δ 6 ,δ 7 ,δ 8 are the corresponding weights respectively.

[0166] In an exemplary embodiment, the calculation formula for scoring a travel path whose travel mode is walking and whose travel preference is other travel paths is as follows:

[0167]

[0168] in, is the travel time of path x under travel mode α, is the effective width compliance rate of the β-type roads in path x, is the tree-lined ratio of type β roads in path x, is the flow of the β-type road in the path x, Tour x is the proportion of the number of Internet celebrity check-in places in path x, E x is the motor vehicle entrance and exit opening ratio of path x, where ε 1 、v 2 , ε 3 , ε 4 , ε 5 , ε 6 are the corresponding weights respectively.

[0169] In an exemplary embodiment, the calculation formula for scoring a travel path where the travel mode is a bicycle or an electric bicycle and the travel preference is other travel paths is as follows:

[0170]

[0171] in, is the travel time of path x under travel mode α, is the effective width compliance rate of the β-type roads in path x, is the tree-lined ratio of type β roads in path x, is the proportion of non-physical isolation road mileage of path x, P x is the percentage of road mileage with roadside parking in route x, is the flow of type β roads in path x, is the proportion of buses occupying non-motorized vehicle lanes in route x, Tour x is the proportion of the number of Internet celebrity check-in places in path x, E x is the motor vehicle entrance and exit opening ratio of path x, where ρ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 are the corresponding weights respectively.

[0172] In an embodiment of the present application, after all travel paths are scored according to the above calculation formula based on the user's travel mode, a genetic algorithm is further applied to optimize all paths, and the path with the highest score from all paths of the user from the travel starting point to the travel end point is optimized and selected according to the score maximization target. That is, through continuous iterative search and optimization, the path that meets the user's travel is screened out from all travel paths, and further, according to the score maximization target path, the path with the highest score from all paths of the user from the starting point to the destination is optimized and selected as the target travel path from the screened paths that meet the user's travel information. In an exemplary embodiment, when it is determined that there is only one path with the highest score, the path is used as the target travel path; in another exemplary embodiment, when it is determined that there are at least two paths with the highest score, the travel time corresponding to the at least two travel paths is further calculated, and the travel path with the shortest travel time is used as the target travel path. In this embodiment, the above is an exemplary explanation. Based on the concept of the present invention, other optimization ideas are within the protection scope of this application. For example, when optimizing all paths through a genetic algorithm, the target path can also be minimized according to the score, that is, the path with the lowest score among all paths from the user's starting address to the destination address is optimized and selected as the target travel path. No further details are given here.

[0173] refer to Figure 4As shown, in a scenario of an embodiment of the present application, first, a slow traffic network is drawn by using ArcGIS software, and corresponding attribute information is added to each road section in the traffic network, mainly including the starting point of the road, the end point of the road, the road grade, the road length, the effective width of the sidewalk, the effective width of the non-motorized vehicle lane, the form of separation between vehicles and non-motorized vehicles, the shaded area of ​​the sidewalk, the shaded area of ​​the non-motorized vehicle lane, whether there is roadside parking, the number of building entrances and exits, whether the bus stops occupy the road, the number of Internet celebrity check-in spots on both sides of the road, the signal cycle, the green light duration, the pedestrian flow and the non-motorized vehicle flow, etc.

[0174] Refer to Table 1.

[0175]

[0176] Table 1

[0177] Further obtain the user's travel information, including the travel starting address, target address, travel mode and travel preferences, use the depth-first search algorithm to traverse all possible travel paths from the starting address to the target address, further calculate the index value of each road traffic environment influencing factor, and then give a comprehensive score to each possible travel path based on the user's travel mode, travel preferences and corresponding weights.

[0178] Furthermore, the genetic algorithm is applied to optimize the travel path, and the path that meets the user's travel needs is selected from all possible travel paths. Then, according to the goal of maximizing the score, the travel path with the highest score from the user's starting address to the target address is preferentially selected from the selected paths, that is, the optimal route. When there are multiple travel paths with the same score, the path with the shortest travel time will be recommended as the optimal route.

[0179] In this embodiment, after determining the optimal route according to the user's travel information, the optimal route is output in the form of a file, for example, saved as a csv file, as shown in Table 2, which includes travel mode, travel preference, travel start address, travel destination address and optimal route information. In the embodiment of the present application, there are two optimal routes determined by scoring, refer to Figure 5 In one scenario of this embodiment, by calculating the travel time of the two paths, the path with the shortest travel time is used as the final target travel path; in another scenario, according to the received user selection operation, one of the paths is selected as the final target travel path.

[0180] ID Travel Travel preferences Travel starting point Trip destination Optimal route 1 bike commuting 1 59 [‘1’,’10’,’19’,’28’,’37’,’46’,’55’,’56’,’57’,’58’,’59’] 2 bike Leisure 1 59 [‘1’,’2’,’11’,’12’,’21’,’30’,’39’,’40’,’41’,’50’,’59’]

[0181] Table 2

[0182] A computing device is also provided in an embodiment of the present application, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the slow traffic path induction method as described above.

[0183] A computer-readable storage medium is also provided in an embodiment of the present application, on which a computer program is stored. When the computer program is executed by a processor, the steps of the slow traffic path induction method as described in any one of the above are implemented.

[0184] In the embodiments of the smart terminal and storage medium provided in the present application, all technical features of any of the above-mentioned control method embodiments may be included, and the expanded and explained contents of the specification are basically the same as those of the embodiments of the above-mentioned methods, and will not be repeated here.

[0185] The embodiment of the present application further provides a computer program product, which includes a computer program code. When the computer program code runs on a computer, the computer executes the methods in the above various possible implementation modes.

[0186] An embodiment of the present application also provides a chip, including a memory and a processor, the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a device equipped with the chip executes the methods in various possible implementation modes as described above.

[0187] It is understood that the above scenarios are only examples and do not constitute a limitation on the application scenarios of the technical solutions provided in the embodiments of the present application. The technical solutions of the present application can also be applied to other scenarios. For example, it is known to those skilled in the art that with the evolution of the system architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0188] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0189] The steps in the method of the embodiment of the present application can be adjusted in order, combined and deleted according to actual needs.

[0190] The units in the device of the embodiment of the present application can be merged, divided and deleted according to actual needs.

[0191] In the present application, the same or similar terminology concepts, technical solutions and / or application scenario descriptions are generally described in detail only the first time they appear. When they appear again later, they are generally not repeated for the sake of brevity. When understanding the technical solutions and other contents of the present application, for the same or similar terminology concepts, technical solutions or application scenario descriptions that are not described in detail later, you can refer to the previous related detailed descriptions.

[0192] In the present application, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0193] The various technical features of the technical solution of the present application can be arbitrarily combined. In order to make the description concise, not all possible combinations of the various technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of the present application.

[0194] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as above, and includes a number of instructions for a terminal device (which can be a mobile phone, a computer, a server, a controlled terminal, or a network device, etc.) to execute the method of each embodiment of the present application.

[0195] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loading and executing computer program instructions on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. Computer instructions can be stored in a storage medium, or transmitted from one storage medium to another storage medium. For example, computer instructions can be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) mode. The storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integration. Available media can be magnetic media, (e.g., floppy disk, storage disk, tape), optical media (e.g., DVD), or semiconductor media (e.g., solid-state storage disk Solid State Disk (SSD)), etc.

[0196] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A slow traffic path induction method, characterized in that: The slow traffic path induction method comprises: obtaining user travel information; Acquire all travel routes based on the travel information; Calculating the index values ​​of the road traffic environment influencing factors of all the travel routes; The index values ​​are made consistent and dimensionless; Calculate the comprehensive scores of all the travel paths respectively; When there is only one path with the highest score, the path is used as the target travel path; or, When there are at least two paths with the highest scores, the path with the shortest travel time is selected as the target travel path.

2. The slow traffic path induction method according to claim 1, characterized in that: Before the step of obtaining all travel paths based on the travel information, the method includes: Build a slow-moving traffic network; Corresponding road traffic environment influencing factors are added to the road sections in the slow traffic network.

3. The slow traffic path induction method according to claim 2, characterized in that: The step of calculating the index value of the road traffic environment influencing factor of all the travel paths comprises: Determine the factors affecting the road traffic environment for each road section in each travel route; An index value of the road traffic environment influencing factor of each travel route is obtained by calculation based on the road traffic environment influencing factor.

4. The slow traffic path induction method according to any one of claims 1 to 3, characterized in that: The travel information includes at least one of the following: Travel mode, including at least one of: walking, bicycle and electric bicycle; Travel preferences, including at least one of the following: commuting, school, travel, activities, and a combination; Travel time; Address, including: starting address and target address.

5. The slow traffic path induction method according to any one of claims 1 to 3, characterized in that: The index values ​​of the factors affecting the road traffic environment include at least one or more of the following: Length of road; Green-to-signal ratio at intersections; The effective width of roads that meet the standards, including the effective width of sidewalks and non-motorized vehicle lanes that meet the standards; The proportion of road mileage with non-physical isolation of vehicles; Road tree-lined ratio, including: sidewalk tree-lined ratio and non-motorized lane tree-lined ratio; The percentage of road miles with roadside parking; Opening ratio of motor vehicle entrances and exits along the road; The proportion of buses occupying non-motorized vehicle lanes for parking; The number of internet celebrity check-in spots on both sides of the road; Road traffic, including pedestrian traffic and non-motor vehicle traffic.

6. The slow traffic path induction method according to claim 5, characterized in that: The calculation expression of the road effective width compliance rate is as follows: Wherein, β is the road type, and the road type is one of a sidewalk and a non-motorized vehicle lane; is the effective width compliance rate of type β roads in path x; is the mileage of section i that meets the effective width of category β road; L x is the mileage of path x; The calculation expression for the proportion of road mileage with non-physical isolation is as follows: in, is the proportion of road mileage with non-physical isolation for path x; is the mileage of the non-physical isolation section i; L x is the mileage of path x; The calculation expression of the road tree-lined ratio is as follows: Wherein, β is the road type, and the road type is one of a sidewalk and a non-motorized vehicle lane; is the tree-lined ratio of type β roads in path x; is the tree-lined area of ​​the β-type road on section i; is the area of ​​the β-type road on section i; The calculation expression of the road mileage ratio of roadside parking is as follows: Among them, P x is the percentage of road miles with roadside parking in route x; is the mileage of road section i with roadside parking; L x is the mileage of path x; The calculation expression of the opening ratio of motor vehicle entrances and exits along the road is as follows: Among them, E x is the motor vehicle entrance and exit opening ratio of path x; is the number of motor vehicle entrances and exits on road section i; L x is the mileage of path x; The calculation expression for the proportion of buses occupying non-motorized vehicle lanes is as follows: in, is the proportion of buses occupying non-motorized vehicle lanes in route x; is the number of bus stops occupying non-motorized vehicle lanes on road section i; L x is the mileage of path x; The expression for calculating the travel time of each travel path is as follows: Wherein, α is the travel mode, which is one of walking, bicycle and electric bicycle; is the travel time of path x under travel mode α; L i is the mileage of section i; V α is the travel speed of travel mode α; C j is the signal period of signalized intersection j; g j is the green light time of signalized intersection j.

7. The slow traffic path induction method according to any one of claims 1 to 3, characterized in that: The step of performing uniform and dimensionless processing on the index value comprises: Classifying the factors affecting the road traffic environment, wherein the classification includes: positive index classification and negative index classification; The index values ​​of the classified factors affecting the road traffic environment are made consistent and dimensionless; in, The expression for the consistent processing of positive index classification is as follows: The expression for the consistent treatment of negative index classification is as follows: The dimensionless expression is as follows: Among them, V i x is the consistent value of the road traffic environment influencing factor index i in path x; is the value of the road traffic environment influencing factor index i in path x; Max i It is the maximum value of the road traffic environment influencing factor index i among all travel routes; Min i It is the minimum value of the road traffic environment influencing factor index i among all travel routes; is the dimensionless value of the road traffic environment influencing factor index i in path x; n is the number of travel paths.

8. The slow traffic path induction method according to any one of claims 1 to 3, characterized in that: The steps of respectively calculating the comprehensive scores of all the travel paths include: Determine an index value and a corresponding weight of the travel path based on the travel information; A comprehensive score of the travel path is calculated based on the weight and the index value.

9. A computing device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the slow traffic path induction method described in any one of claims 1 to 8.

10. A 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 slow traffic path induction method described in any one of claims 1 to 8 are implemented.