Method and apparatus for finding matching routes between different map databases

Abstract

A method is disclosed for obtaining a second route in a second map database that is matched with a first route in a first map database between different map databases that are configured with nodes and links.

Description

[Technical field]

[0001] The present disclosure is directed to a method for finding matching routes among different map databases. [Background technology]

[0002] Domestic road traffic conditions are only provided in the domestic standard node-link format. Therefore, if a service is provided using a different map data format, there is a problem that the domestic road traffic conditions cannot be reflected. In particular, Google provides map data in the OSM (Open Street Map) data model, which does not accurately match the domestic standard node-link format, and as a result, companies that provide services using OSM have difficulty providing domestic road traffic conditions.

[0003] To solve this problem, methods are being researched for finding routes that are accurately matched between different map data.

[0004] Korean Patent No. 1538042 provides a method for converting paths between different data formats (2D and 3D). Summary of the Invention [Problem to be solved by the invention]

[0005] The present disclosure has been devised in response to the above-mentioned background art, and aims to provide a method for searching, among different map databases, a route in a second map database that accurately matches a route in a first map database. [Means for solving the problem]

[0006] In order to solve the above-mentioned problems, a method for obtaining a second route in a second map database that matches a first route, which is a route in a first map database, between different map databases that are configured with nodes and links is provided. The method includes the steps of matching data in the first map database with data in the second map database in the same coordinate system; obtaining candidate links in the second database that match the first route based on coordinate information of the first route; obtaining a start candidate link group and an end candidate link group from the candidate links based on angle information with links included in the first route; and obtaining the second route by searching for a route that connects a link included in the start candidate link group and a link included in the end candidate link group.

[0007] Alternatively, the step of acquiring candidate links in the second database may include: acquiring latitude coordinate information included in at least one link included in the first route; acquiring longitude coordinate information included in at least one link included in the first route; acquiring at least one plane based on the latitude coordinate information and the longitude coordinate information; expanding the acquired at least one plane based on a predetermined error range; acquiring a node in the second map database based on the expanded plane; and acquiring a link including the acquired node as a candidate link.

[0008] Alternatively, the step of obtaining the starting candidate link group and the ending candidate link group may include: determining as the starting candidate link group a link that forms an angle with a first link of the first path that is less than or equal to a first angle; and determining as the ending candidate link group a link that forms an angle with a last link of the second path that is less than or equal to a second angle.

[0009] Alternatively, the first angle and the second angle may both be 20 degrees.

[0010] Alternatively, the step of determining the starting candidate link group may determine the starting candidate link group by further considering distance information from the first link of the first route, and the step of determining the ending candidate link group may determine the ending candidate link group by further considering distance information from the last link of the first route.

[0011] Alternatively, the starting candidate link group may include a plurality of links, and the ending candidate link group may also include a plurality of links, and in the step of acquiring the second path, the computing device may: acquire a shortest distance path among paths connecting a link included in the starting candidate link group and a link included in the ending candidate link group as a candidate path, thereby acquiring a plurality of candidate paths connecting each of the plurality of links included in the starting candidate link group and each of the plurality of links included in the ending candidate link group, and acquiring a second path from the acquired candidate paths.

[0012] Alternatively, the computing device may select the second path from among the candidate paths based on distance information to a start node of the first path and distance information to an end node of the first path.

[0013] In order to solve the above-mentioned problems, a computer program stored on a computer-readable storage medium may be provided, the computer program including instructions for one or more processors to obtain a second route in a second map database that is matched with a first route, which is a route in a first map database, between different map databases each including nodes and links, the instructions including: matching data in the first database with data in the second database in a same coordinate system; obtaining candidate links in the second database that are matched with the first route based on coordinate information of the first route; obtaining a start candidate link group and an end candidate link group from among the candidate links based on angle information with links included in the first route; and obtaining the second route by searching for a route connecting a link included in the start candidate link group and a link included in the end candidate link group. Effect of the Invention

[0014] The present disclosure can obtain a route in a second map database that is accurately matched with a route in a first map database. [Brief description of the drawings]

[0015] [Figure 1] 1 is a diagram for explaining a map database according to an embodiment of the present disclosure. [Diagram 2] 1 is a diagram illustrating a computing device 100 according to an embodiment of the present disclosure. [Diagram 3] 1 is a diagram illustrating a method in which a computing device 100 acquires a second path according to an embodiment of the present disclosure. [Figure 4] 1 is a diagram showing a method for acquiring a second path according to an embodiment of the present disclosure. [Diagram 5] 11 is a diagram for explaining a method for acquiring candidate routes according to another embodiment of the present disclosure; [Figure 6] FIG. 1 is a general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0016] Various embodiments will now be described with reference to the drawings. Various descriptions are presented herein to provide an understanding of the present disclosure. However, it will be apparent that such embodiments may be practiced without such specific descriptions.

[0017] As used herein, the terms "component," "module," "system," and the like refer to computer-related entities, hardware, firmware, software, a combination of software and hardware, or software implementations. For example, a component may be, but is not limited to, a procedure running on a processor, a processor, an object, a thread of execution, a program, and / or a computer. For example, an application running on a computing device and the computing device may all be a component. One or more components may reside within a processor and / or thread of execution. A component may be localized within one computer. A component may be distributed among two or more computers. Also, such components may execute from various computer readable media having various data structures stored therein. Components may communicate through local and / or remote processes, for example, by signals having one or more data packets (e.g., data from one component interacting with other components in a local system, a distributed system, and / or data transmitted over a network such as the Internet to other systems via signals).

[0018] Additionally, the term "or" is intended to mean an inclusive "or" rather than an exclusive "or." That is, unless otherwise specified or clear from the context, "X utilizes A or B" is intended to mean one of the natural inclusive permutations. That is, if X utilizes A; X utilizes B; or X utilizes both A and B, then "X utilizes A or B" may apply in any of these cases. Additionally, the term "and / or" as used herein should be understood to refer to and include all possible combinations of one or more of the associated listed items.

[0019] Additionally, the terms "comprise" and / or "comprises" should be understood to mean the presence of the indicated feature and / or component. However, the terms "comprise" and / or "comprises" should be understood not to exclude the presence or addition of one or more other features, components and / or groups thereof. Additionally, in the present specification and claims, the singular should generally be construed to mean "one or more," unless otherwise specified or clear from the context as indicating the singular form.

[0020] Furthermore, the term "at least one of A or B" should be interpreted as meaning "a case in which only A is included," "a case in which only B is included," or "a case in which A and B are combined in the configuration."

[0021] Those skilled in the art should additionally appreciate that the various exemplary logical blocks, configurations, modules, circuits, means, logic, and algorithm steps described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or any combination of both. To clearly illustrate the interchangeability of hardware and software, the various exemplary components, blocks, configurations, means, logic, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is embodied in hardware or software depends on the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in various ways for each particular application. However, such implementation decisions should not be interpreted as departing from the scope of the present disclosure.

[0022] The description of the embodiments presented is provided to enable one of ordinary skill in the art to utilize or practice the present disclosure. Various modifications to the embodiments will be apparent to those of ordinary skill in the art to which the present disclosure pertains. The generic principles defined herein may be applied to other embodiments without departing from the scope of the present disclosure. And the present invention is not limited to the embodiments presented herein. The present invention is to be accorded the broadest scope consistent with the principles and novel features presented herein.

[0023] FIG. 1 is a diagram for explaining a map database according to an embodiment of the present disclosure.

[0024] According to one embodiment of the present disclosure, a map database may be composed of nodes and links.

[0025] Here, the node may represent a location where a speed change occurs when a vehicle travels on a road. Specifically, the node may represent an intersection, an overpass end point, an end point of a road, an underground passage end point, an end point of a tunnel, an administrative boundary, etc., but is not limited thereto.

[0026] In addition, a link may refer to a line connecting nodes where speed changes occur, and may represent a real road. Specifically, a link may represent a road, a bridge, an overpass, an underground road, a tunnel, etc., but is not limited thereto.

[0027] For example, even if a map database is constructed for the same location in Korea, the map data constructed in Korea and the map data constructed in a foreign country may be different from each other.

[0028] The Korean government provides traffic volume data by matching it with map data it has created. As a result, when providing services using domestic map data created by other entities, it is difficult to use traffic volume data, so it is necessary to match the map data created in Korea with map data created in other countries.

[0029] 1(a) shows a route (e.g., a first route) consisting of nodes and links in a first map database according to one embodiment of the present disclosure, and FIG. 2(b) shows data representing the vicinity of the first route in a second map database. Hereinafter, a method for finding a route in the second map database that matches the first route will be disclosed.

[0030] FIG. 2 is a diagram illustrating a computing device 100 according to an embodiment of the present disclosure.

[0031] 2 is merely a simplified example, in that the computing device 100 may include other components for implementing the computing environment of the computing device 100 in one embodiment of the present disclosure, and only some of the disclosed components may constitute the computing device 100.

[0032] The computing device 100 may include a processor 110 , a memory 130 , and a network portion 150 .

[0033] The processor 110 may be configured with one or more cores, and may include a processor for data analysis and deep learning, such as a central processing unit (CPU) of a computing device, a general purpose graphics processing unit (GPGPU), and a tensor processing unit (TPU). The processor 110 may read a computer program stored in the memory 130 to perform data processing for machine learning according to an embodiment of the present disclosure. According to an embodiment of the present disclosure, the processor 110 may perform calculations for learning a neural network. The processor 110 may perform calculations for learning a neural network, such as processing input data for learning in deep learning (DL), extracting features from the input data, calculating errors, and updating weights of the neural network using backpropagation. At least one of the CPU, GPGPU, and TPU of the processor 110 may process learning of a network function. For example, the CPU and GPGPU may both process learning of a network function and data classification using the network function. In addition, in an embodiment of the present disclosure, the processors of a plurality of computing devices may be used together to process learning of a network function and data classification using the network function. In addition, the computer program executed in the computing device according to an embodiment of the present disclosure may be a CPU, GPGPU, or TPU executable program.

[0034] According to an embodiment of the present disclosure, the memory 130 may store any type of information generated or determined by the processor 110 and any type of information received by the network unit 150 .

[0035] According to an embodiment of the present disclosure, the memory 130 may include at least one of the following types of storage media: flash memory type, hard disk type, multimedia card micro type, card type memory (e.g., SD or XD memory), Random Access Memory (RAM), Static Random Access Memory (SRAM), Read-Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Programmable Read-Only Memory (PROM), magnetic memory, magnetic disk, and optical disk. The computing device 100 may operate in conjunction with web storage that performs the storage function of the memory 130 over the Internet. The above description of the memory is merely exemplary, and the present disclosure is not limited thereto.

[0036] The network unit 150 according to one embodiment of the present disclosure can use various wired communication systems such as a Public Switched Telephone Network (PSTN), x Digital Subscriber Line (xDSL), Rate Adaptive DSL (RADSL), Multi Rate DSL (MDSL), Very High Speed ​​DSL (VDSL), Universal Asymmetric DSL (UADSL), High Bit Rate DSL (HDSL), and a Local Area Network (LAN).

[0037] In addition, the network unit 150 presented in this specification can use various wireless communication systems such as CDMA (Code Division Multi Access), TDMA (Time Division Multi Access), FDMA (Frequency Division Multi Access), OFDMA (Orthogonal Frequency Division Multi Access), SC-FDMA (Single Carrier-FDMA), and other systems.

[0038] In the present disclosure, the network unit 150 may be configured regardless of the communication type, such as wired or wireless, and may be configured with various communication networks such as a short-range communication network (PAN: Personal Area Network), a short-range communication network (WAN: Wide Area Network), etc. Also, the network may be the well-known World Wide Web (WWW), and may use wireless transmission technology used for short-range communication, such as infrared data association (IrDA) or Bluetooth (Bluetooth (registered trademark)).

[0039] The computing device 100 of the present disclosure can obtain a second route in a second map database that is matched with a first route in a first map database between different map databases that are configured with nodes and links, as will be described in detail below with reference to FIG.

[0040] FIG. 3 is a diagram illustrating a method for a computing device 100 to obtain a second path according to one embodiment of the present disclosure.

[0041] In step S310, the computing device 100 may match the data in the first map database with the data in the second map database in the same coordinate system.

[0042] For example, the computing device 100 may match information about nodes and links contained in a first map database with information about nodes and links contained in a second map database in the same Cartesian coordinate system.

[0043] In step S320, the computing device 100 may obtain candidate links in the second database that are matched with the first route in the first map database based on the coordinate information of the first route.

[0044] For example, the computing device 100 may acquire latitude coordinate information included in at least one link of the first route. In a specific example, the computing device 100 may acquire all latitude coordinate values ​​included in all links of the first route.

[0045] In addition, the computing device 100 may acquire longitude coordinate information included in at least one link of the first route. In a specific example, the computing device 100 may acquire all longitude coordinate values ​​included in all links of the first route.

[0046] In addition, the computing device 100 may obtain at least one plane based on at least one of the latitude coordinate information and the longitude coordinate information. For example, the computing device 100 may obtain one plane using the maximum and minimum values ​​of the acquired plurality of latitude coordinate values ​​and the maximum and minimum values ​​of the acquired plurality of longitude coordinate values.

[0047] In addition, the computing device 100 can acquire nodes of the second map database based on the acquired at least one plane, and can acquire links including the acquired nodes as candidate links. For example, the computing device 100 can expand the acquired plane based on a predetermined error range, detect all nodes included in the expanded plane on the second map data, and acquire links on the second map data including at least one of the detected nodes as candidate links.

[0048] In operation S330, the computing device 100 may acquire a start candidate link group and an end candidate link group from among the candidate links based on angle information formed with the links included in the first route.

[0049] The computing device 100 may have a predetermined angle threshold value. For example, the computing device 100 may have a predetermined angle threshold value for acquiring a start candidate link group, and a predetermined angle threshold value for acquiring an end candidate link group. In this case, the predetermined angle threshold value for acquiring the start candidate link group and the predetermined angle threshold value for acquiring the end candidate link group may be the same (specifically, for example, the predetermined angle threshold value may be 20 degrees, but is not limited thereto).

[0050] The computing device 100 may determine, as a starting candidate link group, links that form an angle with the first link of the first path smaller than a pre-angle critical value among the candidate links. In this case, the first link generally means a link connected to the starting node on the first path, but may also mean a link that is not connected to the starting node depending on the developer's selection or road conditions.

[0051] Also, the computing device 100 may determine the starting candidate link group by further considering distance information with respect to the first link of the first path. Specifically, the computing device 100 may determine, as the starting candidate link group, a link whose angle with the first link of the first path is smaller than a pre-arranged angle threshold and whose distance with the first link is smaller than a pre-arranged distance threshold. In this case, the distance between the first link and the candidate link may be defined as the distance between the end point of the first link and the end point of the candidate link, but is not limited thereto.

[0052] The computing device 100 may determine, as an end candidate link group, a link whose angle with the last link of the first path is smaller than a pre-angle critical value among the candidate links. In this case, the last link generally means a link connected to the end node in the first path, but may also mean a link that is not connected to the end node depending on the developer's selection or road conditions.

[0053] Also, the computing device 100 may determine the end candidate link group by further considering distance information with respect to the last link of the first path. Specifically, the computing device 100 may determine, as the end candidate link group, a link whose angle with the last link of the first path is smaller than a pre-set angle threshold value and whose distance with the last link is smaller than a pre-set distance threshold value. In this case, the distance between the last link and the candidate link may be defined as, but is not limited to, the distance between the end point of the last link and the end point of the candidate link.

[0054] In step 340, the computing device 100 may obtain a second route by searching for a route connecting a link included in the start candidate link group and a link included in the end candidate link group. In this case, the second route refers to a route consisting of at least one node and at least one link included in the second map data.

[0055] According to an embodiment of the present disclosure, the computing device 100 may obtain a candidate path by acquiring a path connecting a link included in a start candidate link group and a link included in an end candidate link group using the Dijkstra algorithm. To explain again, the computing device 100 may acquire a shortest distance path among paths connecting a link included in a start candidate link group and a link included in a candidate link group as a candidate path. In this case, since the start candidate link group includes a plurality of links and the end candidate link group also includes a plurality of links, the computing device 100 may acquire a plurality of candidate paths connecting each of the plurality of links included in the start candidate link group and each of the plurality of links included in the end candidate link group.

[0056] In addition, the computing device 100 may acquire a second route from among a plurality of candidate routes. For example, the computing device 100 may acquire a second route from among the candidate routes based on distance information from the first route. Specifically, the computing device 100 may acquire a route from among the candidate routes that has the smallest distance information from the first route as the second route.

[0057] In this case, the distance information from the first route may mean the average value (average value of the first distance and the second distance) of the distance between the start node of the first route and the start node of the candidate route (first distance value) and the distance between the end node of the first route and the end node of the candidate route (second distance value), but is not limited to this.

