JP2004301667A - Server, method, and program for distributing route, and route distribution system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a server, a method, and a program for distributing a route, and a route distribution system which can efficiently solve the traffic jam, in which a driver does not individuality judge the route, but the server centrally manages and computes the information on the current position and the destination of each driver, and so forth, and distributes the route information to each driver. <P>SOLUTION: A route search request receiving part 2 is the means for receiving current position information, the destination information, and so forth, as well as the route search request, from a navigation device 7 mounted on each of the vehicles X and Y, and for transmitting them to a route search 3. The route data on the other traveling vehicles are stored in an other-vehicle route data storage 5, and the route search 3 is the means for performing the computation so that the routes to the destinations of respective vehicles are dispersed into the routes different from each other, on the basis of the route data and road map data of a road map data storage part 4. A transmission etc. control unit 1 is the means for receiving the information on the departure point and the destination from the navigation device, and for transmitting the computed route to the vehicle. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
According to the present invention, instead of the driver making a route decision independently, the server centrally manages and calculates information such as the current location and the destination of each driver, and distributes the route information to each driver to reduce traffic congestion. The present invention relates to a route distribution server, a route distribution method, a route distribution program, and a route distribution system that can solve the problem efficiently.
[0002]
[Prior art]
In recent years, with the advance of digital technology and communication technology, various technologies for improving the convenience of vehicles have been developed. Among such technologies, a vehicle navigation system calculates an optimal route to a given destination based on map data prepared in advance, and calculates a position of the vehicle in real time by GPS navigation or the like. While displaying a map near the position of the vehicle on the screen, guidance such as turning left or right for traveling on the optimum route is provided by displaying an image on the screen or outputting a synthesized voice from the voice output means. .
[0003]
In such a vehicle navigation system, as the map data, conventionally, a recording medium such as a CD-ROM or a DVD-ROM is mounted on the vehicle as a map medium, and the map data is recorded by driving the map medium. We use map data.
[0004]
On the other hand, as a recent trend, with the spread of mobile devices such as digital mobile phones, opportunities to connect to the Internet and commercial provider servers using these mobile devices have been increasing. In response to this situation, in the field of vehicle navigation technology, in recent years, mobile devices such as digital mobile phones have been connected to navigation devices mounted on vehicles, and information centers have been accessed to obtain the latest map data. Technology is being developed and put into practical use.
[0005]
The following technology has been proposed to reduce traffic congestion by using a navigation system or a mobile device mounted on such a vehicle. In other words, there is a system that utilizes VICS information, which is a road traffic information communication system that provides traffic congestion and the like to a navigation system in real time. A technology has been proposed that provides information and changes the route to a road without traffic congestion by user operation or automatic control of the system based on the accurate information, thereby avoiding traffic concentration on a specific road as a whole. (See Patent Document 1).
[0006]
In addition, by accurately acquiring the position information of the vehicle based on the signal transmitted from the mobile device mounted on the vehicle and accurately grasping the traffic volume on the road, it detects and predicts traffic congestion and blinks the traffic light A technique for operating a cycle to reduce traffic congestion has also been proposed (for example, see Patent Document 2).
[0007]
[Patent Document 1]
JP-A-2002-35032
[Patent Document 2]
JP 2001-12185 A
[0008]
[Problems to be solved by the invention]
However, in the navigation system disclosed in Patent Document 1, the route selection for avoiding traffic congestion is ultimately performed for each vehicle. And this did not necessarily lead to alleviation of traffic congestion.
[0009]
Further, since the route selection for each system as described above is performed based on road map data stored in a navigation system mounted on the vehicle or road map data stored in a specific server provided outside, Considering the efficiency and smoothness of system operation, there is a certain limit in grasping detailed data of a specific area, and it is impossible to select a detailed route for each specific area.
[0010]
That is, in the conventional navigation system as described above, the route selection is ultimately left to each system, and it is impossible to collectively and unify the route selection and the route determination, so that the traffic congestion is efficiently solved. I couldn't do that.
[0011]
In addition, the traffic congestion mitigation system disclosed in Patent Document 2 certainly helps to alleviate traffic congestion, but it is, of course, impossible to distribute vehicle routes, resulting in a change in traffic volume itself. Could not be produced. Therefore, even with such a technology, it was impossible to alleviate traffic congestion in a lump and in a unified manner.
[0012]
The present invention has been proposed to solve the above-mentioned problems of the prior art. The purpose of the present invention is not to make a route decision by a driver independently, but to make a server determine the current location of each Provided is a route distribution server, a route distribution method, a route distribution program, and a route distribution system that efficiently solve traffic congestion by centrally managing and calculating information such as ground and distributing route information to each driver. It is.
[0013]
[Means for Solving the Problems]
In order to achieve the above object, the route distribution server according to claim 1 is a server that distributes an optimal route to a destination to a plurality of vehicles, wherein the route search server includes a vehicle position and a destination from each of the vehicles. A means for receiving the request, the route search request, and a road map data prepared in advance, calculating each route to the destination for each vehicle such that each vehicle is distributed over different routes. And a means for returning the calculated data of each route to each of the vehicles.
[0014]
According to a fifth aspect of the present invention, there is provided a route distribution method for distributing an optimal route to a destination to a plurality of vehicles. Receiving a route search request including the vehicle position and the destination from the vehicle, based on the route search request and road map data prepared in advance, each route to the destination for each vehicle, The method includes calculating the vehicles so as to be distributed on different routes, and returning the data of the calculated routes to the respective vehicles.
[0015]
The invention described in claim 7 captures the invention of claims 1 and 5 from the viewpoint of a computer program, and distributes an optimal route to a destination to a plurality of vehicles by controlling the computer. In the route distribution program, the program causes the computer to receive a route search request including the own vehicle position and the destination from each vehicle, and based on the route search request and road map data prepared in advance, Each route to the destination for each vehicle is calculated such that each vehicle is distributed on a different route, and the data of each calculated route is returned to each vehicle.
[0016]
According to the inventions as set forth in claims 1, 5 and 7, the server that receives the route calculation from each vehicle distributes different routes to each vehicle on the premise of the overall situation, thereby increasing traffic to a specific road. Since concentration is prevented, congestion is effectively avoided. In other words, based on the current position information, destination information, and the like transmitted from the navigation device mounted on the vehicle, the server can receive a route search, create guide route data, and transmit the data to each vehicle. By managing the routes of a plurality of vehicles in a planned and collective manner, the traffic volume can be distributed.
[0017]
The server according to claim 2 is a server provided in each predetermined area, and distributes information on an optimal route to a destination to vehicles in the area, wherein a server from a vehicle under the jurisdiction that has entered the area. A means for receiving a route search request including the own vehicle position and the destination, and, when the route search request is received from a vehicle in charge of the own area, the search request for at least a part of the route from the current location to the destination. Means for outsourcing to each server in another area within a predetermined range, and receiving the other area route returned as a result from each server to the server, and one means based on a route search request from a vehicle in charge of the own area. Alternatively, two or more routes within the own area and one or more routes when the server is entrusted with the entrustment are distributed to routes different from each other in the own area for each vehicle related to each route. By summing up the route within the own area and the returned other area route to calculate the data of the entire route for the vehicle under the jurisdiction within the own area to go to the destination. And an aggregation return means for returning the requesting vehicle to the jurisdiction vehicle.
[0018]
According to a sixth aspect of the present invention, the invention of the second aspect is grasped from the viewpoint of a method. In each predetermined area, information on an optimal route to a destination is delivered to vehicles in the area. A route distribution method, wherein a step of receiving a route search request involving the own vehicle position and the destination from the jurisdiction vehicle entering the own area, and when the route search request is received from the jurisdiction vehicle in the own area, Entrusting a search request for at least a part of the route to each server in another area within a predetermined range from the current position to the destination, and receiving another area route returned as a result from each server to the server; And one or more routes in the own area based on a route search request from a vehicle in the own area, and one or more routes in the case of entrusting the entrustment from another server. A step of searching for each vehicle related to the route to be distributed in different routes in the own area, and aggregating the route in the own area and the returned other area route to control the vehicles in the own area. Calculating data of the entire route to the destination and returning the data to the responsible vehicle of the request source.
[0019]
The invention described in claim 8 captures the invention of claims 2 and 6 from the viewpoint of a computer program. By controlling the computer, in each predetermined area, a vehicle in the area is provided with a destination. A route distribution program for distributing information of an optimal route to the computer, the program causing the computer to receive a route search request including a vehicle position and a destination from a vehicle under the jurisdiction of the own area, When there is a route search request from the vehicle in charge within, the search request for at least a part of the route is entrusted to each server in another area within a predetermined range from the current location to the destination, and Receives the other area route returned as a result from each server, and receives one or more local areas based on a route search request from the vehicle in charge of the local area. A route and one or two or more routes in the case where the entrustment is entrusted from another server are searched such that vehicles related to the respective routes are distributed in different routes in the own area, and the search is performed in the own area. By aggregating the route and the returned other area route, it is possible to calculate data of the entire route for the jurisdictional vehicle in the own area to go to the destination and to return the data to the jurisdiction vehicle of the request source. Features. The invention according to claim 4 is characterized in that a route distribution system is configured by combining a plurality of servers according to claim 2.
[0020]
According to the inventions described in claims 2, 6 and 8, and in claim 4, a server for controlling each area is provided for each area, and detailed road map data of each area is stored for each server. Even if the route from the current position of the vehicle to the destination extends between the servers, each server concentrates on the calculation only in the area under its own control (called its own area). it can.
[0021]
In addition, each server sets a route in its own area based on a route search request from a vehicle in its own area based on a route search request, and a route in the case of entrusting the entrustment returned from another server. Since the vehicle is searched and calculated so as to be distributed on different routes in the own area, it is possible to prevent traffic concentration on a specific road. Furthermore, since the server that controls the vehicle aggregates the route search data made in each area and collectively guides the route of the vehicle under the control, it is necessary to finely distribute the traffic volume according to the traffic situation for each area Will be able to
[0022]
According to a third aspect of the present invention, in the route distribution server according to the first or second aspect, the search means calculates the route so as to avoid a congested road section based on traffic information provided from outside. It is characterized by doing.
[0023]
According to the third aspect of the present invention, the server can refer to traffic information such as VICS, and collectively and unifiedly calculate and determine the route of the vehicle, thereby enabling more accurate route distribution. Therefore, it is possible to more efficiently solve traffic congestion.
[0024]
BEST MODE FOR CARRYING OUT THE INVENTION
Next, embodiments of the present invention (each referred to as an “embodiment”) will be specifically described with reference to the drawings. Each embodiment is realized by controlling a computer with software. In this case, hardware and software can be implemented in various forms. Therefore, in the following description, the present invention and the present embodiment will be described. A virtual circuit block that realizes each function is used.
[0025]
[1. First Embodiment]
[1-1. Configuration of First Embodiment]
First, the configuration of the first embodiment is shown in FIG. That is, the server device (also simply referred to as “server”) S includes one or more server computer units, network devices, and the like (not shown) as necessary. Play the role of each part.
[0026]
First, the communication etc. control unit 1 is a means for receiving information on the departure place and the destination from the navigation device. The route search request receiving unit 2 receives the current position information and the destination information from the navigation device 7 mounted on each of the vehicles X and Y together with the route search request, and further performs negotiations such as authentication of each vehicle. When each vehicle is authenticated, the current position information and the destination information are transmitted to the route search unit 3.
[0027]
The route search unit 3 is a means for calculating an optimum route to the destination based on the current position information and the destination information. The calculation is performed in the road map data storage unit 4 as representing a road network structure. This is performed based on road map data stored in advance. Further, in the present embodiment, the other vehicle route data storage unit 5 stores route data of another vehicle that is currently traveling, and the route search unit 3 determines the purpose of each vehicle based on the route data. Each route to the ground is configured to be calculated so as to be distributed over different routes. Further, the communication or the like control unit 1 also serves as a means for transmitting route data representing the calculated route to a navigation device described later.
[0028]
The navigation device 7 is mounted on vehicles X and Y (Y is not shown) and is a device that guides an optimal route to a destination. An absolute position / azimuth detecting unit 71 for detecting an absolute position / azimuth of the vehicle, a relative azimuth detecting unit 72 for detecting a relative azimuth of the own vehicle using a gyro or the like, and a vehicle speed detecting unit 73 for detecting a vehicle speed from a vehicle speed pulse. And a main processing unit 74 including a main CPU, a memory, a peripheral circuit, and the like; an input / output unit 75 for performing liquid crystal screen display and button operation input; And a communication control unit 76 that performs the communication.
[0029]
The main processing unit 74 plays the role of the following units shown in FIG. 1 by the operation of a program (not shown). First, the current position calculation unit 74a calculates the absolute position and orientation of the vehicle on the earth obtained by the absolute position / direction detection unit 71, the relative direction of the vehicle obtained by the relative direction detection unit 72, and the vehicle speed detection. This is a part for calculating the current position of the own vehicle in real time based on the vehicle speed obtained by the unit 73.
[0030]
The destination specifying unit 74b is a part that determines and accepts a departure place and a destination, which are conditions for a route search. For example, the destination determination unit 74b determines the current location as a departure place, or determines a destination based on a search result of a facility such as a store. Accept the designation of the land. The search request unit 74c is a means for requesting a route search by transmitting information of a departure place and a destination to a predetermined server S. The route receiving unit 74d is a unit that receives, from the server S, guidance data indicating a route to be guided in response to the route search request.
[0031]
[1-2. Operation and Effect of First Embodiment]
The operation of the first embodiment having the above configuration will be described with reference to FIGS. FIG. 2 is an image diagram showing that the server S is performing route guidance between the vehicle X and the vehicle Y, and FIG. 3 is a sequence diagram illustrating processing in which the server S performs route guidance between the vehicle X and the vehicle Y. is there.
[0032]
That is, the operation of the present embodiment is roughly described as follows. As shown schematically in the image diagram of FIG. 2, the server S is currently transmitted from the navigation device 7 mounted on each vehicle X, Y via a communication network such as the Internet N. Position information and destination information are received together with the route search request, and based on the route search request and the road map data, the routes to the destinations for each of the vehicles X and Y are distributed to different routes. And the result is sent back to each of the vehicles X and Y.
[0033]
Specifically, as shown in the sequence diagram of FIG. 3, the vehicle X acquires the current position A1 information and the destination A2 information by the navigation device 7 mounted on the own vehicle, and sends the information to the server S. At the same time, a route search request is transmitted from the search request unit 74c (step 301).
[0034]
The server S authenticates the vehicle at the route search request receiving unit 2 via the communication etc. control unit 1 and thereafter receives the route search request together with the current position A1 information and the destination A2 information, and transmits these information to the route. It is transmitted to the search unit 3. The route search unit 3 calculates the route A based on the road map data provided in the road map data storage unit 4 and returns the result to the vehicle X as the route data A ', and the route data A' Is stored in the other vehicle route data storage 5 (step 302). The vehicle X receives the route data A 'in the route receiving unit 74d, and starts navigation to the destination A2 according to the route A via the drawing guide unit 74e and the input / output unit 75 (step 303).
[0035]
On the other hand, after the transmission of the route of the vehicle X is completed as described above, the vehicle Y first uses the navigation device (not shown) mounted on the vehicle to provide the current position information and the purpose, similarly to the operation of the vehicle X. The location information is acquired, and a route search request is transmitted from the search request unit to the server S together with the information (step 304).
[0036]
The server S refers to the route search request, the road map data provided in the road map data storage unit 4, and the route data A 'stored in the other vehicle route data storage unit 5 in step 302, and refers to the vehicle Y. The route search unit calculates the route B such that the route to the destination B2 is different from the route A of the vehicle X. That is, as shown in FIG. 2, the server S instructs the vehicle X to proceed on the road P as its route. The route is calculated so as to be included as the route. Then, the result is returned to the vehicle Y as route data B ', and the route data B' is stored in the other vehicle route data storage 5 (step 305).
[0037]
Then, the vehicle Y receives the route data B 'in the route receiving unit, and starts navigation to the destination B2 according to the route B via the drawing guide unit and the input / output unit (step 306).
[0038]
Here, in the above operation, only the route data A ′ of the vehicle X is shown as information to be referred when the server S searches for the route of the vehicle Y, but the reference data is not limited to such. For example, the route of the vehicle Y can be calculated so as to avoid a congested road section by referring to traffic congestion information provided from outside such as VICS.
[0039]
Next, the operation of the server S while the vehicles X and Y are traveling will be described with reference to FIG. In other words, the server S may be configured to change the route even after the route is transmitted to the vehicle X or Y by the above-described route search process in response to the ever-changing traffic conditions. Transmits the route change instruction to each vehicle. Since the functions of the vehicles X and Y are the same, they are collectively described as a vehicle without distinction.
[0040]
The vehicle starts running according to the route searched by the above-described operation (step 401). Next, until the vehicle reaches the destinations A2 and B2, it is sequentially determined whether or not the vehicle has reached the destination (step 402). When it is determined that the vehicle has not reached the destination ("NO" in step 402). The process proceeds to step 403, where the current location information is transmitted to the server S at regular intervals (step 403). On the other hand, if the vehicle has arrived at the destination ("YES" in step 402), the process ends.
[0041]
On the other hand, the server S determines whether or not there is current position information transmitted from the vehicle at any time (step 411), and if there is no update of the current position information (the “NO” process of step 411), the process ends and the update is performed. If there is ("YES" processing in step 411), the process proceeds to step 412, where the route search unit 3 determines the optimum value at that time based on the current position information and the external information such as the route of another vehicle and traffic congestion information. Are calculated sequentially (step 412). If the route is changed ("YES" in step 413), the route is transmitted to the vehicle again (step 414). If the route is not changed ("NO" in step 413). ), And repeat the processing from step 411.
[0042]
Further, the vehicle side determines whether or not the route change information has been received from the server S, and if it has been received ("YES" in step 404), the route information is added to the changed route information. Is updated (step 405), and if it has not been transmitted ("NO" processing in step 404), the processing from step 402 onward is repeated. After the route is updated, the process returns to the step 402 until the destination is reached, and the above process is repeated.
[0043]
The first embodiment acting as described above has the following effects. That is, based on the current position information, the destination information, and the like transmitted from the navigation device 7 mounted on the vehicle, the server S performs route search, creation of guide route data, and route guidance for each vehicle. Since the route of Y can be specified so as not to overlap, the traffic volume can be sorted according to the road condition and the like.
[0044]
Further, as described above, in the present embodiment, it is also possible to calculate the route of the vehicle Y so as to avoid the congested road section with reference to traffic congestion information provided from outside such as VICS. . As a result, the traffic volume can be more accurately grasped, and the vehicle can be accurately sorted, so that the traffic congestion can be more efficiently alleviated.
[0045]
Further, in the present embodiment, the current position of the vehicle is transmitted to the server S at any time, and the server S always determines the optimal route based on the current position information and the route of another vehicle or external traffic information. Therefore, when a route change is required, a route change is automatically instructed. Therefore, when traffic congestion is predicted on the route at the time of departure, the route can be changed, so that the vehicle can easily avoid traffic congestion, and the same applies to a plurality of vehicles. Since the processing is performed as needed, traffic concentration is not caused as a whole, and the traffic jam can be unified.
[0046]
Here, in the present embodiment, for the sake of convenience of explanation, a description has been given of the route guidance of only two vehicles, the vehicle X and the vehicle Y, but the server is not limited to such an example, and the route guidance is not limited thereto. It goes without saying that even when the number of vehicles to be performed further increases, the route guidance is performed for each of the vehicles in the same manner as described above.
[0047]
The effect of the present embodiment becomes more remarkable as the number of vehicles performing the route guidance of the server S increases. That is, as described above, the server S of the present embodiment performs route guidance for each vehicle by receiving a route calculation from each of a plurality of vehicles and distributing a different route to each vehicle based on the overall situation. For example, in FIG. 2, when there are about 100 vehicles going from the road R to the road U, these vehicles are integrated into the roads O, P, and Q by the collective and unified route guidance of the server S. It is possible to disperse about 30 vehicles on three roads. Thereby, traffic concentration on one route can be prevented, and traffic congestion can be efficiently alleviated.
[0048]
[2. Second Embodiment]
[2-1. Configuration of Second Embodiment]
FIG. 5 shows the configuration of the second embodiment. The servers according to the first embodiment are provided in a plurality of predetermined areas, respectively. FIG. 4 illustrates the server S and the server T among them. Note that, in the internal configuration of the server, the configuration of the vehicle, and the configuration of the navigation device mounted thereon, the same reference numerals are given to the portions common to the first embodiment, and the description thereof will be omitted.
[0049]
Further, in the present embodiment, a vehicle entering an area under the control of each server is referred to as a vehicle belonging to the area, and a vehicle belonging to another area and requesting a route search from a server belonging to the other area. The completed vehicle is called a commissioned vehicle.
[0050]
As shown in FIG. 4, the server S, the server T, and each of the vehicles Z, W are connected to the Internet N via a predetermined communication device. However, the server S, the server T, and other servers (not shown) can be connected not only by the Internet N but also by any communication means such as a dedicated communication line.
[0051]
Each of the servers S and T includes, in addition to the servers of the first embodiment, a route search unit 3 including a trust management unit 31, a trust management unit 32, and an aggregation processing unit 33. Is provided. This is because, in the present embodiment, each server is provided in each area.
[0052]
That is, in the present embodiment, when the route management request is issued from the vehicle under the jurisdiction, the consignment management unit 31 includes a This is a means for entrusting a route search in a server in the other area with respect to a route in the other area. In addition, the aggregation processing unit 33 aggregates the other area route returned as a search result from the server in the other area entrusted with the above route search with the own area route calculated by the route search unit 3, and determines the destination from the current location. It is a means to make the whole route to the ground.
[0053]
The area information data storage unit 6 stores, as table data, data of a server passing halfway from the own area to the destination area. It is configured to access the area information data storage unit 6 and refer to the area information.
[0054]
The commission management unit 32 accepts, when entrusted by another server to search for a route in the own area (other area when viewed from the jurisdiction server) of the consigned vehicle, accepts this, and determines an optimal route in the own area. It is a means to search.
[0055]
Here, also in the route search unit 3 of the present embodiment, as in the case of the first embodiment, the route calculation is performed by using the road map data stored in advance in the road map data storage unit 4 as representing the network structure of the road. It is performed based on. Further, based on the route data of the other vehicle currently traveling stored in the other vehicle route data storage unit 5, the calculation is performed such that each route to the destination for each vehicle is distributed to different routes. ing.
[0056]
[2-2. Operation and effect of second embodiment]
Next, the operation of the second embodiment will be described with reference to FIGS. FIG. 6 is an image diagram showing an example of route search and route guidance according to the present embodiment, and FIG. 7 is a sequence diagram showing a process in which the server S performs route guidance for the vehicle Z. In FIG. 6, each part separated by a dotted line is a boundary line indicating the areas A to I controlled by each server in the present embodiment.
[0057]
As shown in the image diagram of FIG. 6, in the present embodiment, the server S generally transmits current position information and destination information from the navigation device 7 mounted on the vehicle Z via a communication network N such as the Internet. The route search request is received together with the route search request, and among the routes included in the route search request, a route search request for an area other than G, which is an area under the jurisdiction of the server S, is transmitted to another area within a predetermined range from the current location to the destination, that is, Here, the server is entrusted to each server that controls the area E and the like, and a route in the own area G is searched.
[0058]
The server S receives the other area route calculated by each server, and aggregates the in-area route and the other area route to calculate overall route data Z ′ for the vehicle Z to go to the destination. Then, it is returned to the vehicle Z.
[0059]
Next, the operation of the present embodiment will be specifically described with reference to the server S having the area G and the server T having the area E as an example. As shown in the sequence diagram of FIG. 7, the vehicle Z acquires the current position G1 information and the destination G2 information by the navigation device 7 mounted on the own vehicle, and sends the information together with the information to the server S from the search request unit 74c. A route search request is transmitted (step 701).
[0060]
The server S receives the current position information, the destination information, and the route search request in the route search request receiving unit 2 after the authentication of the vehicle Z, and relates to the area E, which is an area other than the area G of the server S. With respect to the route search request, the search is entrusted to the jurisdiction server T in another area within a predetermined range from the current location to the destination by the operation of the entrustment management unit 31 (step 702). Here, for convenience of explanation, a route in the area G is referred to as a route Z1, and a route in the area E is referred to as a route Z2.
[0061]
On the other hand, the server T receives a route search request from the responsible vehicle W belonging to the area E before receiving the route search commissioned by the server S (step 703), and calculates and returns route data W 'in response thereto. At the same time, the data is stored in the other vehicle route data storage of the server T (step 704), and the vehicle W starts navigation in the area E according to the route data W '(step 705).
[0062]
In such a situation, when the server T is entrusted with the route search in the area E of the entrusted vehicle Z, the server T entrusts the entrustment to the entrustment management unit, and stores the entrusted vehicle route data W of the jurisdiction vehicle W. , A route search is performed so that the received route Z2 does not overlap with the route W, and route data Z2 'related to the route Z2 is returned to the server S and stored in the other vehicle route data storage unit in the server. (Step 706).
[0063]
In the server S, the route search unit 3 searches for a route in the own area in the route search unit 3 and stores the result in the other vehicle route data storage unit 5 in the server (step 707). In this search, for example, when there are a plurality of vehicles under the jurisdiction in the own area and a plurality of route search requests are received, the calculation is performed so that the routes of the vehicles do not overlap each other or concentrate on a specific route. Also, when a route search commission for the commissioned vehicle is entrusted by the entrustment management unit 32 from another jurisdiction server such as the area D, as in the server T, the route between the entrusted vehicle and the jurisdiction vehicle W is changed. The calculation is performed so that the routes are different from each other.
[0064]
Next, the server S aggregates the route data Z2 'returned from the server T and the route data Z1' in its own area in the aggregation processing unit 33, calculates the route data Z 'based on this, and performs communication. The data is transmitted to the vehicle Z via the control unit 1 and stored in the other vehicle route data storage unit 5 in the server S (step 708). Then, the vehicle Z receives the route data Z 'in the route receiving unit, and starts navigation to the destination E2 according to the route Z via the drawing guide unit 74d and the input / output unit 75 (step 709).
[0065]
Here, the aggregation processing of the path data Z1 'and the path data Z2' in the aggregation processing unit 33 of the server S in the present embodiment will be described below. That is, as described above, the server T in the area E to which the server S has requested the route search searches the route Z2 and returns the route data Z2 ′ to the server S as shown in FIG. In this case, the end point of the route Z1 searched by the server S does not match the end point of the route Z2. Therefore, the server S calculates the route D in the area D and aggregates the three route data to calculate the route data Z ′ in order to create the route Z by connecting the two routes.
[0066]
The route calculated from the server T may be configured so that only one of the routes Z2 is transmitted to the server S as described above. However, the present embodiment is not limited to this. As indicated by a two-dot chain line in FIG. 2, a plurality of routes (here, two routes) may be calculated as candidates as long as they do not overlap with the route W. Then, in this case, the server S selects one optimal route from among the plurality of candidate routes, taking into consideration the connection with the route Z, the presence / absence of overlap with the route of another vehicle, and the like, and performs the aggregation process. Will be performed.
[0067]
By the way, in the present embodiment, for convenience of explanation, the entrusted server for the route search is limited to one of the servers T. However, in the present invention, the route from the departure point of the vehicle to the destination is in more sections. It can also be assumed that it is straddling. For example, in FIG. 4, if the departure place of the vehicle is the G area and the destination is the C area, there is a possibility that a lot of sections may be passed in order to reach the destination in the C area.
[0068]
In such a case, when a certain destination is set in the server S, the data of the server passing halfway from the own area to the destination area is provided in the area information data storage unit 6 as table data, The server S entrusts a route search to all servers in an area that may pass through based on the server S. In each of those areas, the same route search processing as that performed in the server S or the server T is performed. As a result, the server S combines the routes presented at the end points of the routes from the plurality of routes presented from each area, and performs an aggregation process of calculating the total route.
[0069]
The operation during the running of the vehicle is the same as that of the first embodiment, and will not be described. Also, in the second embodiment, similarly to the first embodiment, for example, the route of the vehicle Y is referred to by referring to traffic congestion information provided from the outside such as VICS so as to avoid a congested road section. It is also possible to calculate
[0070]
The second embodiment that operates as described above has the following effects. In other words, a server that controls the area is provided for each area, and detailed road map data for each area is stored for each server. Even when the route to the ground extends between the servers, each server can concentrate on the calculation only in the area under its control (referred to as its own area).
[0071]
Further, in the present embodiment, each server sets a route in its own area based on a route search request from a vehicle in its own area based on a route search request, and a route in the case of receiving the entrustment returned from another server. Since each vehicle related to each route is searched and calculated so as to be distributed on different routes within its own area, traffic concentration on a specific road can be prevented. Furthermore, since the server that controls the vehicle aggregates the route search data made in each area and collectively guides the route of the vehicle under the control, it is necessary to finely distribute the traffic volume according to the traffic situation for each area Will be able to
[0072]
[3. Other Embodiments]
It should be noted that the present invention is not limited to the above embodiment, and various other various embodiments can be implemented within the scope of the present invention. For example, the communication means is not limited to a mobile phone or the Internet, but it is also possible to use a satellite phone or another type of communication network.
[0073]
In the second embodiment, the area controlled by each server can be changed as appropriate, and the server does not necessarily need to be installed in the area, and may be limited to a certain range. Absent.
[0074]
【The invention's effect】
As described above, according to the present invention, instead of the driver making a route decision independently, the server centrally manages and calculates information such as the current location and the destination of each driver, and calculates the route information to each driver. , A route distribution server, a route distribution method, a route distribution program, and a route distribution system that efficiently solve traffic congestion.
[Brief description of the drawings]
FIG. 1 is a functional block diagram showing an overall configuration according to a first embodiment of the present invention.
FIG. 2 is a conceptual diagram illustrating an example of a process according to the first embodiment of the present invention.
FIG. 3 is a sequence diagram showing processing according to the first embodiment of the present invention.
FIG. 4 is a flowchart illustrating processing according to the first embodiment of the present invention.
FIG. 5 is a functional block diagram showing an overall configuration according to a second embodiment of the present invention.
FIG. 6 is a conceptual diagram illustrating an example of a process according to a second embodiment of the present invention.
FIG. 7 is a sequence diagram showing processing according to the second embodiment of the present invention.
[Explanation of symbols]
1. Communication control unit
2. Route search request receiving unit
3: Route search unit
4: Road map data storage
5 Other vehicle route data storage
6 ... Area information data storage
7 Navigation device
31 ... Consignment management department
32: Contract Management Department
33: Aggregation processing unit
71 ... Absolute position / azimuth detection unit
72: relative azimuth detecting unit
73 ... vehicle speed detection unit
74: Main processing unit
74a: Current position calculation unit
74b: Destination designation section
74c: Search request section
74d: route receiving unit
74e: Drawing guide section
75 ... input / output unit
76: Communication control unit
77… Mobile phone terminal
N: Internet
W, X, Y, Z ... vehicles

Claims (8)

In a server that distributes the optimal route to the destination to multiple vehicles,
Means for receiving a route search request including the own vehicle position and the destination from each of the vehicles,
A search unit that calculates each route to a destination for each vehicle based on the route search request and road map data prepared in advance so that each vehicle is distributed over different routes;
Means for returning the calculated data of each route to each of the vehicles,
A route distribution server comprising: A server that is provided in each predetermined area and distributes information on an optimal route to a destination to vehicles in the area,
Means for receiving a route search request including the own vehicle position and the destination from the responsible vehicle that has entered the own area;
When the route search request is received from the vehicle in the own area, the search request relating to at least a part of the route is entrusted to each server in another area within a predetermined range from the current position to the destination, and Means for receiving the other area route returned from each server as a result,
One or more routes within the own area based on a route search request from a vehicle in the own area and one or more routes when the trust is entrusted from another server, and Search means for searching for vehicles to be distributed on different routes in the own area;
By aggregating the route in the own area and the returned other area route, data of the entire route for the vehicle in the own area to travel to the destination is calculated and the requesting vehicle in the same area is calculated. Aggregate reply means to reply,
A route distribution server comprising: 3. The route distribution server according to claim 1, wherein the search unit calculates the route so as to avoid a congested road section based on traffic information provided from outside. 4. A route distribution system, wherein a plurality of servers according to claim 2 are combined. In a route distribution method for distributing an optimal route to a destination to a plurality of vehicles,
Receiving a route search request including the own vehicle position and the destination from each of the vehicles;
A step of calculating each route to a destination for each vehicle based on the route search request and the road map data prepared in advance so that each vehicle is distributed over different routes;
Returning the calculated data of each route to each of the vehicles;
A route distribution method comprising: In a predetermined area, a route distribution method for distributing information of an optimal route to a destination to vehicles in the area,
Receiving a route search request including the own vehicle position and the destination from the responsible vehicle that has entered the own area;
When the route search request is received from the vehicle in the own area, the search request relating to at least a part of the route is entrusted to each server in another area within a predetermined range from the current position to the destination, and Receiving the other area route returned from each server as a result,
One or more routes within the own area based on a route search request from a vehicle in the own area and one or more routes when the trust is entrusted from another server, and Searching for vehicles to be distributed on different routes within the own area;
By aggregating the route in the own area and the returned other area route, data of the entire route for the vehicle in the own area to travel to the destination is calculated and the requesting vehicle in the same area is calculated. Replying,
A route distribution method comprising: In a route distribution program that distributes an optimal route to a destination to a plurality of vehicles by controlling a computer,
The program is stored on the computer
A route search request including the own vehicle position and the destination is received from each of the vehicles,
Based on the route search request and the previously prepared road map data, each route to the destination for each vehicle is calculated such that each vehicle is distributed over different routes,
A route distribution program for transmitting the calculated data of each route to each of the vehicles. By controlling the computer, in each predetermined area, a route distribution program that distributes information on an optimal route to a destination to vehicles in the area,
The program is stored on the computer
Receives a route search request with own vehicle position and destination from the vehicle in charge of the own area,
When the route search request is received from the vehicle in the own area, the search request relating to at least a part of the route is entrusted to each server in another area within a predetermined range from the current position to the destination, and To the other area routes returned from each server as a result,
One or more routes within the own area based on a route search request from a vehicle in the own area and one or more routes when the trust is entrusted from another server, and Vehicles are searched to be distributed on different routes within their own area,
By aggregating the route in the own area and the returned other area route, data of the entire route for the vehicle in the own area to travel to the destination is calculated and the requesting vehicle in the same area is calculated. A route distribution program characterized by sending a reply.

Images