JP7489223B2 - Vehicle allocation control device, vehicle allocation control system, and vehicle allocation control method - Google Patents

Description

The present invention relates to a vehicle dispatch control device, a vehicle dispatch control system, and a vehicle dispatch control method.

There is a known invention that returns items left behind in a vehicle to a user (Patent Document 1). The invention described in Patent Document 1 identifies the user who left the item and returns it based on the location information of the user's terminal device.

JP 2002-245591 A

If the item is returned to the user who left it behind, as in the invention described in Patent Document 1, losses related to vehicle dispatch will occur. There is a need to reduce such losses related to vehicle dispatch, but there is no mention of this in Patent Document 1.

The present invention has been made in consideration of the above problems, and its purpose is to provide a vehicle dispatch control device, a vehicle dispatch control system, and a vehicle dispatch control method that can reduce losses related to vehicle dispatch.

In one embodiment of the present invention, when a vehicle dispatch control device detects an item left in a vehicle before selecting a vehicle dispatch request, the vehicle dispatch control device calculates candidate driving routes for each of a plurality of vehicle dispatch requests that include at least a drop-off location, extracts facilities for leaving the lost item within a predetermined range for each of the calculated candidate driving routes, calculates a bypass route that passes through the extracted facilities for each of the calculated candidate driving routes, calculates a loss associated with dispatching the vehicle for the candidate driving route for each calculated bypass route, sets a vehicle dispatch route from among the calculated bypass routes based on the calculated loss associated with dispatching, and selects a vehicle dispatch request that includes a drop-off location on the set vehicle route.

The present invention makes it possible to reduce losses related to vehicle dispatch.

FIG. 1 is an overall schematic diagram of a vehicle dispatch control system 10 according to an embodiment of the present invention. FIG. 2 is a functional block diagram of the computer 20, the vehicle 40, and the terminal device 60 according to the embodiment of the present invention. FIG. 3 is a diagram illustrating an example of a travel route candidate according to an embodiment of the present invention. FIG. 4 is a diagram illustrating an example of a facility according to an embodiment of the present invention. FIG. 5 is a diagram illustrating an example of a route according to an embodiment of the present invention. FIG. 6 is a flowchart illustrating an example of an operation of the vehicle dispatch control system 10 according to the embodiment of the present invention. FIG. 7 is a diagram for explaining the loss of a user 73 according to the first modification of the present invention.

Embodiments of the present invention will be described below with reference to the drawings. In the description of the drawings, identical parts are given the same reference numerals and the description will be omitted.

(Example of a vehicle dispatch control system configuration)

An example of the configuration of a vehicle dispatch control system 10 according to this embodiment will be described with reference to Figures 1 and 2. As shown in Figure 1, the vehicle dispatch control system 10 includes a computer 20, a communication network 30, a vehicle 40, users 70 to 73, and terminal devices 60 to 63 owned by the users 70 to 73.

The computer 20 (dispatch control device) communicates with the vehicles 40 and the terminal devices 60-63 via the communication network 30. The computer 20 includes a CPU (Central Processing Unit) 21, a memory 22, a communication I/F 23, and a storage device 24, and these components are electrically connected via a bus (not shown). There are no particular limitations on where the computer 20 is installed, but for example, the computer 20 is installed in the management center of the operator that operates the vehicles 40.

The CPU 21 loads various programs stored in the storage device 24 and the like into the memory 22 and executes various commands contained in the programs. The memory 22 is a storage medium such as a ROM (Read Only Memory) or a RAM (Random Access Memory). The storage device 24 is a storage medium such as a HDD (Hard Disk Drive). Note that a part (or all) of the vehicle dispatch control system 10, including the functions of the computer 20 described below, may be provided by an application (such as Software as a Service (SaaS)) located on the communication network 30. The computer 20 may also be a server.

The communication I/F 23 is implemented as hardware such as a network adapter, various communication software, or a combination of these, and is configured to realize wired or wireless communication via a communication network 30, etc.

The communication network 30 may be configured using either a wireless or wired system, or both, and may include the Internet. In this embodiment, the computer 20, the vehicle 40, and the terminal devices 60 to 63 are connected to the communication network 30 using a wireless communication system.

The vehicle 40 may be a vehicle with a driver, or may be an autonomous vehicle without a driver. In this embodiment, the vehicle 40 is described as an autonomous vehicle without a driver. The vehicle 40 is not particularly limited, but may be, for example, a taxi.

User 70 requests a vehicle using terminal device 60. A vehicle dispatch application (hereinafter simply referred to as a vehicle dispatch app) used to request a vehicle is installed on terminal device 60, and user 70 requests a vehicle using the vehicle dispatch app. Similarly, users 71 and 72 also request vehicles using terminal devices 61 and 62.

When the user 73 uses the vehicle 40, he or she leaves something behind in the vehicle 40. When the user 73 realizes that he or she has left something behind, the user 73 requests to search for the item using a dedicated application installed on the terminal device 63. Note that the application for searching for the item is not limited to a dedicated application, and may be incorporated as part of the functions of the ride-hailing app.

Next, the computer 20, the vehicle 40, and the terminal devices 60 to 63 will be described in detail with reference to FIG. 2.

The terminal device 60 includes a communication I/F 601, a vehicle dispatching app 602, and a GPS receiver 603. The communication I/F 601 has a configuration similar to that of the communication I/F 23 (see FIG. 1), and communicates with the computer 20 via the communication network 30. The terminal device 60 is, for example, a smartphone or a tablet. The terminal device 60 may also be a wearable device. Although not shown in the figure, the terminal device 60 also includes a CPU, memory, storage device, etc., like the computer 20.