[0058] According to another embodiment of the present disclosure, the computing device 100 may acquire a sum of distance values ​​(Value_Sum) between all coordinate points included in the first path and a link closest to the first path among the links included in the candidate paths to acquire a second path from among the candidate paths. Also, the computing device 100 may acquire a candidate link having a minimum sum of distance values ​​(Value_Sum) among the candidate links as the second path.

[0059] 4(a) to 4(c) are diagrams illustrating a method for obtaining a second path according to an embodiment of the present disclosure.

[0060] In accordance with one embodiment of the present disclosure, 401 in FIG. 4(a) illustrates a first route of the first map data. The first route may be composed of at least one node and at least one link. In this case, the first link may be connected to the start node, and the last link may be connected to the end node. Although the first route may have three or more links, it is assumed here for convenience of explanation that the first route has two links.

[0061] In accordance with an embodiment of the present disclosure, 402 in FIG. 4(a) illustrates an example of a candidate link to be matched with a first route. The computing device 100 may acquire the candidate route by using at least one of latitude coordinate information and longitude coordinate information of the first route. This has been described in detail with reference to FIG. 3.

[0062] According to an embodiment of the present disclosure, 403 in FIG. 4(b) illustrates an example of a start candidate link group, and 404 in FIG. 4(b) illustrates an example of an end candidate link group. The computing device 100 may determine, as the start candidate link group, a link that has an angle with the first link of the first path smaller than a pre-arranged angle threshold and a distance with the first link smaller than a pre-arranged distance threshold. Also, the computing device 100 may determine, as the end candidate link group, a link that has an angle with the last link of the first path smaller than a pre-arranged angle threshold and a distance with the last link smaller than a pre-arranged distance threshold. This has been described in detail with reference to FIG. 3.

[0063] 4(c) illustrates an example of acquiring a candidate path connecting a start candidate link included in a start candidate link group and an end candidate link included in an end candidate link group, in accordance with an embodiment of the present disclosure. In particular, when there are multiple paths connecting a start candidate link and an end candidate link, the computing device 100 may acquire a shortest distance path (405(2)) among the paths as a candidate path.

[0064] 4(c) 406 illustrates an example of acquiring a plurality of candidate paths according to an embodiment of the present disclosure. For example, if the start candidate link group includes three links (a, b, c) and the end candidate link group includes three links (l, m, n), the computing device 100 can acquire nine (3*3=9) paths as candidate paths.

[0065] According to an embodiment of the present disclosure, the computing device 100 may acquire, as the second route, a route having the smallest distance information from the first route among the candidate routes.

[0066] FIG. 5 is a diagram for explaining a method for acquiring candidate routes according to another embodiment of the present disclosure.

[0067] According to one embodiment of the present disclosure, if the shortest distance route among the routes connecting the start candidate link and the end candidate link is obtained as the candidate route, in special circumstances, an embodiment may occur in which a route that does not match the first route becomes the candidate route.

[0068] 5, (a) shows a first route, (b) shows a candidate route with the shortest distance, and (c) shows a candidate route that is matched with the first route.

[0069] 5, if the shortest distance route among routes connecting the start candidate link and the end candidate link is acquired as a candidate route, the route same as the solid line in (b) may be acquired as the candidate route. In this case, there may be an embodiment in which the computing device 100 cannot acquire the route same as the solid line in (c) that is matched with the first route as a candidate route. Such an embodiment may occur when the second map data has more detailed data.

[0070] According to another embodiment of the present disclosure, the computing device 100 may acquire all paths connecting the start candidate link and the end candidate link as candidate paths. Referring again to 405 in FIG. 4C, according to another embodiment of the present disclosure, all paths ((1), (2), (3)) may be acquired as candidate paths. In this case, referring again to 406 in FIG. 4C, the number of candidate paths may be nine or more.

[0071] According to another embodiment of the present disclosure, the computing device 100 may acquire candidate paths by selecting paths based on a predetermined threshold value from among all paths connecting a start candidate link and an end candidate link. Specifically, if there are too many paths connecting a start candidate link and an end candidate link, the computing device 100 may acquire candidate paths by selecting paths whose distance information is equal to or less than a predetermined threshold value and / or by selecting a predetermined number of paths in ascending order of distance information.

[0072] According to an embodiment of the present disclosure, the computing device 100 may acquire a sum of distance values ​​(Value_Sum) between a coordinate point included in the first path and a link that is closest to the first path among the links included in the candidate paths to acquire a second path from among the candidate paths. Also, the computing device 100 may acquire a candidate link having a minimum sum of distance values ​​(Value_Sum) acquired from among the candidate links as the second path.

