KR102474014B1 - Method and apparatus for finding matching routes between different map databases - Google Patents

Abstract

Disclosed is a method for obtaining a second route of a second map database matching a first route, which is a route of a first map database, between different map databases composed of nodes and links. The method comprises the steps of: matching data on a first map database and data on a second map database by using the same coordinate system; obtaining candidate links, which match a first route, from a second database 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 information on an angle formed with a link included in the first route; and obtaining 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.

Description

Method and device for finding matching routes between different map databases

The present disclosure is for a method for finding matching routes between different map databases.

Domestic road traffic conditions are provided only in the form of domestic standard node links. Accordingly, when services are provided using other map data formats, there is a problem in that the domestic road traffic conditions cannot be reflected. In particular, Google provides map data in the OSM (Open Street Map) data model method, which does not exactly match with domestic standard node links. There was a problem that was difficult to provide.

In order to solve this problem, research is being conducted on a method for finding a route that is accurately matched between different map data.

Registered Patent No. 1538042 provides a method for converting paths between different data formats (2D and 3D).

The present disclosure has been made in response to the aforementioned background art, and aims to provide a method for finding a route of a second map database that exactly matches a route of a first map database among different map databases.

In order to solve the above problem, a method for obtaining a second path of a second map database that matches a first path that is a path of a first map database between different map databases composed of nodes and links is provided. do. The method may include matching data of a first map database and data of a second map database in the same coordinate system; obtaining candidate links matching the first route from a second database 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 formed with a link included in the first path; and acquiring the second path by searching for a path connecting a link included in the starting candidate link group and a link included in the ending candidate link group. can include

Alternatively, acquiring the candidate links from the second database may include: obtaining latitude coordinate information included in at least one link included in the first route; obtaining longitude coordinate information included in at least one link included in the first route; obtaining at least one plane based on the latitude coordinate information and the longitude coordinate information; extending at least one previously acquired plane based on a predetermined error range; obtaining nodes of a second map database based on the previously expanded plane; and obtaining links including previously obtained nodes as candidate links; can include

Alternatively, the acquiring of the starting candidate link group and the ending candidate link group may include: determining links having an angle less than or equal to a first angle with the first link of the first path as starting candidate link groups; and determining links having an angle less than or equal to a second angle with the last link of the second path as termination candidate link groups. can include

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

Alternatively, in the determining of the starting candidate link group, the starting candidate link group is determined by further considering distance information from the first link of the first path, and the determining of the ending candidate link group includes the first link group. An ending candidate link group may be determined by further considering distance information from the last link of the path.

Alternatively, the starting candidate link group includes a plurality of links, the ending candidate link group also includes a plurality of links, and in the step of acquiring the second path, the computing device: included in the starting candidate link group 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 is obtained as a candidate path among paths connecting the linked link and the link included in the end candidate link group. It is possible to obtain a plurality of candidate paths that connect, and obtain a second path among the obtained candidate paths.

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

A computer program stored in a computer readable storage medium for solving the above problems, wherein the computer program is configured to generate a first path that is a path of a first map database between different map databases composed of nodes and links by one or more processors. It includes instructions for obtaining a second path of a second map database that matches, the instructions comprising: matching data of the first database and data of the second database to the same coordinate system; obtaining candidate links matching the first route from a second database 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 formed with a link included in the first path; and acquiring the second path by searching for a path connecting a link included in the starting candidate link group and a link included in the ending candidate link group. Including, it can provide a computer program stored in a computer-readable storage medium.

According to the present disclosure, a route of a second map database that exactly matches a route of a first map database may be obtained.

1 is a diagram for explaining a map database according to an embodiment of the present disclosure.
2 is a diagram for explaining a computing device 100 according to an embodiment of the present disclosure.
FIG. 3 is a diagram for explaining a method of obtaining a second path by the computing device 100 according to an embodiment of the present disclosure.
4A to 4C are diagrams illustrating a method of obtaining a second path according to an embodiment of the present disclosure.
5 is a diagram for explaining a method of obtaining candidate routes according to another embodiment of the present disclosure.
6 is a simplified and general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

Various embodiments are now described with reference to the drawings. In this specification, various descriptions are presented to provide an understanding of the present disclosure. However, it is apparent that these embodiments may be practiced without these specific details.

The terms “component,” “module,” “system,” and the like, as used herein, refer to a computer-related entity, hardware, firmware, software, a combination of software and hardware, or an execution of software. For example, a component may be, but is not limited to, a procedure, processor, object, thread of execution, program, and/or computer running on a processor. For example, both an application running on a computing device and a computing device may be components. One or more components may reside within a processor and/or thread of execution. A component can be localized within a single computer. A component may be distributed between two or more computers. Also, these components can execute from various computer readable media having various data structures stored thereon. Components may be connected, for example, via signals with one or more packets of data (e.g., data and/or signals from one component interacting with another component in a local system, distributed system) to other systems and over a network such as the Internet. data being transmitted) may communicate via local and/or remote processes.

In addition, 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 employs A or B” is intended to mean one of the natural inclusive substitutions. That is, X uses A; X uses B; Or, if X uses both A and B, "X uses either A or B" may apply to either of these cases. Also, the term "and/or" as used herein should be understood to refer to and include all possible combinations of one or more of the listed related items.

Also, the terms "comprises" and/or "comprising" should be understood to mean that the features and/or components are present. However, it should be understood that the terms "comprises" and/or "comprising" do not exclude the presence or addition of one or more other features, elements, and/or groups thereof. Also, unless otherwise specified or where the context clearly indicates that a singular form is indicated, the singular in this specification and claims should generally be construed to mean "one or more".

In addition, the term “at least one of A or B” should be interpreted as meaning “when only A is included”, “when only B is included”, and “when A and B are combined”.

Those skilled in the art will further understand that the various illustrative logical blocks, components, modules, circuits, means, logics, and algorithm steps described in connection with the embodiments disclosed herein may be implemented using electronic hardware, computer software, or combinations of both. It should be recognized that it can be implemented as To clearly illustrate the interchangeability of hardware and software, various illustrative components, blocks, configurations, means, logics, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented in hardware or as software depends on the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application. However, such implementation decisions should not be interpreted as causing a departure from the scope of this disclosure.

The description of the presented embodiments is provided to enable any person skilled in the art to use or practice the present invention. Various modifications to these embodiments will be apparent to those skilled in the art of this disclosure. The general principles defined herein may be applied to other embodiments without departing from the scope of this disclosure. Thus, the present invention is not limited to the embodiments presented herein. The present invention is to be accorded the widest scope consistent with the principles and novel features set forth herein.

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

According to an embodiment of the present disclosure, a map database may be composed of nodes and links.

Here, the node may represent a place where a change in speed occurs when the vehicle travels on the road. Specifically, the node may represent an intersection, an overpass, a starting and ending point of a road, an underpass starting and ending point, a tunnel starting and ending point, an administrative boundary, and the like, but is not limited thereto.

In addition, the link may mean a node that is a speed change occurrence point and a line connecting the node, and may represent a real road. Specifically, the links may represent roads, bridges, overpasses, underpasses, tunnels, and the like, but are not limited thereto.

The map database may be constructed differently depending on the subject of construction. For example, even if a map database is constructed for the same place in Korea, map data constructed in Korea and map data constructed in foreign countries may be different from each other.

The Korean government provides traffic data by matching it with map data built by the government. As a result, when providing services using domestic map data built by other entities, there is a disadvantage in that it is difficult to utilize traffic data, so it is necessary to match map data built in Korea with map data built in foreign countries. there is

1(a) shows one path (eg, a first path) composed of nodes and links in a first map database according to an embodiment of the present disclosure. Part 2 (b) is data representing the neighborhood of the first route in the second map database. Hereinafter, a method for finding a route matching the first route in the second map database will be described.

2 is a diagram for explaining a computing device 100 according to an embodiment of the present disclosure.

The configuration of the computing device 100 shown in FIG. 2 is only a simplified example. In one embodiment of the present disclosure, the computing device 100 may include other components for performing a computing environment of the computing device 100, and only some of the disclosed components may constitute the computing device 100.

