JP2001331491A - Target retrieval method and target retrieval device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a target retrieval device capable of retrieving the positions of pertinent targets from map data when a relation among plural targets is specified. SOLUTION: This target retrieval device for retrieving the targets from a map data base 70 is provided with an input means 30 for specifying plural names for indicating the targets and a distance between the targets, a map data retrieval means 11 for retrieving the position data of the targets pertinent to the respective names from the target data of the map data base, a distance calculation means 12 for calculating the distance between the respective targets by using the position data and a link detection means 13 for comparing the calculated distance with the specified distance between the targets and retrieving the set of close targets. Whether or not the targets are close to each other is automatically judged and the pertinent position is retrieved even when a place is specified like 'the place where a convenience store and a gas station can be viewed nearby'.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and an apparatus for searching for a target from a map database, and more particularly to a method for searching for a target when a relation between a plurality of targets or a relation with a road is specified. It is possible to search for the corresponding target.

[0002]

2. Description of the Related Art Conventionally, a map search device for searching for and displaying a target object from a map database has been developed.
For example, Japanese Utility Model Publication No. 7-49506 describes a device that, when a user inputs a name, a name of a destination, and the like, searches for and displays address data and a position in a map image.

As shown in FIG. 14, this apparatus includes a display 2 for displaying a map image, a keyboard 3 for a user to input the name of a target, a floppy (registered trademark) disk drive 6 for reading address book data, and And a CD-ROM 7 storing map data, a CPU 1 comprising a microprocessor, a ROM 4 storing a program defining the operation of the CPU 1, and a RAM 5 used by the CPU 1 as a work area.

The address book data read from the floppy disk drive 6 includes an address, a name or a destination name, an address kanji code, and other information as shown in FIG.

As shown in FIG. 16, an address (data number), an address kanji code, a page number of a plurality of divided maps stored in the CD-ROM 7, and the page A map search table including X and Y coordinate data therein is recorded.

In this device, when the user inputs a name or a destination name from the keyboard 3, the CPU 1 reads the address kanji code corresponding to the name or the destination name from the address book data in accordance with the procedure shown in FIG. (Step 1), a record having this address kanji code is searched from the map search table, a page of the divided map is obtained, and a map image of the corresponding page is displayed on the display 2 (step 2). Then, from that record X
The Y coordinate is obtained, and the corresponding XY coordinate of the displayed map image is highlighted.

[0007] As described above, the conventional map search device (target search device) searches for a target corresponding to the input from a single input (for example, a target name, a genre of a target, an address, etc.). It has the function to do.

[0008] In addition, even a device that performs a search based on a plurality of inputs presents search results corresponding to the respective input search keys.

[0009]

However, in the conventional target search device, when searching for a place where a plurality of targets are in a predetermined positional relationship, for example, a "place where a convenience store and a gas station are close to each other" is searched. ", Enter" convenience store "and" gas station "respectively, and display the locations of the searched convenience store and gas station on a map. The operator had to judge the location near the gas station.

As described above, in the conventional target search device,
There is a problem that the location cannot be specified by utilizing a keyword such as "nearby" indicating the positional relationship between a plurality of targets.

[0011] Such a problem becomes a serious problem particularly in an emergency call system and the like. The emergency call system is a system that automatically reports accident information from the in-vehicle device of the accident vehicle to the center when a traffic accident occurs, but the center does not provide accurate location information from the in-vehicle device. Try to identify the location of the accident by talking with the driver. At this time, even if the driver sends a message such as "a place where a convenience store and a gas station can be seen", the conventional target search device cannot identify the accident site from this information.

The present invention solves such a conventional problem. When a relationship between a plurality of targets is specified, a target which can search the position of the target from a map database is specified. It is an object of the present invention to provide an object search method and an apparatus for executing the method.

[0013]

Therefore, according to the present invention, in a target search method for searching for a target from a map database, when a plurality of names representing the target and a distance between the targets are specified, From the target data included in the map database, search for the position data of the target corresponding to each of the names, calculate the distance between each target using the searched position data, this distance is specified distance The following set of landmarks is searched.

When a route number of a road and a name representing a target are specified, a mesh including the road having this route number and a mesh surrounding the mesh are searched from the road data included in the map database. Then, an area including all of the searched meshes is set as a search area, and a target corresponding to the name and located in the search area is searched from the target data included in the map database. I have to.

