JP6320739B2 - Route search system, route search method, route search device, traffic information processing device, and computer program - Google Patents

Description

The present invention relates to a route search system and a route search method for searching a route from a departure point to a destination point while exchanging predetermined information between the route search device and the traffic information processing device.
The present invention also relates to an accounting search device and a traffic information processing device constituting a route search system, and a computer program for operating a computer as these devices.

A route search device (for example, an in-vehicle navigation device) that appropriately guides a vehicle from a departure point to a destination point is already well known.
This route search device calculates the optimum route when passing from the departure point to the destination point using a predetermined route search logic, and the route obtained as a result of the calculation is boarded with an image or sound from a display or a speaker. Guide the person. In such route search processing, the minimum cost route that minimizes the link cost is generally calculated by a specific route search logic. As this route search logic, for example, the Dijkstra method or the potential method is used (see Patent Document 1).

A traffic signal control system that controls the operation of traffic signals belonging to a jurisdiction area according to a traffic volume measured by a vehicle sensor or the like (hereinafter also referred to as “measured traffic volume”) is already well known.
This traffic signal control system includes a traffic signal control device (also referred to as a “central device”) installed in a traffic control center, and a plurality of traffic signal devices, traffic signal control devices, and vehicle sensors in a jurisdiction area. The traffic signal control device performs traffic sensitivity control for setting signal control parameters such as split and offset according to the inflow traffic to the intersection, and causes the traffic signal controller to execute the set signal control parameters (Patent Document 2). reference).

Japanese Patent Laid-Open No. 7-103777 JP 2011-60019 A

In a conventional route search apparatus, link travel time and traffic jam information included in VICS information ("VICS" is an abbreviation for Vehicle Information and Communication System and is a registered trademark of the Road Traffic Information Communication System Center). Define link cost from
On the other hand, as described above, at the traffic control center, the measured traffic volume based on the detection signal of the vehicle detector is collected almost in real time. Therefore, it is considered that a more accurate search result can be obtained if the route search process is performed with the link cost considering the traffic volume with a high real-time property.

In addition, since the road administrator who manages the traffic control center also manages regulation information such as construction regulations and traffic regulations, even when performing route search processing with link costs that take into account such regulation information, higher accuracy is achieved. It is thought that the search result of is obtained.
However, if the route search process for the optimal route is performed by including the traffic volume sensed by the vehicle detector and the regulation information that the road administrator has established exclusively in the link cost, the following will be performed according to the subject performing the route search. There is a problem like this.

In other words, assuming that the above-described high-accuracy route search processing is performed by a private company, the traffic volume and regulation information (hereinafter collectively referred to as “traffic information”) measured by the vehicle detector is private. It is necessary to notify the contractor.
However, from the viewpoint of preventing tampering, the road manager (or traffic manager) cannot provide the traffic information managed by the road manager (or traffic manager) to private companies without obtaining approval from the relevant organizations in the current legal system. Therefore, it is difficult to implement high-accuracy route search processing mainly by private companies because traffic information cannot be obtained from road administrators.

On the other hand, assuming that the road administrator performs the above-described high-accuracy route search processing, the location information (hereinafter also referred to as “OD information”) and user identification information set by the user are set. It is necessary to notify the road manager of personal information such as.
However, since users tend to be reluctant to provide personal information to road managers, performing high-accuracy route search processing mainly by road managers can obtain personal information including OD information from users. It was difficult to realize it.

In short, users are reluctant to notify their road administrator of their personal information, and road managers cannot easily notify private operators of traffic information that they manage independently for legal reasons. It was difficult to perform route search processing that included traffic information in the link cost.
SUMMARY OF THE INVENTION The present invention has been made in view of such conventional problems, and an object of the present invention is to improve the accuracy of route search processing while maintaining the confidentiality of information that is difficult for a user or road administrator to provide.

The present invention relates to a route search system including a route search device and a traffic information processing device.
The route search device performs a first route search process for searching for a route from the departure point to the destination point using a plurality of search requests including a departure point, a destination point, and a departure time or arrival time. And an information calculation unit for calculating passage schedule information indicating the number of vehicles that will pass through a predetermined point on the road after the current time based on a search result by the first route search process, and the calculated passage schedule And a transmission unit that transmits information to the traffic information processing apparatus.

  In addition, the traffic information processing apparatus includes: a receiving unit that receives the passing schedule information; the received passing schedule information; and traffic information that includes at least one of measured traffic volume and traffic restriction information. An information generation unit that generates risk information indicating a difficulty level when the vehicle passes through a predetermined point on the road, and a transmission unit that transmits the generated risk information to the route search device.

  According to the route search system of the present invention, it is possible to improve the accuracy of route search processing while maintaining the secrecy of information that is difficult for a user or road administrator to provide.

1 is an overall configuration diagram of a route search system according to an embodiment of the present invention. It is a functional block diagram of a route search device and a traffic information processing device. It is a flowchart of a route search process. It is a plane map which shows an example of a minimum zone. (A) is a table which shows the data format of link passing schedule information, (b) is a table which shows the data format of intersection passing schedule information. It is a correspondence table showing the search result of the second route search process performed in correspondence with the value of risk degree and the value of avoidance strength.

<Outline of Embodiment of the Present Invention>
Hereinafter, an outline of embodiments of the present invention will be listed and described.
(1) A route search system according to an embodiment of the present invention is a route search system including a route search device and a traffic information processing device.
The route search device includes a route search unit that performs a first route search process using a plurality of search requests including a departure point, a destination point, and a departure time or arrival time, and a search result obtained by the first route search process. An information calculation unit that calculates passage schedule information indicating the number of vehicles that are scheduled to pass through a predetermined point on the road after the present time, and a transmission unit that transmits the calculated passage schedule information to the traffic information processing device; Have.

  In addition, the traffic information processing apparatus includes: a receiving unit that receives the passing schedule information; the received passing schedule information; and traffic information that includes at least one of measured traffic volume and traffic restriction information. An information generation unit that generates risk information indicating a difficulty level when the vehicle passes through a predetermined point on the road, and a transmission unit that transmits the generated risk information to the route search device.

The “degree of difficulty when the vehicle passes through a predetermined point on the road” means the difficulty or ease of passage when the vehicle passes through a predetermined point on the road (for example, a link or an intersection). .
Therefore, if the “difficulty” represents difficulty, the risk information may be quantified so that the risk information increases as the passage becomes difficult. The risk information may be quantified so that the risk information becomes larger as the process becomes easier.

According to the route search system of the present embodiment, the information calculation unit of the route search device represents the number of vehicles that the vehicle is scheduled to pass through the predetermined point on the road after the current time based on the search result by the first route search process. The passage schedule information is calculated, and the transmission unit of the route search apparatus transmits the calculated passage schedule information to the traffic information processing apparatus.
For this reason, the OD information that the user does not want to provide to the road manager is not provided to the traffic information processing apparatus, and the confidentiality can be maintained.

Further, according to the route search system of the present embodiment, the information generation unit of the traffic information processing device includes traffic information including at least one of the received passing schedule information, the measured traffic volume of the road, and the traffic regulation information. Based on the above, risk information indicating the degree of difficulty when the vehicle passes a predetermined point on the road is generated, and the transmission unit of the traffic information processing device transmits the generated risk information to the route search device.
For this reason, traffic information (such as traffic volume and regulation information measured by vehicle detectors) that road administrators cannot easily provide to private companies for legal reasons is not provided to the route search device, and its confidentiality. Can be maintained.

(2) Accordingly, the route search device further includes the risk information received from the traffic information processing device in the link cost and further performs route search, while maintaining the confidentiality of information that is difficult for the user or road administrator to provide. The accuracy of the route search process can be improved.
Specifically, the route search apparatus further includes a reception unit that receives the risk information, and the route search unit performs a second route search process that includes the received risk information in a link cost, The transmission unit of the route search apparatus may transmit the search result by the second route search process to the user terminal that is the transmission source of the search request.

(3) In the route search system of the present embodiment, the route search unit performs a process of converting the departure point and the destination point to representative points of a predetermined area including these points, and the representative after the conversion It is preferable to perform the first route search process using a point.
The reason is that if the above conversion process is performed, for example, the representative point is set at the intersection of the main road, so that the shortest route corresponding to the main road on which the measured traffic volume is measured can be easily obtained. This is because it contributes to the improvement of the accuracy of risk information generated.

(4) In the route search system of the present embodiment, the passing schedule information includes at least one of link passing schedule information and intersection passing schedule information defined below.
Link passing schedule information: Information indicating the number of vehicles that the vehicle will pass after the current time in the link included in the search result of the first route search process. Intersection passing schedule information: included in the search result of the first path search process Information representing the number of vehicles that the vehicle will pass through the intersection after the current time

Either one of the link passing schedule information and the intersection passing schedule information may be calculated, but it is preferable that the passing schedule information of both of them is calculated.
The reason is that the link passing schedule information and the intersection passing schedule information are useful when the information generation unit of the traffic information processing apparatus generates “intersection risk information” described later.

(5) In the route search system of the present embodiment, the risk information includes intersection risk information indicating a difficulty level when the vehicle passes the intersection.
In this case, the information generation unit can generate the intersection risk information using the link passage schedule information, the intersection passage schedule information, and the measured traffic volume of the link flowing into the intersection.

  (6) More specifically, the information generation unit uses a value obtained by dividing the measured traffic volume of the link flowing into the intersection by the link passage schedule information, and the intersection passage schedule information for the intersection. The predicted traffic volume occurring at the intersection can be calculated, and the intersection risk information can be obtained based on the calculated predicted traffic volume.

(7) In the route search system of the present embodiment, the risk information includes link risk information indicating a difficulty level when the vehicle passes the link.
In this case, the information generation unit can generate the link risk information by reading from the storage device the link risk information set in advance based on the restriction information.

(8) The route search method according to the embodiment of the present invention is a route search method performed by the above-described route search systems (1) to (7).
Therefore, the route search method of this embodiment has the same effects as the route search systems (1) to (7) described above.

(9) The traffic information processing apparatus according to the embodiment of the present invention is a traffic information processing apparatus that is a component (sub-combination) of the route search system of (1) to (7) described above.
(10) A route search device according to an embodiment of the present invention is a route search device that is a component (sub-combination) of the route search system of (1) to (7) described above.
Therefore, these devices also have the same effects as the route search systems (1) to (7) described above.

(11) A computer program according to an embodiment of the present invention is a computer program for operating a computer as the above-described traffic information processing apparatus.
(12) A computer program according to an embodiment of the present invention is a computer program for operating a computer as the above-described route search device.
Therefore, these computer programs have the same effects as the above-described traffic information processing apparatus and route search apparatus.

<Details of Embodiment of the Present Invention>
Hereinafter, details of embodiments of the present invention will be described with reference to the drawings.
[Overall configuration of route search system]
FIG. 1 is an overall configuration diagram of a route search system 1 according to an embodiment of the present invention. FIG. 2 is a functional block diagram of the route search device 3 and the traffic information processing device 5 constituting the route search system 1 according to the embodiment of the present invention.

As shown in FIGS. 1 and 2, the route search system 1 includes a route search device 3 provided in a navigation center 2, a traffic information processing device 5 provided in a traffic control center 4, and a plurality of user terminals 7 ( 2).
Examples of the user terminal 7 include, for example, a notebook computer, a desktop personal computer, a mobile phone, a smartphone, and a tablet terminal that can communicate with the route search device 3 and in which an application for using the route search output is installed.

Further, the user terminal 7 may be, for example, an in-vehicle device (so-called navigation device) permanently mounted on the vehicle 6 or a mobile terminal (such as a mobile phone or a smartphone) temporarily mounted on the vehicle 6. It may be.
“Vehicle” refers to automobiles, motorbikes, light vehicles, trolley buses, and the like. The “in-vehicle device” refers to a computer device that is mounted on the vehicle 6 and has a navigation function for guiding a passenger to the vehicle 6 to the destination.

The route search system 1 of the present embodiment performs a route search for registered members (users) who have joined the navigation center 2 in advance in consideration of information such as link traffic volume and traffic regulations that the traffic control center 4 has, The search result is provided to the user.
Therefore, according to the present system 1, it is possible to provide a user with a search result with higher accuracy than a route search considering only VICS information (congestion information, link travel time, etc.) obtained from VICS.

The route search device 3 acquires VICS information distributed by FM multiplex broadcasting from a road traffic information center (not shown). The route search device 3 is connected to the traffic information processing device 5 of the traffic control center 4 via a router 9 via a communication line 8 such as a telephone line.
Furthermore, the route search apparatus 3 can communicate with the radio base station 10 via the Internet network 11, and each user terminal 7 can communicate with the radio base station 10 by radio. For this reason, each user terminal 7 can transmit and receive information to and from the route search apparatus 3 in almost real time by communication using the Internet.

The user terminal 7 includes an input device and an output device including a display and a speaker. When a predetermined travel condition is input to the input device, the user terminal 7 transmits the condition to the route search device 3.
The travel plan setting conditions that can be input to the user terminal 7 include departure point (including the current point) and destination point, departure time or arrival time, waypoint and priority route (general road priority or toll road priority, , Distance priority or road width priority).

When the user terminal 7 has a position detection function such as a GPS (Global Positioning System) receiver, the detected current position can be set as a departure point.
Further, when the user terminal 7 receives the data of the optimum route from the route search device 3, the user terminal 7 can provide the optimum route to the user by displaying a road map including the received optimum route on the display.

The traffic information processing device 5 of the traffic control center 4 constitutes a traffic signal control system for controlling the light color of the traffic signal device 12 included in a predetermined jurisdiction area. This traffic signal control system includes a traffic signal 12, a traffic signal controller 13, a vehicle sensor 14, and the like.
The traffic signal controller 13 is installed at each intersection in the jurisdiction area, and is connected to the traffic information processing apparatus 5 via the router 9 via the communication line 8 such as a telephone line.

The traffic information processing device 5 constitutes a traffic signal controller 13 at an intersection included in the jurisdiction area and a LAN (Local Area Network).
Therefore, the traffic information processing device 5 can bidirectionally communicate with the traffic signal controller 13 at each intersection, and each traffic signal controller 13 can also bidirectionally communicate with other traffic signal controllers 13. . In addition, the traffic information processing apparatus 5 does not necessarily need to be installed in the traffic control center 4, and may be installed on the road.

The vehicle sensor 14 is installed, for example, in the inflow path of the main road, and is connected to the traffic signal controller 13 via the communication line 8.
The vehicle detector 14 is a roadside sensor that detects the presence of the vehicle 6 traveling on the road one by one at a fixed position, for example, an ultrasonic vehicle detector that detects the vehicle 6 that passes directly under the ultrasonic wave, A temperature type vehicle sensor that detects the passage of the vehicle 6 from a temperature change when the vehicle passes, a loop coil embedded in a road that detects the vehicle 6 by an inductance change, and the like.

The traffic information processing device 5 performs traffic sensitivity control for changing signal control parameters (split, cycle length, offset, etc.) according to traffic conditions for traffic signals 12 at intersections belonging to a network in a jurisdiction area.
Specifically, system control for adjusting a group of traffic signals on the same road based on the inflow traffic obtained from the detection signal of the vehicle sensor 14, wide area control that extends this system control to the road network, etc. The signal control parameter which is the control result is transmitted to the traffic signal controller 13.

The traffic signal controller 13 generates the lamp color switching timing (step seconds) of the traffic signal 12 according to the signal control parameter received from the traffic information processing device 5.
In addition, the traffic signal controller 13 switches the signal light device such that the blue light, the yellow light, the red light, and the right turn light, etc. of the traffic light 12 are turned on, off, or blinking according to the generated switching timing. Supply power.

[Internal configuration of route search device]
As shown in FIG. 2, the route search device 3 includes a computer device 20 including a workstation, first and second communication units 21 and 22 including communication interfaces connected to the computer device 20, and various databases 23. ~ 25.

The first communication unit 21 is connected to the communication unit 31 of the traffic information processing apparatus 5 via the communication line 8 and the router 9.
The second communication unit 22 is connected to the radio base station 10 via the Internet network 11, and transmits and receives information to and from the user terminal 7 through radio communication between the radio base station 10 and the user terminal 7. It can be carried out.

The member database 23 stores member identification information registered in the route search system 1. Based on the search request received from the specific registered member stored in the member database 23, the computer device 20 executes a route search process (FIG. 3) described later.
The traffic information database 24 stores VICS information acquired from the road traffic information center, probe information (running locus) of the vehicle 6 acquired from the probe center (not shown), and the like. These pieces of traffic information are updated sequentially every time they are received, and the latest information is held.

In the map database 25, road map data 26 is recorded. The road map data 26 includes “intersection data” and “link data”.
Among these, “intersection data” is data in which intersection IDs assigned to intersections nationwide are associated with the intersection positions. The “link data” includes data in which the following information 1) to 4) is associated with the link ID of a specific link assigned corresponding to a road in the whole country.

1) Position of start point / end point / interpolation point of specific link 2) Link ID connected to start point of specific link
3) Link ID connected to the end point of a specific link
4) Link cost of specific link The road map data 26 of this embodiment constitutes a network corresponding to the actual road alignment and the traveling direction, and therefore, for example, as shown in FIG. The network is represented by a pair of directed links l (lowercase letters L).

Specifically, the road map data 26 includes a directed graph in which a node n is set for each intersection and the nodes n are connected by a pair of links 1 in the opposite direction. Accordingly, in the case of a one-way road, only one-way link l is set. Note that the node n may be set at a midway point on the road other than the intersection.
Further, the link data of the road map data 26 includes a road type indicating whether the specific link 1 corresponding to each road on the map is a general road or a toll road.

On the other hand, as many link costs as the number of combinations of a link l and a link l connected to its end point are prepared. As a component of the link cost recorded in the road map data 26, it is necessary to leave the end point of the specific link l after entering the start point of the specific link l and enter the start point of the link 1 to be connected next. Includes link travel time.
That is, the link travel time includes the “link passage time” required to travel from the start point to the end point of the specific link l and the travel time required to travel from the end point of the specific link l to the start point of the next link l. That is, “intersection passing time” required for passing the intersection is included.

The link travel time is prepared every 5 minutes from the present to the next day for each day type such as weekdays, Saturdays, Sundays, and holidays. The data for every 5 minutes is the VICS in the traffic information database 24. It is generated based on information, probe information (running locus) acquired from the probe center, and the like.
Further, the link cost component recorded in the road map data 25 includes the distance (link distance) between the start point and the end point of the specific link l.

As shown in FIG. 2, the computer device 20 of the route search device 3 includes a storage device 27 composed of an HDD, a random access memory, and the like, and an arithmetic device composed of a CPU that reads out various computer programs from the storage device 27 and executes them. 28.
One of the computer programs uses a predetermined search algorithm to search for a route that minimizes the travel cost (cumulative link cost) when the vehicle 6 travels from the departure point to the destination point. It consists of a program to do.

The arithmetic unit 28 searches for a route having the minimum traffic cost (total link cost) by a search algorithm using, for example, the Dijkstra method or the potential method.
For example, in the Dijkstra method, when constructing an intermediate link tree from a start link, when branching from one intermediate link to another intermediate link, the path cost including the intermediate link after branching (after branching from the start link) This is a search algorithm that compares the sum of the link costs up to the intermediate link) and sorts them in ascending order of the path cost, and further continues the search from the intermediate link with the lower path cost.

  In addition, the computer program executed by the computing device 28 of the computer device 20 includes a program for executing processing (step ST2 in FIG. 3) for converting the OD information included in the search request set by the user into a representative point of the minimum zone. Or, a process (step ST4 in FIG. 3) for calculating “passing schedule information” (see FIG. 5) for the link or the intersection from the search result obtained by the first route search process (step ST3 in FIG. 3). Includes programs to do. These processes will be described later.

[Internal configuration of traffic information processing device]
As shown in FIG. 2, the traffic information processing apparatus 5 includes a computer device 30 including a workstation, a communication unit 31 including a communication interface connected to the computer device 30, and various databases 32 and 33. Yes.

The communication unit 31 is connected to the first communication unit 21 of the route search device 3 via the communication line 8 via the router 9.
The communication unit 31 is also connected to the traffic signal controller 13 and the vehicle detector 14 via the communication line 8 and the router 9.

The traffic information database 32 stores the number of vehicles 6 passing through the intersection (measured traffic volume of the inflow link) calculated based on the detection signal obtained from the vehicle detector 14 in almost real time.
The traffic information database 32 may also store VICS information acquired from the road traffic information center, probe information (running locus) of the vehicle 6 acquired from the probe center, and the like. These pieces of traffic information are updated sequentially every time they are received, and the latest information is held.

  In the map database 33 of the traffic information processing apparatus 5, road map data 26 including “intersection data” and “link data” is recorded in the same manner as the map database 25 of the route search apparatus 3.

As shown in FIG. 2, the computer device 30 of the traffic information processing device 5 includes a storage device 34 composed of an HDD, a random access memory, etc., and an arithmetic operation comprising a CPU that reads out various computer programs from the storage device 34 and executes them. Device 35.
One of the computer programs is a program for executing the above-described system control and wide area control for setting the signal control parameter according to the link traffic volume obtained from the sensing signal of the vehicle detector 14.

  Further, in the computer program executed by the arithmetic unit 28 of the computer device 20, a process of generating “intersection risk degree” from “passing schedule information” (see FIG. 5) regarding links and intersections acquired from the route search device 3. (Step ST6 in FIG. 3) and a program for performing a process of generating a “link risk degree” (step STST7 in FIG. 3) are also included. These processes will be described later.

[Contents of route search processing]
FIG. 3 shows a flowchart of route search processing executed in cooperation by the route search device 3 and the traffic information processing device 5 of the route search system 1.
As shown in FIG. 3, in the route search system 1 of the present embodiment, first, the user terminal 7 accepts route search condition settings by a user who is a registered member of the navigation center 2 (step ST1).

This condition setting includes at least setting of a departure point and a destination point and setting of a departure time or an arrival time.
However, when there is no setting of the departure point, the current position specified by the GPS function may be automatically set as the departure point. Further, the search request transmitted by the user may include other input information such as toll road priority.

A search request including input information such as a departure point and a destination point is transmitted to the route search apparatus 3 via the radio base station 10 and the Internet network 11.
When the search request is received, the computer device 20 of the route search device 3 first corresponds the position information (OD information) of the departure point and the destination point included in the search request to the preset “minimal zone”. It converts into the representative point to perform (step ST2).

In the present system 1, the “minimal zone” refers to, for example, a predetermined area unit set to further divide the “small zone” in the person trip survey.
In the map database 25 (see FIG. 2) of the route search device 3, in addition to the road map data 26, a minimal zone and representative points included therein are recorded in advance. The small zone of the person trip survey is an area unit with 15,000 people as a guide for the night population, and in a densely populated city, the area is approximately 2 km square.

The minimum zone is defined by further dividing such a small zone. For example, if specified by size, it becomes an area unit of about 1 km square, and if specified by time, it is an area of about 2 minutes based on 30 km / h. Unit.
FIG. 4 is a plan map showing an example of the minimum zone Zi (i = 1 to 11). As shown in FIG. 4, representative points Pi (i = 1 to 11) corresponding to the intersection positions of the road are defined in advance in each minimum zone Zi.

The representative point Pi corresponds to the position of an intersection (for example, an important intersection) of the main road in the minimum zone Zi.
Here, the OD information conversion process (step ST2 in FIG. 3) by the route search device 3 converts the actual OD information included in the search request from the user into a neighboring representative point Pi corresponding to the minimal zone Zi. Is done by.

That is, as shown in FIG. 4, the computer device 20 of the route search device 3 determines which minimum zone Zi each of the departure point O6 and the destination point D5 included in the search request is included in each point O6, D5 is replaced with the corresponding representative point Pi of the minimum zone Zi.
For example, when the departure point O6 is included in the minimum zone Z6 and the destination point D5 is included in the minimum zone P5, the computer device 20 converts the departure point O6 into the representative point P6 of the minimum zone Z6, The point D5 is converted into the representative point P5 of the minimum zone Z5.

Next, the computer device 20 of the route search device 3 executes a first route search process using the converted OD information as a departure point and a destination point (step ST3).
The first route search process that is performed first is a normal route search process that is performed without taking into consideration the later-described intersection risk degree CR and link risk degree LR.

Specifically, the computer device 20 of the route search device 3 sets the link or node closest to the converted starting point (point P6 in FIG. 4) as a search start link, and converts the destination point (point P5 in FIG. 4). The network data including the search start link to the search end link is acquired from the map database 25 from the above-mentioned link data, with the link closest to) as the search end link.
Next, the computer device 20 of the route search device 3 executes the search algorithm described above on the acquired network data.

That is, the computer device 20 sequentially adds links from the search start link to the search end link to form a link tree, and does not consider the risk levels CR and LR in the tree reaching the search end link. The route with the smallest accumulated “first link cost” defined by the equation is obtained by route search logic using the Dijkstra method or the potential method.
First link cost = (a x link travel time) + (b x link distance) + (c x road type)
+ (D x toll) + (e x crossing time)

However, a to e are coefficients that can be set for each route calculation type and each user.
In the present embodiment, as in the case of the first route search process using the first link cost, the minimum cost obtained by the route search process that does not consider the intersection risk degree CR and the link risk degree LR. The route is called “shortest route”.

Next, the computer device 20 of the route search device 3 relates to a link and an intersection that the user of the route search system 1 plans to pass by the vehicle 6 in the future based on the shortest route obtained by the first route search process. “Passing schedule information” (see FIG. 5) is calculated and the information is updated (step ST4).
The passing schedule information includes “link passing schedule information” regarding links and “intersection passing schedule information” regarding intersections. FIG. 5A shows the data format of the link passing schedule information, and FIG. 5B shows the data format of the intersection passing schedule information.

As shown in FIG. 5A, the link passing schedule information is in a data format in which the number of vehicles that the user's vehicle 6 is scheduled to pass is summarized for each link in a predetermined time zone after the current time.
When one shortest route is obtained by the first route search process, the computer device 20 of the route search device 3 obtains an identification number (link number) of a link included in the shortest route and a time zone passing through the link. The data content of the link passing schedule information is updated by extracting and incrementing the number of vehicles in the table column corresponding to the extracted link number and time zone by one.

Further, as shown in FIG. 5B, the intersection passing schedule information is in a data format in which the number of vehicles that the user's vehicle 6 is scheduled to pass is summarized for each intersection in a predetermined time zone after the current time. .
When one shortest route is obtained by the first route search processing, the computer device 20 of the route search device 3 obtains an intersection identification number (intersection number) included in the shortest route and a time zone passing through the intersection. By extracting and incrementing the number of vehicles in the table column corresponding to the extracted intersection number and time zone by one, the data content of the intersection passing schedule information is updated.

  When the link passing schedule information and the intersection passing schedule information are updated as described above, the computer device 20 of the route search device 3 transmits the updated latest passing schedule information to the traffic information processing device 5 ( Step ST5).

Next, the computer device 30 of the traffic information processing device 5 indicates the difficulty level when the vehicle 6 passes through the intersection based on the “link passage plan information” and the “intersection passage plan information” received from the route search device 3. “Intersection risk CR” is calculated.
Specifically, for the same link, the computer device 30 first calculates the calibration rate LCj for the link from the link passing schedule information and the measured traffic volume of the inflow link obtained from the sensing signal of the vehicle detector 14. Obtained by the following equation.
LCj = Measured traffic volume of inflow links / link passing schedule information

Next, the computer device 30 of the traffic information processing device 5 obtains the calibration rate CCk for the intersection by the following equation.
CCk = average value of the calibration rates LCj of a plurality of links flowing into the intersection Note that other statistical values such as the median value are used in place of the “average value” in the above-described equation of the calibration rate CCk It may be.

Next, the computer device 30 of the traffic information processing device 5 uses the intersection calibration rate CCk and the “intersection passing schedule information” received from the route search device 3 to predict the traffic volume flowing into the intersection after the current time. Is calculated by the following equation.
V = intersection passing schedule information × calibration rate CCk
Then, the computer device 30 of the traffic information processing device 5 compares the intersection predicted traffic volume V with the traffic volume AV of the intersection, thereby calculating the degree of difficulty in passing through the intersection in a stepwise numerical value. The degree CR is calculated.

Specifically, the computer device 30 of the traffic information processing device 5 sets the intersection risk CR to “3” for an intersection where the predicted traffic volume V> the traffic capacity AV.
Further, the computer device 30 of the traffic information processing device 5 sets the intersection risk CR to “2” for an intersection where (1−α) × AV ≦ V <AV.
Furthermore, the computer apparatus 30 of the traffic information processing apparatus 5 sets the intersection risk CR to “1” for an intersection where V ≦ (1-α).

  The set value α is a traffic jam prevention coefficient preset by the administrator of the traffic control center 4 within a range of 0 <α <1, and the traffic jam prevention coefficient α is set for an intersection where traffic congestion is to be prevented as much as possible. The value is set as large as possible.

Next, the computer apparatus 30 of the traffic information processing apparatus 5 specifies the link risk degree LR by reading the preset link risk degree LR from the traffic information database 32 (step ST7).
The link risk level LR is calculated by the manager of the traffic control center 4 by numerically evaluating the difficulty level when the vehicle 6 passes the link in stages, and the scale of construction regulations and traffic regulations (for example, extension of the regulation section and According to the number of lanes, etc., it is recorded in the traffic information database 32 in advance.

Next, the computer apparatus 30 of the traffic information processing apparatus 5 transmits the intersection risk degree CR and the link risk degree LR to the route search apparatus 3 (step ST8).
When each risk degree CR, LR is received, the computer device 20 of the route search device 3 executes a second route search process (step ST9 in FIG. 3).
The second route search process performed for the second time is a route search process performed in consideration of the intersection risk degree CR and the link risk degree LR.

Specifically, the computer device 20 of the route search device 3 sets the link or node closest to the converted starting point (point P6 in FIG. 4) as a search start link, and converts the destination point (point P5 in FIG. 4). The network data including the search start link to the search end link is acquired from the map database 25 from the above-mentioned link data, with the link closest to) as the search end link.
Next, the computer device 20 of the route search device 3 executes the search algorithm described above on the acquired network data.

That is, the computer device 20 sequentially adds links from the search start link to the search end link to form a link tree, and considers the risk levels CR and LR in the tree reaching the search end link. The route with the smallest accumulated “second link cost” defined by the equation is obtained by route search logic such as Dijkstra method or potential method.
Second risk cost = (a x link travel time) + (b x link distance) + (c x road type)
+ (D x toll) + (e x crossing time)
+ (Β x intersection delay time) + (β x link delay time)

However, a to e are coefficients that can be set for each route calculation type and each user.
Further, the term + (β × intersection delay time) + (β × link delay time) on the right side of the second link cost is referred to as “risk-inclusive cost”. Accordingly, the second link cost is the sum of the first link cost and the risk-inclusive cost.

In the present embodiment, the minimum cost route (β> 0) obtained in consideration of the intersection risk degree CR and the link risk degree LR obtained by the second route search process using the second risk cost described above. In this case) is called “optimum route”.
However, when β = 0, the second link cost is the same as the first link cost, so only the “shortest route” can be obtained even if the second route search process is performed.

Here, the risk coefficient β is a coefficient defined by the product of the risk degrees CR and LR and the avoidance strength DN indicating the degree that the user wants to avoid the risk.
The avoidance strength DN is, for example, a parameter that can be defined as input information by a user in a search request. The larger the value of the avoidance strength DN, the higher the user's risk avoidance request. Therefore, when DN = 0, it means that the user wants only a normal route search without worrying about the risk levels CR and LR.

In the route search process, the representative point Pi (the point P6 and the point P5 in FIG. 4) of the minimal zone Zi is used as the OD information of the vehicle 6. However, the representative points P6 and P5 are different from the actual OD information (starting point O6 and destination point D6 in FIG. 4) included in the user's search request.
Therefore, in the second route search process (step ST9 in FIG. 3), in addition to the route search process for searching for the route between the representative points P6 and P5, the actual departure point O6 or the purpose from the representative points P6 and P5, respectively. A route search process for obtaining a route in the zone up to the point D5 is included.

As described above, since the minimal zone Zi of this embodiment is set in a relatively small area unit of about 1 km square, the route obtained by the route search process for obtaining the route in the zone is relatively small other than the main road. It is likely to be a large road.
Therefore, for the route search process for obtaining the intra-zone route, for example, only the link travel time and the link distance may be used as the link cost, and it may be sufficient to search for the route having the minimum link cost.

FIG. 6 is a correspondence table showing search results of the second route search process performed in correspondence with the values of the risk degrees CR and LR and the avoidance strength DN.
In the first to third lines in FIG. 6, the avoidance strength DN = 0 is set. Therefore, in this case, the risk coefficient β = 0 regardless of the values of the risk levels CR and LR, and the “shortest path” in which the risk levels CR and LR are not reflected is obtained even in the second route search process.

In the fourth to sixth lines in FIG. 6, the avoidance strength DN = 2 is set. Therefore, in this case, the risk coefficient β is a relatively high value (β = 6, 4 or 2), and in the second route search process, an “optimal route” in which the risk levels CR and LR are reflected higher is obtained. I want.
In the seventh to ninth lines in FIG. 6, the avoidance strength DN = 1 is set. Therefore, in this case, the risk coefficient β is a relatively low value (β = 3, 2 or 1), and in the second route search process, the “optimum route” in which the risk levels CR and LR are reflected to be low I want.

In the correspondence table of FIG. 6, “retry recommendation” in the first row means that the route search considering the risk levels CR and LR is executed again by setting the avoidance strength DN to a value other than “0”. It means information that encourages users to do this.
In addition, in the correspondence table of FIG. 6, “caution information” in the second row or the like does not necessarily set the avoidance strength DN to the maximum value (= 2), and therefore the risk levels CR and LR are not necessarily considered to the maximum. This means information that informs the user that the optimum route is not provided.

In the “risk-included cost” included in the second link cost described above, “intersection delay time” is the time difference between the time required to pass through an intersection when a traffic jam occurs and when there is no traffic jam. The “delay time” is the time difference between the link travel time when the construction regulation or traffic regulation is performed and when it is not performed.
These delay times are recorded in the traffic information database 24 of the route search device 3 for each intersection and each link as past statistical data.

