CN118031997A - GIS-based space geographic information service method and device - Google Patents
GIS-based space geographic information service method and device Download PDFInfo
- Publication number
- CN118031997A CN118031997A CN202410450153.XA CN202410450153A CN118031997A CN 118031997 A CN118031997 A CN 118031997A CN 202410450153 A CN202410450153 A CN 202410450153A CN 118031997 A CN118031997 A CN 118031997A
- Authority
- CN
- China
- Prior art keywords
- target
- node
- path
- cost function
- path cost
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000013439 planning Methods 0.000 claims abstract description 67
- 238000012937 correction Methods 0.000 claims abstract description 37
- 230000006583 body weight regulation Effects 0.000 claims abstract description 11
- 238000004422 calculation algorithm Methods 0.000 claims description 15
- 230000001105 regulatory effect Effects 0.000 claims description 4
- 238000000605 extraction Methods 0.000 claims description 3
- 238000013473 artificial intelligence Methods 0.000 abstract description 6
- 238000005516 engineering process Methods 0.000 abstract description 4
- 230000006870 function Effects 0.000 description 145
- 238000004458 analytical method Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000008520 organization Effects 0.000 description 2
- 238000012384 transportation and delivery Methods 0.000 description 2
- 206010063385 Intellectualisation Diseases 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012806 monitoring device Methods 0.000 description 1
- 238000003012 network analysis Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000002265 prevention Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Landscapes
- Traffic Control Systems (AREA)
Abstract
The invention relates to an artificial intelligence technology, and provides a space geographic information service method and device based on GIS, comprising the following steps: acquiring road network data of a target area by using a GIS, and generating area nodes of the target area according to the road network data; generating a shortest path cost function from a starting point to an ending point in the regional node; extracting information characteristics of the real-time traffic information of the collected target area; performing cost correction on the shortest path cost function according to the information characteristics to obtain a multi-condition path cost function; performing weight regulation and control on the multi-condition path cost function according to the path requirement of the target user to obtain a target path cost function; and performing node exploration on the regional nodes according to the target path cost function, generating a target planning path of the target region according to an exploration result of the node exploration and the actual distance acquired in advance, and performing path correction on the original planning path of the target user according to the target planning path. The invention can improve the efficiency of the space geographic information service.
Description
Technical Field
The invention relates to the technical field of artificial intelligence, in particular to a spatial geographic information service method and device based on GIS.
Background
Under the background of digitalization and intellectualization, the application scene of the geographic information is wider and wider, and the geographic information service cannot be effectively used from route planning to traffic management, disaster prevention and emergency management, so that the service efficiency is improved, and the rapidly-growing demands of the fields on the geographic information can be met.
At present, the traditional geographic information collection and updating often depend on periodic ground measurement or satellite remote sensing, the methods are long in time consumption and difficult to realize the requirement of quick response to urban change, meanwhile, the geographic information data processing flow may involve a plurality of departments and links, from data collection, editing and verification to final warehousing, the data are not integrated in real time, each link may introduce time delay, the overall updating speed is slow, and therefore the space geographic information service efficiency is low.
Disclosure of Invention
The invention provides a spatial geographic information service method and device based on GIS, which mainly aim to solve the problem of lower spatial geographic information service efficiency.
In order to achieve the above object, the present invention provides a spatial geographic information service method based on GIS, including:
acquiring road network data of a target area by using a GIS, and generating area nodes of the target area according to the road network data;
Generating a shortest path cost function from a starting point in the area node to an ending point in the area node;
Collecting real-time traffic information of the target area, and extracting information characteristics of the real-time traffic information;
Performing cost correction on the shortest path cost function according to the information characteristics to obtain a multi-condition path cost function of the target area;
And performing weight regulation and control on the multi-condition path cost function according to the path requirement of a target user to obtain a target path cost function of the target area, wherein the target path cost function is as follows: Wherein, Is a target path cost function of the target region,/>Is the total number of demands of the path demands,/>Is a requirement identification of the path requirement,/>Is a target node in the area node,/>Is/>The corresponding demand weight of the path demand is calculated by the method of the name of the pathIs/>A multi-condition path cost function corresponding to the path demand is generated;
And performing node exploration on the regional nodes according to the target path cost function, generating a target planning path of the target region according to an exploration result of the node exploration and a pre-acquired actual distance, and performing path correction on an original planning path of the target user according to the target planning path.
Optionally, the generating the area node of the target area according to the road network data includes:
generating a directed graph of the target area according to the road network data;
And determining the area node of the target area according to the directed graph.
Optionally, the generating a shortest path cost function from a start point in the area node to an end point in the area node includes:
Determining the actual distance from a starting point in the regional node to a target node in the regional node according to the road network data, and determining the actual distance as the actual cost from the starting point to the target node;
Generating an estimated distance from a target node in the area node to an end point in the area node by using a preset distance algorithm, wherein the preset distance algorithm is as follows: wherein/> Is the estimated distance of the target node to the endpoint,/>Is the node coordinates of the target node,/>Is the endpoint coordinates of the endpoint;
determining the estimated cost from the target node to the end point according to the estimated distance, and generating a shortest path cost function from the start point to the end point by using a preset shortest path cost function, the actual cost and the estimated cost, wherein the preset shortest path cost function is as follows: wherein/> Is the shortest path cost function from the start point to the end point,/>Is the actual cost of starting in the region node to the target node,/>Is the estimated cost of the target node to the endpoint in the region node,/>Is the target node.
Optionally, the extracting the information feature of the real-time traffic information includes:
Generating a road congestion value, a traffic flow and an average vehicle speed of the target area according to the real-time traffic information;
and collecting the road congestion value, the traffic flow and the average vehicle speed as information characteristics of the real-time traffic information.
Optionally, the performing cost correction on the shortest path cost function according to the information feature to obtain a multi-condition path cost function of the target area includes:
generating an adjusting factor of a shortest path cost function according to the information characteristics;
and carrying out cost correction on the shortest path cost function according to the adjustment factor to obtain a multi-condition path cost function of the target area.
Optionally, the performing cost correction on the shortest path cost function according to the adjustment factor to obtain a multi-condition path cost function of the target area includes:
And carrying out cost correction on the shortest path cost function according to the adjustment factors and the information characteristics to obtain a multi-condition path cost function of the target area, wherein the multi-condition path cost function is as follows: wherein/> Is a multi-conditional path cost function of the target region,/>Is the actual cost of starting in the region node to the target node,/>Is the estimated cost of the target node in the region node to the endpoint,/>Is the target node,/>Is a congestion value of the road in the information feature,/>Is the traffic flow in the information feature,/>Is the average vehicle speed in the information feature,/>Is the adjusting factor corresponding to the congestion value of the road,/>Is the regulating factor corresponding to the traffic flow,/>Is an adjustment factor corresponding to the average vehicle speed.
Optionally, the performing weight adjustment and control on the multi-condition path cost function according to the path requirement of the target user to obtain a target path cost function of the target area, including:
Determining the path requirement of the target user;
generating a dynamic weight array of the path requirements;
And carrying out weight regulation and control on the multi-condition path cost function according to the dynamic weight array to obtain a target path cost function of the target area.
Optionally, the node exploration is performed on the area node according to the target path cost function, and a target planning path of the target area is generated according to an exploration result of the node exploration and a pre-acquired actual distance, including:
generating estimated cost of a target node in the regional node and an end point in the regional node;
selecting nodes in a preset open list according to the estimated cost and the target path cost function to obtain selected nodes;
and performing node matching on the selected node and the target node, and generating a target planning path of the target area according to a matching result of the node matching and a pre-acquired actual distance.
Optionally, the node matching is performed on the selected node and the target node, and a target planning path of the target area is generated according to a matching result of the node matching and a pre-acquired actual distance, including:
When the selected node is matched with the target node, determining the selected node as the target node, and generating a target planning path of the target area according to the target node and a pre-acquired actual distance;
When the selected node is not matched with the target node, determining an adjacent node corresponding to the selected node, generating an actual cost from the starting point to the adjacent node through the selected node, and generating a target planning path of the target area according to the actual cost, the adjacent node and a pre-acquired actual distance.
In order to solve the above problems, the present invention further provides a spatial geographic information service device based on GIS, the device comprising:
The regional node generation module is used for acquiring road network data of a target region by utilizing the GIS and generating regional nodes of the target region according to the road network data;
The shortest path cost function generation module is used for generating a shortest path cost function from a starting point in the area node to an ending point in the area node;
The information feature extraction module is used for collecting real-time traffic information of the target area and extracting information features of the real-time traffic information;
The multi-condition path cost function generation module is used for carrying out cost correction on the shortest path cost function according to the information characteristics to obtain a multi-condition path cost function of the target area;
The target path cost function generation module is used for carrying out weight regulation and control on the multi-condition path cost function according to the path requirement of a target user to obtain a target path cost function of the target area, wherein the target path cost function is as follows: wherein/> Is a target path cost function of the target region,/>Is the total number of demands of the path demands,/>Is a requirement identification of the path requirement,/>Is a target node in the area node,/>Is/>The corresponding demand weight of the path demand is calculated by the method of the name of the pathIs/>A multi-condition path cost function corresponding to the path demand is generated;
And the path correction module is used for carrying out node exploration on the regional nodes according to the target path cost function, generating a target planning path of the target region according to the exploration result of the node exploration and the pre-acquired actual distance, and carrying out path correction on the original planning path of the target user according to the target planning path.
According to the embodiment of the invention, the geographical information is converted into the digitized data, so that the representation of the space information is more accurate and standardized, the knowledge representation mode is beneficial to more rapid and accurate space analysis and decision support, the GIS can generate the multi-condition path cost function by collecting the real-time traffic information and combining the road network data, the feasibility of predicting the travel time and the route is more accurately facilitated, the efficiency and the accuracy of path planning are improved, the GIS allows the weight regulation and control on the multi-condition path cost function according to the path requirement of the target user, the finally generated target path cost function is more suitable for the actual requirement of the user, more personalized service is provided, meanwhile, the node exploration is carried out in the regional nodes, the target planning path is generated according to the exploration result and the actual distance, the original planning path of the user is further corrected, and the real-time property and the accuracy of path planning are ensured by the dynamic adjustment mechanism.
Drawings
FIG. 1 is a schematic flow chart of a GIS-based spatial geographic information service method according to an embodiment of the present invention;
Fig. 2 is a functional block diagram of a spatial geographic information service device based on GIS according to an embodiment of the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The embodiment of the application provides a spatial geographic information service method based on GIS. The GIS-based spatial geographic information service method can be executed by software or hardware installed on terminal equipment or server equipment, and the software can be a blockchain platform. The service end includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like. The server may be an independent server, or may be a cloud server that provides cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (Content Delivery Network, CDN), and basic cloud computing services such as big data and artificial intelligence platforms.
Referring to fig. 1, a flowchart of a spatial geographic information service method based on GIS according to an embodiment of the present invention is shown. In this embodiment, the spatial geographic information service method based on GIS includes:
S1, acquiring road network data of a target area by utilizing a GIS, and generating area nodes of the target area according to the road network data.
In an embodiment of the present invention GIS (Geographic Information System) is a computer technology based geographic information system for capturing, storing, querying, analyzing and displaying geographic data that combines geospatial information with attribute data so that a user can effectively manage, analyze and visualize the geographic information.
In detail, the obtaining the road network data of the target area by using the GIS includes: and connecting various data sources by using GIS software (such as ArcGIS, QGIS and the like), importing or downloading map data of a target area, preprocessing the acquired map data, including data cleaning, format conversion, space reference system matching and the like, so as to obtain road network data of the target area, and ensuring the integrity, accuracy and consistency of the road network data for subsequent analysis and application.
In an embodiment of the present invention, the generating, according to the road network data, the area node of the target area includes:
generating a directed graph of the target area according to the road network data;
And determining the area node of the target area according to the directed graph.
In detail, using the provided road network data, a directed graph of a target area is first generated, the directed graph being a graph structure composed of vertices (nodes) representing intersections or road endpoints in the road network and edges representing road segments connecting the two vertices and having directionality.
Further, the directed graph may be expressed in the form of: wherein/> Is a directed graph of the target region,/>Is a set of nodes in the directed graph,/>Is the set of edges of the directed graph.
In detail, the area nodes may be intersections located inside the target area or intersections adjacent to the boundary of the target area, or vertices in the directed graph may be screened and marked according to a specific algorithm or rule to determine which nodes belong to the target area.
In detail, area nodes of the target area may be generated from the provided road network data, which will play an important role in subsequent road network analysis and path planning.
S2, generating a shortest path cost function from the starting point in the regional node to the ending point in the regional node.
In the embodiment of the present invention, the generating the shortest path cost function from the starting point in the area node to the ending point in the area node includes:
Determining the actual distance from a starting point in the regional node to a target node in the regional node according to the road network data, and determining the actual distance as the actual cost from the starting point to the target node;
Generating an estimated distance from a target node in the area node to an end point in the area node by using a preset distance algorithm, wherein the preset distance algorithm is as follows: wherein/> Is the estimated distance of the target node to the endpoint,/>Is the node coordinates of the target node,/>Is the endpoint coordinates of the endpoint;
determining the estimated cost from the target node to the end point according to the estimated distance, and generating a shortest path cost function from the start point to the end point by using a preset shortest path cost function, the actual cost and the estimated cost, wherein the preset shortest path cost function is as follows: wherein/> Is the shortest path cost function from the start point to the end point,/>Is the actual cost of starting in the region node to the target node,/>Is the estimated cost of the target node to the endpoint in the region node,/>Is the target node.
In detail, the area node refers to an intersection or a road endpoint located in the target area or adjacent to the boundary of the target area; the actual distance refers to the actual geographic distance between two regional nodes, namely the actual path length between two points in the road network; the estimated distance is the estimated distance between the target node and the end point calculated according to a preset distance algorithm, and is generally used for heuristic search in a path planning algorithm.
In detail, the shortest path cost function is used to evaluate the cost of a path passing through a certain node from a start point to an end point, and is typically composed of an actual cost and an estimated cost.
In detail, the actual distance from the origin to the target node is calculated from the road network data, which can be obtained by calculating the road length between the two points or by measuring using an actual navigation tool, in order to determine the actual cost from the origin to the target node.
In detail, the estimated distance from the target node to the end point is calculated using a preset distance algorithm, in this example, a euclidean distance algorithm is used, and the linear distance between the two points is calculated according to the coordinates of the target node and the end point, so as to determine the estimated cost from the target node to the end point.
In detail, the actual cost and the estimated cost are combined by using a preset shortest path cost function, and the shortest path cost function from the start point to the end point is calculated, typically by adding the actual cost and the estimated cost, so as to evaluate the path cost from the start point to the end point through the target node.
In detail, assuming that there is road network data of a city, the starting point is a, the end point is B, the target node is C, the actual distance from a to C is 10 km according to the actual distance, the estimated distance from C to B is 8 km according to the preset distance algorithm, and the shortest path cost function value from a to B through C according to the preset shortest path cost function is:
s3, collecting real-time traffic information of the target area, and extracting information characteristics of the real-time traffic information.
In an embodiment of the present invention, the collecting real-time traffic information of the target area includes: and collecting real-time traffic information of the target area through traffic monitoring equipment or a third party service.
In detail, the traffic monitoring device refers to a device for monitoring and collecting traffic information, such as a traffic camera, a vehicle sensor, a traffic flow detector, etc.; a third party service refers to an independent organization or organization that provides traffic information data or related services, such as traffic applications, traffic data providers, and the like.
In an embodiment of the present invention, the extracting information features of the real-time traffic information includes:
Generating a road congestion value, a traffic flow and an average vehicle speed of the target area according to the real-time traffic information;
and collecting the road congestion value, the traffic flow and the average vehicle speed as information characteristics of the real-time traffic information.
In detail, the road congestion value is an index for measuring the congestion degree of the road, and is usually calculated based on data such as traffic flow, vehicle speed and the like; the traffic flow refers to the number of vehicles passing through a certain road section in unit time, and is an important index for measuring traffic flow density; average speed refers to the average speed of all vehicles on a road segment and is commonly used to evaluate the smoothness of traffic.
In detail, generating the road congestion value, the traffic flow, and the average vehicle speed of the target area according to the real-time traffic information refers to extracting required specific information or characteristics, such as the road congestion value, the traffic flow, and the average vehicle speed, from raw data or information.
In detail, the information features that the road congestion value, the traffic flow and the average vehicle speed are the real-time traffic information are integrated or combined together to form a complete data set or information set.
In detail, according to the acquired real-time traffic information, information characteristics such as congestion values, traffic flows, average vehicle speeds and the like of all roads in a target area are calculated, and the information characteristics can be realized through a data processing and analysis algorithm, so that the characteristics with representativeness and usability are extracted from mass data.
It is assumed that in one city, the traffic monitoring cameras and the third party traffic data service are used to collect real-time traffic information in a certain area, and information features such as congestion values, traffic flows, average vehicle speeds and the like of all roads in the area are extracted through data processing and analysis, for example, the congestion value of a certain trunk road is high, the traffic flows are 500 vehicles per hour, the average vehicle speed is 30 km/h, and the features are collected to form complete real-time traffic information, so that the traffic information can be used for road condition prediction.
And S4, carrying out cost correction on the shortest path cost function according to the information characteristics to obtain a multi-condition path cost function of the target area.
In the embodiment of the present invention, the performing cost correction on the shortest path cost function according to the information feature to obtain a multi-condition path cost function of the target area includes:
generating an adjusting factor of a shortest path cost function according to the information characteristics;
and carrying out cost correction on the shortest path cost function according to the adjustment factor to obtain a multi-condition path cost function of the target area.
In detail, the generation of the adjustment factor of the shortest path cost function according to the information features refers to generation of a corresponding adjustment factor according to features such as a road congestion value, a traffic flow and an average vehicle speed in real-time traffic information, so as to adjust weights of all items in the shortest path cost function according to the features.
In detail, the cost correction is performed on the shortest path cost function according to the adjustment factor, and obtaining the multi-condition path cost function of the target area refers to performing cost correction on the original shortest path cost function according to the generated adjustment factor, which includes adjusting weights of corresponding items in the cost function according to information features such as a road congestion value, a traffic flow and an average speed so as to reflect influence of traffic conditions on path selection, and after the cost correction, the generated multi-condition path cost function can take the influence of traffic information features into consideration, so that the cost of a path can be estimated more accurately, and the multi-condition path cost function can be used in applications such as path planning so as to obtain more proper path selection.
In detail, the performing cost correction on the shortest path cost function according to the adjustment factor to obtain a multi-condition path cost function of the target area includes:
And carrying out cost correction on the shortest path cost function according to the adjustment factors and the information characteristics to obtain a multi-condition path cost function of the target area, wherein the multi-condition path cost function is as follows: wherein/> Is a multi-conditional path cost function of the target region,/>Is the actual cost of starting in the region node to the target node,/>Is the estimated cost of the target node in the region node to the endpoint,/>Is the target node,/>Is a congestion value of the road in the information feature,/>Is the traffic flow in the information feature,/>Is the average vehicle speed in the information feature,/>Is the adjusting factor corresponding to the congestion value of the road,/>Is the regulating factor corresponding to the traffic flow,/>Is an adjustment factor corresponding to the average vehicle speed.
In detail, the multi-condition path cost function adjustment factor may be dynamically adjusted according to historical data, user preferences, or real-time traffic conditions in order to find an optimal path. For example, if a user prefers to avoid traffic congestion, the adjustment factor for the road congestion value may be set relatively high to increase the cost of congested road segments. Also, if the user wishes to avoid traveling on a road segment with a large traffic volume, the user is correspondingly turned up. If the user is concerned with the speed of travel, it is adjusted to reflect this.
In detail, the shortest path cost function is a function for determining the shortest path from a starting point to a target node, and generally consists of an actual cost and an estimated cost; the adjusting factors are used for adjusting the weights of all items in the shortest path cost function so as to carry out cost correction according to different conditions; the multi-condition path cost function includes path cost functions of a plurality of conditions for evaluating the cost of the path, for example, considering information features such as the degree of congestion of the road, the flow rate of the vehicle, and the average speed of the vehicle.
In detail, it is assumed that a shortest path from the place A to the place B needs to be planned in one city, but in consideration of traffic congestion, information features such as a road congestion value, traffic flow, average speed and the like are introduced, corresponding adjustment factors are obtained through calculation according to real-time traffic information, then, according to the adjustment factors, cost correction is carried out on an original shortest path cost function, the influence of the traffic information features is considered, and finally, the obtained multi-condition path cost function can better reflect actual traffic conditions, so that a more suitable path planning result is obtained.
In detail, the multi-condition path cost function consists of actual cost, estimated cost and a plurality of traffic information characteristics, the influence of the factors on the path cost is comprehensively considered through the adjusting factors, so that more reasonable path selection is realized, and each item in the function forms the basic structure of the multi-condition path cost function, so that the multi-condition path cost function has the characteristics of strong adaptability, high accuracy and the like.
And S5, performing weight regulation and control on the multi-condition path cost function according to the path demand of the target user to obtain a target path cost function of the target region.
In the embodiment of the present invention, the weight adjustment and control are performed on the multi-condition path cost function according to the path requirement of the target user, so as to obtain the target path cost function of the target area, including:
Determining the path requirement of the target user;
generating a dynamic weight array of the path requirements;
And carrying out weight regulation and control on the multi-condition path cost function according to the dynamic weight array to obtain a target path cost function of the target area.
In detail, the path requirement of the target user refers to the specific requirement of the user when planning the path, such as shortest path, fastest arrival time, congestion avoidance, etc.; the dynamic weight array is an array containing a plurality of weight values, and the weight values are dynamically adjusted according to the path requirements of the target user and are used for adjusting the weights of various items in the multi-condition path cost function.
In detail, the multi-condition path cost function is a function for evaluating path cost from a start point to a target node, including: an actual cost, an estimated cost, and a plurality of traffic information characteristics.
In detail, the target path cost function is a path cost function regulated according to the path requirement of the target user and the dynamic weight array, and is used for evaluating the path cost from the starting point to the end point, and reflecting the specific path requirement focused by the user.
In detail, the performing weight adjustment and control on the multi-condition path cost function according to the dynamic weight array refers to adjusting weights of each item in the multi-condition path cost function according to the dynamic weight array to meet the path planning requirement of the user to the greatest extent, for example: and giving higher weight to factors which are more focused by the user so as to obtain a target path cost function which meets the requirements of the user.
In detail, the path planning requirement of the user is acquired through a user interface, user input or system setting and other modes, for example: the user wants to reach the destination quickly, avoid congestion, etc.
In detail, assuming that the user a wishes to pay more attention to avoiding traffic congestion when planning a path, and the user B pays more attention to the shortest driving distance, the service platform generates a dynamic weight array according to the demands of the user a and the user B, so that the traffic congestion factor is higher in the weight array of the user a and lower in the weight array of the user B, then adjusts each weight in the multi-condition path cost function according to the dynamic weight arrays to obtain target path cost functions corresponding to the user a and the user B, finally, performs path planning according to the demands of the user, selects an optimal path, considers the preference of the user in the navigation process, and provides personalized navigation service.
In detail, it is necessary to know the needs and preferences of the target user for the path, which may include shortest time, shortest distance, least traffic congestion, etc., which will affect how to adjust the cost function.
Further, based on the path requirements of the target user, a dynamic weight array may be generated, where the array includes weights for different factors, and the weights may be adjusted according to real-time information, for example: if the traffic conditions are poor, the weight of the traffic jam may be increased; if the user is more concerned about time than distance, the weight of distance may be reduced.
Further, the multi-conditional path cost function is adjusted using a dynamic weight array, which means that the cost of each factor is multiplied by its corresponding weight and then added to get the total cost, so that the path planning result can be optimized according to the path requirements of the user.
In detail, the objective path cost function is: wherein/> Is a target path cost function of the target region,/>Is the total number of demands of the path demands,/>Is a requirement identification of the path requirement,/>Is a target node in the area node,/>Is/>The corresponding demand weight of the path demand is calculated by the method of the name of the pathIs/>And a multi-condition path cost function corresponding to the path demand.
In detail, the objective path cost function integrates the evaluation of multiple path demands, and the final path cost evaluation value is obtained by a weighted summation mode, so that the objective path cost function has the advantage that multiple demands of users can be considered, and the path planning is more in accordance with the expectations of the users.
In detail, the objective path cost function is a function for evaluating the path quality, which combines a plurality of path demands and corresponding weights to calculate the total cost of a node, and the meaning of the function is that it allows us to evaluate the total cost of a path according to different path demands (such as shortest time, shortest distance, least traffic jam, etc.) and the relative importance (weight) of the demands, and in practical applications such as path planning of an automatic driving vehicle, such a function can help to select an optimal driving route to meet the specific requirements of users while considering road conditions and traffic rules.
Further, since different users may have different demands on the path planning, the weight is adjustedPersonalized path planning may be implemented, for example, some users may be more concerned with avoiding congestion, while other users may be more concerned with saving time or distance.
In detail, if the user changes the demand of the path planning under different time or different situations, the user only needs to adjust the corresponding weight, and does not need to redesign the whole path planning algorithm.
In detail, since the objective path cost function can be dynamically adjusted according to the needs of the user, the objective path cost function can be used in a real-time path planning system to carry out path planning according to the needs of the user changing in real time.
And S6, performing node exploration on the regional nodes according to the target path cost function, generating a target planning path of the target region according to the exploration result of the node exploration and the actual distance acquired in advance, and performing path correction on the original planning path of the target user according to the target planning path.
In the embodiment of the present invention, the node exploration is performed on the area node according to the target path cost function, and a target planning path of the target area is generated according to an exploration result of the node exploration and a pre-acquired actual distance, including:
generating estimated cost of a target node in the regional node and an end point in the regional node;
selecting nodes in a preset open list according to the estimated cost and the target path cost function to obtain selected nodes;
and performing node matching on the selected node and the target node, and generating a target planning path of the target area according to a matching result of the node matching and a pre-acquired actual distance.
In detail, node exploration refers to searching and exploring regional nodes to find an optimal path in a path planning process; the open list is used for storing the nodes to be explored, and the list for selecting the nodes is carried out according to a certain rule.
In detail, node matching refers to comparing a selected node with a target node to determine whether to match or not, and then determining the next step of path planning, wherein an urban road network is assumed, the starting point is A, the end point is B, and if the selected node is matched with the target node B, a planned path is directly generated; if the nodes are not matched, determining adjacent nodes of the selected nodes, calculating actual cost, and then continuing node selection and matching until a target node is found or an end point is reached.
In detail, the step of performing node matching on the selected node and the target node, and generating a target planning path of the target area according to a matching result of the node matching and a pre-acquired actual distance includes:
When the selected node is matched with the target node, determining the selected node as the target node, and generating a target planning path of the target area according to the target node and a pre-acquired actual distance;
When the selected node is not matched with the target node, determining an adjacent node corresponding to the selected node, generating an actual cost from the starting point to the adjacent node through the selected node, and generating a target planning path of the target area according to the actual cost, the adjacent node and a pre-acquired actual distance.
In detail, in the path exploration process, it is required to determine whether the currently selected node is a target node, and if the selected node matches with the target node, that is, the selected node is the target node, a planned path may be generated based on information between the node and the starting point.
Further, if the selected node is a target node, a planned path from the starting point to the target node is generated by directly utilizing the pre-acquired actual distance information and combining the target node.
In detail, if the pick node is not the target node, it is necessary to find nodes adjacent to the pick node, which may be potential paths to the target node, for each of the adjacent nodes, calculate the actual costs (which typically involve cumulative costs, such as time, distance, etc.) from the start point through the pick node to the adjacent node, and then update the planned path based on these actual costs and the locations of the adjacent nodes, as well as the actual distances previously obtained.
In an embodiment of the present invention, the performing, according to the target planned path, path correction on the original planned path of the target user includes: comparing the original planning path of the target user with the target planning path to determine a path difference; and carrying out path correction on the original planning path according to the path difference to obtain the optimal planning path of the target user.
In detail, the path comparison refers to comparing the target planned path with the original planned path, and finding out the difference between the two paths, for example: route direction, route length, transit time, etc.
In detail, the path correction refers to adjusting or modifying the original planned path according to the result of the path comparison so as to make the original planned path closer to or conform to the target planned path.
In detail, the optimal planning path refers to an optimal or most appropriate path planning result obtained by considering real-time traffic information and user personalized requirements.
In detail, it is assumed that the original planned path of the user a passes from the point a to the point B through the point C, but the target planned path passes from the point a to the point B according to the real-time traffic information and the requirement of the user a, and at this time, the path comparison result is that there is a difference between the original planned path and the target planned path between the point C and the point D, and then, the original planned path is corrected according to the difference, so that the user a is redirected from the point C to the point D, thereby obtaining the optimal planned path of the user a.
According to the embodiment of the invention, the geographical information is converted into the digitized data, so that the representation of the space information is more accurate and standardized, the knowledge representation mode is beneficial to more rapid and accurate space analysis and decision support, the GIS can generate the multi-condition path cost function by collecting the real-time traffic information and combining road network data, the feasibility of predicting the travel time and the route is more accurately facilitated, the efficiency and the accuracy of path planning are improved, the GIS allows the weight regulation and control on the multi-condition path cost function according to the path requirement of the target user, the finally generated target path cost function is more suitable for the actual requirement of the user, more personalized service is provided, meanwhile, the node exploration is carried out in the regional nodes, the target planning path is generated according to the exploration result and the actual distance, the original planning path of the user is further corrected, and the real-time and the accuracy of path planning are ensured by the dynamic adjustment mechanism.
Fig. 2 is a functional block diagram of a spatial geographic information service device based on GIS according to an embodiment of the present invention.
The spatial geographic information service device 100 based on GIS can be installed in electronic equipment. Depending on the implementation function, the GIS-based spatial geographic information service apparatus 100 may include an area node generating module 101, a shortest path cost function generating module 102, an information feature extracting module 103, a multi-condition path cost function generating module 104, a target path cost function generating module 105, and a path correcting module 106. The module of the invention, which may also be referred to as a unit, refers to a series of computer program segments, which are stored in the memory of the electronic device, capable of being executed by the processor of the electronic device and of performing a fixed function.
In the present embodiment, the functions concerning the respective modules/units are as follows:
The regional node generating module 101 is configured to obtain road network data of a target region by using a GIS, and generate a regional node of the target region according to the road network data;
the shortest path cost function generating module 102 is configured to generate a shortest path cost function from a start point in the area node to an end point in the area node;
The information feature extraction module 103 is configured to collect real-time traffic information of the target area, and extract information features of the real-time traffic information;
the multi-condition path cost function generating module 104 is configured to perform cost correction on the shortest path cost function according to the information feature, so as to obtain a multi-condition path cost function of the target area;
The target path cost function generating module 105 is configured to perform weight adjustment and control on the multi-condition path cost function according to a path requirement of a target user, so as to obtain a target path cost function of the target area, where the target path cost function is: wherein/> Is a target path cost function of the target region,/>Is the total number of demands of the path demands,/>Is a requirement identification of the path requirement,/>Is a target node of the area nodes,Is/>The corresponding demand weight of the path demand is calculated by the method of the name of the pathIs/>A multi-condition path cost function corresponding to the path demand is generated;
The path correction module 106 is configured to perform node exploration on the area node according to the target path cost function, generate a target planned path of the target area according to an exploration result of the node exploration and a pre-acquired actual distance, and perform path correction on an original planned path of the target user according to the target planned path.
In detail, each module in the GIS-based spatial geographic information service device 100 in the embodiment of the present invention adopts the same technical means as the GIS-based spatial geographic information service method described in fig. 1, and can produce the same technical effects, which are not described herein.
In the several embodiments provided by the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is merely a logical function division, and there may be other manners of division when actually implemented.
The modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units can be realized in a form of hardware or a form of hardware and a form of software functional modules.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof.
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, encryption algorithm and the like. The blockchain (Blockchain), essentially a de-centralized database, is a string of data blocks that are generated in association using cryptographic methods, each of which contains information from a batch of network transactions for verifying the validity (anti-counterfeit) of its information and generating the next block. The blockchain may include a blockchain underlying platform, a platform product services layer, an application services layer, and the like.
The embodiment of the application can acquire and process the related data based on the artificial intelligence technology. Wherein artificial intelligence (ARTIFICIAL INTELLIGENCE, AI) is the theory, method, technique, and application system that uses a digital computer or a digital computer-controlled machine to simulate, extend, and expand human intelligence, sense the environment, acquire knowledge, and use knowledge to obtain optimal results.
Finally, it should be noted that the above-mentioned embodiments are merely for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made to the technical solution of the present invention without departing from the spirit and scope of the technical solution of the present invention.
Claims (10)
1. A spatial geographic information service method based on a GIS, the method comprising:
acquiring road network data of a target area by using a GIS, and generating area nodes of the target area according to the road network data;
Generating a shortest path cost function from a starting point in the area node to an ending point in the area node;
Collecting real-time traffic information of the target area, and extracting information characteristics of the real-time traffic information;
Performing cost correction on the shortest path cost function according to the information characteristics to obtain a multi-condition path cost function of the target area;
And performing weight regulation and control on the multi-condition path cost function according to the path requirement of a target user to obtain a target path cost function of the target area, wherein the target path cost function is as follows: wherein/> Is a target path cost function of the target region,/>Is the total number of demands of the path demands,/>Is a requirement identification of the path requirement,/>Is a target node in the area node,/>Is/>The corresponding demand weight of the path demand is calculated by the method of the name of the pathIs/>A multi-condition path cost function corresponding to the path demand is generated;
And performing node exploration on the regional nodes according to the target path cost function, generating a target planning path of the target region according to an exploration result of the node exploration and a pre-acquired actual distance, and performing path correction on an original planning path of the target user according to the target planning path.
2. The GIS-based spatial geographic information service method according to claim 1, wherein the generating the region node of the target region according to the road network data comprises:
generating a directed graph of the target area according to the road network data;
And determining the area node of the target area according to the directed graph.
3. The GIS-based spatial geographic information service method according to claim 1, wherein said generating a shortest path cost function from a start point in said area node to an end point in said area node comprises:
Determining the actual distance from a starting point in the regional node to a target node in the regional node according to the road network data, and determining the actual distance as the actual cost from the starting point to the target node;
Generating an estimated distance from a target node in the area node to an end point in the area node by using a preset distance algorithm, wherein the preset distance algorithm is as follows: wherein/> Is the estimated distance of the target node to the endpoint,/>Is the node coordinates of the target node,/>Is the endpoint coordinates of the endpoint;
determining the estimated cost from the target node to the end point according to the estimated distance, and generating a shortest path cost function from the start point to the end point by using a preset shortest path cost function, the actual cost and the estimated cost, wherein the preset shortest path cost function is as follows: wherein/> Is the shortest path cost function from the start point to the end point,/>Is the actual cost of starting in the region node to the target node,/>Is the estimated cost of the target node to the endpoint in the region node,/>Is the target node.
4. The GIS-based spatial geographic information service method according to claim 1, wherein said extracting information features of the real-time traffic information comprises:
Generating a road congestion value, a traffic flow and an average vehicle speed of the target area according to the real-time traffic information;
and collecting the road congestion value, the traffic flow and the average vehicle speed as information characteristics of the real-time traffic information.
5. The GIS-based spatial geographic information service method according to claim 1, wherein performing cost correction on the shortest path cost function according to the information feature to obtain a multi-condition path cost function of the target area comprises:
generating an adjusting factor of a shortest path cost function according to the information characteristics;
and carrying out cost correction on the shortest path cost function according to the adjustment factor to obtain a multi-condition path cost function of the target area.
6. The GIS-based spatial geographic information service method according to claim 5, wherein performing cost correction on the shortest path cost function according to the adjustment factor to obtain a multi-condition path cost function of the target area comprises:
And carrying out cost correction on the shortest path cost function according to the adjustment factors and the information characteristics to obtain a multi-condition path cost function of the target area, wherein the multi-condition path cost function is as follows: wherein/> Is a multi-conditional path cost function of the target region,/>Is the actual cost of starting in the region node to the target node,/>Is the estimated cost of the target node in the region node to the endpoint,/>Is the target node,/>Is a congestion value of the road in the information feature,/>Is the traffic flow in the information feature,/>Is the average vehicle speed in the information feature,/>Is the adjusting factor corresponding to the congestion value of the road,/>Is the regulating factor corresponding to the traffic flow,/>Is an adjustment factor corresponding to the average vehicle speed.
7. The GIS-based spatial geographic information service method according to claim 1, wherein the performing weight adjustment and control on the multi-condition path cost function according to the path requirement of the target user to obtain the target path cost function of the target area comprises:
Determining the path requirement of the target user;
generating a dynamic weight array of the path requirements;
And carrying out weight regulation and control on the multi-condition path cost function according to the dynamic weight array to obtain a target path cost function of the target area.
8. The GIS-based spatial geographic information service method according to claim 1, wherein the performing node exploration on the regional node according to the target path cost function, and generating the target planned path of the target region according to the exploration result of the node exploration and a pre-acquired actual distance, comprises:
generating estimated cost of a target node in the regional node and an end point in the regional node;
selecting nodes in a preset open list according to the estimated cost and the target path cost function to obtain selected nodes;
and performing node matching on the selected node and the target node, and generating a target planning path of the target area according to a matching result of the node matching and a pre-acquired actual distance.
9. The GIS-based spatial geographic information service method according to claim 8, wherein the performing node matching between the selected node and the target node, and generating the target planning path of the target area according to the matching result of the node matching and the pre-acquired actual distance, comprises:
When the selected node is matched with the target node, determining the selected node as the target node, and generating a target planning path of the target area according to the target node and a pre-acquired actual distance;
When the selected node is not matched with the target node, determining an adjacent node corresponding to the selected node, generating an actual cost from the starting point to the adjacent node through the selected node, and generating a target planning path of the target area according to the actual cost, the adjacent node and a pre-acquired actual distance.
10. A GIS-based spatial geographic information service apparatus, the apparatus comprising:
The regional node generation module is used for acquiring road network data of a target region by utilizing the GIS and generating regional nodes of the target region according to the road network data;
The shortest path cost function generation module is used for generating a shortest path cost function from a starting point in the area node to an ending point in the area node;
The information feature extraction module is used for collecting real-time traffic information of the target area and extracting information features of the real-time traffic information;
The multi-condition path cost function generation module is used for carrying out cost correction on the shortest path cost function according to the information characteristics to obtain a multi-condition path cost function of the target area;
The target path cost function generation module is used for carrying out weight regulation and control on the multi-condition path cost function according to the path requirement of a target user to obtain a target path cost function of the target area, wherein the target path cost function is as follows: wherein/> Is a target path cost function of the target region,/>Is the total number of demands of the path demands,/>Is a requirement identification of the path requirement,/>Is a target node in the area node,/>Is/>The corresponding demand weight of the path demand is calculated by the method of the name of the pathIs/>A multi-condition path cost function corresponding to the path demand is generated;
And the path correction module is used for carrying out node exploration on the regional nodes according to the target path cost function, generating a target planning path of the target region according to the exploration result of the node exploration and the pre-acquired actual distance, and carrying out path correction on the original planning path of the target user according to the target planning path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410450153.XA CN118031997B (en) | 2024-04-15 | 2024-04-15 | GIS-based space geographic information service method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410450153.XA CN118031997B (en) | 2024-04-15 | 2024-04-15 | GIS-based space geographic information service method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118031997A true CN118031997A (en) | 2024-05-14 |
| CN118031997B CN118031997B (en) | 2024-07-12 |
Family
ID=90991648
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410450153.XA Active CN118031997B (en) | 2024-04-15 | 2024-04-15 | GIS-based space geographic information service method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118031997B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103994768A (en) * | 2014-05-23 | 2014-08-20 | 北京交通大学 | Method for seeking for overall situation time optimal path under dynamic time varying environment |
| CN113029176A (en) * | 2021-03-19 | 2021-06-25 | 重庆长安新能源汽车科技有限公司 | Multi-level experience-oriented optimal charging path planning method for electric vehicle |
| CN114450556A (en) * | 2019-08-31 | 2022-05-06 | 华为技术有限公司 | Path planning method and device |
| CN114518755A (en) * | 2022-01-28 | 2022-05-20 | 福思(杭州)智能科技有限公司 | Global path planning method, device, equipment and storage medium |
| CN115112136A (en) * | 2021-03-23 | 2022-09-27 | 腾讯科技（深圳）有限公司 | Travel path planning method and travel path recommendation method |
| CN115493606A (en) * | 2022-08-25 | 2022-12-20 | 江苏电力信息技术有限公司 | Optimal path selection method of power grid maintenance grid work order based on map |
| CN116067383A (en) * | 2021-10-29 | 2023-05-05 | 博泰车联网科技(上海)股份有限公司 | Multi-terminal navigation method, device and vehicle |
| WO2023174080A1 (en) * | 2022-03-16 | 2023-09-21 | 宇通客车股份有限公司 | Path planning method and apparatus, and cloud platform |
| CN116878532A (en) * | 2023-07-17 | 2023-10-13 | 中国电信股份有限公司技术创新中心 | Path planning method and device for mobile object and related equipment |
| CN117367433A (en) * | 2023-11-16 | 2024-01-09 | 浙江省交通运输科学研究院 | Low-altitude unmanned aerial vehicle path planning method and device, unmanned aerial vehicle and readable storage medium |
| CN117606507A (en) * | 2023-12-14 | 2024-02-27 | 奇瑞新能源汽车股份有限公司 | Intelligent decision method for vehicle navigation switching route |
| CN117870678A (en) * | 2023-12-25 | 2024-04-12 | 长三角哈特机器人产业技术研究院 | Unmanned forklift path planning method for introducing regional congestion rate |
-
2024
- 2024-04-15 CN CN202410450153.XA patent/CN118031997B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103994768A (en) * | 2014-05-23 | 2014-08-20 | 北京交通大学 | Method for seeking for overall situation time optimal path under dynamic time varying environment |
| CN114450556A (en) * | 2019-08-31 | 2022-05-06 | 华为技术有限公司 | Path planning method and device |
| CN113029176A (en) * | 2021-03-19 | 2021-06-25 | 重庆长安新能源汽车科技有限公司 | Multi-level experience-oriented optimal charging path planning method for electric vehicle |
| CN115112136A (en) * | 2021-03-23 | 2022-09-27 | 腾讯科技（深圳）有限公司 | Travel path planning method and travel path recommendation method |
| CN116067383A (en) * | 2021-10-29 | 2023-05-05 | 博泰车联网科技(上海)股份有限公司 | Multi-terminal navigation method, device and vehicle |
| CN114518755A (en) * | 2022-01-28 | 2022-05-20 | 福思(杭州)智能科技有限公司 | Global path planning method, device, equipment and storage medium |
| WO2023174080A1 (en) * | 2022-03-16 | 2023-09-21 | 宇通客车股份有限公司 | Path planning method and apparatus, and cloud platform |
| CN115493606A (en) * | 2022-08-25 | 2022-12-20 | 江苏电力信息技术有限公司 | Optimal path selection method of power grid maintenance grid work order based on map |
| CN116878532A (en) * | 2023-07-17 | 2023-10-13 | 中国电信股份有限公司技术创新中心 | Path planning method and device for mobile object and related equipment |
| CN117367433A (en) * | 2023-11-16 | 2024-01-09 | 浙江省交通运输科学研究院 | Low-altitude unmanned aerial vehicle path planning method and device, unmanned aerial vehicle and readable storage medium |
| CN117606507A (en) * | 2023-12-14 | 2024-02-27 | 奇瑞新能源汽车股份有限公司 | Intelligent decision method for vehicle navigation switching route |
| CN117870678A (en) * | 2023-12-25 | 2024-04-12 | 长三角哈特机器人产业技术研究院 | Unmanned forklift path planning method for introducing regional congestion rate |
Non-Patent Citations (2)
| Title |
|---|
| F. RUBIN: "The Lee Path Connection Algorithm", 《IEEE TRANSACTIONS ON COMPUTERS》, vol. 23, no. 9, 30 September 1974 (1974-09-30), pages 907 - 914 * |
| 艾皖东: "区域自动代客泊车自主引导行驶控制应用研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》, no. 2, 15 February 2021 (2021-02-15), pages 035 - 604 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN118031997B (en) | 2024-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7580788B2 (en) | Traffic information interpolation system | |
| US6668226B2 (en) | Polar coordinate-based isochrone generation | |
| US7355528B2 (en) | Traffic information providing system and car navigation system | |
| JP5833567B2 (en) | Time and / or accuracy dependent weights for network generation in digital maps | |
| CN110298474B (en) | AIS and GIS-based logistics site selection method for ship spare parts | |
| US20090228198A1 (en) | Selecting landmarks in shortest path computations | |
| BRPI0616736A2 (en) | methods for predicting destinations from partial trajectories using open world and closed world modeling methods | |
| JP2007179348A (en) | Traffic situation prediction method, device therefor and program | |
| TW201205040A (en) | Probe data processing | |
| US20130166204A1 (en) | Generating Travel Time Data | |
| CN110598917B (en) | Destination prediction method, system and storage medium based on path track | |
| CN111582559A (en) | Method and device for estimating arrival time | |
| KR102386786B1 (en) | Method for managing travel route database based on location and server for the method | |
| US20150198739A1 (en) | Insolation calculating device, route proposing device, and insolation calculating method | |
| CN114450557A (en) | Route deviation quantification and vehicle route learning based thereon | |
| CN111429744A (en) | Road condition information fusion analysis method, device and storage medium | |
| CN116542709A (en) | Electric vehicle charging station planning analysis method based on traffic situation awareness | |
| CN107798450B (en) | Service distribution method and device | |
| CN118031997B (en) | GIS-based space geographic information service method and device | |
| CN115994726B (en) | Dispatch path adjustment method, dispatch path adjustment device, electronic equipment and computer readable medium | |
| CN110674208A (en) | Method and device for determining position information of user | |
| CN109344247B (en) | Method and apparatus for outputting information | |
| CN115691140B (en) | Analysis and prediction method for space-time distribution of automobile charging demand | |
| CN112380443B (en) | Guide recommendation method, device, computer equipment and storage medium | |
| US6980930B2 (en) | Communication terminal and information processing apparatus of a payment system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |