KR100714916B1 - Path searching method - Google Patents

Abstract

When re-navigating a route, a method of searching for a route from a departure point to a point on the nearest route and transmitting the route is provided. Upon requesting the destination location based on the current route, the route data is received and stored in response to the route request, and the route is determined according to whether the GPS data matches the route data. When the path deviates, it is determined whether the current vehicle is located at a position deviated from a plurality of nodes or at a position deviated from the link. If the current vehicle is located at a position away from a plurality of nodes, the data from the node closest to the current vehicle position to the destination node is stored. If the current vehicle is at a position away from one link, the data from one link to the destination node is stored. . According to the route rescan request, the data before the rescan request is extracted, and if the path data from the current location to the destination and the data before the rescan request are similar, the path from one node to the one link or the one link from the plurality of nodes Determines whether it is acceptable to provide a path from an adjoining location to a link. If the route data from the current location to the destination is similar to the route data before requesting re-search, the relevant data is transmitted.

Route navigation

Description

Path search method {PATH SEARCHING METHOD}

1 is a view showing a road guidance service system according to an embodiment of the present invention.

2 is a diagram illustrating a configuration of a terminal and a server applied to a path searching method according to an embodiment of the present invention.

3 is a flowchart illustrating a route searching method according to an embodiment of the present invention.

4 is a diagram illustrating a network structure and a conceptual diagram applied to the path searching method of FIG.

<Description of Signs for Main Parts of Drawings>

102: GPS 200: terminal

210: directions request module 220: route database

230: GPS receiving module 240: map matching module

250: road guidance module 260: re-search minimization module

300: path navigation module 310: re-search minimization module

The present invention relates to a route searching method, and more particularly, when a customer leaves the route and re-searches the route in the server, a method of calculating an optimal / shortest route by searching all the routes from the route departure point to the destination. Rather, the present invention relates to a method of transmitting route data by searching for a route from the point where the customer deviates from the closest 'specific point on the first route'.

In the case of the existing road guidance service, when the customer inputs destination information (voice input or direct input), the route search server receives the input information to calculate the best / shortest destination route data, and returns the destination information to the terminal. Sent. However, when the customer leaves the route, the server searches for a route back to the first set destination based on the departure point. However, if the originally downloaded route is different from the re-discovered route, there is no problem. If there are a lot of overlapping sections (there is almost no traffic information fluctuations and the route search results are much matched), unnecessary charges due to duplicated wireless data are incurred and download time is delayed. In case of customers who are overcharged due to excessive fees, they will be charged excessive fees.

Accordingly, the present invention has been made to solve the above-mentioned problems of the prior art, and when the customer deviates the route and re-searches the route in the server, the present invention is optimized by searching the entire route from the deviated point to the destination. It is not intended to calculate the shortest route, but to provide a way to send route data after searching for a route from the point at which the customer exited to the closest 'specific point on the first route'.

In order to achieve the above object, the route search method according to the present invention (a) a plurality of links comprising the actual road shape as data in response to the terminal requests a route to the destination based on the current route to the route search server and Receiving route data including the node and storing the route data in a route database; (b) determining, by the terminal, whether the vehicle of the terminal user has left the route according to whether the GPS data and the stored route data match each other; (c) when the vehicle of the terminal user deviates from the route, determining, by the terminal, whether the current vehicle is in a position away from the plurality of nodes or in a position adjacent to one link; (d) if the current vehicle is at a position away from the plurality of nodes, the data from the node closest to the current vehicle position to the destination node; if the current vehicle is at a position away from the one link, the one Storing data from a link to the destination node; (e) extracting route data before the current user terminal requests re-search by referring to a database of the terminal as the terminal requests the route re-search; (f) the route search server compares the route data from the current location of the terminal user's vehicle to the destination and the route data before requesting re-search, and outputs a comparison result including a different route and the same route between the two route data; Doing; (g) the route search server determining whether the two route data are similar or different based on the comparison result of step (f); And (h) if the route search server is similar to the route data from the current position of the terminal user's vehicle to the destination and the route data before requesting the re-search, the route search server is the first requested by the terminal. And transmitting the corresponding path to the terminal from a location away from a plurality of nodes to the one link, or a path from one location to the one link in an adjacent location.