When the computer device 20 of the route search device 3 calculates the optimum route (however, the shortest route when β = 0) by the second route search process, the user who has transmitted the search request uses the calculated optimum route. To the user terminal 7 (step ST10).
When receiving the optimum route from the route search device 3, the user terminal 7 provides the user with the optimum route and the route contents related to this route via an output device such as a display or a speaker (step ST11).

In this case, as the shortest path information provided to the user by the output device, for example, the following information can be included.
1) Travel route from departure point to destination point and travel time 2) Travel distance from departure point to destination point 3) Toll fee when traveling on toll road 4) Entrance and exit when traveling on toll road

After that, the user who has received the above information determines whether or not to select the route of the provided optimum route when riding on the vehicle 6 and driving (step ST12).
When the user selects the optimum route provided, the vehicle 6 on which the user is boarding travels along the optimum route from the departure point and arrives at the destination point.

[Effect of this embodiment]
According to the route search system 1 of the present embodiment, the computer device 20 of the route search device 3 is based on the shortest route obtained by the first route search process (step ST3 in FIG. 3) for a plurality of OD information. Since the passage schedule information (see FIG. 5) regarding the link and the intersection is calculated (step ST4 in FIG. 3) and the passage schedule information is transmitted to the traffic information processing device 5, the OD that the user does not want to provide to the road manager Personal information such as information and identification information is not provided to the traffic information processing apparatus 5 and the confidentiality thereof can be maintained.

  Further, according to the route search system 1 of the present embodiment, the computer device 30 of the traffic information processing device 5 generates the intersection risk degree CR and the link risk degree LR and transmits them to the route search device 3 (FIG. 3). Steps ST6 to ST8) Traffic information (such as traffic volume and regulation information measured by the vehicle sensor 14) that the road administrator cannot easily provide to a private company for legal reasons is not provided to the route search device 3. The confidentiality can be maintained.

Then, the computer device 20 of the route search device 3 executes the second route search process based on the second link cost reflecting the received risk degrees CR and LR in the cost (step ST9 in FIG. 3). Compared with a normal route search process that does not consider the risk levels CR and LR, a search result with higher accuracy can be obtained.
For this reason, it is possible to perform route search processing with higher accuracy while maintaining the confidentiality of personal information that the user does not want to provide and traffic information that cannot be provided by the road administrator.

Further, according to the route search system 1 of the present embodiment, the computer device 20 of the route search device 3 converts the OD information into the representative point Pi of the minimum zone Zi (step ST2 in FIG. 3), and then the scheduled passage information. The first route search process (step ST3 in FIG. 3) for obtaining the shortest route used for the calculation is executed.
Therefore, it is easy to obtain the shortest route corresponding to the main road where the measured traffic volume is measured, and the link included in the shortest route is more likely to match the link whose traffic volume is measured by the vehicle detector. .

  For this reason, since the accuracy of the calibration rates LCj and CCk calculated by the computer device 30 of the traffic information processing device 5 is increased, the accuracy of the intersection risk CR generated by the computer device 30 can be improved.

[Other variations]
The embodiment disclosed this time should be considered as illustrative in all points and not restrictive. The scope of the present invention is defined by the terms of the claims, and includes the meaning equivalent to the terms of the claims and all modifications within the scope of the claims.

For example, in the above-described embodiment, the traffic information processing device 5 generates the risk degrees CR and LR and transmits them to the route search device 3, and the route search device 3 includes the link based on the received risk degrees CR and LR. Although the cost is calculated, the traffic information processing device 5 may calculate the link-in cost and transmit the calculated link-in cost to the route search device 3.
Accordingly, the “risk information” provided from the traffic information processing device 5 to the route search device 3 includes not only the risk degrees CR and LR but also the link inclusion cost.

  In the above-described embodiment, the second route search process (step ST9 in FIG. 3) is performed by using the OD information as it is without converting the OD information included in the search request into the representative point Pi of the minimal zone Zi. You may decide to do it.

In the above-described embodiment, signal information (for example, cycle, split, offset, each lamp color and its duration) in the traffic signal 12 may be reflected in the risk levels CR and LR of the intersection.
For example, in the case of an intersection where there is a difference in split between the main direction and the subordinate direction, a more detailed risk degree can be defined by allocating the intersection risk degree CR according to the direction according to the split value. The route search process considering CR can be performed with higher accuracy.

In the above-described embodiment, the case where one route search device 3 performs route search processing in cooperation with one traffic information processing device 5 is exemplified, but the correspondence relationship between the route search device 3 and the traffic information processing device 5 is as follows. , “One-to-multiple”, “multiple-to-one”, or “multiple-to-multiple”.
For example, one route search device 3 of a navigation center 2 operated by a specific private company cooperates with the traffic information processing device 5 of a plurality of traffic control centers 4 to configure a route search system for each jurisdiction area. It may be (one to plural).

On the contrary, one traffic information processing device 5 of the traffic control center 4 that performs traffic signal control of a specific jurisdiction area cooperates with a plurality of route search devices 3 operated by different private contractors, and the passing schedule information and the risk level Information may be exchanged between CR and LR (multiple-to-one).
Similarly, the route search system 1 of this embodiment can also be constructed as a system in which a plurality of route search devices 3 and a plurality of traffic information processing devices 5 cooperate with each other.

1: Route search system 2: Navigation center 3: Route search device 4: Traffic control center 5: Traffic information processing device 6: Vehicle 7: User terminal 8: Communication line 9: Router 10: Wireless base station 11: Internet network 12: Traffic signal device 13: Traffic signal controller 14: Vehicle detector 20: Computer device (route search unit, information calculation unit)
21: 1st communication part (transmission part, reception part)
22: Second communication unit 23: Member database 24: Traffic information database 25: Map database 26: Road map data 27: Storage device 28: Computing device 30: Computer device (information generation unit)
31: Communication unit (transmission unit, reception unit)
32: Traffic information database 33: Map database 34: Storage device 35: Computing device

Claims (14)