The dispatch application 602 is used to request a vehicle as described above. The dispatch application 602 functions as a user interface when the user 70 requests a vehicle. The dispatch application 602 is realized by the CPU provided in the terminal device 60 reading and executing a dedicated application program from a storage device provided in the terminal device 60. When the user 70 requests a vehicle, the user 70 inputs a desired boarding location, a desired waiting time, a desired disembarking location, a desired arrival time at the disembarking location, and the like into the dispatch application 602 and requests a vehicle. The terminal device 60 transmits a dispatch request to the computer 20 according to the input of the user 70. In addition, the terminal device 60 displays various information (such as receipt of the dispatch request, estimated arrival time, and driving route) included in a signal returned from the computer 20 in response to the dispatch request on a display provided in the terminal device 60. However, the method of realizing the dispatch application 602 is not limited to this. For example, the terminal device 60 may access a server that provides the functions of the vehicle dispatch app 602, receive the functions, and display the results of the execution of the functions sent from the server on the browser.

The location information of the terminal device 60 acquired by the GPS receiver 603 is transmitted to the computer 20 at any time.

Although not shown in the figure, terminal devices 61 to 63 are also equipped with a communication I/F, a vehicle dispatching app, a GPS receiver, etc., just like terminal device 60.

2, the CPU 21 (controller) of the computer 20 includes, as examples of multiple functions, a request receiving unit 211, a position acquiring unit 212, a vehicle detecting unit 213, a lost item detecting unit 214, a driving route calculating unit 215, a facility extracting unit 216, a route via calculation unit 217, a loss calculating unit 218, and a request selecting unit 219. A map database 241 and a customer database 242 are stored in the storage device 24 of the computer 20.

Map database 241 stores map information necessary for route guidance, such as road information and facility information. Road information includes road signs indicating the number of lanes on a road, road boundaries, lane connections, speed limits, one-way streets, etc.

The customer database 242 stores account information such as the IDs of users 70 to 73, vehicle usage history, etc. The usage history includes the vehicle number, boarding date and time, boarding section, fare, etc. The ID and usage history are linked and stored.

The request receiving unit 211 receives vehicle dispatch requests from users 70-72 sent from terminal devices 60-62. The request receiving unit 211 outputs signals for performing processing according to the received vehicle dispatch requests to the position acquisition unit 212, the vehicle detection unit 213, and the driving route calculation unit 215.

The location acquisition unit 212 acquires location information of the users 70-73 from the terminal devices 60-63, and acquires location information of the vehicle 40 from the vehicle 40. The location information of the users 70-73 means the location information of the terminal devices 60-63 possessed by the users 70-73.

The vehicle detection unit 213 detects vehicles to be assigned to the users 70 to 72 based on the dispatch requests received by the request reception unit 211. Since there are three users who have made dispatch requests, three vehicles are required to fulfill all dispatch requests. In this embodiment, a case where only one vehicle exists near the boarding locations desired by the users 70 to 72 will be described. The vehicle detection unit 213 refers to the position information of the boarding locations desired by the users 70 to 72 and detects vacant vehicles running near these boarding locations. In this embodiment, the vehicle 40 will be described as the vehicle detected by the vehicle detection unit 213. Since the vehicle detection unit 213 acquires position information from the vehicle 40, it can detect the vehicle 40 by referring to the position information of the boarding locations desired by the users 70 to 72 and the position information of the vehicle 40. Note that "near the boarding locations desired by the users 70 to 72" means, for example, that the distance from the boarding locations desired by the users 70 to 72 is less than a predetermined distance.

The lost property detection unit 214 receives a signal from the user 73 indicating that the user wishes to search for a lost property, and detects the lost property. The lost property detection unit 214 identifies the vehicle in which the user 73 last rode by comparing the ID of the user 73 included in the signal indicating that the user wishes to search for a lost property with the customer database 242. After identifying the vehicle, the lost property detection unit 214 transmits a signal to the identified vehicle to detect the lost property.

The travel route calculation unit 215 refers to the map database 241 to calculate candidate travel routes from the current location of the vehicle 40 to the boarding location desired by the user. The travel route calculation unit 215 also calculates candidate travel routes from the boarding location desired by the user to the disembarking location (destination) desired by the user. The candidate travel routes calculated by the travel route calculation unit 215 are, for example, the travel routes that take the shortest time from the current location of the vehicle 40 to the boarding location desired by the user and arrive at the disembarking location desired by the user. The candidate travel routes are calculated according to the number of users who have made a ride dispatch request. In this embodiment, there are three users who have made a ride dispatch request (users 70 to 72), so three candidate travel routes are calculated.

The facility extraction unit 216 extracts facilities for leaving lost items within a specified range for each candidate driving route. The facility extraction unit 216 extracts facilities by referring to the map database 241.

The via route calculation unit 217 calculates a via route that passes through the facility for each candidate driving route. In this embodiment, there are three candidate driving routes, so three via routes are calculated.

The loss calculation unit 218 calculates the loss associated with dispatching vehicles for the candidate driving routes for each of the via routes calculated by the via route calculation unit 217.

The request selection unit 219 selects at least one dispatch request from the multiple dispatch requests based on the loss calculated by the loss calculation unit 218.

The vehicle 40 includes a communication I/F 401, a vehicle ECU (Electronic Control Unit) 402, a GPS receiver 403, a camera 404, and a controller 405. The communication I/F 401 has a configuration similar to that of the communication I/F 23 and the communication I/F 601, and communicates with the computer 20 via the communication network 30. The vehicle ECU 402 is a computer for controlling the running of the vehicle 40. The vehicle ECU 402 controls various actuators (such as a brake actuator, an accelerator actuator, and a steering actuator) based on commands from the vehicle dispatch control system 10. The position information of the vehicle 40 acquired by the GPS receiver 403 is transmitted to the computer 20 at any timing.

When the controller 405 receives a signal for detecting a lost item from the lost item detection unit 214, it uses the camera 404 to capture an image of the interior of the vehicle 40. The controller 405 analyzes the camera image using a predetermined image processing method. This analysis detects an item left behind by the user 73. The controller 405 sends a signal to the computer 20 indicating that a lost item has been detected.

Next, an example of the operation of the vehicle dispatch control system 10 according to this embodiment will be described with reference to FIG. 3.

In the scene shown in FIG. 3, users 70-72 request vehicles using terminal devices 60-62. Since three users have made vehicle dispatch requests, three vehicles are required to fulfill all of the dispatch requests. However, as described above, only one vehicle (vehicle 40) is detected near the boarding locations desired by users 70-72. A shown in FIG. 3 is the boarding location desired by user 70. B shown in FIG. 3 is the boarding location desired by user 71. C shown in FIG. 3 is the boarding location desired by user 72. Near boarding locations A, B, and C means that the distance from boarding locations A, B, and C is less than a predetermined distance.

The request receiving unit 211, which has received a dispatch request, outputs a signal to the driving route calculation unit 215 to calculate a candidate driving route. The driving route calculation unit 215, which has received a signal from the request receiving unit 211, refers to the map database 241 and calculates a candidate driving route from the current location of the vehicle 40 via the boarding location desired by the user 70 to the disembarking location. 80 shown in FIG. 3 is a candidate driving route from the current location of the vehicle 40 via the boarding location A desired by the user 70 to the disembarking location G1 (destination) desired by the user 70. Similarly, 81 shown in FIG. 3 is a candidate driving route from the current location of the vehicle 40 via the boarding location B desired by the user 71 to the disembarking location G2 (destination) desired by the user 71. Similarly, 82 shown in FIG. 3 is a candidate driving route from the current location of the vehicle 40 via the boarding location C desired by the user 72 to the disembarking location G3 (destination) desired by the user 72. Since there are three users (users 70 to 72) who have made a dispatch request, three candidate driving routes are calculated.

As described above, when the user 73 used the vehicle 40, he left something behind in the vehicle 40. After realizing that he left something behind, the user 73 requests a search for the item using a dedicated application. As a result, a signal indicating a request to search for the item (hereinafter, referred to as signal S1) is sent to the lost item detection unit 214. The signal S1 includes the ID of the user 73, the specific details of the item left behind (here, a wallet), the date and time when the vehicle was used, etc.

The lost property detection unit 214, which receives the signal S1 from the user 73, refers to the customer database 242 to identify the vehicle in which the user 73 last rode. As described above, the customer database 242 stores the user ID, vehicle number, boarding date and time, boarding section, fare, etc. The lost property detection unit 214 identifies the vehicle in which the user 73 last rode by matching the ID of the user 73 contained in the signal S1 with the customer database 242. In the example shown in FIG. 3, the vehicle 40 is the identified vehicle. The lost property detection unit 214 transmits a signal (hereinafter referred to as signal S2) to the identified vehicle 40 to detect the lost property.

When the controller 405 mounted on the vehicle 40 receives the signal S2 from the lost item detection unit 214, it uses the camera 404 to capture an image of the interior of the vehicle 40. The controller 405 analyzes the camera image using a predetermined image processing. This analysis detects the item (wallet) left behind by the user 73. The controller 405 sends a signal (hereinafter, signal S3) to the computer 20 indicating that the lost item has been detected.

When an item is left behind in a vehicle, the user 73 is in trouble, so it is conceivable to quickly return the item to the user 73, but there are cases where the user 73 is unable to retrieve the item immediately. In such cases, it is conceivable to return the item to a facility for leaving lost items. However, stopping the vehicle dispatch service to return the item to the facility would result in a loss. In order to reduce such losses, it is preferable to return the item to the facility and at the same time continue the vehicle dispatch service. Here, the computer 20 receives vehicle dispatch requests from users 70 to 72 other than the user 73 who left the item, but does not select which vehicle dispatch request to accept. In other words, in this embodiment, it is assumed that the computer 20 receives the signal S1 before selecting a vehicle dispatch request.

When selecting a vehicle dispatch request, it is necessary to reduce losses associated with dispatching a vehicle to deliver the lost item to the facility. Examples of losses associated with dispatching a vehicle include loss of time and loss of energy (gasoline, hydrogen, electricity, etc.). Note that energy loss may also be expressed as loss of distance. Hereinafter, losses associated with dispatching a vehicle may be simply referred to as loss.

In order to reduce losses related to vehicle dispatch, the following process is performed. First, the facility extraction unit 216 extracts facilities for leaving lost items within a predetermined range for each candidate driving route. Specifically, as shown in FIG. 4, the facility extraction unit 216 refers to the map database 241 to extract facilities for leaving lost items within a predetermined range 90 based on the candidate driving route 80. Similarly, the facility extraction unit 216 extracts facilities for leaving lost items within a predetermined range 91 based on the candidate driving route 81. Similarly, the facility extraction unit 216 extracts facilities for leaving lost items within a predetermined range 92 based on the candidate driving route 82. The facilities 93 to 95 are, for example, convenience stores and police stations. Note that the facilities extracted by the facility extraction unit 216 are, for example, places that the user 73 can go to on foot, but are not limited to this. The extracted facilities may be places that the user 73 can go to by bicycle, or may be places that the user 73 can go to by vehicle.

