JP2011214889A - Location registration apparatus - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a location registering device for solving the problem that local objects existing in an area where a network is discontinued by a water area, a step height, or the like, are specified, when carrying out location registration.SOLUTION: The location registering device includes a location indicating unit for indicating a location which a user desires; a network-position determining unit for determining a location on the network according to the location indicated by the location indicating unit; an arrival location extraction unit for extracting an arrival location stored in a map database from the location on the network determined by the network-position determining unit; and a location registration unit for identifying the data on the shape of a local object stored in the map database, on the basis of the arrival location extracted by the arrival location extraction unit, and performing location registration.

Description

  The present invention relates to a point registration device for registering a feature desired by a user in a map database.

  Many GIS systems and navigation devices include a point registration device that stores an arbitrary point designated by a user together with its address or arbitrary name. Among such point registration devices, those that specify a point on the map or that use a detection result of a positioning device such as GPS can conveniently input characters such as addresses and facility names. It is.

  In particular, in the car navigation device disclosed in Patent Document 1, it corresponds to the stop time of the target point among the point information of the points within the predetermined range from the target point determined to be registered based on the stop time of the car. A point having preliminary information to be extracted is extracted as a registration candidate, and the point information of the point selected from the registration candidates is registered. For this reason, since it is possible to narrow down registration candidates to be referred to by the user at the time of spot registration by searching for spot information in consideration of the stop time of the car, spot registration is possible with a simple selection operation, and the convenience of the device This has the effect of improving the performance. For example, when a car is stopped at a parking lot for a predetermined time or more, a store that is open within a predetermined range from the stop position is searched using a map database that stores information such as business date and time of the store. Because of this, it is possible to demonstrate the effect that a location that cannot be visited is not a candidate for a registered location.

JP 2009-47439 A

However, the conventional point registration device may still detect many registration point candidates unnecessary for the user.
In the point registration device for registering the feature desired by the user in the map database storing the road network data and the shape data schematically representing the feature, all information is arranged and developed in a two-dimensional plane. ing. For this reason, in a predetermined range centered on the stop position of the automobile (inside a circle with a predetermined radius centered on the stop position), it cannot actually move from the stop position or is extremely inconvenient to move. There are many cases that include points. For example, when a car is stopped along a river or moat, the user cannot move to a point on the opposite shore across the river or moat even within a predetermined range from the stop position. In this case, even if a point within a predetermined range from the stop position is searched, about half of the points are on the opposite shore, which is not very reasonable. Such inconveniences are not limited to the case where water or sea areas are involved, but are problems that occur even when there are steps that are more easily accessible to the user, such as hills and cliffs. Is desired.
An object of this invention is to provide the point registration apparatus which can solve said subject.

  In order to solve the above-described problems, the point registration device according to the present invention provides a map database that stores network data in which road shapes are modeled by nodes and links and shape data in which features are modeled. A registration device for registering the feature, wherein the map database includes an arrival point that is a point on the network suitable for accessing the feature and is associated with the shape data of the feature. A point indicating unit that stores point data and indicates a point desired by the user, a network position determining unit that determines a point on the network according to the point specified by the point indicating unit, and the network position An arrival point extraction that extracts the arrival point stored in the map database from the point on the network determined by the determination unit. A point registration unit for identifying and registering the feature shape data stored in the map database based on the arrival point extracted by the arrival point extraction unit, and a registration registered by the point registration unit And a registered point storage unit for storing the points.

  Note that the above-described features do not enumerate all the features of the present invention, and a configuration having these as the main part can also be an invention.

  According to the present invention, the point designated by the user is determined as a point on the network, and by extracting the arrival point on the network, the feature taking the road shape into consideration is specified. Therefore, a feature located in an area where the network is disconnected due to a water area or a step is not specified. In addition, according to the present invention, the feature shape data and the arrival point are associated and registered as information on the registration point. For example, even if the position of the arrival point is later changed due to road construction or the like, the changed arrival point can be derived from the association between the feature shape data and the arrival point.

The block diagram of a point registration apparatus. Explanatory drawing which shows the structure of a map database. The figure which shows an example of the setting of an arrival point. The flowchart of a point registration process. The figure which shows an example of point registration.

