JP5132694B2 - DATA GENERATION DEVICE, DATA GENERATION METHOD, AND ROUTE SEARCH DEVICE - Google Patents

Description

  The present invention relates to an apparatus for searching for a route by setting a starting point and a destination, and more particularly to a technique for searching for a route by efficiently setting a road near the starting point and the destination.

  2. Description of the Related Art Car navigation systems and mobile phone applications that search for routes corresponding to search conditions such as departure points and destinations input by users are used. In these technical fields, a route search is performed using road data that represents a road network by a node (node) on a road expression such as an intersection and a link that connects the nodes. For this reason, when the position designated by the user as the starting point or destination is far from the road, such as the center of the facility, the road nearest to the designated position (neighboring road) is usually determined from the road data. The route search is performed by an algorithm such as Dijkstra method with the specified end point.

  However, when the road closest to the specified position is located across a non-passable area such as a river, it is inappropriate to acquire such a road as a neighboring road, and the wrong route There was a problem that led to the presentation.

  On the other hand, in Patent Document 1, a polyline that is a line indicating a non-passable area is prepared, and a line connecting a designated position and a point on the road that is close to the polyline indicating a non-passable area It is determined whether or not the vehicle intersects, and if it intersects, a proposal is made to exclude the road from the acquisition target.

JP 2007-263922 A

  However, in patent document 1, since the said intersection determination process must be performed about all the acquired nearby road candidates, there exists a problem that processing load is large.

  The present invention solves the above problem, and an object of the present invention is to acquire an appropriate nearby road with respect to an end point such as a starting point or a destination in route search with a small processing load.

  Based on the above object, one aspect (1) of the present invention is a map data storage means for storing map data including a plurality of position coordinates, and a traffic prohibition data representing an inaccessible portion of the map data. And a road data storage means for storing road data representing roads represented by links connecting the nodes to each other in the road generation data storage device. Map data dividing means for dividing the map data stored in the map data storage means into a plurality of passable areas with a portion represented by the prohibition data stored in the storage means as a boundary, and included in the passable area For searching for a nearby road for searching for a nearby road by associating the road data stored in the road data storage means with the accessible area Characterized in that it comprises a near road search data generating means for generating over data, the.

  According to the data generating apparatus configured as described above, the map data is divided into a plurality of passable areas with the road prohibition data as a boundary, and road data included in each passable area is associated and stored. When determining nearby roads for departure and destination in route search, determine the passable area that includes the position specified by the user, and use only road data included in the passable area as candidates for nearby roads This eliminates the need to determine the intersection of a line connecting a point specified by the user and a point on the nearby road and the inaccessible area, and acquiring an appropriate nearby road with a small processing load. It becomes possible.

  One aspect (2) of the present invention is a route search device including a nearby road search data storage unit that stores the nearby road search data generated in the aspect (1). The position designation information acquisition means for acquiring the position designation information to be designated, and the passable area including the position designation information are determined based on the neighboring road search data, and are associated with the passable area 1 Alternatively, a neighboring road candidate acquisition unit that acquires a plurality of road data, and a point on the acquired road data, and finds a closest point closest to the specified position, and a distance between the specified position and the closest point A neighboring road determining means for determining the shortest road data; and a neighboring road setting means for setting the road data determined by the neighboring road determining means as a neighboring road. It is characterized in.

  According to the route search device configured as described above, the map data is divided into a plurality of passable areas with the pass prohibition data as a boundary, and road data included in each passable area is associated and stored in advance. This makes it possible to determine only roads that have no inaccessible elements when determining the neighboring roads in the route search, and obtain appropriate neighboring roads with a small processing load. It becomes possible.

  According to one aspect (3) of the present invention, there is provided a position specifying device for specifying a position in a route search device including a nearby road search data storage means storing the nearby road search data generated in the aspect (1). One or a plurality of road data associated with the passable area by determining the passable area including the position specifying information based on the nearby road search data, and the position specifying information acquiring means for acquiring information A neighboring road candidate obtaining unit for obtaining a route candidate, a route candidate searching unit for setting each road data obtained by the neighboring road candidate obtaining unit as a neighboring road, and obtaining a route candidate connecting the plurality of designated positions, and the route candidate searching Route search result output means for outputting a plurality of route candidates obtained by the means as a route search result with priority given to those having a short required time or distance. And wherein the Rukoto.

  According to the route search device configured in this way, the neighborhood where the required time or distance is the shortest can be obtained by obtaining the entire route with all road data included in the accessible area including the position of the position designation information as neighboring road candidates. The road can be set with higher accuracy.

  It should be noted that other categories such as methods or programs corresponding to the above aspects and more specific aspects described below are also included in the present invention.

  According to the present invention, it is possible to acquire an appropriate nearby road with a small processing load.