The computing device 100 may include a processor 110 , a memory 130 , and a network unit 150 .

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

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 .

According to an embodiment of the present disclosure, the memory 130 is a flash memory type, a hard disk type, a multimedia card micro type, or a card type memory (eg, SD or XD memory, etc.), RAM (Random Access Memory, RAM), SRAM (Static Random Access Memory), ROM (Read-Only Memory, ROM), EEPROM (Electrically Erasable Programmable Read-Only Memory), PROM (Programmable Read-Only Memory) -Only Memory), a magnetic memory, a magnetic disk, and an optical disk may include at least one type of storage medium. The computing device 100 may operate in relation to a web storage that performs a storage function of the memory 130 on the Internet. The above description of the memory is only an example, and the present disclosure is not limited thereto.

The network unit 150 according to an embodiment of the present disclosure includes a Public Switched Telephone Network (PSTN), x Digital Subscriber Line (xDSL), Rate Adaptive DSL (RADSL), Multi Rate DSL (MDSL), and VDSL ( Various wired communication systems such as Very High Speed DSL), Universal Asymmetric DSL (UADSL), High Bit Rate DSL (HDSL), and Local Area Network (LAN) may be used.

In addition, the network unit 150 presented in this specification includes Code Division Multi Access (CDMA), Time Division Multi Access (TDMA), Frequency Division Multi Access (FDMA), Orthogonal Frequency Division Multi Access (OFDMA), SC-FDMA ( Single Carrier-FDMA) and other systems.

In the present disclosure, the network unit 150 may be configured regardless of its communication mode, such as wired and wireless, and may be configured with various communication networks such as a personal area network (PAN) and a wide area network (WAN). can In addition, the network may be the known World Wide Web (WWW), or may use a wireless transmission technology used for short-range communication, such as Infrared Data Association (IrDA) or Bluetooth.

The computing device 100 of the present disclosure may obtain a second path of a second map database that matches a first path of a first map database between different map databases composed of nodes and links. . Hereinafter, it will be described in detail with reference to FIG. 3 .

FIG. 3 is a diagram for explaining a method of obtaining a second path by the computing device 100 according to an embodiment of the present disclosure.

In step S310, the computing device 100 may match data of the first map database and data of the second map database in the same coordinate system.

For example, the computing device 100 may match node and link information included in the first map database and node and link information included in the second map database with the same Cartesian coordinate system.

In step S320, the computing device 100 may obtain candidate links matching the first route of the first map database from the second database based on the coordinate information of the first route.

For example, the computing device 100 may obtain latitude coordinate information included in at least one link of the first route. Specifically, for example, the computing device 100 may obtain all latitude coordinate values included in all links of the first path.

Also, the computing device 100 may obtain longitude coordinate information included in at least one link of the first path. Specifically, for example, the computing device 100 may obtain all longitude coordinate values included in all links of the first path.

Also, the computing device 100 may obtain at least one plane based on at least one of latitude coordinate information and longitude coordinate information. Specifically, for example, the computing device 100 may obtain one plane by using the maximum value and the minimum value of the obtained plurality of latitude coordinate values and the maximum value and minimum value of the obtained plurality of longitude coordinate values.

Also, the computing device 100 may obtain nodes of the second map database based on the obtained at least one plane, and may obtain links including the acquired nodes as candidate links. Specifically, for example, the computing device 100 may expand the acquired plane based on a predetermined error range, detect all nodes included in the expanded plane on the second map data, and among the detected nodes. Links on the second map data including at least one may be obtained as candidate links.

In step S330, the computing device 100 may obtain a start candidate link group and an end candidate link group from among candidate links based on angle information formed with a link included in the first path.

Computing device 100 may have a predetermined angle threshold. For example, the computing device 100 may have a prior angle threshold for obtaining a starting candidate link group, and may have a prior angle threshold for obtaining an ending candidate link group. In this case, the preliminary angle threshold for acquiring the starting candidate link group and the preliminary angle threshold for obtaining the ending candidate link group may be the same (specifically, for example, the preliminary angle threshold may be 20 degrees, but not limited to).