Hereinafter, examples embodying the present invention will be described.
As shown in FIG. 1, the point registration device 1 in this embodiment includes a map database 2, a point instruction unit 3, a network position determination unit 4, an arrival point extraction unit 5, a point registration unit 6, and a registered point. And a storage unit 7.

  As shown in FIG. 2, the map database 2 stores network data 21 in which road shapes are schematically represented by nodes and links, and feature data 22 in which features are schematically represented. In addition, the map database 2 stores arrival point data relating to an arrival point that is a point on the network suitable for accessing the feature. The arrival point data is associated with feature shape data (polygon data).

  The point instruction unit 3 has a function of instructing a point desired by the user. As a method of instructing a point, for example, a method of instructing a point designated by the user on a map, a method of instructing a point corresponding to an address input by the user, or a positioning point by instructing the current position of the user There are methods. When the point indicating unit 3 measures the current position and indicates a positioning point, the point indicating unit 3 includes a GPS 31 as a current position detecting unit that detects the current position of the user, and can indicate the point based on the detection result. Specifically, the current position (latitude and longitude) of the point registration device 1 is measured based on radio signals transmitted from a plurality of GPS satellites received by the GPS antenna of the point registration device 1. In addition to this, the current position may be measured by a method using DGPS (differential GPS) or a method using or using a gyro sensor.

  The network position determination unit 4 has a function of determining a point on the network according to the point designated by the point instruction unit 3. In the point determination process on the network, the nearest link or node is specified from the point indicated by the point indicating unit 3. As a specific method, for example, a plurality of perpendicular lines are drawn with respect to a network existing within a predetermined range from an instructed point, and points on the plurality of networks are extracted. Then, the network position determination unit 4 determines whether or not there is an obstacle on the vertical line that connects the extracted point on the network and the designated point.

  When it is determined that there is an obstacle on the vertical line, the network position determination unit 4 excludes the network ahead of the vertical line from the determination target. Here, the predetermined range from the instructed point is not particularly limited. For example, when the current position detected by the GPS 31 is designated, the range can be set in consideration of the measurement error of the GPS 31, and when the user designates a point on the map, can do. When the GPS measurement error is large, the range from the designated point can be set wide, and when the GPS measurement error is small, the range from the designated point can be set narrow. Moreover, as an obstacle in a present Example, the thing which cannot pass physically, such as a river and a lake, is mention | raise | lifted, for example. These obstacles can be stored in the map database 2 as shape data.

  The arrival point extraction unit 5 extracts the arrival point stored in the map database 2 based on the point on the network determined by the network position determination unit 4. As an arrival point extraction method, for example, there is a method of extracting an arrival point stored in a map database by tracing nodes and links from a point on the network. Moreover, the arrival point extraction part 5 is provided with the function which displays the shape data of the feature linked | related with the extracted some arrival point, and prompts a user to select, when several arrival points are extracted. The user may select the feature shape data as long as it is at least one of the displayed data. For example, the feature data may have a form of selecting all of the plurality of displayed data.

  The point registration unit 6 specifies the shape data of the feature stored in the map database 2 based on the arrival point extracted by the arrival point extraction unit 5, and stores the data related to the specified feature as the registration point. Store in the storage unit 7. If the arrival point is not extracted by the arrival point extraction unit 5, the point registration unit 6 stores the point on the network determined by the network position determination unit 4 in the registration point storage unit 7.

  The registered point storage unit 7 stores information regarding registered points. Examples of information stored in the registration point storage unit 7 include a position registration name, a position coordinate of a point designated by the user, a feature shape, a feature name, a feature ID, a registration or update date, and a feature. Position coordinates, position coordinates of arrival points, position coordinates of entrance / exit points corresponding to the arrival points, position coordinates of points on the network, and the like. Information on the registered points stored in the registered point storage unit 7 is read from the name of the location registration and the like, and can be used as a destination in route search, for example.

  Next, network data will be described. Network data is data representing roads as links and nodes. As the network data 21 in this embodiment, two types of main network data and semi-network data are prepared. The main network data in this embodiment is data for which traffic regulations are sufficiently prepared by field surveys, and can be used without any trouble for route search for vehicles. On the other hand, the semi-network data in the present embodiment is data that cannot be said to have sufficient traffic regulations. The links L1 to L4 and nodes N1 and N2 indicated by solid lines in FIG. 2 are main network data, and the links L11 to L13 and nodes N11 and N12 indicated by broken lines are semi-network data.

  The main network data and the quasi-network data can take various structures such as a table format. The link data is data relating to a link connecting points when the roads on the map are divided at a plurality of points such as intersections, branches, and merge points. The link data includes a unique ID number for identifying the link, a link length indicating the length of the link, latitude / longitude coordinates of nodes existing at the start and end of the link, latitude / longitude coordinates of multiple points in the link, road name, The attribute information includes various data such as road type, road width, number of lanes, presence / absence of right / left turn lanes, the number of lanes dedicated to the lanes, and speed limit. On the other hand, the node data is data relating to nodes attached to points where roads on the map intersect, merge and branch, and where road attributes are changed. The node data includes various data such as a unique ID number identifying the node, node coordinates, a node name, a connection link ID describing a link ID of a link connected to the node, and an intersection type as attribute information.

