METHOD FOR OPERATING AN AUTONOMOUS DRIVING VEHICLE AND AN AUTONOMOUS DRIVING VEHICLE

Abstract

A method for operating an autonomous driving vehicle waiting to pick-up a passenger at a pick-up location includes: determining a waiting time which the vehicle is required to wait for the passenger; determining a first and second route from an actual location of the vehicle to a parking spot and from there to the pick-up location; estimating parking cost based on the determined first and second routes and the waiting time; determining a third route from the actual location of the vehicle to the pick-up location by selecting a sequence of street segments from a plurality of pre-selected street segments such that a segment driving cost is minimized; estimating a driving cost for the third route based on the segment driving cost; comparing the estimated parking cost and the estimated driving cost; operating the vehicle to maneuver along the first and second routes when the estimated parking cost is lower than the estimated driving cost; and operating the vehicle to maneuver along the third route when the estimated driving cost is lower than the estimated parking cost.

Claims

1. A method for operating an autonomous driving vehicle waiting to pick-up a passenger at a predefined pick-up location, the method comprising: determining a waiting time which the vehicle is required to wait for the passenger; determining a first route from an actual location of the vehicle to a parking spot and a second route from the parking spot to the pick-up location; estimating a parking cost based on the determined first and second routes and the waiting time; determining a third route from the actual location of the vehicle to the pick-up location, wherein determining the third route includes pre-selecting a plurality of street segments leading from the actual location to the pick-up location based on the waiting time and an actual average driving speed possible in a respective street segment such that the vehicle reaches the pick-up location within the waiting time, determining a segment driving cost for each pre-selected street segment, and selecting a sequence of street segments from the plurality of pre-selected street segments such that a sum of the segment driving costs is minimized; estimating a driving cost for the third route based on the segment driving costs; comparing the estimated parking cost and the estimated driving cost; operating the vehicle to maneuver along the first and second routes when the estimated parking cost is lower than the estimated driving cost; and operating the vehicle to maneuver along the third route when the estimated driving cost is lower than the estimated parking cost.

2. The method according to claim 1, wherein determining the segment driving cost for each street segment includes estimating an operational cost for driving the vehicle in the respective street segment with the actual average driving speed possible in this street segment.

3. The method according to claim 2, wherein determining the segment driving cost for each street segment further includes multiplying the estimated operational cost for driving the vehicle in the respective street segment with the actual average driving speed possible in the respective street segment with a weighting factor.

4. The method according to claim 3, wherein the weighting factor lies within a range between 0.5 and 5.

5. The method according to claim 3, wherein the weighting factor depends on a speed limit prescribed for the respective street segment.

6. The method according to claim 5, wherein the weighting factor decreases as the speed limit prescribed for the respective street segment increases.

7. The method according to claim 1, further comprising: determining if another vehicle is present behind the autonomous driving vehicle, when the vehicle is maneuvered along the third route; and operating the autonomous driving vehicle to stop when it is determined that another vehicle is not present behind the autonomous driving vehicle.

8. The method according to claim 1, wherein the sequence of street segments from the plurality of pre-selected street segments are further selected such that one street segment is only driven once within a predetermined time limit.

9. The method according to claim 1, wherein estimating the parking cost includes summing an operating cost of the vehicle to drive the first and second routes and a parking fee due for a parking time in which the vehicle is parked.

10. The method according to claim 1, wherein estimating the driving cost includes summing the segment driving cost of the selected street segments of the third route and an amount of toll due for the third route.

11. A street vehicle configured for autonomous driving, the vehicle comprising: a control system configured to perform the method according to claim 1.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0028] For a more complete understanding of the present disclosure and advantages thereof, reference is now made to the following description taken in conjunction with the accompanying drawings. The disclosure is explained in more detail below using specific embodiments, which are specified in the schematic figures, in which:

[0029] FIG. 1 shows a schematic view of an autonomous driving vehicle according to an embodiment of the disclosure;

[0030] FIG. 2 shows a street map in which a possible route of an autonomous driving vehicle waiting for a passenger may take when being operated in accordance with a method according to an embodiment of the disclosure;