The computing device 100 may determine, as a start candidate link group, links having an angle between the first link of the first path and the first link smaller than a prior angle threshold value among candidate links. In this case, the initial link generally refers to a link connected to the start node in the first path, but may also refer to a link not connected to the start node according to a developer's choice or road conditions.

In addition, the computing device 100 may determine a starting candidate link group by further considering distance information from the first link of the first path. Specifically, the computing device 100 selects, among candidate links, links formed by an angle between the initial link of the first path and a distance from the initial link smaller than a prior angle threshold and a distance from the initial link smaller than a prior distance threshold as starting candidate link groups. can decide In this case, the distance between the initial link and the candidate link may be defined as the distance between the end point of the initial link and the end point of the candidate link, but is not limited thereto.

The computing device 100 may determine, from among the candidate links, links having an angle between the last link of the first path and a smaller than a prior angle threshold value as the termination candidate link group. In this case, the last link generally means a link connected to the end node in the first path, but may mean a link not connected to the end node according to the developer's choice or road conditions.

Also, the computing device 100 may determine the ending candidate link group by further considering distance information from the last link of the first path. Specifically, the computing device 100 selects, among candidate links, links that have an angle between the last link of the first path and a distance from the last link that is less than a prior angle threshold and a distance from the last link that is less than a prior distance threshold, as termination candidate link groups. can decide In this case, the distance between the last link and the candidate link may be defined as the distance between the end point of the last link and the end point of the candidate link, but is not limited thereto.

In operation 340, the computing device 100 may obtain a second path by searching for a path connecting a link included in the starting candidate link group and a link included in the ending candidate link group. In this case, the second path means a path composed of at least one node and at least one link included in the second map data.

According to an embodiment of the present disclosure, the computing device 100 obtains a path connecting a link included in a starting candidate link group and a link included in an ending candidate link group by using the Dijkstra Algorithm, Candidate routes can be obtained. In other words, the computing device 100 may obtain, as a candidate path, a shortest path among paths connecting a link included in the starting candidate link group and a link included in the candidate link group. 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 determines each of the plurality of links included in the start candidate link group and the end candidate link. A plurality of candidate paths connecting each of a plurality of links included in the group may be obtained.

Also, the computing device 100 may obtain a second path from among a plurality of candidate paths. For example, the computing device 100 may obtain a second path among candidate paths based on distance information from the first path. Specifically, the computing device 100 may obtain a path having the minimum distance information from the first path among candidate paths as the second path.

In this case, the distance information from the first path is the distance between the start node of the first path and the start node of the candidate path (first distance value) and the distance between the end node of the first path and the end node of the candidate path (first distance value). 2 distance values) may mean a value obtained by averaging (a value obtained by averaging the first distance and the second distance), but is not limited thereto.

According to another embodiment of the present disclosure, the computing device 100 includes all coordinate points included in the first path and a first path among links included in the candidate path, in order to obtain a second path among candidate paths. A sum (Value_Sum) of distance values to the nearest link may be obtained. Also, the computing device 100 may obtain a candidate link having a minimum sum of obtained distance values (Value_Sum) among candidate links as the second path.

4A to 4C are diagrams illustrating a method of obtaining a second path according to an embodiment of the present disclosure.

According to an embodiment of the present disclosure, 401 of FIG. 4A represents a first path of first map data. The first path may include 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. The first path may have three or more links, but here, for convenience of description, it is assumed that the first path has two links.

According to an embodiment of the present disclosure, 402 of FIG. 4A illustrates candidate links matching the first path. The computing device 100 may obtain candidate routes by using at least one of latitude coordinate information and longitude coordinate information of the first route. A detailed description of this has been described above with reference to FIG. 3 .

403 of FIG. 4B illustrates an example of starting candidate link groups, and 404 of FIG. 4B illustrates an example of ending candidate link groups, according to an embodiment of the present disclosure. The computing device 100 may determine, as a starting candidate link group, links having an angle between the initial link of the first path and a distance from the initial link smaller than a prior distance threshold value, among candidate links, and a distance from the initial link less than a prior distance threshold value. . In addition, the computing device 100 determines, as an ending candidate link group, links having an angle between the last link of the first path and a distance between the last link and the last link smaller than a prior distance threshold among the candidate links. can A detailed description of this has been described above with reference to FIG. 3 .