The predetermined range 90 based on the driving route candidate 80 is set as a range of a predetermined distance from the driving route candidate 80, as one example. Alternatively, the predetermined range 90 based on the driving route candidate 80 may be set as a range that includes facilities that can be reached within a predetermined time based on the driving route candidate 80. The predetermined time is, for example, 10 minutes. However, this time can be changed as appropriate.

The predetermined range 90 based on the travel route candidate 80 may be set as a range in which the travel route candidate can be changed so as to arrive in time for the desired arrival time at the drop-off point G1 desired by the user 70. As described above, the dispatch request includes the desired arrival time of the user 70. Even if the travel route candidate is changed, if the drop-off point G1 is reached within the desired arrival time, it is considered that the change of the travel route candidate is not disadvantageous to the user 70. Therefore, the predetermined range 90 may be set as a range in which the user 70 can arrive at the drop-off point G1 within the desired arrival time, even if the travel route candidate is changed within that range. The predetermined ranges 91 and 92 are similar to the predetermined range 90.

The via route calculation unit 217, which has received a signal indicating that a facility has been extracted by the facility extraction unit 216, calculates a via route that passes through the facility for each travel route candidate. Specifically, as shown in FIG. 5, the via route calculation unit 217 calculates a via route 83 that passes through the facility 93 for the travel route candidate 80. The via route 83 is a route that passes through the facility 93 from the current location of the vehicle 40, then passes through the boarding location A, and arrives at the disembarking location G1. Similarly, the via route calculation unit 217 calculates a via route 84 that passes through the facility 94 for the travel route candidate 81. The via route 84 is a route that passes through the facility 94 from the current location of the vehicle 40, then passes through the boarding location B, and arrives at the disembarking location G2. Similarly, the via route calculation unit 217 calculates a via route 85 that passes through the facility 95 for the travel route candidate 82. The via route 85 is a route that passes through the facility 95 from the current location of the vehicle 40, then passes through the boarding location C, and arrives at the disembarking location G3.

Although facility 93 has been described as a facility where vehicle 40 leaves lost items before letting user 70 board, the present invention is not limited to this. Facility 93 may also be a facility where vehicle 40 leaves lost items after letting user 70 board. The same applies to facilities 94 and 95.

Whether the route is via 83, 84, or 85, the vehicle 40 can leave the user 73's lost property and can arrive at the drop-off point G1, G2, or G3 within the desired arrival time of the user 70, 71, or 72. However, the loss associated with dispatching the vehicle differs depending on the route via 83, 84, or 85.

The loss calculation unit 218, which has received a signal indicating that a via route has been calculated by the via route calculation unit 217, calculates the loss associated with dispatching a vehicle for each via route along the candidate driving route. Specifically, the loss calculation unit 218 calculates the loss for the candidate driving route 80 when the vehicle 40 drives along the via route 83, the loss for the candidate driving route 81 when the vehicle 40 drives along the via route 84, and the loss for the candidate driving route 82 when the vehicle 40 drives along the via route 85. Time or distance is used as an example of the loss calculation.