[0031] FIG. 3 shows a flow chart of a method for operating an autonomous driving vehicle waiting to pick-up a passenger at a predefined pick-up location according to an embodiment of the disclosure; and

[0032] FIG. 4 shows a flow chart of method sub-steps of the method of FIG. 3.

[0033] Unless indicated otherwise, like reference numbers or signs in the figures indicate like elements.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0034] FIG. 1 shows by way of example a block diagram of an autonomous driving vehicle 1 or autonomous vehicle, AV. The AV 1 may, for example, be a street vehicle, in particular, a passenger vehicle, such as an automobile or a bus. As shown in FIG. 1, the AV 1 may include a control system 10 and a drive and steering system, DSS, 20.

[0035] As is schematically shown in FIG. 1, the control system 10 may include a control unit 12 having a memory 14 and a processor 15 and may include a sensor system 16 having a plurality of sensors 17.

[0036] The memory 14, for example, may be realized as a non-volatile data storage medium, such as a hard drive, a solid state drive, or the like, and may store software executable by the processor 15. The processor 15 may, for example, comprise one or more CPUs, an ASIC(s), FPGA(s), or the like. Generally, the processor 15 may be configured to generate output signals based on input data, e.g. by executing software stored in the memory 14.

[0037] The sensors 17 of the sensor system 16 may include one or more of distance sensors, e.g. radar or lidar sensors, position sensors, e.g. GPS sensors and/or inertial measurement units, velocity sensors, and the like. As is schematically shown in FIG. 1, the sensors 17 of the sensor system 16 may be connected to the control unit, e.g. via a BUS-system or via a wireless connection such as Wi-Fi. In particular, environmental data and/or vehicle related data captured by the sensors 17 may be input to the control unit 12. The processor 15 may generate output signals based on the input data received from the sensors 17.

[0038] As shown by way of example in FIG. 1, the vehicle 1 may further include a communication interface 5, which may optionally be part of the control system 10. The communication interface 5 may be connected to the control unit 12, as shown in FIG. 1 and serves to send data to and/or receive data from external data sources via a data network, such as the internet. External data sources may be, for example, servers, other vehicles, and the like.

[0039] As is shown in a simplified manner by way of example in FIG. 1, the DSS 20 may include components configured for accelerating, braking, and steering the AV 1, such as a motor 21, a transmission 22, wheel brakes 23, and a steering mechanism 24. As schematically shown in FIG. 1, the DSS 20 may be connected to the control unit 12, e.g. via a wire bound connection such as a BUS-system or via a wireless connection such as Wi-Fi. Based on the data captured by the sensors 17 and/or based on the data received via the communication interface 5, the control unit 12 may generate command signals to actuate the DSS 12. Thereby, the AV 1 may be operated autonomously by the control system 10.

[0040] FIG. 3 shows a flow chart of an example of a method M for operating an AV 1 waiting to pick-up a passenger at a predefined pick-up location P. The method M may be realized by aid of the AV 1 shown in FIG. 1. For example, the memory 14 may store software executable by the processor 15 and causing the control system 10 to perform the steps M1-M10 of the method M.

[0041] When the AV 1 drops off a passenger at a drop-off location, the passenger may desire to be picked up again at a distinct time at a distinct pick-up location P, which may be identical or different from the drop-off location. In the meantime, the AV 1 may be required to wait for the passenger and has to take an appropriate action.

[0042] In the method M shown in FIG. 3, in first step M1, a waiting time, which the vehicle 1 is required to wait for the passenger, is determined. For example, a default time may be stored in the memory 14 of the control unit 12 of the AV 1 or the passenger may input a pick-up time to the control unit 12 via an input device (not shown). For example, the AV 1 may receive the pick-up time via the communication interface 5 from a smart phone or other handheld electronic device of the passenger.

[0043] In step M2, a first route from an actual location of the vehicle 1, e.g. the drop-off location, to a parking spot and a second route from the parking spot to the pick-up location is determined or calculated. For example, the first and second routes may be fastest possible or shortest possible routes to an available parking spot and from that parking spot to the pick-up location. The first and second routes may be determined on known route calculation algorithms. Optionally, a parking time may be calculated by subtracting the time required for travelling the first and second routes from the waiting time. A location of a free parking spot may, for example, be received via the communication interface from other vehicles driving around and notifying other vehicles of the free parking spaces.