The functional block diagram which shows the structure of Embodiment 1 of this invention. The figure which illustrates each information (data) in Embodiment 1 to 3 of this invention. The flowchart which shows the process sequence in Embodiment 1 of this invention. The conceptual diagram which illustrates the passable area | region in Embodiment 1 of this invention. The figure which illustrates each information (data) in Embodiment 1 to 3 of this invention. The functional block diagram which shows the structure of Embodiment 2 of this invention. The flowchart which shows the process sequence in Embodiment 2 of this invention. The conceptual diagram which illustrates the passable area | region in Embodiment 2 of this invention. The functional block diagram which shows the structure of Embodiment 3 of this invention. The flowchart which shows the process sequence in Embodiment 3 of this invention.

  Next, a mode for carrying out the present invention (referred to as “embodiment”) will be described with reference to FIGS. It should be noted that assumptions common to those already described in the background art and problems are omitted as appropriate.

[1. Embodiment 1]
[1-1. Constitution〕
As shown in FIG. 1 (configuration diagram), the present embodiment relates to a data generation apparatus (hereinafter also referred to as “this apparatus”) 1 for generating data for searching for nearby roads for searching for nearby roads. FIG. 1 is a configuration diagram of this apparatus. However, the present invention can also be grasped as a method or a computer program corresponding to the apparatus 1.

  First, the present apparatus 1 has, as a general computer configuration, at least an arithmetic control unit 5 such as a CPU, a storage device 6 such as an external storage device (HDD or the like) or a main memory, and a communication network (Internet or mobile phone). And a communication means 7 (such as a LAN adapter) with a network or the like (not shown).

  In the apparatus 1, a predetermined computer program (not shown) stored (installed) in advance in the storage device 6 controls the arithmetic control unit 5 so that elements (10, 20,...) Shown in FIG. ). Among these elements, information storage means can be realized in the storage device 6 in any format such as various databases, files, variables such as arrays, system setting values, and the like.

  Of the storage means, the map data storage means 11 stores map data corresponding to the position coordinates in advance. Map data may be managed by dividing map data of Japan nationwide with a grid mesh of a predetermined range, for example, so that map data including the position can be easily searched when position information is input, In this case, as illustrated in FIG. 2A, a mesh ID that is an identifier for uniquely identifying a mesh, a coordinate 1 that is a coordinate value of latitude and longitude of the lower left (southwest corner) of the mesh, and an upper right ( Coordinate 2 which is the coordinate value of latitude and longitude in the corner of Tohoku) is included. Note that the map data need not be managed by mesh.

  Further, the traffic prohibition data storage means 12 stores in advance data representing areas on a map that cannot be passed by car or on foot, such as tracks and rivers. As shown in FIG. 2 (2), the prohibition data is a data ID that is an identifier of the prohibition data that uniquely identifies a non-passable area, and coordinates of each point that specifies a polyline or a line segment representing the area. And the type of the area.

  The road data storage means 21 stores data representing the road network structure in advance. Here, the network structure of the road is represented by connecting links representing road sections with nodes (nodes) representing road intersections, branches, inflection points, and the like. Since the link is defined by the start point and the end point for each direction in which the road section can pass, one link is set for the one-way road section and two links are set in the opposite directions for the two-way road section. The As illustrated in FIG. 2 (3), the network data representing such a network structure includes, for each link ID of a link representing a road section, a node ID1 and a node ID2 at both ends, a cost such as a transit time, and road Contains information such as type. Also, coordinates corresponding to each node are stored in a form that can be referred to from the node ID.

