Aspects of the disclosure relate to determining parking costs in virtually partitioned parking areas. Currently, parking areas are divided, such as via painted partitioning lines, into a fixed number of parking spaces of predetermined size. Therefore, the number and size of parking spaces, as well as cost of parking in a parking area cannot be altered on demand to more efficiently accommodate a varying number of vehicles with varying sizes in the parking area. Exemplary embodiments of the disclosure address these problems, both individually and collectively.
Certain embodiments are described for determining parking costs in virtually partitioned parking areas. An exemplary embodiment includes an apparatus having at least one processor configured to virtually partitioning a portion of a parking area for a vehicle based on at least one attribute of (a) the vehicle or (b) the parking area; determine a parking cost for the virtually partitioned portion of the parking area, obtain approval for the determined parking cost, and allocate the virtually partitioned portion of the parking area to the vehicle based on the obtained approval; and a data storage unit configured to communicate with the processor and to store information on the parking cost.
Another exemplary embodiment includes an apparatus having a means for receiving at least one request for parking a vehicle in a parking area; means for means for virtually partitioning a portion of a parking area for a vehicle based on at least one attribute of (a) the vehicle or (b) the parking area; means for determining a parking cost for the virtually partitioned portion of the parking area; means for obtaining approval for the determined parking cost; and means for allocating the virtually partitioned portion of the parking area to the vehicle based on the obtained approval.
Another exemplary embodiment includes a method comprising virtually partitioning a portion of a parking area for a vehicle based on at least one attribute of (a) the vehicle or (b) the parking area; determining a parking cost for the virtually partitioned portion of the parking area; obtaining approval for the determined parking cost; and allocating the virtually partitioned portion of the parking area to the vehicle based on the obtained approval.
Aspects of the disclosure are illustrated by way of example. In the accompanying figures, like reference numbers indicate similar elements.
Examples are described herein in the context of determining parking costs in virtually partitioned parking areas. Embodiments provided in the following description are illustrative only and not intended to limit the scope of the present disclosure. Reference will now be made in detail to implementations of examples as illustrated in the accompanying drawings. The same reference indicators will be used throughout the drawings and the following description to refer to the same or like items.
In the interest of clarity, not all of the routine features of the examples described herein are shown and described. It will, of course, be appreciated that in any such actual implementation, numerous implementation-specific details may nevertheless exist in order to achieve goals such as compliance with application- and business-related constraints, and that these specific goals can vary from one implementation to another.
The term “virtual partitioning” as used throughout the specification refers to a partitioning that is not based on or relies on fixed markers defining dimensions of a partitioned portion, such as via painted partitioning lines defining a parking space in a parking lot, but rather to partitioning characterized by dimensions that can be altered on the fly based on the needs of the vehicle. The term “allocating the virtually partitioned portion” as used throughout the specification refers to assigning a virtually partitioned portion to a vehicle so as to make the allocated portion unavailable to other vehicles.
As described in greater detail below, parking spaces in parking area 20 have virtually configured perimeters. As such, parking area 20 either does not have predetermined, fixed partitioning markings (e.g. via painted partitioning lines) to define its parking spaces, or such fixed partitioning markings are not used by the implementations described in this disclosure in determining parking space(s) for vehicle(s) in parking area 20.
In an exemplary embodiment, vehicle(s) 10 are configured to communicate via communication device(s) 11, such as by wireless means 14, with communication device(s) 6 on a remote server 5, such as one residing in a data cloud 3. Remote server 5 includes processor(s) 5a and data storage unit(s) 5b. Processor(s) 5a is configured to virtually partition portion(s), such as portions 20a or 20b, of parking area 20 based at least one attribute of (a) vehicles 10a or 10b and/or (b) attributes of parking area 20. Data storage unit(s) 5b, coupled to processor(s) 5a, are configured to store information, such as attributes of vehicle 10a, or parking area 20, and virtually partitioned portion(s) such as 20a or 20b. In an exemplary embodiment, the dimensions and other pertinent attribute(s) of the vehicle(s) are obtained from database(s), such as a look-up table(s), containing information, such as the make, model, year, etc., of the vehicle(s).
In remote server 5, processor(s) 5a define virtual perimeter(s) of partitioned portion(s), such as perimeters 20a1 and 20b1 (illustrated as dashed-lines), which define portions 20a and 20b respectively, as shown in
As shown in
In an exemplary embodiment, after virtually partitioning portion(s) 20a and 20b of parking area 20 for vehicles 10a and 10b as described above, processor(s) 5a may determine parking cost(s) for virtually partitioned portion(s) of parking area 20, such as portions 20a and 20b, for each of vehicles 10a and 10b, as shown in
In an exemplary embodiment, processor(s) 5a first receive request(s) for parking vehicles 10a or 10b in parking area 20, which are at entrance 21 of parking area 20, as shown in
As shown in
Processor(s) 5a may also determine a location within parking area 20 for virtually partitioned portions 41 and 42, based on attributes of parking area 20, such as covered region(s) 25 under covering structure(s) 26 (e.g. car port), or handicap designation region(s) 27. In the exemplary embodiment shown in
Parking area 20 may further be virtually partitioned to more portion(s), such as portions 43 through 49, as shown in
Next, in block 320, processor(s) 5a determine a parking cost(s) for virtually partitioned portion(s) 41 and 42 of parking area 20. Parking cost(s) may vary based on attributes corresponding to at least one attribute of (a) vehicles 10a or 10b and/or (b) attributes of parking area 20. For example, a higher parking cost might be determined for vehicle 10b than for vehicle 10a, based on larger size of vehicle 10b which requires a correspondingly larger virtually partitioned portion 42. Likewise, attributes of parking area 20, such as covered region(s) 25 under covering structure(s) 26 (e.g. car port), may affect parking cost(s) determination. For example, a higher parking cost might be determined for a virtually partitioned portion within covered region(s) 25, such as portion 60, or in relative proximity to at least one of venues 30 or 31, such as within portion(s) 41 and 42. Other factors, such as duration of stay (e.g. based on retrieval time of vehicle 10 from parking area 20), may also be considered in varying parking cost(s).
Next, in block 330, approval(s) is obtained for determined parking cost(s) for virtually partitioned portion(s), such as portions 41, 42, and 60. In an exemplary embodiment as shown in blocks 331 and 332, entity(ies) are selected for obtaining approval(s) of determined parking cost(s), such one entity for each of vehicles 10a, 10b or 10c. For example in block 331, an entity might be selected from at least one of (a) vehicle, such as processor(s) 12a in each vehicle, (b) an occupant of vehicle, such as driver or a passenger, or (c) at least one pre-assigned entity, such as a charge account associated with vehicle or its occupant(s). Next, in block 332, request(s) are provided to the selected entity(ies) for approval(s) of determined parking cost(s). In exemplary embodiment, requests maybe provided wirelessly, such via Wifi, or cellular communication, and in various forms, such an payments application or text message notifications, and may appear graphically on a display module 15, as described in greater detail below in conjunction with
Next, in block 340, upon obtaining of approvals of determined parking costs, virtually partitioned portions 41, 42, and 60 are allocated to their respective vehicles 10a, 10b, and 10c, which may then park in their allocated portions, as shown in
In another exemplary embodiment, sensor(s) 40 may also be placed at location(s) within sensing range of parking area 20 (such as atop a covering structure 26), so provide remote server 5 with additional information, such as traffic dynamics within parking area 20, and availability of any unoccupied portion(s) in parking area 20.
In an exemplary embodiment, a user may be allowed to select a portion, such as portion 42, of substantially larger dimensions than the user's vehicle 10, so to reduce the risk of a vehicle 10 coming into adverse contact, such as being hit by opened car doors, from other vehicle(s) parked in proximity of portion 42, such as portions 44, 46 and 48. A higher parking cost (e.g. $30), may be determined based on the larger dimensions of portion 42.
In an exemplary embodiment, virtually partitioning portion(s) of parking area 20 may be also based on parking profile(s) associated with vehicle(s) 10. A parking profile may include information on parking preferences, such as covered parking, location(s) close to a venue, etc, and well as dimensions and other attributes of vehicle(s) 10 or its occupant(s).
A user, such as a driver or passenger(s) in a vehicle 10, may then select a desired portion, such as portion 41, from provided portions, such as 41-49, and 60. In an exemplary embodiment, display unit 15 is an interactive unit, such as a touch screen, by which a user can select a desired portion by touching the graphically represented area corresponding to a desired portion, such as portion 41.
Following user's selection, user is then presented by processor(s) 12a with a confirmation notification of selected portion and associated determined parking cost, and queried to either approve or deny the selection and determined parking cost, as shown in portion 15b. Upon obtaining approval of user's selection by processor(s) 12a, user is then presented, in portion 15c, with payment options, such as credit, debit or other options including crypto currencies, or a pre-assigned entity such as a corporate or personal parking charge account. Processor(s) 12a then provides, such as to remote server 5, payment or payment information for determined parking cost based on selected payment option.
According to one embodiment, each of portions 15a, 15b and 15c may occupy some or all of display unit 15 during a given time. It should also be noted that the interactive illustration in
Next, in block 620, a parking area, such as parking area 20 is selected, such as by user, from determined parking areas 20, 71 and 72. In an exemplary embodiment, a parking area may be selected based on virtually partitioning capabilities of parking area, as well as other available information such as (1) time of day, (2) average speed of getting vehicles in and out of parking area, (3) users' ranking of ease of getting in and out of that parking area (such as from a canonical database), (4) types of vehicle(s) parked (e.g. trucks, SUVs, motor-cycles, etc.), (5) anticipated duration stay of vehicle(s) parked in parking area, or (6) status offering, such as VIP, handicap, etc.
It is understood that specific order or hierarchy of steps in the processes is an illustration of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged. Further, some steps may be combined or omitted. The accompanying method claims recite various steps in a sample order. Unless otherwise specified, the order in which the steps are recited is not meant to require a particular order in which the steps must be executed.
The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects.
Operations described in the present disclosure may be controlled and/or facilitated by software, hardware, or a combination of software and hardware. Operations described in the present disclosure may be controlled and/or facilitated by software executing on various machines, such as in the above-described remote server 5, vehicle(s) 10, or an on-site server (not shown), or any combination thereof. Such operations may also be controlled and/or facilitated specifically-configured hardware, such as field-programmable gate array (FPGA) specifically configured to execute the various steps of particular method(s). For example, relevant operations can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in a combination thereof. In one example, a device may include a processor or processors. The processor may be coupled to a computer-readable medium, such as a random access memory (RAM). The processor may execute computer-executable program instructions stored in memory, such as executing one or more computer programs. Such processors may comprise a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), field programmable gate arrays (FPGAs), and/or state machines. Such processors may further comprise programmable electronic devices such as PLCs, programmable interrupt controllers (PICs), programmable logic devices (PLDs), programmable read-only memories (PROMs), electronically programmable read-only memories (EPROMs or EEPROMs), or other similar devices.
Such processors may comprise, or may be in communication with, media, for example computer-readable storage media, that may store instructions that, when executed by the processor, can cause the processor to perform the steps described herein as carried out, or assisted, by a processor. Examples of computer-readable media may include, but are not limited to, an electronic, optical, magnetic, or other storage device capable of providing a processor, such as the processor in a web server, with computer-readable instructions. Other examples of media comprise, but are not limited to, a floppy disk, CD-ROM, magnetic disk, memory chip, ROM, RAM, ASIC, configured processor, optical media, magnetic tape or other magnetic media, and/or any other medium from which a computer processor can read. The processor, and the processing, described may be in one or more structures, and may be dispersed through one or more structures. The processor may comprise code for carrying out one or more of the methods (or parts of methods) described herein.
The foregoing description has been presented only for the purpose of illustration and description and is not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Numerous modifications and adaptations thereof will be apparent to those skilled in the art without departing from the spirit and scope of the disclosure.
Reference herein to an example or implementation means that a particular feature, structure, operation, or other characteristic described in connection with the example may be included in at least one implementation of the disclosure. The disclosure is not restricted to the particular examples or implementations described as such. The appearance of the phrases “in one example,” “in an example,” “in one implementation,” or “in an implementation,” or variations of the same in various places in the specification does not necessarily refer to the same example or implementation. Any particular feature, structure, operation, or other characteristic described in this specification in relation to one example or implementation may be combined with other features, structures, operations, or other characteristics described in respect of any other example or implementation.
Use herein of the word “or” is intended to cover inclusive and exclusive OR conditions. In other words, A or B or C includes any or all of the following alternative combinations as appropriate for a particular usage: A alone; B alone; C alone; A and B only; A and C only; B and C only; and A and B and C.
This application claims the benefit of U.S. Provisional Application No. 62/381,350, filed Aug. 30, 2016, the entirety of which is hereby incorporated by reference.
Number | Date | Country | |
---|---|---|---|
62381350 | Aug 2016 | US |