[0073] FIG. 6 is a general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

[0074] While the present disclosure has been described above as generally being embodied in a computing device, those skilled in the art will appreciate that the present disclosure may also be embodied in combination with computer-executable instructions and / or other program modules that may be executed on one or more computers and / or in a combination of hardware and software.

[0075] Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Additionally, those skilled in the art will appreciate that the disclosed methods may be implemented with other computer system configurations, including single-processor or multi-processor computer systems, microcomputers, mainframe computers, as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, and the like, each of which may operate in conjunction with one or more associated devices.

[0076] The illustrated embodiments of the present disclosure may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

[0077] A computer typically includes a variety of computer readable media. Any medium accessible by a computer may be a computer readable medium, including volatile and non-volatile media, transitory and non-transitory media, and mobile and non-mobile media. By way of non-limiting example, computer readable media may include computer readable storage media and computer readable transmission media. Computer readable storage media include volatile and non-volatile media, transitory and non-transitory media, mobile and non-mobile media embodied in any method or technology for storing information such as computer readable instructions, data structures, program modules, or other data. Computer readable storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, DVD (digital video disk) or other optical disk storage device, magnetic cassette, magnetic tape, magnetic disk storage device or other magnetic storage device, or any other medium that can be accessed by a computer and used to store the desired information.

[0078] Computer-readable transmission media typically embodies computer-readable instructions, data structures, program modules or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and includes all information delivery media. The term modulated data signal means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, computer-readable transmission media includes wired media, such as a wired network or direct-wired connection, and wireless media, such as acoustic, RF, infrared and other wireless media. Combinations of any of the above media should also be included within the scope of computer-readable transmission media.

[0079] An exemplary environment 1100 for implementing various aspects of the disclosure is shown including a computer 1102 including a processing unit 1104, a system memory 1106, and a system bus 1108. The system bus 1108 couples system components including, but not limited to, the system memory 1106 to the processing unit 1104. The processing unit 1104 may be any of a variety of commercially available processors. Dual processors and other multi-processor architectures may also be utilized as the processing unit 1104.

[0080] The system bus 1108 may be any of several types of bus structures that may additionally be interconnected with a memory bus, a peripheral bus, and a local bus using any of a variety of commercially available bus architectures. The system memory 1106 includes a read only memory (ROM) 1110 and a random access memory (RAM) 1112. The basic input / output system (BIOS) is stored in non-volatile memory 1110, such as a ROM, EPROM, or EEPROM, and contains the basic routines that help transfer information between components within the computer 1102, such as during start-up. The RAM 1112 may also include a high-speed RAM, such as a static RAM, for caching data.

[0081] The computer 1102 also includes an internal hard disk drive (HDD) 1114 (e.g., EIDE, SATA) - which may also be configured for external use in a suitable chassis (not shown) - a magnetic floppy disk drive (FDD) 1116 (e.g., for reading from and writing to a removable diskette 1118), and an optical disk drive 1120 (e.g., for reading from and writing to a CD-ROM disk 1122 or other high capacity optical media such as DVDs). The hard disk drive 1114, the magnetic disk drive 1116, and the optical disk drive 1120 may be coupled to the system bus 1108 by a hard disk drive interface 1124, a magnetic disk drive interface 1126, and an optical drive interface 1128, respectively. The interface 1124 for implementing an external drive includes at least one or both of USB (Universal Serial Bus) and IEEE 1394 interface technologies.

[0082] These drives and their associated computer-readable media provide non-volatile storage of data, data structures, computer-executable instructions, and the like. In the case of computer 1102, the drives and media correspond to storage of any data in a suitable digital format. Although the above description of computer-readable media refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those skilled in the art will appreciate that other types of computer-readable media such as zip drives, magnetic cassettes, flash memory cards, cartridges, and the like may also be used in the exemplary operating environment, and that any such media may contain computer-executable instructions for performing the methods of the present disclosure.

[0083] A number of program modules may be stored in the drives and RAM 1112, including an operating system 1130, one or more application programs 1132, other program modules 1134 and program data 1136. All or portions of the operating system, applications, modules and / or data may also be cached in RAM 1112. It will be appreciated that the present disclosure may be embodied with various commercially available operating systems or combinations of operating systems.