In addition, (i) when the route search server differs from the current position of the terminal user's vehicle to the destination and the route data before requesting re-search according to the determination result of step (g), more than a predetermined range, Providing a newly discovered full path from the location to the destination point.

In addition, when the route data from the current location of the terminal user's vehicle to the destination and the route data before requesting re-search are similar in step (h), the node to which the vehicle will pass in each route data of step (f) is identified. In comparison, the nodes are the same.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating a road guidance service system according to an exemplary embodiment of the present invention. FIG. 2 is a diagram illustrating a configuration of a terminal and a server applied to a route searching method according to an exemplary embodiment of the present invention. 3 is a flowchart illustrating a path searching method according to an embodiment of the present invention.

As the terminal 200 requests a destination location based on the current route to the route search server 300 through the route guidance request module 210, a plurality of links and a plurality of links each configured with actual road shapes as data in response to the route request. Route data including a plurality of nodes having a source node, at least one connection node, and a destination node at the intersection where the links intersect is received and stored in the path database 220 (step S310).

In the present invention, the vehicle off the route to C11 is a point C, the vehicle off the route to C12 re-search the route to return to any point on C1, after which the route initially stored the data received in the terminal database Is a concept that allows us to reuse it.

The terminal 200 accesses the route search server 300 to request route data and the like, and generates specific service data desired by a user of the terminal 200 using various servers to be interlocked and outputs the predetermined service data through predetermined display means.

All route data for the navigation service is configured as shown in FIG. 4 is a diagram illustrating a network structure and conceptual diagram of route data applied to the route searching method of FIG. 3. Referring to FIG. 4, all data is reconstructed in the form of a road network for a navigation service, which is composed of a plurality of nodes and a plurality of links. Links consist of data of the actual road shape, and nodes become intersection points where each link intersects or features that require specific guidance.

If the customer requests the route search server 300 for the route from point A to point G, it is assumed that the route search result at the server is the same as the above line (A1 → B1 → C1 → D1 → G1 → E1). . In the normal case, the route will be smoothly routed through node C to the point C1, but the customer may move to C11 or C12 in an unexpected situation. In this case, the conventional road guidance route search server requests to re-search the route from the current position C11 or C12 to the point G again. At this time, if the traffic information is changed so much that the retransmitted route is different from the original route, there is no problem. However, in most cases, a route search result similar to the first is generated to move from C1 → D → D1 → E → E1 → G. In addition, the terminal 200 guides the route through the GPS receiving module 230, the map matching module 240, and the road guidance module 250.

The road guide module 250 of the terminal 200 determines whether the terminal user vehicle has left the route according to whether the actual GPS data and the stored route data match (step S320). At this time, the map matching module 240 matches the actual GPS data obtained from the GPS 100 and the route data through the GPS receiving module 230 and performs a path deviation determination.

As a result of the determination in step S320, when the terminal user vehicle has deviated from the path, the rescan minimization module 260 of the terminal 200 determines whether the current vehicle is at the position C11 that is out of the plurality of nodes (step S320). S330).

As a result of the determination in step S330, when the current vehicle is located at C11, which is a position away from the plurality of nodes, the rescan minimization module 260 performs data from the node closest to the current vehicle position to the destination node, that is, node C. Data from node G to node G are stored in path database 220 (step S340). In contrast, when the current vehicle is not at C11, which is a position away from the plurality of nodes, it is determined whether the current vehicle is at position C12, which is adjacent to one link (step S350).

As a result of the determination in step S350, when the rescan minimization module 260 is in a position where the current vehicle is adjacent to the one link, the data from the one link to the destination node, that is, the link C1 to the node G Is stored in the path database 220 (step S360).

The route guidance request module 210 of the terminal 200 requests the route search server 300 to rescan the route (step S370), and the re-search minimization module 310 of the route search server 300 accesses the user database. With reference to the current user terminal extracts the path data before the request for re-search (step S380).

Subsequently, since the current user has requested re-search, the route search server 300 compares the route data from the current location of the terminal user to the destination and the route data before requesting the re-search (step S390).

