Logistics system, package delivery method, and program
US-2019012631-A1 · Jan 10, 2019 · US
US11100433B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11100433-B2 |
| Application number | US-201615538896-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jan 19, 2016 |
| Priority date | Jan 26, 2015 |
| Publication date | Aug 24, 2021 |
| Grant date | Aug 24, 2021 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for the optimized use of a parking area. Vehicles which are to be parked on the parking area are each assigned a parking space, the vehicles navigating to the respective assigned parking space, in particular autonomously. Furthermore, vehicles may carry out a change of the parking space in order to enable an improved use of the available parking area or a faster availability of the vehicle, whereby overall an optimized use of the parking area is achieved. Initially, an available range of the respective vehicles is ascertained, and the assignment of the respective parking space and/or a possible change of the parking space are made dependent on the available range of the individual vehicles. The available range of a vehicle is in particular described by a residual fuel amount or a charge state of the vehicle.
Opening claim text (preview).
What is claimed is: 1. A method for the optimized use of a parking area, the method comprising: assigning, via a central control unit, each of a plurality of vehicles which are to be parked on the parking area a respective parking space; navigating, based on control data of the central control unit and a parking assistance system, for each of the vehicles, autonomously to the respective assigned parking space; carrying out, via the central control unit and the parking assistance system, for each of the vehicles, a change of the parking space enable a maximum number of the vehicles being parkable in the available parking area and minimizing a pick-up duration, which is a time during which a corresponding vehicle travels from its parking position to a pick-up position; ascertaining, via the central control unit, an available range for each of the vehicles, wherein the assignment of the respective parking space and an automatic re-parking in another parking space within the parking area is carried out as a function of the available range of the individual vehicles; wherein characteristic variables of a vehicle, including at least one of a vehicle type and a vehicle geometry, and at least one of a residual fuel amount and a planned parking duration, are transmitted in advance, wherein the available range of a vehicle is newly determined at least one of prior to and after, the re-parking process by a calculation model for ascertaining at least one of a fuel consumption of the vehicle and a power consumption of a vehicle, from a starting position until reaching the destination of a re-parking process of the vehicle, wherein a number of re-parking processes is minimized with the aid of a calculation process, the calculation processing including one of Greedy, dynamic programming, or genetic programming, and wherein an optimization with boundary conditions is performed to provide that a number of re-parking processes and an overall path length to be traveled is optimized, and as a subordinate optimization variable, it is considered that a remaining range of each vehicle is sufficient to cover a previously defined remaining route. 2. The method as recited in claim 1 , wherein the available range of a vehicle is described by at least one of a residual fuel amount of the vehicle and a charge state of the vehicle. 3. The method as recited in claim 1 , wherein the calculation model is dependent on a vehicle type. 4. The method as recited in claim 1 , wherein a planned remaining parking duration of each parked vehicle is taken into consideration. 5. The method as recited in claim 1 , wherein a geometry of the parking area is taken into consideration. 6. The method as recited in claim 1 , wherein a vehicle geometry of each parked vehicle is taken into consideration. 7. A valet parking system for optimizing use of a parking area, comprising: a central control unit configured to perform the following: assigning, via the central control unit, each of a plurality of vehicles which are to be parked on the parking area a respective parking space; navigating, based on control data of the central control unit and a parking assistance system, for each of the vehicles autonomously to the respective assigned parking space; carrying out, via the central control unit and the parking assistance system, for each of the vehicles, a change of the parking space to enable a maximum number of the vehicles being parkable in the available parking area and minimizing a pick-up duration, which is a time during which a corresponding vehicle travels from its parking position to a pick-up position; ascertaining, via the central control unit, an available range for each of the vehicles, wherein the assignment of the respective parking space and an automatic re-parking in another parking space within the parking area is carried out as a function of the available range of the individual vehicles; wherein characteristic variables of a vehicle, including at least one of a vehicle type and a vehicle geometry, and at least one of a residual fuel amount and a planned parking duration, are transmitted in advance, wherein the available range of a vehicle is newly determined at least one of prior to and after, the re-parking process by a calculation model for ascertaining at least one of a fuel consumption of the vehicle and a power consumption of a vehicle, from a starting position until reaching the destination of a re-parking process of the vehicle, and wherein a number of re-parking processes is minimized with the aid of a calculation process, the calculation processing including one of Greedy, dynamic programming, or genetic programming, and wherein an optimization with boundary conditions is performed to provide that a number of re-parking processes and an overall path length to be traveled is optimized, and as a subordinate optimization variable, it is considered that a remaining range of each vehicle is sufficient to cover a previously defined remaining route. 8. The valet parking system as recited in claim 7 , further comprising: an installation for at least one of refueling a vehicle and charging a vehicle.
Automatic manoeuvring for parking · CPC title
Constructional details of charging stations · CPC title
Plug-in electric vehicles · CPC title
Energy storage systems for electromobility, e.g. batteries · CPC title
Optimisation of two dimensional placement, e.g. cutting of clothes or wood · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.