[1-2. Action)
An outline of the operation of the apparatus 1 configured as described above is shown in the flowchart of FIG. That is, first, the map data dividing means 10 acquires map data from the map data storage means 11, and acquires the passage prohibition data including the coordinates corresponding to the map data from the passage prohibition data storage means 12 (step S01). Specifically, map data associated with an arbitrary mesh ID is acquired from the map data storage means 11, and the traffic prohibition data included in the range of the map data (here, the traffic prohibition data is polyline data). Exemplify.)

  Subsequently, the map data dividing means 10 divides the map data into a plurality of passable areas, with the portion indicated by the prohibited traffic data as a boundary (step S02). More specifically, the entire rectangle illustrated in FIG. 4 is assumed to be map data M managed in units of meshes, and the traffic prohibition polyline data P indicated by dotted points is superimposed on a corresponding area of the map data M. Then, with the passage-prohibited polyline data P as a boundary, a passable area A (area indicated by a broken line in FIG. 4) and a passable area B (area indicated by a one-dot chain line in FIG. 4) not including the polyline data P Are divided into two polygons. Furthermore, an identifier for uniquely identifying the area (polygon) and position coordinates of a plurality of vertices of the polygon are assigned to the divided passable areas A and B.

  Then, the nearby road search data generating means 20 extracts the road data included in each passable area divided in step S02 from the road data storage means 21, and associates with each passable area as the close road search data. Then, it is stored in the neighborhood road search data storage means 22 (step S03). Specifically, the road data included in the polygons of the passable areas A and B in FIG. 4 is extracted from the road data storage means 21, and associated with the identifier of each corresponding passable area A or B, The data is stored in the nearby road search data storage means 22 as road search data.

  For example, in the neighborhood road search data storage means 22, as illustrated in FIG. 5, a mesh ID for specifying a map data area, and an area ID 1 for uniquely identifying a passable area included in the mesh. , ID2 and IDn are stored. These region IDs are stored as many as the number of regions included in the mesh. Further, in order to identify the passable area, for each area ID (shown for the area ID “P00001” in FIG. 5), the coordinates of the vertex of the polygon of the passable area and the link included in the passable area are specified. The link ID is associated and stored.