Next, the feature data 22 will be described by taking the building H1 shown in FIG. 2 as an example. The feature data 22 is data for drawing features such as buildings and roads, and stores data such as names, shapes, representative points, entrance / exit lines, arrival points, and attributes.
The name is the name of the feature. A unique ID may be used for the shape data.
The shape is a sequence of coordinates indicating the vertices of the shape data of the feature. In the illustrated example, coordinate data representing the coordinates of the vertices P1, P2, P3, and P4 of the shape data of the building H1 is stored.
The representative point is the coordinates of the point C that represents the position of the feature. The representative point often uses the centroid of the feature, but can be set arbitrarily.

  The entrance / exit line is information for associating a feature with a road. In the case of the building H1, a line segment D for exiting from the entrance to the road is registered as an entrance / exit line. Specifically, the coordinates of both ends of the line segment D are registered. The entry / exit line may register only the end point on the road (hereinafter referred to as “entrance / exit point”) of the line segment D. In addition, the entrance / exit line is set for a feature such as a building or a parking lot, and it is not necessary to set it for all the features. In the example of FIG. 2, entrance / exit lines DH2 to DH4 are set for the entrance / exit line DB1 on the front side of the building BLD, the entrance / exit line DB2 on the parking lot BLDP side, and the buildings H2 to H4, respectively.

  The arrival point G is a point on the network that can be reached via a road from the entrance / exit point of the feature. In the case of the building H1, since it can reach the link L2 via the road R21 with which the entrance / exit line D is associated as shown by the dotted line in the drawing, the arrival point G is set on the link L2. It is also possible to follow the road R21 in the right direction in FIG. 2 from the entrance / exit line D, turn right at the node N11 and take a route to the node N2, and use the node N2 as an arrival point. In this embodiment, since the route from the building H1 to the node N2 is shorter than the route from the building H1 to the node N2, the point G is set as the arrival point. The arrival point need not be limited to one, and a point corresponding to the node N2 in addition to the arrival point G may be set as the arrival point. In the example of FIG. 2, the point GH is set as the arrival point for each of the buildings H2 to H4. For the building BLD, a point GBLD1 and a point GBLD2 are set as arrival points.

FIG. 3 is an explanatory diagram showing a method for setting an arrival point, and shows an arrival point for the entrance / exit point DP of the building BLD1.
As main network data around the building BLD1, there are a link L7, a node N7, a link L5, a link L6, a node N5, and a node N6. As the quasi-network data, there is a link L14 indicated by a broken line.
As shown by a dotted line in FIG. 3, the route reaching the main network from the entrance point DP of the building BLD1 is the route reaching the link L7 via the road R24 and the link L6 via the road R25. There are three types of routes: a route that reaches the link L5 via the road R25. The point G7, the point G6, and the point G5 where these routes reach the link L7, the links L6 and L5 are the arrival points.

These arrival points G5 to G7 can be obtained by route search. In this embodiment, since the feature BLD1 is associated with the road by the entrance / exit line DB, the arrival points G5 to G7 can be obtained by route search starting from the entrance / exit point DP.
This route search may use all of main network data, quasi-network data, and road shape data. The road shape data is not composed of links and nodes, but has data that specifies adjacent shape data, and the relationship between the shape data is specified. It can be used for searching. As a result of the route search starting from the entrance / exit point, the point where the main network data is reached can be set as the arrival point.

As in the example of FIG. 3, when three points of the point G7, the point G6, and the point G5 are extracted as arrival points, these three points may be used as the arrival points of the building BLD1. Also, for example, from the feature to the starting point, the point with the shortest distance from the feature, the point with the shortest distance from the feature, the point where there is a lot of overlap between the route from the feature to the arrival point and the quasi-network data The arrival point may be selected based on a criterion such as a point close to the direction to go.
In the example of FIG. 3, if the route or distance from the feature is selected as a reference, the point G5 closest to the building BLD1 is the arrival point. When the departure point is in the leftmost direction in the figure, the point G7 becomes the arrival point if the direction of the departure point is selected as a reference.

  In this embodiment, the arrival point is set according to the above-described procedure, and is set in advance in the feature data 22. However, the arrival point is not set in advance, but is a process of processing such as route search. It is good also as what it asks for.