According to an embodiment of the present disclosure, 405 of FIG. 4C illustrates an example of obtaining 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. Specifically, when there are a plurality of paths connecting the starting candidate link and the ending candidate link, the computing device 100 may obtain the shortest path ((2) of 405) among the paths as a candidate path.

According to an embodiment of the present disclosure, 406 of FIG. 4C shows an example of obtaining a plurality of candidate routes. Specifically, when the number of links included in the start candidate link group is 3 (a, b, c) and the number of links included in the end candidate link group is 3 (l, m, n), the computing device 100 can obtain 9 (3*3=9) paths as candidate paths.

According to an embodiment of the present disclosure, the computing device 100 may obtain a path having a minimum distance information from the first path among candidate paths as the second path.

5 is a diagram for explaining a method of obtaining candidate paths according to another embodiment of the present disclosure.

According to an embodiment of the present disclosure, if the shortest path among paths connecting a start candidate link and an end candidate link is obtained as a candidate path, an embodiment in which a path that does not match the first path becomes a candidate path may occur in a special situation. have.

Referring to FIG. 5 , a solid line in (a) represents a first path, and a solid line in (b) represents a candidate path with the shortest distance. Also, in (c), a solid line indicates a candidate path matching the first path.

As can be seen in FIG. 5 , if the shortest path among the paths connecting the starting candidate link and the ending candidate link is obtained as a candidate path, a path shown by a solid line in (b) can be obtained as a candidate path. In this case, an embodiment may occur in which the computing device 100 fails to obtain a path, such as the solid line in (c), matching the first path as a candidate path. This embodiment may occur when the second map data has more detailed data.

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

According to another embodiment of the present disclosure, the computing device 100 may obtain candidate paths by selecting paths among all paths connecting the start candidate link and the end candidate link based on a predetermined threshold. Specifically, when there are excessively many paths connecting starting candidate links and ending candidate links, a path having distance information of a path having a distance equal to or less than a predetermined threshold value is selected, and/or a path having distance information of a path in descending order is selected. Candidate routes may be obtained by selecting a predetermined number of routes.

According to an embodiment of the present disclosure, the computing device 100 determines the coordinate points included in the first route and the first route and the closest links among links included in the candidate route in order to obtain a second route among candidate routes. A sum (Value_Sum) of distance values to a nearby link may be obtained. Also, the computing device 100 may obtain a candidate link having a minimum sum of obtained distance values (Value_Sum) among candidate links as the second path.

6 is a simplified and general schematic diagram of an exemplary computing environment in which embodiments of the present disclosure may be implemented.