The route search server 300 determines whether the route data from the current location of the terminal user's vehicle to the destination is very different from the route data before requesting the re-search according to the comparison result of the step S390 (step S400). ).

If the route search server 300 determines that the route data from the current location of the terminal user's vehicle to the destination and the route data before requesting re-search are very different from each other, the destination G point at the current location. Newly generated route data up to (step S410) is provided. On the contrary, it is determined whether or not the user may provide only the path from the position C11 deviating from the plurality of nodes to the one link C (step S420).

As a result of the determination in step S420, if it is determined that the user may only provide a path from the location C11 deviated from the plurality of nodes to the one link C, at the location C11 deviated from the plurality of nodes as requested by the first terminal. The path up to the one link C is transmitted to the terminal 200 (step S430). On the contrary, if it is determined that the user should not provide only the path from the position C11 deviating from the plurality of nodes to the one link C, only the path from the position C12 deviating from one link C1 to the link C1 is provided. It is determined whether or not it is OK (step S440).

As a result of the determination in step S440, if it is determined that only the path from the position C12 that is adjacently separated from one link to the link C1 may be provided, the position C12 that is adjacently separated from one link C1 as requested by the first terminal 200. In step S450, the path to the link C1 is transmitted to the terminal 200.

In the above, the comparison of steps S400, S420, and S440 may be performed when the node is the same by comparing the path data from the current location of the terminal user to the destination and the node to which the vehicle passes in the received route data. And determining based on the case where one or more nodes are different. However, the comparison criteria is not limited thereto, and the difference between the data of the route data from the current location of the terminal user's vehicle to the destination and the data capacity of the route data before requesting a rescan, the current location of the terminal user's vehicle to the destination It may include a difference between the path data of the link and the link constituting the path data before requesting a rescan.

Although the present invention has been described as a specific preferred embodiment, the present invention is not limited to the above-described embodiments, and the present invention is not limited to the above-described embodiments without departing from the gist of the present invention as claimed in the claims. Anyone with a variety of variations will be possible.

As described above, in the present invention, when a customer deviates a route and re-searches the route in the server, the customer is not a method of calculating an optimal / shortest route by searching all the routes from the deviated point to the destination. It searches for a route from one point to the closest 'specific point on the first route' and transmits route data. By using this method, the size of the route data can be reduced, which can improve the download time and reduce the data usage fee, which can ultimately improve the service.

Claims (3)

(a) receiving and storing, in a route database, route data including a plurality of links and nodes having actual road shapes as data in response to the terminal requesting a route to a destination based on the current route from the route search server; ; (b) determining, by the terminal, whether the vehicle of the terminal user has left the route according to whether the GPS data and the stored route data match each other; (c) when the vehicle of the terminal user deviates from the route, determining, by the terminal, whether the current vehicle is in a position away from the plurality of nodes or in a position adjacent to one link; (d) if the current vehicle is at a position away from the plurality of nodes, the data from the node closest to the current vehicle position to the destination node; if the current vehicle is at a position away from the one link, the one Storing data from a link to the destination node; (e) extracting route data before the current user terminal requests re-search by referring to a database of the terminal as the terminal requests the route re-search; (f) the route search server compares the route data from the current location of the terminal user's vehicle to the destination and the route data before requesting re-search, and outputs a comparison result including a different route and the same route between the two route data; Doing; (g) the route search server determining whether the two route data are similar or different based on the comparison result of step (f); And (h) when the route search server determines that the route data from the current location of the terminal user's vehicle to the destination is similar to the route data before requesting a re-search, the plurality of routes are initially requested by the terminal. And transmitting a corresponding path to the terminal from a position away from the node of the path to the one link, or a path from the position adjacent to the one link to the one link to the terminal. The method of claim 1, (i) When the route search server determines that the route data from the current location of the terminal user's vehicle to the destination and the route data before requesting re-search differ by more than a predetermined range, as a result of the determination of step (g), the destination at the current location Providing a newly created full route to the point. The method of claim 1, If the route data from the current location of the terminal user's vehicle to the destination in step (h) and the route data before requesting re-search are similar, And comparing the nodes to which the vehicle will pass in the respective route data of step (f), wherein the nodes are the same.

Images