CN110553661B - R-tree-based user position-to-target area path recommendation method - Google Patents
R-tree-based user position-to-target area path recommendation method Download PDFInfo
- Publication number
- CN110553661B CN110553661B CN201910869990.5A CN201910869990A CN110553661B CN 110553661 B CN110553661 B CN 110553661B CN 201910869990 A CN201910869990 A CN 201910869990A CN 110553661 B CN110553661 B CN 110553661B
- Authority
- CN
- China
- Prior art keywords
- rectangle
- node
- rectangular
- tree
- rec
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
Abstract
The invention relates to a user position-to-target area path recommendation method based on an R tree, which comprises the following steps of: constructing a tree-shaped index structure for the track data by adopting the conventional R tree index method, and automatically creating a hierarchical model by means of the hierarchical structure of the R tree; and recommending a rectangle and a track set which are closest to the target scenic spot according to the position of the user. The method stores a plurality of discrete track data by utilizing the index structure of the R tree, recommends the rectangle and the track set which are closest to the target scenic spot according to the position of the user, and has the advantages of high reliability, strong accuracy and the like.
Description
Technical Field
The invention relates to the field of computer software and Geographic Information System (GIS) application, in particular to a user position-to-target area path recommendation method based on an R tree.
Background
With the technical progress and the continuous maturity of the market, more and more intelligent devices with the geographic positioning function are provided, and the intelligent devices can be GPS (global positioning system) track recording devices or Beidou navigation equipment. The geographical location trajectory data is usually obtained by collecting a series of location points of outdoor activities by using a smart device with a geographical positioning function, wherein each location point comprises information such as time, longitude, latitude, altitude and the like. The user can adopt intelligent equipment to record their outdoor movement track, realizes travel experience sharing, life record and sports record analysis etc..
Meanwhile, websites, forums or travel APPs appear on the Internet, so that users can conveniently establish network communities related to geographic positions. Users upload their recorded outdoor sport traces to these websites, forums, or servers of travel APPs, manage their travel experiences on Web maps and share travel knowledge among each other. For example, one can find some attractive places from the travel routes of other people and plan an interesting and efficient trip based on the travel trajectories of multiple users.
Thus, the servers of the website, forum or travel APP accumulate a large number of GPS tracks, but most of the GPS tracks are raw GPS data. Faced with such a huge data set, it is impossible for a general user to browse the GPS tracks one by one and identify interesting and useful GPS tracks by himself. The average user would like the system to recommend one or more interesting and efficient routes so that the individual can learn an unfamiliar scenic spot or city in a short amount of time and plan their journey with minimal effort.
The R tree is a balanced tree-like hierarchical structure, all leaf nodes have the same depth, a leaf node directly contains a target, its parent node contains several leaf nodes, and they are sequentially nested upwards, the root node at the uppermost layer indirectly contains all targets, the root node range is the minimum bounding box containing all targets, the whole tree has only one root node, usually the entry of various operations, such as space query and update operation, etc. In real life, the R tree can be used to store spatial information on a map, such as a restaurant address, or polygons on a map used to construct streets, buildings, lake edges, and coastlines, and can also be used to implement path recommendation from a user's location to a target area.
In real life, the departure position of a user is often far away from a target scenic spot or a target city, and the schedule is often compact. The user wishes to plan a most classical path from the departure location to the target scenic spot or city to visit or become familiar with the target area of emphasis.
Disclosure of Invention
In order to solve the technical problem, the invention provides a user position-to-target area path recommendation method based on an R tree.
The technical scheme of the invention is as follows: comprises the following steps of (a) preparing a solution,
step 1, constructing a tree-shaped index structure for track data by adopting the conventional R tree index method, and automatically creating a hierarchical model by means of the hierarchical structure of an R tree;
and 2, recommending a rectangle and a track set which are closest to the target scenic area according to the position of the user.
The specific mode of the above step 1 of the present invention includes the following steps,
step 1.1, the system anonymously collects the motion trail of the user in the activity area, the motion trail accumulates day by day, the system stores n discrete trail data sequences with the numbers as follows: 1,2,3, \8230;, k, k +1, \8230;, n;
step 1.2, i-th position point p of k-th track data sequence ki The longitude value and the latitude value of (c) form a coordinate (x) of the coordinate point ki ,y ki ). Wherein x is ki Represents the longitude value, y, of the ith position point of the kth track data sequence ki Representing the latitude value of the ith position point of the kth track data sequence. Ith position point coordinate (x) of kth track data sequence ki ,y ki ) And the (i + 1) th position point coordinate (x) adjacent to the position point k(i+1) ,y k(i+1) ) Form a rectangle R h (h =1,2,3, \8230;), the ith and i +1 th coordinate point data to be saved are shown as a rectangle R h Is stored in a leaf node of the R-tree, a momentForm R h Pointed track data sequence (List) R hL Increase k, R hL =R hL + { k }, initial value R hL =NULL。
When a new user arrives at a city where a tourist attraction is located, the user position is input, the user position can be the current position, but the user position is not necessarily within the range of the tourist attraction. If the user position is within the tourist attraction, namely within the rectangle formed by all leaf nodes of the R tree, other navigation algorithms are adopted to plan the tourist route.
The specific mode of the step 2 of the present invention includes the following steps,
step 2.1, setting the user position as p u . Firstly, a root node N of an R tree is set root Insertion queue Q, root node N root Represented by a rectangle R root Inserting rectangular linked lists Rec L . If the queue Q is not empty, entering the step 2.2;
step 2.2, popping up the head node N of the queue Q, and obtaining the ID of the node N N . Traverse rectangular linked list Rec L If rectangular linked list Rec L Middle rectangle R i ID of (2) i And ID of node N N Equality, from rectangular linked lists Rec L In deleting the rectangle R i . Entering the step 2.3;
step 2.3, traverse node N's child node N sub If child node N sub Corresponding rectangle R sub Capable of controlling rectangular linked lists Rec L Some rectangle R in i From rectangular linked lists Rec L In deleting the rectangle R i . If rectangular linked list Rec L Middle rectangle R i Is a non-leaf node and the user position is p u In the rectangle R i In, and the child node N sub Is a leaf node, then the child node N sub Is rectangular R sub Need to be saved into rectangular linked list Rec L In (1). If rectangular linked list Rec L Middle rectangle R i Capable of controlling child node N sub Corresponding rectangle R sub Then child node N sub Is rectangular R sub Without saving into rectangular linked lists Rec L In (1). Entering the step 2.4;
step 2.4, if node N is a non-leaf nodeThe child node N sub Inserting a queue Q;
step 2.5, after the nodes in the queue Q are processed, the rectangular linked list Rec L The rectangle and the track set contained in the image are the rectangle and the track set which are nearest to the target scenic region.
The above step 2.3 of the present invention includes the following definitions,
definition 1, user position p u To rectangle R i The distances of the four vertices are shown as,
dis 4 (p u →R i )=(D1,D2,D3,D4);
definition 2, user position p u To rectangle R i The distance of the 2 vertices of the four vertices with the shortest distance is expressed as,
min 2 (dis 4 (p u →R i )) = (D1,D2);
definition 3, user position p u To rectangle R i The distance of 2 vertexes with the shortest distance among the four vertexes is constantly smaller than the user position p u To rectangle R j The distance between the shortest 2 vertexes of the four vertexes is called as a rectangle R i Can control the rectangle R j ，
If min 2 (dis 4 (p u →R i ))all<min 2 (dis 4 (p u →R j ) Then rectangle R) i Can control the rectangle R j 。
Compared with the prior art, the invention has the beneficial effects that:
the invention stores a plurality of discrete track data by utilizing the index structure of the R tree, recommends the track set closest to the target scenic spot according to the position input by the user, and has the advantages of high reliability, strong accuracy and the like. Meanwhile, the method has wide market prospect in the application and popularization of database, data analysis, data mining, track data query and analysis and track data mining.
Drawings
FIG. 1 is a schematic diagram of 2 trace data sequences according to the present invention.
FIG. 2 is a schematic diagram of the 1 st track data sequence forming a rectangle according to the present invention.
FIG. 3 is a schematic diagram of an R-tree formed by 2 track data sequences according to the present invention.
FIG. 4 shows a user location p according to the present invention u Distances to the four vertex positions of the rectangle Ri are illustrated.
FIG. 5 is a diagram of an R-tree structure according to the present invention.
FIG. 6 is a schematic diagram of a set of rectangles and tracks recommended to be closest to a target scenic spot according to a user position.
Detailed Description
The invention will now be further described with reference to the accompanying drawings, which illustrate and describe embodiments.
Referring to fig. 1, a schematic diagram of 2 track data sequences according to the present invention is shown. The 1 st trace data sequence includes { p 11 ，p 12 ，p 13 ，p 14 ，p 15 The 2 nd trace data sequence comprises { p } 21 ，p 22 ，p 23 ，p 24 ，p 25 ，p 26 The sequence of position points. The longitude value and the latitude value of the ith position point of the kth track data sequence form coordinate (x) ki ,y ki ). Wherein x is ki Representative position point p ki Longitude value of y ki Representative position point p ki The latitude value of (a). For example: p is a radical of 11 The longitude value and the latitude value of the position point form coordinate (x) of the coordinate point 11 ,y 11 )。
Referring to fig. 2, the 1 st track data sequence of the present invention constitutes a rectangular schematic diagram. Paired position points p ki And p k(i+1) Coordinate (x) of ki ,y ki ) And (x) k(i+1) ,y k(i+1) ) Form a rectangle R h Location points p to be saved ki And p k(i+1) Is represented by a rectangle R h Is stored in a leaf node of the R-tree. Rectangle R h Pointed track data sequence (List) R hL Increasing k, R hL =R hL + { k }, initial value R hL = NULL. For example: paired position points p 11 And p 12 Coordinate (x) of 11 ,y 11 ) And (x) 12 ,y 12 ) Form a rectangle R 1 Rectangular R 1 Pointed track data sequence (List) R 1L Increase in 1,R 1L =R 1L 1, since the initial value R 1L Not NULL, so R 1L = {1}。
Referring to fig. 3, the 2 track data sequences of the present invention form an R-tree diagram. When the R-tree processes the 2 nd track data sequence, p 21 Is contained in an existing rectangle R 1 In, R 1L =R 1L +{2}={1,2}，p 22 Is contained in an existing rectangle R 2 In, R 2L =R 2L +{2}={1,2}。p 23 Is contained in an existing rectangle R 3 In, R 3L =R 3L + {2} = {1,2}, but p 24 Not contained in an existing rectangle, so p is inserted in the R-tree 23 And p 24 Form a rectangle R 5 ，R 5L =R 5L +{2}={2}。p 25 And p 26 Neither position point is contained in an existing rectangle, so p is inserted in the R-tree 25 And p 26 Formed rectangle R 7 ，R 7L =R 7L +{2}={2}。
As can be seen from FIG. 3, p 21 And p 22 The straight-line tracks formed are not all rectangular R 1 And R 2 Wrap because of p 21 And p 22 Only the user location points collected, as for the user from p 21 To p 22 Whether the straight line or the curve is taken between the two paths cannot be predicted, so that a new rectangle does not need to be added in the R tree.
When a new user arrives at a city where a tourist attraction is located, the user position is input, the user position can be the current position, but the user position is not necessarily within the range of the tourist attraction. If the user position is within the tourist attraction, namely within the rectangle formed by all leaf nodes of the R tree, other navigation algorithms are adopted to plan the tourist route.
Referring to fig. 4, a user position p u Distances dis to the four vertex positions of rectangle R9 4 (p u → R9) are (100, 60,150, 176), respectively, user position p u Distances dis to the four vertex positions of rectangle R8 4 (p u → R8) are (116, 152,262, 280), respectively, user positionp u Distances dis to the four vertex positions of rectangle R10 4 (p u → R10) are (90, 76,158, 150), respectively. User location p u Distance min corresponding to 2 position points with the shortest distance among the four vertex positions of the rectangle R9 2 (dis 4 (p u → R9)) is (100, 60). This means that the user position p u The shortest distance to the real recording point contained by the rectangle R9 is between 100 and 60, R9, the user position p u To the recording point p 15 Is 60. Accordingly, the user position p u Distance min corresponding to 2 position points with the shortest distance among the four vertex positions of the rectangle R8 2 (dis 4 (p u → R8)) is (116, 152). This means that the user position p u The shortest distance to the real recording point contained by the rectangle R8 is between 116 and 152, R8, the user position p u To the recording point p 14 Is 134. Thus, at least one recording point in the rectangle R9 reaches the user location point p u Is compared with the distance p from any recording point in the rectangle R8 to the user position point u All of the rectangles R9 can control the rectangle R8, and in the R tree, R8 can be pruned. However, the user position p u Distance min corresponding to 2 position points with the shortest distance among the four vertex positions of the rectangle R10 2 (dis 4 (p u → R10)) is (90, 76). Thus, the rectangle R9 cannot control the rectangle R10, and conversely, the rectangle R10 cannot control the rectangle R9.
Referring to fig. 5, the R-tree structure of the present invention is schematically illustrated. The example R-tree contains 4 nodes, where node 1, node 2, and node 3 are leaf nodes whose node entries point to the rectangle R h Rectangular R h Containing the position point p ki Coordinate (x) ki ,y ki ) And p k(i+1) Position point coordinates (x) k(i+1) ,y k(i+1) ). Node 4 is the root node of the R tree, node 4 is a non-leaf node, the node items of node 4 point to their child nodes, and the rectangle R represented by each node item h A rectangle containing child nodes. For example, node item rectangle R for node 4 8 Rectangle R containing node 1 1 ，R 2 And R 3 ；R 9 IncludedRectangle R of node 2 4 ，R 5 ；R 10 Rectangle R containing node 3 6 ，R 7 。
Referring to fig. 6, the present invention recommends a set of rectangles and trajectories closest to a target scenic spot according to a user position. Firstly, the root node N of the R tree is 4 Insertion queue Q, root node N 4 Represented by a rectangle R 11 Inserting rectangular linked lists Rec L . Pop-up queue Q head node N 4 And obtaining the ID =4 of the node N. Traverse rectangular linked list Rec L Rectangular chain table Rec L Middle rectangle R 11 Is equal to the ID of node 4, from rectangular linked list Rec L In deleting the rectangle R 11 . Traversal node N 4 The 1 st child node is node 1, i.e. N 1 ，N 1 The corresponding rectangle is R 8 Because of the rectangular linked list Rec L For empty sets, the rectangle R8 is saved in a rectangular linked list Rec L Node 1 is inserted into queue Q. Then a second child node, N 2 ，N 2 The corresponding rectangle is R 9 . As shown in FIG. 4, rectangle R9 can control rectangle R8, so the rectangular linked list Rec is selected from L Deleting the rectangle R8 and storing the rectangle R9 into the rectangular linked list Rec L Node 2 is inserted into queue Q. Next, the 3 rd child node, N, is processed 3 ，N 3 The corresponding rectangle is R 10 . As shown in FIG. 4, the rectangles R9 and R10 cannot control each other, and therefore, the rectangle R10 is saved in the rectangular linked list Rec L Node 3 is inserted into queue Q. Because queue Q is not empty, pop queue head node 1 because in rectangular linked list Rec L If the ID of the rectangle is not found to be equal to the ID of the node 1, the node 1 does not process the data. Next queue Q pops up node 2, rectangular linked list Rec L Middle rectangle R 9 Is equal to the ID of node 2, from the rectangular linked list Rec L In deleting the rectangle R 9 . The child nodes R4 and R5 of node 2 are then processed. Since R4 can control R5, only R4 remains. The children of node 3, R6 and R7, are then processed. Since R7 can control R6, only R7 remains. Finally, the rectangles R4 and R7 and the included track set {1,2} are the rectangles and tracks recommended to be closest to the target scenic region according to the user's positionA trace set.
In summary, after reading the present disclosure, those skilled in the art can make various other corresponding changes without creative mental work according to the technical solutions and concepts of the present disclosure, and all of them are within the protection scope of the present disclosure.
Claims (1)
1. A user position to target area path recommendation method based on an R tree is characterized in that: comprises the following steps of (a) preparing a solution,
step 1, constructing a tree-shaped index structure for track data by adopting the existing R tree index method, and automatically creating a hierarchical model by means of the hierarchical structure of an R tree;
step 2, recommending a rectangle and a track set which are closest to a target scenic spot according to the position of the user;
the specific mode of the step 1 comprises the following steps,
step 1.1, the system anonymously collects the movement track of the user in the activity area, the movement track accumulates day by day, the system stores n discrete track data sequences, and the number is as follows: 1,2,3, \8230;, k, k +1, \8230;, n;
step 1.2, i-th position point p of k-th track data sequence ki The longitude value and the latitude value of (c) form a coordinate (x) ki ,y ki ) Wherein x is ki Represents the longitude value, y, of the ith position point of the kth track data sequence ki Representing the latitude value of the ith position point of the kth track data sequence; ith position point coordinate (x) of kth track data sequence ki ,y ki ) And the (i + 1) th position point coordinate (x) adjacent to the position point k(i+1) ,y k(i+1) ) Form a rectangle R h (h =1,2,3, \ 8230;), the ith and i +1 th coordinate point data to be saved are shown as a rectangle R h Is stored in a leaf node of the R-tree, rectangular R h Pointed track data sequence (List) R hL Increase k, R hL =R hL + { k }, initial value R hL =NULL；
When a new user arrives at a city where a certain tourist attraction is located, inputting a user position, wherein the user position can be a current position, but the user position must not be in the scenic spot range; if the user position is in the tourist attraction range, namely in the rectangle formed by all leaf nodes of the R tree, planning the tourist route by adopting other navigation algorithms;
the specific mode of the step 2 comprises the following steps,
step 2.1, set the user position as p u (ii) a Firstly, a root node N of an R tree is set root Insertion queue Q, root node N root Represented by a rectangle R root Inserting rectangular linked lists Rec L (ii) a If the queue Q is not empty, entering step 2.2;
step 2.2, popping up the head node N of the queue Q, and obtaining the ID of the node N N Go through rectangular chain table Rec L If rectangular linked list Rec L Middle rectangle R i ID of i And ID of node N N Equality, from rectangular linked lists Rec L In deleting the rectangle R i Entering step 2.3;
step 2.3, traverse child node N of node N sub If child node N sub Corresponding rectangle R sub Can control rectangular linked list Rec L Some rectangle R in i From a rectangular linked list Rec L In deleting the rectangle R i (ii) a If rectangular linked list Rec L Some rectangle R in i Is a non-leaf node and the user position is p u In the rectangle R i Middle, and child node N sub Is a leaf node, then the child node N sub Is rectangular R sub Need to be stored in a rectangular linked list Rec L The preparation method comprises the following steps of (1) performing; if rectangular linked list Rec L Some rectangle R in i Capable of controlling child node N sub Corresponding rectangle R sub Then child node N sub Is rectangular R sub Do not require saving into rectangular linked lists Rec L In step (5), entering step 2.4; definition 1, user position p u To rectangle R i The distances of the four vertices are denoted dis 4 (p u →R i ) = (D1, D2, D3, D4); definition 2, user position p u To rectangle R i The distance of the 2 vertices with the shortest distance among the four vertices is denoted as min 2 (dis 4 (p u →R i ) ) = (D1, D2); definition 3, user position p u To rectangle R i Four vertexesThe distance of the 2 shortest middle distances is constantly less than the user position p u To rectangle R j The distance of 2 vertexes with the shortest distance among the four vertexes is called as a rectangle R i Can control the rectangle R j If min 2 (dis 4 (p u →R i ))all<min 2 (dis 4 (p u →R j ) Then rectangle R) i Can control the rectangle R j ；
Step 2.4, if the node N is a non-leaf node, the child node N sub Inserting a queue Q;
step 2.5, after the nodes in the queue Q are processed, the rectangular linked list Rec L The rectangle and the track set contained in the image are the rectangle and the track set which are nearest to the target scenic region.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910869990.5A CN110553661B (en) | 2019-09-16 | 2019-09-16 | R-tree-based user position-to-target area path recommendation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910869990.5A CN110553661B (en) | 2019-09-16 | 2019-09-16 | R-tree-based user position-to-target area path recommendation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110553661A CN110553661A (en) | 2019-12-10 |
| CN110553661B true CN110553661B (en) | 2023-02-03 |
Family
ID=68740398
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910869990.5A Active CN110553661B (en) | 2019-09-16 | 2019-09-16 | R-tree-based user position-to-target area path recommendation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110553661B (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9593957B2 (en) * | 2010-06-04 | 2017-03-14 | Microsoft Technology Licensing, Llc | Searching similar trajectories by locations |
| US10331753B1 (en) * | 2018-04-04 | 2019-06-25 | The Florida International University Board Of Trustees | Efficient progressive continuous k-nearest neighbor query algorithm for moving objects with a tree-like index |
| CN108614554A (en) * | 2018-05-03 | 2018-10-02 | 南京理工大学 | A kind of robot multi-source shortest path planning method based on region limitation |
| CN109902139B (en) * | 2019-03-12 | 2022-10-28 | 湖南科技大学 | R-tree-based track data compression method |
-
2019
- 2019-09-16 CN CN201910869990.5A patent/CN110553661B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110553661A (en) | 2019-12-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105095242B (en) | A kind of method and apparatus of label geographic area | |
| US20100211308A1 (en) | Identifying interesting locations | |
| CN111143680B (en) | Route recommendation method, system, electronic equipment and computer storage medium | |
| CN107407572A (en) | Along route search | |
| CN106225799A (en) | Travel information dynamic vehicle navigation system and method | |
| CN107155342A (en) | Virtual camera for 3d maps | |
| CN104981681A (en) | Displaying location preview | |
| TW201405451A (en) | Travel route recommendation system and method thereof | |
| CN104115180A (en) | Information processing device, information processing method, and program | |
| US11448516B2 (en) | Scenic route-based navigation directions | |
| US11550340B2 (en) | Method and apparatus for providing dynamic obstacle data for a collision probability map | |
| JP2007256959A (en) | Map information updating apparatus and map information updating method | |
| CN104034340A (en) | Navigation system with deduper mechanism and method of operation thereof | |
| CN102881218A (en) | Signage real-scene elevation shopping guide map and establishment method for same | |
| Sarkar et al. | A new point-of-interest approach based on multi-itinerary recommendation engine | |
| CN110555174B (en) | R-tree-based track path recommendation method | |
| KR102042919B1 (en) | A System of Providing Theme Travel AI Curation Based on AR through Customization Learning of Virtual Character | |
| CN112632379A (en) | Route recommendation method and device, electronic equipment and storage medium | |
| CN108228593A (en) | Point of interest importance measuring method and device | |
| Li et al. | TrafficPulse: A mobile GISystem for transportation | |
| Li et al. | Route search and planning: A survey | |
| US11781869B2 (en) | Method and apparatus for providing an indoor pedestrian origin-destination matrix and flow analytics | |
| Bartelme | Geographic information systems | |
| CN108549649B (en) | Rural tourism recommendation method and system based on seasonal characteristics and position characteristics | |
| Minucciani et al. | Available and implementable technologies for virtual tourism: a prototypal station project |
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 | ||
| GR01 | Patent grant |