The loss formulas using time are expressed by the following formulas (1) to (3). Formula (1) shows the time loss for a travel route candidate 80 when the vehicle 40 travels along a via route 83, formula (2) shows the time loss for a travel route candidate 81 when the vehicle 40 travels along a via route 84, and formula (3) shows the time loss for a travel route candidate 82 when the vehicle 40 travels along a via route 85.
(T1-T1') x α (1)
(T2-T2') x α (2)
(T3-T3') x α (3)

T1 is the time required for the vehicle 40 to arrive at the drop-off point G1 when traveling along the travel route candidate 80. T1' is the time required for the vehicle 40 to arrive at the drop-off point G1 when traveling along the via route 83 that passes through the facility 93. Similarly, T2 is the time required for the vehicle 40 to arrive at the drop-off point G2 when traveling along the travel route candidate 81. T2' is the time required for the vehicle 40 to arrive at the drop-off point G2 when traveling along the via route 84 that passes through the facility 94. Similarly, T3 is the time required for the vehicle 40 to arrive at the drop-off point G3 when traveling along the travel route candidate 82. T3' is the time required for the vehicle 40 to arrive at the drop-off point G3 when traveling along the via route 85 that passes through the facility 95. α is a weight for time, and an arbitrary value is set. If the travel time when traveling along the via route is longer than that of the travel route candidate, the loss is large.

The loss calculation unit 218 uses formulas (1) to (3) to calculate the time loss for each of the via routes for the candidate travel route. The request selection unit 219 sets the via route with the smallest time loss calculated by the loss calculation unit 218 as the travel route that the vehicle 40 will actually travel. Here, it is assumed that the route with the smallest time loss among the via routes 83, 84, and 85 is the via route 83. In this case, the request selection unit 219 changes the travel route that the vehicle 40 will actually travel from the candidate travel route 80 to the via route 83. Since the drop-off point G1 on the via route 83 is included in the vehicle dispatch request of the user 70, the request selection unit 219 selects the vehicle dispatch request of the user 70.

The request selection unit 219 then sends a command to the vehicle 40 to travel along the via route 83. Upon receiving the command, the vehicle 40 stops at the facility 93 to leave the user 71's belongings before picking up the user 70. This allows the user 73 to retrieve the belongings at the facility 93. In addition, compared to the case where the vehicle 40 heads to the user 73's current location D, the loss associated with dispatching is reduced. In addition, for the user 70, the change in the candidate driving route 80 to the via route 83 means that the arrival time at the drop-off location G1 will be slightly delayed, but since the arrival time at the drop-off location G1 is within the user 70's desired arrival time, there is no disadvantage.

When the request selection unit 219 selects a dispatch request from the user 70, it notifies the terminal device 60 that the dispatch request from the user 70 has been accepted, the estimated arrival times at the boarding point A and the disembarking point G1, the driving route (via route 83), and the like. In addition, before the vehicle 40 arrives at the facility 93, the computer 20 notifies the terminal device installed at the facility 93 of the time the vehicle 40 will arrive. This allows employees working at the facility 93 to know when the lost item will be delivered. In addition, the computer 20 notifies the user 73 of the name of the facility 93, the location information of the facility 93, the time the lost item was left at the facility 93, and the like. The user 73 who receives this notification on the terminal device 63 can retrieve the lost item at the facility 93.

The loss formulas using distance are expressed by the following formulas (4) to (6). Formula (4) shows the distance loss for the travel route candidate 80 when the vehicle 40 travels along the via route 83, formula (5) shows the distance loss for the travel route candidate 81 when the vehicle 40 travels along the via route 84, and formula (6) shows the distance loss for the travel route candidate 82 when the vehicle 40 travels along the via route 85.
(D1-D1') x β (4)
(D2-D2') x β (5)
(D3-D3') x β (6)

D1 is the distance required to arrive at the drop-off point G1 when the vehicle 40 travels along the travel route candidate 80. D1' is the distance required to arrive at the drop-off point G1 when the vehicle 40 travels along the via route 83 that passes through the facility 93. Similarly, D2 is the distance required to arrive at the drop-off point G2 when the vehicle 40 travels along the travel route candidate 81. D2' is the distance required to arrive at the drop-off point G2 when the vehicle 40 travels along the via route 84 that passes through the facility 94. Similarly, D3 is the distance required to arrive at the drop-off point G3 when the vehicle 40 travels along the travel route candidate 82. D3' is the distance required to arrive at the drop-off point G3 when the vehicle 40 travels along the via route 85 that passes through the facility 95. β is a weight for distance, and an arbitrary value is set. If the travel distance when traveling along the via route is longer than that of the travel route candidate, the loss is large.

The loss calculation unit 218 uses equations (4) to (6) to calculate the distance loss for each via route with respect to the candidate travel route. The request selection unit 219 sets the via route with the smallest distance loss calculated by the loss calculation unit 218 as the travel route that the vehicle 40 will actually travel. Here, it is assumed that the route with the smallest distance loss among the via routes 83, 84, and 85 is the via route 83. In this case, the request selection unit 219 changes the travel route that the vehicle 40 will actually travel from the via route candidate 80 to the via route 83. Since the drop-off point G1 on the via route 83 is included in the vehicle dispatch request of the user 70, the request selection unit 219 selects the vehicle dispatch request of the user 70.

In the above description, the loss of time and the loss of distance are described separately, but this is not limiting. The loss calculation unit 218 may calculate the total loss of time and distance using both the time and the distance. The loss formula when using both the time and the distance is expressed by the following formulas (7) to (9). Formula (7) shows the total loss of time and distance for the travel route candidate 80 when the vehicle 40 travels along the via route 83, formula (8) shows the total loss of time and distance for the travel route candidate 81 when the vehicle 40 travels along the via route 84, and formula (9) shows the total loss of time and distance for the travel route candidate 82 when the vehicle 40 travels along the via route 85.
(T1-T1') x α + (D1-D1') x β ... (7)
(T2-T2') x α + (D2-D2') x β ... (8)
(T3-T3') x α + (D3-D3') x β ... (9)

The request selection unit 219 may set the route that has the smallest total loss in terms of time and distance calculated by the loss calculation unit 218 as the actual travel route for the vehicle 40.

Note that in the examples shown in Figures 3 to 5, a case has been described in which an item is detected as left behind in the vehicle, but this does not necessarily mean that an item will be detected as left behind. This is because the location where the user 73 left the item is not necessarily the vehicle 40. If no item is detected as left behind, the controller 405 sends a signal to the computer 20 indicating that no item has been left behind.

Next, an example of the operation of the vehicle dispatch control system 10 will be described with reference to the flowchart in FIG. 6.

In step S101, the request receiving unit 211 receives a vehicle dispatch request from a user 70 to 72 input to a terminal device 60 to 62. Having received the vehicle dispatch request, the request receiving unit 211 outputs a signal for calculating a candidate driving route to the driving route calculation unit 215.

The process proceeds to step S103, where the driving route calculation unit 215, having received a signal from the request receiving unit 211, refers to the map database 241 and calculates potential driving routes 80-82 from the current location of the vehicle 40 to the desired boarding locations A-C of the users 70-72 and arrive at the disembarking locations G1-G3 (see FIG. 3).

If the lost property detection unit 214 receives a signal (signal S1) from the user 73 indicating that the user wishes to search for a lost property before the request selection unit 219 selects a vehicle dispatch request (YES in step S105), processing proceeds to step S107.

In step S107, the lost property detection unit 214 receives the signal S1 from the user 73 and refers to the customer database 242 to identify the vehicle (vehicle 40) in which the user 73 last rode. The lost property detection unit 214 transmits a signal (signal S2) to the identified vehicle 40 to detect a lost property. The controller 405 receives the signal S2 and uses the camera 404 to capture an image of the interior of the vehicle 40. The controller 405 analyzes the camera image using a predetermined image processing method to detect a lost property. If a lost property is detected (YES in step S107), the controller 405 transmits a signal (signal S3) to the computer 20 indicating that a lost property has been detected. On the other hand, if a lost property is not detected (NO in step S107), the controller 405 transmits a signal to the computer 20 indicating that no property has been left behind.

In step S109, the computer 20 notifies the user 71 that no items have been left behind in the vehicle 40.

In step S111, the facility extraction unit 216 extracts facilities for leaving lost items that are within a predetermined range for each candidate driving route. The extracted facilities are facilities 93 to 95 (see Figure 4).

The process proceeds to step S113, where the via route calculation unit 217, having received a signal indicating that a facility has been extracted by the facility extraction unit 216, calculates a via route that passes through the facility for each candidate driving route. The calculated via routes are via routes 83 to 85 (see FIG. 5).

The process proceeds to step S115, where the loss calculation unit 218, having received a signal indicating that the via route calculation unit 217 has calculated the via route, calculates the loss associated with dispatching the vehicle for the candidate driving route for each via route.

The process proceeds to step S117, where the request selection unit 219 sets the route with the smallest loss calculated by the loss calculation unit 218 (here, route 83) as the route along which the vehicle 40 will actually travel.

The process proceeds to step S119, where the request selection unit 219 selects the vehicle dispatch request from the user 70 because the drop-off point G1 on the route 83 is included in the vehicle dispatch request from the user 70. The request selection unit 219 then transmits a command to the vehicle 40 to travel along the route 83.

The process proceeds to step S121, where the computer 20 notifies the terminal device installed in the facility 93 of the time when the vehicle 40 will arrive.

The process proceeds to step S123, where the computer 20 notifies the user 73 of the name of the facility 93, the location information of the facility 93, the time to return the lost item to the facility 93, etc.

(Action and Effect)
As described above, according to this embodiment, the following advantageous effects can be obtained.

When the computer 20 detects an item left in the vehicle before selecting a dispatch request, the computer 20 calculates a driving route candidate (driving route candidate 80-82) for each of the multiple dispatch requests that includes at least a drop-off location. The computer 20 extracts facilities (facilities 93-95) within a predetermined range for each calculated driving route candidate where lost items can be left. The computer 20 calculates a via route (via route 83-85) that passes through the extracted facilities for each calculated driving route candidate. The computer 20 calculates a loss related to vehicle dispatch for the driving route candidate for each calculated via route. The computer 20 sets a driving route along which the vehicle 40 will actually travel from among the calculated via routes based on the calculated loss related to vehicle dispatch. The computer 20 selects a dispatch request that includes a drop-off location on the set driving route.

When multiple route options are calculated, the computer 20 sets the route option that has the smallest loss associated with vehicle dispatch as the travel route.

Assuming that the vehicle dispatch request of user 70 is selected, computer 20 sends a command to vehicle 40 to travel along route 83. Upon receiving the command, vehicle 40 stops at facility 93 to deposit the user 71's forgotten property before picking up user 70. This allows user 73 to retrieve the lost property at facility 93. Furthermore, losses related to dispatch are reduced compared to when vehicle 40 heads to user 73's current location D.

One example of a loss related to vehicle dispatch is the loss in time or distance it takes to arrive at the drop-off point for a candidate driving route when vehicle 40 travels along a bypass route. By setting the bypass route with the smallest loss in time or distance as the driving route that vehicle 40 actually travels, the loss related to vehicle dispatch is reduced.

The specified range 90 is set as a range within a specified distance from the proposed driving route 80, or as a range that includes facilities that can be reached within a specified time based on the proposed driving route 80. Since facilities are extracted within the range set in this way, it is possible to extract appropriate facilities.

The dispatch request includes the desired arrival time at the drop-off point G1-G3 desired by the user 70-72 who made the dispatch request. The predetermined range 90-92 (see FIG. 4) is set as a range within which the candidate driving routes 80-82 can be changed so as to arrive in time for the desired arrival time. The via routes 83-85 are calculated within the range set in this way. Assuming that the dispatch request of the user 70 is selected, the change of the candidate driving route 80 to the via route 83 means that the arrival time at the drop-off point G1 will be slightly delayed for the user 70, but since the arrival time at the drop-off point G1 is within the desired arrival time of the user 70, there is no disadvantage to the user 70.

When a vehicle dispatch request is selected, computer 20 transmits information including at least the set driving route to the terminal device held by the user who made the vehicle dispatch request. Assuming that user 70's vehicle dispatch request is selected, user 70 can know that his or her vehicle dispatch request has been accepted. Information including the driving route may also include the estimated arrival times at boarding point A and disembarking point G1.

When the computer 20 receives a signal from the terminal device 63 carried by the user 73 who left something behind, indicating a desire to search for the lost item, the computer 20 transmits a signal to the vehicle 40 to detect the lost item. This enables the computer 20 to detect the lost item inside the vehicle.

The computer 20 transmits the location information of the facilities on the set driving route and the time when the vehicle 40 will arrive at the facility to the terminal device 63 carried by the user 73 who left the item behind. This allows the user 73 to know that the item will be delivered to the facility 93, and allows the user 73 to pick up the item at the facility 93.

The computer 20 transmits the time when the vehicle 40 will arrive to a terminal device installed at a facility along the set driving route. This allows employees working at the facility 93 to know when the lost item will be delivered.

(Variation 1)
Next, a first modified example of the present embodiment will be described. The loss related to the dispatch of a vehicle is described as including a loss of time and a loss of distance, but is not limited thereto. The loss related to the dispatch of a vehicle may include a loss caused by the user 73 who left something behind.

The loss of user 73 is the distance from user 73's current location to the facility. The farther the distance from user 73's current location to the facility, the greater the loss of user 73. This is because it takes more time to retrieve the lost property.

With reference to FIG. 7, an example of the operation of the vehicle dispatch control system 10 relating to the first modified example will be described.

Distance L1 shown in FIG. 7 is the distance from the current location D of user 73 to facility 93. Distance L2 shown in FIG. 7 is the distance from the current location D of user 73 to facility 94. Distance L3 shown in FIG. 7 is the distance from the current location D of user 73 to facility 95. For user 73, the shorter the distance to the facility, the lower the cost required to retrieve the lost property. Therefore, for user 73, the shorter the distance to the facility, the more convenient it is. Therefore, the loss calculation unit 218 acquires the location information of user 73 and the location information of facilities 93 to 95, and calculates distances L1 to L3 from the current location D of user 73 to facilities 93 to 95. In FIG. 7, the shortest distance among distances L1 to L3 is L2. The loss calculation unit 218 determines that the distance with the smallest loss for user 73 is L2. The request selection unit 219, which receives the result of the determination by the loss calculation unit 218, sets the route 84 passing through the facility 94 located at a distance L2 from the current location D of the user 73 as the actual travel route for the vehicle 40.

The request selection unit 219 then sends a command to the vehicle 40 to travel along the route 84. This allows the user 73 to retrieve the lost property at the most convenient facility 94.

(Variation 2)
Next, a second modified example of the present embodiment will be described. The loss related to vehicle dispatch may include the total loss of time, distance, and the loss caused by the user 73 who left something behind.

The loss calculation unit 218 calculates the total loss of time and distance for the candidate driving route 80 when the vehicle 40 travels along the via route 83, and the loss of the user 73. Similarly, the loss calculation unit 218 calculates the total loss of time and distance for the candidate driving route 81 when the vehicle 40 travels along the via route 84, and the loss of the user 73. Similarly, the loss calculation unit 218 calculates the total loss of time and distance for the candidate driving route 82 when the vehicle 40 travels along the via route 85, and the loss of the user 73.

The loss formulas are expressed by the following formulas (10) to (12). Formula (10) shows the total loss of time and distance for the travel route candidate 80 when the vehicle 40 travels along the via route 83, and the loss of the user 73. Formula (11) shows the total loss of time and distance for the travel route candidate 81 when the vehicle 40 travels along the via route 84, and the loss of the user 73. Formula (12) shows the total loss of time and distance for the travel route candidate 82 when the vehicle 40 travels along the via route 85, and the loss of the user 73.
(T-T1) x α + (D-D1) x β + L1 x γ ... (10)
(T-T2) x α + (D-D2) x β + L2 x γ ... (11)
(T-T3) x α + (D-D3) x β + L3 x γ ... (12)

γ is a weight for the distance from the current location D of the user 73 to the facility, and is set to an arbitrary value. Which of the formulas (10) to (12) is the smallest depends on the settings of α, β, and γ. When placing emphasis on the loss of the vehicle 40, α and β can be set large and γ can be set small (for example, α = 1, β = 1, γ = 0). On the other hand, when placing emphasis on the loss of the user 73, α and β can be set small and γ can be set large (for example, α = 0, β = 0, γ = 1). When placing emphasis on the loss of the vehicle 40, the loss of the operator who operates the vehicle is reduced. On the other hand, when placing emphasis on the loss of the user 73, the user 73 can retrieve the lost property in a shorter time, improving the convenience of the user 73. In any case, the loss related to the dispatch is reduced.

(Variation 3)
Next, a third modified example of the present embodiment will be described. The loss related to vehicle dispatch may include the idle time of the vehicle 40.

The empty vehicle time is the time from when a user gets off until the next user gets on. The shorter the empty vehicle time, the smaller the loss of the vehicle. The loss calculation unit 218 calculates the length of the empty vehicle time for the candidate driving route 80 when driving along the via route 83, the length of the empty vehicle time for the candidate driving route 81 when driving along the via route 84, and the length of the empty vehicle time for the candidate driving route 82 when driving along the via route 85. The length of the empty vehicle time for the candidate driving route 80 when driving along the via route 83 is 15 minutes minus 10 minutes, which is 5 minutes, assuming that the empty vehicle time when driving along the candidate driving route 80 is 10 minutes and the empty vehicle time when driving along the via route 83 is 15 minutes.

The request selection unit 219 may set the route that has the shortest length of each empty time calculated by the loss calculation unit 218 as the actual travel route for the vehicle 40. This reduces losses related to vehicle dispatch.

Each of the functions described in the above embodiments may be implemented by one or more processing circuits. Processing circuits include programmed processing devices, such as processors that include electrical circuitry. Processing circuits also include devices, such as application specific integrated circuits (ASICs) or circuit components, arranged to perform the described functions.

As described above, an embodiment of the present invention has been described, but the descriptions and drawings that form part of this disclosure should not be understood as limiting this invention. Various alternative embodiments, examples, and operating techniques will become apparent to those skilled in the art from this disclosure.

In the above embodiment, one dispatch request is selected, but the number of dispatch requests that can be selected is not limited to one. For example, in the example shown in FIG. 3, if users 70 and 71 permit carpooling, it is possible to select (accept) two dispatch requests in total, the dispatch request of user 70 and the dispatch request of user 71.

In the above embodiment, it is assumed that the signal S1 is received before the computer 20 selects the dispatch request. However, the timing of receiving the dispatch request may be before or after the signal S1 is received.

There are cases where a user 73 who has left something behind wishes to retrieve the item quickly. To meet this request, a function for quickly retrieving the lost item may be implemented in a dedicated application. When the user 73 uses this function to request that the lost item be retrieved quickly, the computer 20 may calculate a route that passes through the facility that can be reached most quickly from the current location of the vehicle 40. The computer 20 may then set this route as the actual driving route for the vehicle 40.

In addition, the user 73 may wish to specify an area for receiving lost property. To meet this requirement, a function for specifying an area for receiving lost property may be implemented in a dedicated application. When the user 73 uses this function to specify an area for receiving lost property, the computer 20 may calculate a route that passes through the facility closest to the specified area from the current location of the vehicle 40.

In addition, the user 73 may wish to specify a time to pick up a lost item. To meet this requirement, a function for specifying a time to pick up a lost item may be implemented in a dedicated application. When the user 73 uses this function to specify a time to pick up a lost item, the computer 20 may calculate a route that passes through the facility at the specified time. The computer 20 may then set this route as the actual driving route for the vehicle 40. However, this route needs to be one that allows the user who made the dispatch request to arrive in time for the desired drop-off location.

10 Vehicle dispatch control system 20 Computer 211 Request receiving unit 212 Position acquisition unit 213 Vehicle detection unit 214 Lost item detection unit 215 Travel route calculation unit 216 Facility extraction unit 217 Route via calculation unit 218 Loss calculation unit 219 Request selection unit

Claims (14)

A vehicle dispatch control device including a controller that receives a plurality of vehicle dispatch requests and selects at least one of the vehicle dispatch requests,
The controller:
When an item left behind in the vehicle is detected before the vehicle dispatch request is selected, a driving route candidate is calculated for each of the plurality of vehicle dispatch requests including at least a drop-off location;
extracting facilities for depositing the lost property within a predetermined range for each of the calculated travel route candidates;
Calculating a route via the extracted facility for each of the calculated travel route candidates;
Calculating a loss associated with dispatching a vehicle for the travel route candidate for each of the calculated via routes;
setting a driving route from among the calculated via routes based on the calculated loss related to the vehicle dispatch;
A vehicle dispatch control device that selects a vehicle dispatch request that includes a drop-off location on the set travel route. The vehicle dispatch control device according to claim 1 , wherein, when a plurality of route routes are calculated, the controller sets the route route that has the smallest loss related to the vehicle dispatch as the travel route. The vehicle dispatch control device according to claim 2 , wherein the loss related to the dispatch is a loss related to a time or a distance required for the vehicle to arrive at the drop-off location for the candidate driving route when the vehicle travels along the intermediate route. The vehicle dispatch control device according to claim 2 , wherein the loss relating to the vehicle dispatch is a loss relating to a distance from a current location of the user who left the item to the facility. The vehicle dispatch control device according to claim 2, characterized in that the loss related to the dispatch is the sum of a loss related to the time and distance required for the vehicle to arrive at the drop-off point for the candidate driving route when the vehicle travels along the intermediate route, and a loss related to the distance from the current location of the user who left the item to the facility. The dispatch request includes a boarding location where the user who made the dispatch request is to be boarded,
The vehicle dispatch control device according to claim 2, characterized in that the loss related to the dispatch is a loss related to an empty vehicle time until the vehicle arrives at the boarding point for the candidate driving route when the vehicle travels along the via route. The vehicle dispatch control device according to any one of claims 1 to 6, characterized in that the specified range is a range of a specified distance from the candidate driving route, or a range including facilities that can be reached within a specified time based on the candidate driving route. The dispatch request includes a desired arrival time at a drop-off location desired by the user who made the dispatch request,
7. The vehicle dispatch control device according to claim 1, wherein the predetermined range is a range within which the travel route candidate can be changed so as to arrive in time for the desired arrival time. The vehicle dispatch control device according to any one of claims 1 to 8, characterized in that, when the vehicle dispatch request is selected, the controller transmits at least the set driving route to a terminal device carried by the user. The vehicle dispatch control device according to any one of claims 1 to 9, characterized in that when the controller receives a signal from a terminal device carried by the user who left the item requesting a search for the lost item, it sends a signal to the vehicle to detect the lost item. The vehicle dispatch control device according to any one of claims 1 to 10, characterized in that the controller transmits location information of facilities on the set driving route and the time when the vehicle will arrive at the facility to a terminal device carried by the user who left the item. The vehicle dispatch control device according to any one of claims 1 to 11, characterized in that the controller transmits the time at which the vehicle will arrive to a terminal device installed at a facility along the set travel route. A vehicle dispatch control system including: a vehicle; and a dispatch control device capable of communicating with the vehicle, receiving a plurality of dispatch requests, and selecting at least one of the dispatch requests,
The vehicle dispatch control device includes:
When an item left behind in the vehicle is detected before the vehicle dispatch request is selected, a driving route candidate is calculated for each of the plurality of vehicle dispatch requests including at least a drop-off location;
extracting facilities for depositing the lost property within a predetermined range for each of the calculated travel route candidates;
Calculating a route via the extracted facility for each of the calculated travel route candidates;
Calculating a loss associated with dispatching a vehicle for the travel route candidate for each of the calculated via routes;
setting a driving route from among the calculated via routes based on the calculated loss related to the vehicle dispatch;
A vehicle dispatch control system comprising: a vehicle dispatch request that includes a drop-off location on the set travel route; A vehicle dispatch control method for selecting at least one vehicle dispatch request from a plurality of vehicle dispatch requests by a controller ,
The controller:
When an item left behind in the vehicle is detected before the vehicle dispatch request is selected, a driving route candidate is calculated for each of the plurality of vehicle dispatch requests including at least a drop-off location;
extracting facilities for depositing the lost property within a predetermined range for each of the calculated travel route candidates;
Calculating a route via the extracted facility for each of the calculated travel route candidates;
Calculating a loss associated with dispatching a vehicle for the travel route candidate for each of the calculated via routes;
setting a driving route from among the calculated via routes based on the calculated loss related to the vehicle dispatch;
A vehicle dispatch control method comprising the steps of: selecting a vehicle dispatch request including a drop-off location on the set travel route;

Images