[0084] A user may enter commands and information into the computer 1102 through one or more wired / wireless input devices, such as a keyboard 1138 and a pointing device, such as a mouse 1140. Other input devices (not shown) may include a microphone, an IR remote control, a joystick, a game pad, a stylus pen, a touch screen, etc. These and other input devices are often coupled to the processing unit 1104 through an input device interface 1142 that is coupled to the system bus 1108, but may also be coupled by other interfaces, such as a parallel port, an IEEE 1394 serial port, a game port, a USB port, an IR interface, etc.

[0085] A monitor 1144 or other type of display device is also connected to the system bus 1108 via an interface, such as a video adapter 1146. In addition to the monitor 1144, computers typically include other peripheral output devices (not shown), such as speakers, printers, etc.

[0086] The computer 1102 can operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1148, through wired and / or wireless communications. The remote computer(s) 1148 may be a workstation, computing device computer, router, personal computer, handheld computer, microprocessor-based entertainment device, peer device or other conventional network node, and typically includes many or all of the components described for the computer 1102, although for simplicity, only a memory storage device 1150 is illustrated. The logical connections illustrated include wired / wireless connections to a local area network (LAN) 1152 and / or larger networks, such as a wide area network (WAN) 1154. Such LAN and WAN networking environments are commonplace in offices and companies and facilitate enterprise-wide computer networks, such as intranets, all of which may be connected to a global computer network, such as the Internet.

[0087] When used in a LAN networking environment, the computer 1102 is coupled to the local network 1152 through a wired and / or wireless communication network interface or adapter 1156. The adapter 1156 can facilitate wired or wireless communication to the LAN 1152, which also includes a wireless access point installed thereon for communicating with the wireless adapter 1156. When used in a WAN networking environment, the computer 1102 can include a modem 1158 or be coupled to a communications computing device on the WAN 1154 or have other means of establishing communications through the WAN 1154, such as through the Internet. The modem 1158, which can be internal or external and a wired or wireless device, is coupled to the system bus 1108 through a serial port interface 1142. In a networked environment, program modules described for the computer 1102, or portions thereof, can be stored in a remote memory / storage device 1150. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers can be used.

[0088] The computer 1102 is operable to communicate with any wireless device or entity that is deployed and operative in wireless communication, such as printers, scanners, desktop and / or handheld computers, portable data assistants (PDAs), communication satellites, any equipment or location associated with a wireless detectable tag, and telephones. This includes at least Wi-Fi and Bluetooth wireless technologies. Thus, communication may be of a predefined structure, as in a traditional network, or simply ad hoc communication between at least two devices.

[0089] Wi-Fi (Wireless Fidelity) allows for connection to the Internet etc. without wires. Wi-Fi is a wireless technology like a cell phone that allows such devices, e.g., computers, to transmit and receive data indoors and outdoors, anywhere within the reach of a base station. Wi-Fi networks use IEEE 802.11 (a, b, g, etc.) radio technology to provide secure, reliable, and high-speed wireless connections. Wi-Fi can be used to connect computers to each other, to the Internet, and to wired networks (using IEEE 802.3 or Ethernet). Wi-Fi networks can operate in the unlicensed 2.4 and 5 GHz radio bands, e.g., at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or with products that include both bands (dual band).

[0090] Those of ordinary skill in the art will appreciate that information and signals may be represented using any of a variety of different technologies and techniques. For example, the data, instructions, commands, information, signals, bits, symbols and chips that may be referenced in the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0091] Those of ordinary skill in the art will appreciate that the various exemplary logic blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be embodied in electronic hardware, various forms of program or design code (for convenience, referred to herein as software), or a combination of all of these. To clearly illustrate such interoperability of hardware and software, the various exemplary components, blocks, modules, circuits, and steps have been generally described above in relation to their functionality. Whether such functionality is embodied as hardware or software depends on the particular application and design constraints imposed on the overall system. Those of ordinary skill in the art will appreciate that the described functionality may be embodied in various ways for each particular application, and such implementation decisions should not be interpreted as departing from the scope of the present disclosure.