Next, a method for registering a spot using the spot registration apparatus 1 according to the present embodiment will be described with reference to FIGS. 4 and 5.
As shown in FIG. 4, first, when the point instruction unit 3 recognizes the designation of a point by the user, the point instruction unit 3 instructs the network position determination unit 4 (step S1). For example, when the user presses a current location registration button provided in the location registration device 1, the location M shown in FIG. 5 is detected as the current location by the GPS 31. The point instruction unit 3 recognizes that the point M is designated by the user. The point instruction unit 3 receives the designation by the user and transmits the coordinate information of the point M to the network position determination unit 4.

  When receiving the coordinate information of the point M from the point indicating unit 3, the network position determining unit 4 determines the position on the network (step S2). As shown in FIG. 5, the network position determination unit 4 identifies network data that exists within a certain range E20 from the point M. As a result, the link L21 is specified as network data. The network position determination unit 4 draws a perpendicular line from the point M to the link L21, and extracts the point V21 that is the intersection. Then, the point V21 is determined as a position on the network. When an obstacle such as a river exists on the vertical line, the network position determination unit 4 excludes a point that is an intersection of the vertical line and the network from the position on the network. This is because it is assumed that a detour is required when moving from the point M to the determined point on the network.

  Next, the arrival point extraction unit 5 extracts an arrival point based on the position determined by the network position determination unit 4 (step S3). When arrival points are extracted, the arrival point extraction unit 5 determines whether or not there are a plurality of extracted arrival points (step S4). When the arrival point is not extracted, the point registration unit 6 stores information on the position determined by the network position determination unit 4 in the registration point storage unit 7 (step S5). In the example shown in FIG. 5, the arrival point extraction unit 5 follows the link from the point V21 determined as the network position by the network position determination unit 4, and extracts the arrival point. Specifically, the arrival point extraction unit 5 follows the link L21 from the point V21, and extracts the arrival point G22 and the arrival point G23.

  The arrival point extraction unit 5 presents the shape data of the feature H22 and the feature H23 respectively associated with the extracted arrival point G22 and arrival point G23, and prompts the user to select (step S6). When the feature H22 is selected by the user, the point registration unit 6 stores the arrival point G22 corresponding to the selected feature H22 and information related to the feature H22 in the registration point storage unit 7 for processing. The process ends (step S7).

  As described above, in this embodiment, the feature existing near the designated point M (feature H21 in FIG. 5) is not searched and presented as a candidate for point registration, but is present near the point M. The feature corresponding to the arrival point (feature H22 in FIG. 5) is presented as a candidate for point registration. Therefore, as shown in FIG. 5, when the feature that is at a glance near the designated point M is the feature H21, but the movement distance of the feature H21 to the arrival point G21 is long, It can be avoided that such a feature H21 is presented as a candidate for location registration. In addition, it is possible to avoid selection of a feature whose movement distance from the point M is substantially long due to an obstacle such as a water area or a step as a candidate for point registration.

  Further, in this embodiment, the feature H22 and the arrival point G22 are associated with each other and registered in the registration point storage unit 7 as information about the registration point. For example, even if the position of the arrival point G22 is changed later due to road construction or the like, the changed arrival point can be derived from the association with the feature H22.

1 Point registration device,
2 ... Map database,
3 ... point indication part,
4 ... Network location determination unit,
5 ... Arrival point extraction unit,
6 ... point registration part,
7: Registration point storage unit.

Claims (5)

A point registration device for registering the feature desired by a user in a map database storing network data in which road shapes are schematically represented by nodes and links and shape data in which features are schematically represented.
The map database stores arrival point data associated with shape data of the feature, which is a point on the network suitable for accessing the feature,
A point indicating unit for indicating a point desired by the user;
A network position determining unit that determines a point on the network according to the point instructed by the point indicating unit;
An arrival point extraction unit that extracts an arrival point stored in the map database from points on the network determined by the network position determination unit;
A point registration unit for specifying the shape data of the feature stored in the map database based on the arrival point extracted by the arrival point extraction unit, and for registering the point;
A registration point storage unit for storing the registration points registered by the point registration unit;
A point registration device comprising: The point registration device according to claim 1,
The point registration device, wherein the point instruction unit instructs a point based on a detection result of a current position detection unit that detects a current position of the user. The point registration device according to claim 1 or claim 2,
The arrival point extracting unit extracts an arrival point stored in the map database by tracing a node and a link from a point on the network. The point registration device according to claim 3,
The arrival point extracting unit, when a plurality of arrival points are extracted, displays the shape data of the feature associated with the plurality of arrival points and prompts the user to select the point registration device. . The point registration device according to any one of claims 1 to 4,
The network position determining unit is to determine a point on the network when there is no obstacle that obstructs traffic on a straight line connecting the point instructed by the point indicating unit and a point on the network. A point registration device characterized by.