Further, in a target search device for searching for a target from a map database, input means for designating a plurality of names representing the target and a distance between the targets, and this name from target data in the map database. Map data search means for searching for position data of a target object corresponding to each of:
Distance calculating means for calculating the distance between each target using the retrieved position data, and comparing the distance calculated by the distance calculating means with the distance between the specified targets, Link detecting means for searching for a set of targets located close to each other at an interval equal to or less than the distance between the target objects.

Therefore, it can be automatically determined whether or not the targets are close to each other or the road and the target are close to each other. Therefore, even when a location is designated by an expression such as "a place where a convenience store and a gas station can be seen nearby", the corresponding position can be searched from the map database, and "〇〇 along the road", "〇 〇Nearby ''
The location can be specified by utilizing the keyword "".

[0017]

(First Embodiment) A first embodiment of the present invention.
When the names of a plurality of targets and the distance between the targets are specified, the target search device according to the embodiment searches for a set position of the targets that are close to each other at an interval equal to or less than the specified distance. Can be returned as

As shown in FIG. 1, the apparatus includes an input section 30 for an operator to specify a target and a distance, a map data storage section 70 for storing a map database containing road information and target data, A display unit 20 for displaying an image; a CPU 1 for executing a process of searching for a target; a ROM 4 storing a program that defines the operation of the CPU 1;
Has a RAM 5 used as a work area. The CPU 1 has, as a block configuration, a map data search unit 11 for searching a map database, a distance calculation unit 12 for calculating a distance between a plurality of target objects, And a link detection unit 13 for detecting a target object located (linked) in a predetermined position.

As shown in FIG. 7, the map database of the map data storage unit 70 stores data of addresses (data numbers), names of target objects, genre names of target objects, and X and Y coordinates on the map. A table of target object data including the target object data is accumulated.

It is assumed that a plurality of names # 1, # 2,..., #N and an upper limit distance 1 between the targets are input by the operator from the input unit 30 of the apparatus.

The map data search unit 11 includes a map data storage unit
From the target data of the map database stored in 70,
First, a search is made for a target record for the designated name # 1, and the search result is stored in the target information table # 1 in the RAM 5.
Stored as Next, a record of a target for the designated name # 2 is searched, and the search result is stored as a target information table # 2. Similarly, a record of a target for the designated name #n is searched, and the search result is stored as a target information table #n. In FIG. 2, the names # 1,
The example shows the position on the map of the target searched for each of # 2 and # 3.

FIG. 8 shows an example of the target information table # 1 when "Kuromatsu Store" is input as the name of # 1.
FIG. 8A shows an example of the target information table # 2 when "Aomatsu stand" is input as the name of # 2 in FIG.
FIG. 8C shows an example of the target information table # 3 when “Yellow Green Bank” is input as the name of # 3 shown in FIG.

The distance calculation unit 12 is provided with a target information table # 1
For each target, the distance to the target in the target information table # 2 is calculated, and the link detection unit 13 compares the calculated distance with the distance l between the specified targets, and calculates the distance l Are linked, and each target is stored in the RAM 5 as a corresponding target.