[1-3. effect〕
As described above, in the present embodiment, the map data is divided into a plurality of passable areas with the road prohibition data as a boundary, and the road data included in each passable area is stored in association with each other. When determining the neighborhood road of the starting point and destination, by determining the accessible area that includes the position specified by the user, only the road data included in the accessible area is set as a nearby road candidate, It is no longer necessary to determine the intersection between the line specified by the user and a point on the nearby road and the inaccessible area, and an appropriate nearby road can be acquired with a small processing load. .

[2. Embodiment 2]
As another embodiment, a route search device 100 that includes the nearby road search data storage unit 22 generated in the first embodiment and is used for route search will be described with reference to FIGS. Note that the functions and processes described in Embodiment 1 are omitted as appropriate. The present invention can also be grasped as a method or a computer program corresponding to the route search apparatus 100.

[2-1. Constitution〕
As shown in FIG. 6 (configuration diagram), the route search device of the present embodiment relates to a route search device that receives a search condition from a user terminal T (hereinafter referred to as “terminal T”) and outputs a route search result. . The road data storage means 21 and the nearby road search data storage means 22 are the same as those described in FIGS. Note that the present invention is not limited to the above-described device configuration, and an integrated device (which may be a script) for realizing each processing unit of the route search device 100 is executed on the terminal T ( For example, a mode realized as a navigation device) is also included.

[2-2. Action)
An outline of the operation of the route search apparatus 100 configured as described above is shown in the flowchart of FIG. That is, first, the position designation information acquisition unit 31 acquires information (position designation information) for designating the position of the departure place and the destination, which is a route search condition, from the terminal T (step S11). The location designation information may be an arbitrary location selected by the user on the map, or data such as a facility obtained by searching a facility information database (not shown) based on a keyword such as a facility name or an address input by the user. May be included in the position. In addition to the position designation information, information such as departure time and transportation may be acquired.

  Next, the neighboring road candidate obtaining unit 32 searches the neighboring road search data storage unit 22 based on the position designation information obtained by the position designation information obtaining unit 31, and there is a passable area including the position. It is determined whether or not to perform (step S12). When the passable area does not exist (step S13: “NO”), it is determined that the position specified by the user does not exist in the passable area (for example, in the middle of a railway track, in a river or the sea). An error display to that effect is displayed on the terminal T (step S14), and the process is terminated. If a passable area exists (step S13: “YES”), road data that is a candidate for a nearby road associated with the passable area is acquired from the road data storage unit 21 (step S15).

  Here, the relationship between the position designation information, the passable area, and the neighboring road candidates will be described with reference to FIG. For example, based on the position designation information S indicating that a certain “XXX station” has been designated, the neighboring road retrieval data storage means 22 is searched, and the passable area containing the position designation information S is the passable area C. Is determined, the five road data respectively representing road sections corresponding to the neighboring road candidates R1 to R5 associated with the passable area C are acquired from the road data storage unit 21.

  Subsequently, the neighboring road setting unit 33 obtains the nearest point closest to the position of the position designation information on one or a plurality of road data acquired by the neighboring road candidate acquisition unit 32, and the position designation information The road data with the shortest distance to the position is set as the nearest road (step S16). Then, the route search means 34 uses the position of the position designation information as a node of a route end point (for example, a departure point and a destination), and adjoins a road data node of the neighboring road set by the neighboring road setting means 33. And search for a route connecting the end points (step S17). Then, the route search result output unit 35 outputs the route search result searched for by the route search unit 34 as described above to the user terminal T (step S18), and ends the process.

[2-3. effect〕
As described above, the map data is divided into a plurality of passable areas with the road prohibition data as a boundary, and the road data included in each passable area is associated and stored in advance, so that in the route search, When determining the nearby roads of the place and the destination, only roads having no inaccessible elements can be determined, and appropriate nearby roads can be acquired with a small processing load.

[3. Embodiment 3]
Subsequently, the third embodiment is a route search device 200 including the nearby road search data storage unit 22 generated in the first embodiment, and the neighboring roads are not uniquely determined as in the second embodiment, and some This is an example in which a plurality of routes are searched based on the candidates. Note that the functions and processes described in Embodiment 1 are omitted as appropriate. The present invention can also be grasped as a method or a computer program corresponding to the route search apparatus 200. Note that the present invention is not limited to the above-described apparatus configuration, and is integrated by executing a computer program (which may be a script) on the user terminal T for realizing each processing unit of the route search apparatus 200. The aspect implement | achieved as an apparatus (for example, navigation apparatus) is also included.

[3-1. Constitution〕
As shown in FIG. 9 (configuration diagram), the route search device 200 according to the third embodiment is a route search device that receives a search condition from the terminal T and outputs a route search result. The data storage means 22 is the same as that shown in FIG. 1, FIG. 2 (Embodiment 1) and FIG. 5 (Embodiment 2).

[3-2. Action)
An outline of the operation of the route search apparatus 200 configured as described above is shown in the flowchart of FIG. Steps S21 to S25 are the same as steps S11 to S15 in the second embodiment, and are therefore omitted.

  In the third embodiment, the route candidate search unit 43 sets each road data acquired by the neighboring road candidate acquisition unit 42 as a neighboring road, and searches for a route candidate that connects the positions of the plurality of position designation information (step S26). . Then, the route search result output means 44 gives priority to the plurality of route candidates obtained by the route candidate search means 43 in order of the shortest required time or distance (for example, sort in ascending order of required time or distance). ) Is output to the terminal T as a route search result (step S27), and the process is terminated. Note that a threshold may be provided for the number of cases to be output, and the upper predetermined number (for example, only the upper five cases) of route candidates may be output as route search results.

[3-3. effect〕
As described above, the map data is divided into a plurality of passable areas with the road prohibition data as a boundary, and the road data included in each passable area is associated and stored in advance, so that in the route search, When determining the nearby roads of the place and the destination, only roads having no inaccessible elements can be determined, and appropriate nearby roads can be acquired with a small processing load. In addition, it is possible to set the neighboring road with the shortest required time or distance with higher accuracy by obtaining the entire route using all road data included in the accessible area including the position of the position designation information as neighboring road candidates. become.

DESCRIPTION OF SYMBOLS 1 Data generation apparatus 5 Arithmetic control part 6 Storage apparatus 7 Communication means 10 Map data division means 11 Map data storage means 12 Traffic prohibition data storage means 20 Neighborhood road search data generation means 22 Neighborhood road search data storage means 31, 41 Position Designated information receiving means 32, 42 Neighboring road candidate obtaining means 33 Neighboring road setting means 34 Route searching means 35, 44 Route search result output means 43 Route candidate searching means A, B, C Accessible area M Map data P Traffic prohibited polyline data R1-5 nearby road candidates T user terminal

Claims (4)

Map data storage means for storing map data including a plurality of position coordinates, prohibition data storage means for storing prohibition data representing areas of inaccessible portions in the map data, roads as nodes Road data storage means for storing road data expressed by links connecting nodes, a data generation device comprising:
Map data dividing means for dividing the map data stored in the map data storage means into a plurality of passable areas, with a portion represented by the prohibition data stored in the prohibition data storage means as a boundary;
Neighboring road search data generation for associating the road data stored in the road data storage means included in the passable area with the passable area and generating data for searching for a nearby road for searching for a nearby road Means,
Neighborhood road search data storage means for storing neighborhood road search data generated by the neighborhood road search data generation means;
Position designation information obtaining means for obtaining position designation information for designating one or a plurality of positions;
A neighboring road candidate acquisition unit that determines the passable area including the position designation information based on the neighboring road search data and acquires one or more road data associated with the passable area;
A point on the acquired road data, the nearest point closest to the specified position is determined, and a neighboring road determination unit that determines the road data having the shortest distance between the specified position and the closest point;
Neighborhood road setting means for setting the road data determined by the neighborhood road determination means as a neighborhood road;
Equipped with a,
The link stored in the road data storage means is defined by a start point and an end point for each direction in which the road section can pass,
The neighborhood road setting means searches for a route connecting the link end points stored in the road data storage means.
A route search apparatus characterized by that. Map data storage means for storing map data including a plurality of position coordinates, prohibition data storage means for storing prohibition data representing areas of inaccessible portions in the map data, roads as nodes Road data storage means for storing road data expressed by links connecting nodes, a data generation device comprising:
Map data dividing means for dividing the map data stored in the map data storage means into a plurality of passable areas, with a portion represented by the prohibition data stored in the prohibition data storage means as a boundary;
Neighboring road search data generation for associating the road data stored in the road data storage means included in the passable area with the passable area and generating data for searching for a nearby road for searching for a nearby road Means,
And the neighboring road search data storage means for storing the vicinity road search data generated by the neighboring road search data generating means,
Position designation information obtaining means for obtaining position designation information for designating one or a plurality of positions;
A neighboring road candidate acquisition unit that determines the passable area including the position designation information based on the neighboring road search data and acquires one or more road data associated with the passable area;
Route candidate search means for setting each road data acquired by the neighborhood road candidate acquisition means as a neighborhood road and obtaining route candidates connecting the plurality of designated positions;
A route search result output unit that outputs a plurality of route candidates obtained by the route candidate search unit as a route search result by giving priority to a short time or distance.
Equipped with a,
The link stored in the road data storage means is defined by a start point and an end point for each direction in which the road section can pass,
The route search device characterized in that the route candidate search means searches for a route connecting the end points of the links stored in the road data storage means . Map data storage means for storing map data including a plurality of position coordinates, prohibition data storage means for storing prohibition data representing areas of inaccessible portions in the map data, roads as nodes Road data storage means for storing road data expressed by links connecting nodes, a data generation device comprising:
A map data dividing step for dividing the map data stored in the map data storage means into a plurality of passable areas, with a portion represented by the prohibition data stored in the prohibition data storage means as a boundary;
Neighboring road search data generation for associating the road data stored in the road data storage means included in the passable area with the passable area and generating data for searching for a nearby road for searching for a nearby road Steps,
A neighborhood road search data storage step storing the neighborhood road search data generated by the neighborhood road search data generation step;
A position designation information acquisition step for acquiring position designation information for designating one or a plurality of positions;
A neighboring road candidate acquisition step of determining the passable area including the position designation information based on the neighboring road search data, and acquiring one or a plurality of road data associated with the passable area;
A point on the acquired road data, the nearest road having the closest distance from the specified position is determined, and a neighboring road determination step for determining road data having the shortest distance between the specified position and the closest position;
A neighboring road setting step for setting the road data determined in the neighboring road determining step as a neighboring road;
Equipped with a,
The link stored in the road data storage means is defined by a start point and an end point for each direction in which the road section can pass,
The neighborhood road setting step searches for a route connecting the end points of the links stored in the road data storage means.
A route search method characterized by that.   Map data storage means for storing map data including a plurality of position coordinates, prohibition data storage means for storing prohibition data representing areas of inaccessible portions in the map data, roads as nodes Road data storage means for storing road data expressed by links connecting nodes, a data generation device comprising:
  A map data dividing step for dividing the map data stored in the map data storage means into a plurality of passable areas, with a portion represented by the prohibition data stored in the prohibition data storage means as a boundary;
  Neighboring road search data generation for associating the road data stored in the road data storage means included in the passable area with the passable area and generating data for searching for a nearby road for searching for a nearby road Steps,
  A neighborhood road search data storage step storing the neighborhood road search data generated by the neighborhood road search data generation step;
  A position designation information acquisition step for acquiring position designation information for designating one or a plurality of positions;
  A neighboring road candidate acquisition step of determining the passable area including the position designation information based on the neighboring road search data and acquiring one or more road data associated with the passable area;
  Each road data acquired in the neighboring road candidate obtaining step is set as a neighboring road, and a route candidate searching step for obtaining a route candidate connecting the plurality of designated positions;
  A route search result output step for outputting a plurality of route candidates obtained by the route candidate search step, as a route search result, with priority given to those having a short required time or distance;
  With
  The link stored in the road data storage means is defined by a start point and an end point for each direction in which the road section can pass,
  The route candidate searching step searches for a route connecting between link end points stored in the road data storage means.
  A route search method characterized by that.

Images