A route search system including a route search device and a traffic information processing device with different managers ,
The route search device
A route search unit for performing a first route search process for searching for a route from the departure point to the destination point, using a plurality of search requests including a departure point and a destination point and departure time or arrival time;
An information calculation unit that calculates scheduled passage information indicating the number of vehicles that the vehicle is scheduled to pass through a predetermined point on the road after the current time, based on a search result by the first route search process;
A transmission unit that transmits the calculated passing schedule information to the traffic information processing apparatus,
The traffic information processing apparatus
A receiving unit for receiving the passing schedule information;
Risk information indicating a difficulty level when the vehicle passes a predetermined point on the road based on the received passing schedule information and traffic information including at least one of the measured traffic volume and traffic restriction information on the road An information generation unit for generating
A route search system comprising: a transmission unit that transmits the generated risk information to the route search device. The administrator of the route search device is a private company,
The route search system according to claim 1, wherein an administrator of the traffic information processing apparatus is a road administrator. The information generation unit calculates a predicted traffic volume using the received passing schedule information and the measured traffic volume of the road, and calculates the predicted traffic volume, the traffic capacity of the predetermined point, and the predetermined point. The route search system according to claim 1, wherein the risk information is generated based on a comparison with a threshold value calculated with a set coefficient. The route search apparatus further includes a receiving unit that receives the risk information,
The route search unit performs a second route search process for searching for a route from the departure point to the destination point by including the received risk information in a link cost,
The said transmission part of the said route search apparatus transmits the search result by the said 2nd route search process to the user terminal of the transmission origin of the said search request | requirement of any one of Claims 1-3 . Route search system. The route search unit performs a process of converting the departure point and the destination point into representative points of a predetermined area including these points, and performs the first route search process using the converted representative points. The route search system according to any one of claims 1 to 4, wherein the route search system is performed. The route search system according to any one of claims 1 to 5 , wherein the passing schedule information includes at least one of link passing schedule information and intersection passing schedule information defined below.
Link passing schedule information: Information indicating the number of vehicles that the vehicle will pass after the current time in the link included in the search result of the first route search process. Intersection passing schedule information: included in the search result of the first path search process Information representing the number of vehicles that the vehicle will pass through the intersection after the current time The risk information includes intersection risk information indicating a difficulty level when the vehicle passes the intersection,
The route search according to claim 6 , wherein the information generation unit generates the intersection risk information using the link passage schedule information, the intersection passage schedule information, and a measured traffic volume of a link flowing into the intersection. system. The information generation unit uses the value obtained by dividing the measured traffic volume of the link flowing into the intersection by the link passing schedule information, and the predicted traffic volume generated at the intersection using the intersection passing schedule information about the intersection. The route search system according to claim 7 , wherein the intersection risk information is obtained based on the calculated predicted traffic volume. The risk information includes link risk information indicating a difficulty level when the vehicle passes the risk,
The information generating unit, by reading the link risk information set in advance based on the control information from the storage device, according to any one of claims 4 to claim 8 for generating the link risk information Route search system. A route search method in which a route search device and a traffic information processing device with different managers cooperate to each other,
A route search method in which the route search device executes the following first to third steps, and the traffic information processing device executes the following fourth to sixth steps.
First step: A step of performing a first route search process for searching for a route from the departure point to the destination point using a plurality of search requests including a departure point and a destination point and a departure time or arrival time. Step 2: Step of calculating passage plan information indicating the number of vehicles that the vehicle will pass through a predetermined point on the road after the current time based on the search result by the first route search process Third step: The calculated step Step of transmitting passage schedule information to the traffic information processing apparatus Fourth step: Step of receiving the passage schedule information Fifth step: The received passage schedule information, the measured traffic volume of the road and the traffic regulation information A step of generating risk information indicating a difficulty level when the vehicle passes through a predetermined point of the road based on traffic information including at least one of them Steps: sending the generated the risk information to the route search device A traffic information processing apparatus that provides risk information to be included in a link cost used for a route search process from a departure point to a destination point to a different route search device of an administrator ,
A reception unit that receives from the route search device, the passage plan information indicating the number of vehicles that the vehicle plans to pass through the predetermined point on the road after the present time;
Risk information indicating a difficulty level when the vehicle passes a predetermined point on the road based on the received passing schedule information and traffic information including at least one of the measured traffic volume and traffic restriction information on the road An information generation unit for generating
A traffic information processing apparatus having a transmission unit that transmits the generated risk information to the route search apparatus. A route search device that performs a route search from a departure point to a destination point while exchanging information with traffic information processing devices of different managers ,
A route search unit for performing a first route search process for searching for a route from the departure point to the destination point, using a plurality of search requests including a departure point and a destination point and departure time or arrival time;
An information calculation unit that calculates scheduled passage information indicating the number of vehicles that the vehicle is scheduled to pass through a predetermined point on the road after the current time, based on a search result by the first route search process;
A route search device, comprising: a transmission unit that transmits the calculated passing schedule information to a traffic information processing device. A computer program for operating a computer as a traffic information processing device that provides risk information to be included in a link cost used in a route search process from a departure point to a destination point to a different route search device of an administrator ,
Receiving from the route search device passage schedule information indicating the number of vehicles that the vehicle will pass through a predetermined point on the road after the current time;
Risk information indicating a difficulty level when the vehicle passes a predetermined point on the road based on the received passing schedule information and traffic information including at least one of the measured traffic volume and traffic restriction information on the road A step of generating
Transmitting the generated risk information to the route search device. A computer program for operating a computer as a route search device for searching a route from a departure point to a destination point while exchanging information with different traffic information processing devices of an administrator ,
Performing a first route search process for searching for a route from the departure point to the destination point using a plurality of search requests including a departure point and a destination point and a departure time or arrival time;
Calculating passage schedule information indicating the number of vehicles that the vehicle is scheduled to pass through the predetermined point on the road after the current time based on the search result by the first route search process;
Transmitting the calculated passing schedule information to a traffic information processing apparatus.

Images