[0044] In step M4, a parking cost is calculated or estimated based on the determined first and second routes and the waiting time. For example, the parking cost may be determined by summing an operating cost of the vehicle 1 to drive the first and second routes and a parking fee due for the parking time in which the vehicle 1 is parked. The parking fee may, for example, be received via the communication interface 5, for example, from a server of the parking spot provider. Operating cost of the vehicle 1 may include energy cost for propulsion of the vehicle and cost for wear of the vehicle 1. For example, a cost model may be stored in the memory 14. The cost model may define a functional relationship between average driving speed, travelling distance, and cost. Optionally, toll and other official fees for reaching the parking spot may also be taken into account in estimating the parking cost.

[0045] In step M4, a third route R3 from the actual location of the vehicle 1 to the pick-up location P is determined. One purpose of this step is to find a route along which the AV 1 may travel, with lowest possible cost, while waiting for the passenger so that it timely reaches the pick-up location P.

[0046] Step M4 may include sub-steps M41-M43 shown in FIG. 4. For example, in step M41, a plurality of street segments leading from the actual location of the AV 1 to the pick-up location P may be pre-selected based on the waiting time and an actual average driving speed possible in a respective street segment such that the AV 1 reaches the pick-up location P within the waiting time. In this step, the control unit 12 calculates or determines various possible routes the AV 1 may take while waiting, for example, based on one or more preconditions or criteria. For example, in step M41, the street segments making up the pre-selected routes, may be selected only from street segments being in a predefined radius around the pick-up location. The radius may optionally depend on the waiting time such that it increases with increasing waiting time and decreases with decreasing waiting time.

[0047] The street segments may be pre-selected in step M41 from a street map, e.g. in the form as schematically shown in FIG. 2. The street map may be stored in the memory 14 or may be received via the communication interface 5, for example.

[0048] In step M42, a segment driving cost for each pre-selected street segment is determined or calculated. Generally, determining, in step M42, the segment driving cost for each pre-selected street segment may include estimating an operational cost for driving the AV 1 in the respective road or street segment with the actual average driving speed possible in this street segment. For example, the control unit 12 may determine the cost necessary for operating the AV 1 in the pre-selected street segments, for example, based on the cost model stored in the memory 14, as described above. An actual possible average driving speed for each street segment may be received via the communication interface, e.g. from other vehicles driving in the pre-selected street segments.

[0049] Optionally, determining the segment driving cost for each street segment in step M42 may include multiplying the estimated operational cost for driving the vehicle 1 in the respective street segment with the actual average driving speed possible in this street segment with a weighting factor. For example, the control unit 12 may multiply the operational cost determined by means of the cost model with a weighting factor, which optionally lies within a range between 0.5 and 5. Thereby, the segment cost of a respective road or street segment may be increased or decreased, i.e., a weighted or fictive driving cost is calculated. For example, the weighting factor may optionally depend on a speed limit prescribed for the respective street segment. In particular, the weighting factor may decrease as the speed limit prescribed for the respective street segment increases. Thus, street segments with high speed limits, e.g. above 50 km/h, are multiplied with a small weighting factor, e.g. with a weighting factor smaller than one. Similar, street segments with low speed limits, e.g. below 30 km/h, are multiplied with a high weighting factor, e.g. with a weighting factor greater than one. Street segments with intermediate speed limits, e.g. between 30 and 50 km/h, may be multiplied with a weighting factor close to or equal to one. The speed limit may, for example, be assigned to each street segment within the street map.