[0092] The various embodiments presented herein may be embodied as a method, apparatus, or article of manufacture using standard programming and / or engineering techniques. The term article of manufacture includes a computer program accessible from any computer-readable storage device, carrier, or media. For example, computer-readable storage media include, but are not limited to, magnetic storage devices (e.g., hard disks, floppy disks, magnetic strips, etc.), optical disks (e.g., CDs, DVDs, etc.), smart cards, and flash memory devices (e.g., EEPROM, cards, sticks, key drives, etc.). Additionally, the various storage media presented herein include one or more devices and / or other machine-readable media for storing information.

[0093] It should be understood that the particular order or hierarchy of steps in the processes presented is an example of an example approach. Based on design priorities, it should be understood that the particular order or hierarchy of steps in the processes may be rearranged within the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, but are not meant to be limited to the particular order or hierarchy presented.

[0094] The description of the embodiments presented is provided to enable any person skilled in the art to use or practice the present disclosure. Various modifications to the embodiments will be apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments without departing from the scope of the present disclosure. The present disclosure is not intended to be limited to the embodiments presented herein, but is to be accorded the broadest scope consistent with the principles and novel features disclosed herein.

Claims

1. 1. A method for obtaining a second route in a second map database that is matched with a first route in a first map database between different map databases each including a node and a link, comprising: matching the data of the first map database with the data of the second map database in the same coordinate system; obtaining candidate links in a second database that are matched with the first route based on coordinate information of the first route; obtaining a start candidate link group and an end candidate link group from among the candidate links based on angle information between the start candidate link group and the links included in the first route; and obtaining the second path by searching for a path connecting a link included in a starting candidate link group and a link included in an ending candidate link group; Including, A method for obtaining a second route in a second database that is matched with a first route, the first route being a route in the first database.

2. The steps of obtaining candidate links in a second database include: acquiring latitude coordinate information included in at least one link included in the first route; acquiring longitude coordinate information included in at least one link included in the first route; obtaining at least one plane based on the vertical coordinate information and the longitude coordinate information; expanding the acquired at least one plane based on a predetermined error range; obtaining a node of a second map database based on the expanded plane; and acquiring a link including the acquired node as a candidate link; 2. A method for obtaining a second route in a second database that is matched with a first route, the first route being a route in a first database according to claim 1, comprising:

3. The step of obtaining the starting candidate link group and the ending candidate link group includes: determining a link that forms an angle with a first link of the first path less than or equal to a first angle as a starting candidate link group; and determining a link that forms an angle with a last link of the second path that is equal to or smaller than a second angle as an end candidate link group; 2. A method for obtaining a second route in a second database that is matched with a first route, the first route being a route in a first database according to claim 1, comprising:

4. The method for obtaining a second path in a second database that is matched with a first path, which is a path in a first database, as claimed in claim 3, wherein the first angle and the second angle are both 20 degrees.

5. The step of determining the starting candidate link group further considers distance information from the first link of the first route to determine the starting candidate link group, 4. The method of claim 3, wherein the step of determining the end candidate link group further considers distance information from the last link of the first route to determine the end candidate link group.

6. the starting candidate link group includes a plurality of links, and the ending candidate link group also includes a plurality of links; In the step of acquiring the second path, the computing device:

2. A method for obtaining a second route of a second database that is matched with a first route, which is a route of a first database, as described in claim 1, comprising obtaining a shortest distance route from among routes connecting a link included in a start candidate link group and a link included in an end candidate link group as a candidate route, thereby obtaining a plurality of candidate routes connecting each of a plurality of links included in the start candidate link group and each of a plurality of links included in an end candidate link group, and obtaining a second route from the obtained candidate routes.

7. The computing device comprises: The method for acquiring a second route of a second database that is matched with a first route, which is a route of the first database, as described in claim 6, further comprising selecting the second route from the candidate routes based on distance information from a start node of the first route and distance information from an end node of the first route.

8. A computer program stored on a computer-readable storage medium, the computer program including instructions for causing one or more processors to obtain a second route in a second map database that is matched with a first route in a first map database between different map databases that are configured with nodes and links, the instructions including: matching the data of the first database with the data of the second database in the same coordinate system; obtaining candidate links in a second database that are matched with the first route based on coordinate information of the first route; obtaining a start candidate link group and an end candidate link group from among the candidate links based on angle information between the start candidate link group and the links included in the first route; and obtaining the second path by searching for a path connecting a link included in a starting candidate link group and a link included in an ending candidate link group; Including, A computer program stored on a computer readable storage medium.

Images