In the example of FIG. 8, (# 1-1) and (# 2)
-1), (# 1-1) and (# 2-2), (# 1-2) and (# 2-1), (# 1-2) and (# 2-2), (# 1-
3) and (# 2-1), and each distance of (# 1-3) and (# 2-2) are calculated and compared with the distance l. For example, (# 1-1) and (# 2-1) Is less than or equal to l, (# 1-
1) and (# 2-1) are stored in the RAM 5 as corresponding targets.

In FIG. 3, the range of the distance 1 from each target in the target information table # 1 is represented by a dotted line, and if there is a target # 2 that falls within the range of the dotted line, the # 1 and # 2 objects 2
Are linked. Here, only two sets are applicable targets.

Next, similarly, the target information table #
For each target, the distance between the target and the target in the target information table # 3 is compared, and those which fall within the range of the specified distance l between the targets are linked, and each target is linked. Make the target object. FIG. 4 shows this state. Here, there is no corresponding target.

Similarly, the distance between the target in the target information table #n and the target in the target information table #n is compared for each target in the target information table # 1 so that the distance between the targets is within the range of the distance l between the specified targets. The objects to be entered are linked, and each target is set as a corresponding target.

When the link between the target information table # 1 and the target information tables # 2 to #n has been completed, the target information table # 2 is linked to the target information tables # 3 to #n. Perform linking. FIG. 5 shows a state of linking the target information table # 2 and the target information table # 3.

This linking is performed in the landmark information table #n
For all combinations of. Here, all unlinked target objects are excluded from the target.

Next, the link detecting unit 13 determines whether the link between the target information table # 1 and the target information table # 2 corresponds to the target, the target information table # 2 and the target information table # 3. The target in the linking is checked, and if the target in the target information table # 2 is the same, the target in the target information table # 1, the target information table # 2, and the target information table # 3 Is identified as a link.

That is, (# 1-1) and (##) are linked by linking the target information table # 1 and the target information table # 2.
2-1) is linked, and the link between the target information table # 2 and the target information table # 3 is (#).
When 2-1) and (# 3-1) are linked, the target information table # 1 and the target information table # 3
Even if (# 1-1) and (# 3-1) were not linked by linking with, via (# 2-1),
(# 1-1), (# 2-1) and (# 3-1) are linked.

Similarly, the linked targets from the target information table # 1 to the target information table #n are checked, and the links are further expanded. FIG. 6 shows a target linked to the target information table # 1, the target information table # 2, and the target information table # 3 based on the link results of FIG. 3 and FIG.

The link detecting section 13 performs such processing,
A search target result is a link position of a target in which the number of linked targets (however, the number of targets listed in the same target information table is counted as one) is the same as the number of names input as search targets. The data is output to the display unit 20 and displayed on a map image.

As described above, in this device, when the names of a plurality of targets and the distance between the targets are specified, the link positions of the targets linked at intervals smaller than the specified distance are searched. can do.

Although the case where a plurality of target object names are specified has been described here, even when a plurality of genre names are specified, the genre names are set to # 1 to #n, and the target objects in the map database are set. The same processing can be performed by storing search results from data in the target information tables # 1 to #n.

The same processing can be performed when a plurality of target object names and genre names are input.

(Second Embodiment) A landmark search device according to a second embodiment, when a route number of a road, names of a plurality of landmarks, and a distance between the landmarks are designated, along the road. Is used to search for a link position of a target object that is close to the specified distance.

The structure of this device is the first embodiment (FIG. 1)
There is no change.

From the input unit 30 of this device, the operator inputs the route number of the road and a plurality of names # 1, # 2,.
It is assumed that n and the upper limit distance l between the targets are input.

The map data search unit 11 includes a map data storage unit
From the road information in the map database stored in 70,
Searches the area near the road with the specified route number.

As shown in FIG. 12, the map data is divided into meshes as a specific management unit. Therefore, the map data search unit 11 first obtains a mesh including the corresponding line number. FIG. 9 shows the mesh thus obtained.

At this time, assuming that only the mesh including the relevant line number is the search target area for the target, as shown in FIG. 13, a mesh that leaks from the search target area while being close to the road with that line number is generated. I do. In order to prevent this, as shown in FIG. 10, surrounding meshes that are vertically, horizontally, and diagonally of the acquired mesh and are not yet included in the search target area are fetched into the search target area.
Expand search area.

Next, the map data search section 11 searches the target object data of the map database for a record of the target object located in the search target area and having the specified name # 1. It is stored in the RAM 5 as an object information table # 1. Next, a record of a target included in the search target area and having the specified name # 2 is searched for, and the target object information table # 2 is set as R.
Store it in AM5. Similarly, a record of a target included in the search target area and having the specified name #n is searched and stored as the target information table #n.

In response, the distance calculation unit 12 and the link detection unit 13 perform the same processing as in the first embodiment. That is,
The distance calculation unit 12 calculates the distance between the targets in each target information table, and the link detection unit 13 compares the calculated distance with the distance l between the specified targets, and calculates the distance l. The objects within the range are linked, the linked targets are checked and the link is expanded, and the number of linked targets (however, the number of targets listed in the same target information table is counted as one) ) Outputs the link positions of the target objects as many as the number of the names input as the search target to the display unit 20 as the search target result and displays them on the map image.

As described above, in this apparatus, when the route number of a road, the names of a plurality of targets, and the distance between the targets are specified, the apparatus is located near the road at intervals of less than the specified distance. It is possible to search for a link position of a target existing in the vicinity.

Although the operation in the case where the route number of the road, the name of the target, and the distance between the targets are specified has been described above, a genre name is specified instead of the name of the target. Alternatively, even when the name of the target and the genre name are specified together, the same search can be performed.

Although the operation in the case where the distance between the targets is specified together with the route number of the road and the name of the target is described here, only the route number of the road and the name of the target are specified. In this case, by presenting the target included in the enlarged search target area searched by the map data search unit 11, the target located along the designated road can be indicated as shown in FIG. .

[0048]

As is apparent from the above description, the target search device and the search method according to the present invention can automatically determine whether or not the targets are close to each other, and determine whether the targets are close to each other. Can be presented as a search result. Therefore, even when a location is designated by an expression such as "a place where a convenience store and a gas station can be seen nearby", the location can be searched from the map database.

That is, the location can be specified by utilizing the keywords such as “along”, “near”, and “visible”.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a target search device according to a first embodiment;

FIG. 2 is a diagram showing a position of each target searched from a name in the target search method according to the first embodiment;

FIG. 3 is a view for explaining linking between targets in a target information table # 1 and a target information table # 2 in the target search method according to the first embodiment;

FIG. 4 is a view for explaining linking between landmarks in a landmark information table # 1 and a landmark information table # 3 in the landmark search method according to the first embodiment;

FIG. 5 is a view for explaining linking between landmarks in a landmark information table # 2 and a landmark information table # 3 in the landmark search method according to the first embodiment;

FIG. 6 is a diagram showing a target in a linked target information table # 1, a target information table # 2, and a target information table # 3 in the target search method according to the first embodiment;

FIG. 7 is an explanatory diagram showing target data in the first embodiment;

FIG. 8 is a view showing a target information table created in the first embodiment;

FIG. 9 is a diagram showing a mesh searched based on a route number in the target object search method according to the second embodiment;

FIG. 10 is a diagram illustrating a target object search method according to a second embodiment;
A diagram showing an enlarged search area,

FIG. 11 is a diagram illustrating a target object search method according to a second embodiment;
A diagram showing a target object searched in the enlarged search area,

FIG. 12 is a diagram for explaining a mesh of a map database;

FIG. 13 is a diagram for explaining meshes that are not included in a search target area near a route number;

FIG. 14 is a block diagram showing a configuration of a conventional target search device;

FIG. 15 is an explanatory diagram showing an address book database in the conventional target object search method;

FIG. 16 is an explanatory view showing a search table in a conventional target object search method;

FIG. 17 is a flowchart showing a procedure of a conventional target object search method.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 CPU 2 Display 3 Keyboard 4 ROM5 RAM 6 Floppy disk drive 7 CD-ROM 11 Map data search part 12 Distance calculation part 13 Link detection part 20 Display part 30 Input part 70 Map data storage part

Claims (5)

[Claims] 1. A landmark search method for searching landmarks from a map database, wherein when a plurality of objects representing the landmarks and a distance between the landmarks are designated, the landmark data included in the map database is specified. , Searching for position data of a target corresponding to each of the objects, calculating a distance between the targets using the searched position data, and calculating a set of targets whose calculated distance is equal to or less than a specified distance. A target object search method characterized by searching for a target. 2. A landmark search method for searching landmarks from a map database, wherein when a route number of a road and a name representing the landmark are specified, the road data included in the map database is used.
A search is performed for a mesh including the road of the route number and a mesh around the mesh, an area including all of the searched meshes is set as a search area, and from the target data included in the map database, A target search method, wherein a target corresponding to a name and located in the search area is searched. 3. When a plurality of names representing the target and a distance between the targets are specified together with a route number of the road, the target is a target corresponding to each of the names, and
The position data of the target located in the search area is searched from the target data, the distance between the targets is calculated using the position data, and the calculated distance is smaller than the specified distance. 3. The target search method according to claim 2, wherein the set is searched. 4. The apparatus according to claim 1, wherein when a genre name indicating a genre of the target is input as the name, position data of each target included in the genre is searched from the target data. 3. The target object search method according to 3. 5. A landmark search device for searching for landmarks from a map database, input means for designating a plurality of names representing the landmarks and a distance between the landmarks; Map data searching means for searching for position data of a target corresponding to each of the names; distance calculating means for calculating a distance between the respective targets using the position data searched by the map data searching means; A link that compares the distance calculated by the distance calculation unit with the distance between the specified targets, and searches for a set of targets located close to each other at an interval equal to or less than the distance between the specified targets. A target search device comprising: a detection unit.