Although the present disclosure has been described above as being generally embodied by a computing device, those skilled in the art will understand that the present disclosure may be combined with computer-executable instructions and/or other program modules that may be executed on one or more computers and/or may be implemented in hardware and software. It will be appreciated that it can be implemented as a combination.

Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. In addition, those skilled in the art will understand that the methods of the present disclosure can be applied to single-processor or multiprocessor computer systems, minicomputers, mainframe computers as well as personal computers, handheld computing devices, microprocessor-based or programmable consumer electronics, and the like ( It will be appreciated that each of these may be implemented with other computer system configurations, including those that may be operative in connection with one or more associated devices.

The described 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.

Computers typically include a variety of computer readable media. Computer readable media can be any medium that can be accessed by a computer, including volatile and nonvolatile media, transitory and non-transitory media, removable and non-transitory media. Includes removable media. By way of example, and not limitation, computer readable media may include computer readable storage media and computer readable transmission media. Computer readable storage media are volatile and nonvolatile media, transitory and non-transitory, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. includes media Computer readable storage media may include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage device, magnetic cassette, magnetic tape, magnetic disk storage device or other magnetic storage device. device, or any other medium that can be accessed by a computer and used to store desired information.

A computer readable transmission medium 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. Including all information delivery media. The term modulated data signal means a signal that has one or more of its characteristics set or changed so as to encode information within 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 are also intended to be included within the scope of computer readable transmission media.

An exemplary environment 1100 implementing various aspects of the present disclosure is shown including a computer 1102, which includes a processing unit 1104, a system memory 1106, and a system bus 1108. do. System bus 1108 couples system components, including but not limited to system memory 1106 , to processing unit 1104 . Processing unit 1104 may be any of a variety of commercially available processors. Dual processor and other multiprocessor architectures may also be used as the processing unit 1104.

System bus 1108 may be any of several types of bus structures that may additionally be interconnected to a memory bus, a peripheral bus, and a local bus using any of a variety of commercial bus architectures. System memory 1106 includes read only memory (ROM) 1110 and random access memory (RAM) 1112 . A basic input/output system (BIOS) is stored in non-volatile memory 1110, such as ROM, EPROM, or EEPROM, and is a basic set of information that helps transfer information between components within computer 1102, such as during startup. contains routines. RAM 1112 may also include high-speed RAM, such as static RAM, for caching data.

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

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, drives and media correspond to storing any data in a suitable digital format. Although the description of computer readable media above refers to HDDs, removable magnetic disks, and removable optical media such as CDs or DVDs, those skilled in the art can use zip drives, magnetic cassettes, flash memory cards, cartridges, etc. It will be appreciated that other tangible media readable by the computer, such as the like, may also be used in the exemplary operating environment and any such media may include computer executable instructions for performing the methods of the present disclosure.

A number of program modules may be stored on the drive 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 implemented in a variety of commercially available operating systems or combinations of operating systems.

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, IR remote control, joystick, game pad, stylus pen, touch screen, and the like. Although these and other input devices are often connected to the processing unit 1104 through an input device interface 1142 that is connected to the system bus 1108, a parallel port, IEEE 1394 serial port, game port, USB port, IR interface, may be connected by other interfaces such as the like.

A monitor 1144 or other type of display device is also connected to the system bus 1108 through 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, and the like.

Computer 1102 may operate in a networked environment using logical connections to one or more remote computers, such as remote computer(s) 1148 via wired and/or wireless communications. Remote computer(s) 1148 may be a workstation, computing device computer, router, personal computer, handheld computer, microprocessor-based entertainment device, peer device, or other common network node, and generally includes It includes many or all of the components described for, but for simplicity, only memory storage device 1150 is shown. The logical connections shown include wired/wireless connections to a local area network (LAN) 1152 and/or a larger network, such as a wide area network (WAN) 1154 . Such LAN and WAN networking environments are common in offices and corporations and facilitate enterprise-wide computer networks, such as intranets, all of which can be connected to worldwide computer networks, such as the Internet.

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

Computer 1102 is any wireless device or entity that is deployed and operating in wireless communication, eg, printers, scanners, desktop and/or portable computers, portable data assistants (PDAs), communication satellites, wireless detectable tags associated with It operates to communicate with arbitrary equipment or places and telephones. This includes at least Wi-Fi and Bluetooth wireless technologies. Thus, the communication may be a predefined structure as in conventional networks or simply an ad hoc communication between at least two devices.

Wi-Fi (Wireless Fidelity) makes it possible to connect to the Internet without wires. Wi-Fi is a wireless technology, such as a cell phone, that allows such devices, eg, computers, to transmit and receive data both indoors and outdoors, i.e. anywhere within coverage of a base station. Wi-Fi networks use radio technologies called IEEE 802.11 (a, b, g, etc.) 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, for example at 11 Mbps (802.11a) or 54 Mbps (802.11b) data rates, or in products that include both bands (dual band) .

Those skilled in the art will understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, instructions, information, signals, bits, symbols and chips that may be referenced in the above description are voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields s or particles, or any combination thereof.

Those skilled in the art will understand that the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the embodiments disclosed herein are electronic hardware, (for convenience) , may be implemented by various forms of program or design code (referred to herein as software) or a combination of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends on the particular application and the design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

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

It is to be understood that the specific order or hierarchy of steps in the processes presented is an example of exemplary approaches. Based upon design priorities, it is to be understood that the specific order or hierarchy of steps in the processes may be rearranged within the scope of this disclosure. The accompanying method claims present elements of the various steps in a sample order, but are not meant to be limited to the specific order or hierarchy presented.

The description of the presented embodiments is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these embodiments will be apparent to those skilled in the art of this disclosure, and the general principles defined herein may be applied to other embodiments without departing from the scope of this disclosure. Thus, the present disclosure is not to be limited to the embodiments presented herein, but is to be interpreted in the widest scope consistent with the principles and novel features presented herein.

Claims (8)

A method for obtaining, by a computing device, a second path of a second map database that matches a first path that is a path of a first map database between different map databases composed of nodes and links, the method comprising:
matching data of the first map database and data of the second map database with the same coordinate system;
obtaining candidate links matching the first route from a second database 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 formed with a link included in the first path; and
acquiring the second path by searching for a path connecting a link included in the starting candidate link group and a link included in the ending candidate link group;
including,
Obtaining the candidate links from the second database comprises:
obtaining latitude coordinate information included in at least one link included in the first route;
obtaining longitude coordinate information included in at least one link included in the first path;
obtaining at least one plane based on the latitude coordinate information and the longitude coordinate information;
extending the acquired at least one plane based on a predetermined error range;
obtaining nodes of a second map database based on the expanded plane; and
obtaining links including the obtained nodes as candidate links;
including,
A method of obtaining a second path of a second database that matches a first path that is a path of a first database. delete The method of claim 1, wherein acquiring the starting candidate link group and the ending candidate link group comprises:
determining links having an angle less than or equal to a first angle with an initial link of the first path as starting candidate link groups; and
determining links having an angle less than or equal to a second angle with the last link of the second path as termination candidate link groups;
including,
A method of obtaining a second path of a second database that matches a first path that is a path of a first database. The method of claim 3, wherein the first angle and the second angle are both 20 degrees,
A method of obtaining a second path of a second database that matches a first path that is a path of a first database. According to claim 3,
In the determining of the starting candidate link group, the starting candidate link group is determined by further considering distance information from the first link of the first path;
In the determining of the ending candidate link group, the ending candidate link group is determined by further considering distance information from the last link of the first path.
A method of obtaining a second path of a second database that matches a first path that is a path of a first database. According to claim 1,
The start candidate link group includes a plurality of links, and the end candidate link group also includes a plurality of links;
In obtaining the second path, the computing device:
Among the paths connecting the link included in the starting candidate link group and the link included in the ending candidate link group, the shortest distance path is obtained as a candidate path, and is included in each of the plurality of links included in the starting candidate link group and the ending candidate link group. obtaining a plurality of candidate paths connecting each of the plurality of links, and obtaining a second path among the obtained candidate paths;
A method of obtaining a second path of a second database that matches a first path that is a path of a first database. The method of claim 6, wherein the computing device,
Selecting the second path among the candidate paths based on distance information from a start node of the first path and distance information from an end node of the first path,
A method of obtaining a second path of a second database that matches a first path that is a path of a first database. A computer program stored on a computer-readable storage medium, wherein the computer program is configured by one or more processors to generate a second map database that matches a first path that is a path of a first map database between different map databases composed of nodes and links. Includes instructions to obtain the second path of, the instructions comprising:
matching data of the first database and data of the second database in the same coordinate system;
obtaining candidate links matching the first route from a second database 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 formed with a link included in the first path; and
acquiring the second path by searching for a path connecting a link included in the start candidate link group and a link included in the end candidate link group;
including,
Obtaining the candidate links from the second database comprises:
obtaining latitude coordinate information included in at least one link included in the first route;
obtaining longitude coordinate information included in at least one link included in the first path;
obtaining at least one plane based on the latitude coordinate information and the longitude coordinate information;
extending the acquired at least one plane based on a predetermined error range;
obtaining nodes of a second map database based on the expanded plane; and
obtaining links including the obtained nodes as candidate links;
including,
A computer program stored on a computer readable storage medium.

Images