[0050] Finally, in step M43, a sequence of street segments is selected from the plurality of pre-selected street segments such that a sum or total of the segment driving cost is minimized. For example, in the map 100 shown by way of example in FIG. 2, three potential third routes R3, R3′, and R3″ are shown, wherein route R3 is marked with dotted lines while routes R3′ and R3″ are marked with double dash dotted lines. The three routes R3, R3′, and R3″ have been determined in step M41 as potential third routes. In step M42, for each of the three routes R3, R3′, and R3″ the driving cost has been calculated. Finally, in step M43 the segments making up route R3 are selected as being the route with minimum total of segment driving costs. For example, route R3′ includes street segments S1 and S2 in which a very low speed limit is prescribed. Thus, these segments may account for high segment driving cost when a weighting factor is applied as described above and, consequently, are not selected. Route R3″ includes street segment S3, in which a high speed limit is prescribed and, consequently, a low weighting factor is valid. However, in street segment S3, the actual possible driving velocity may also by high, which tends to cause high operational cost, represented within the fictive or segment driving cost. Thus, segment S3 is also not selected. By contrast, route R3 includes street segments with low weighting factors and with low actual possible average driving speed, e.g. because of rail road RR crossings and a plurality of street crossings present. Thus, the street segments making up route R3 are selected in step M43.

[0051] Optionally, the sequence of street segments making up the third route R3 may be selected from the plurality of pre-selected street segments such that one street segment is only driven once within a predetermined time limit. For example, the whole route R3 may be traveled through several times. Similar, only a specific sequence of the street segments may be travelled several times. In order to avoid negative publicity and/or to avoid frequently traveling through street segments, which are often used by pedestrians, bicyclists, and the like, such street segments may only be travelled once in a predetermined time, e.g. only once in 30 minutes.

[0052] In step M5, a driving cost for the third route R3 based on the segment driving cost is calculated. For example, estimating, in step M5, the driving cost may include summing the segment driving cost of the selected street segments of the third route R3 and, optionally, an amount of toll due for the third route R3.

[0053] Further, in step M6, the estimated parking cost and the estimated driving cost are compared. For example, step M6 may comprise determining whether estimated driving cost is lower than the estimated parking cost. If the answer to this question is negative, i.e. when it is determined in step M6 that the estimated parking cost is lower than the estimated driving cost, as indicated by symbol “−” in FIG. 3, the method proceeds to step M7. In step M7, the control system 10 operates the AV 1 to maneuver along the first and second routes, that is, to proceed to a free parking spot, park itself for a parking time, and, subsequently, to proceed to the pick-up location P.

[0054] When it is determined in step M6 that the estimated driving cost is lower than the estimated parking cost, as indicated in FIG. 3 by symbol “+”, the method proceeds to step M8. In step M8, the control system 10 operates the AV 1 to maneuver along the third route R3. Should the case occur that the parking cost and the driving cost are equal to each other, the method may automatically proceed to step M7. It would also be possible to automatically proceed to step M8 instead.

[0055] When the AV 1 is operated to maneuver along the third route R3, optional method steps M9 and M10 may be carried out as schematically shown in FIG. 3. In step M9, it is determined if another vehicle is present behind the AV 1. For example, the sensor system 16 may detect other vehicles that follow the AV 1. The control unit 12 may determine from the captured sensor data presence of other vehicles. When it is determined, in step M9, that another vehicle is not present behind the AV 1, at least not within a predefined distance range, the control unit 10 may actuate the DSS 20 to stop the AV 1. Thereby, operational cost of the AV 1 is further decreased.

[0056] The disclosure has been described in detail referring to specific embodiments. However, it should be appreciated by those of ordinary skill in the art that modifications to these embodiments may be made without deviating from the principles and central ideas of the disclosure, the scope of the disclosure defined in the claims, and equivalents thereto.

REFERENCE LIST

[0057] 1 vehicle [0058] 5 communication interface [0059] 10 control system [0060] 12 control unit [0061] 14 memory [0062] 15 processor [0063] 16 sensor system [0064] 17 sensors [0065] 20 drive and steering system, DSS [0066] 21 motor [0067] 22 transmission [0068] 23 wheel brakes [0069] 24 steering mechanism [0070] M method [0071] M1-M10 method steps [0072] M41-M43 method steps [0073] P pick-up location [0074] R3 third route [0075] R3′, R3″ pre-selected routes [0076] RR rail road [0077] S1-S3 street segments