DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for facilitating the explanation of the present invention, and have no specific meaning in itself. Thus, "module", "component" or "unit" may be used mixedly.
The parking navigation method based on the block chain is applied to the vehicle-mounted terminal.
The vehicle-mounted terminal in the embodiment of the invention can be a special navigation device, and can also be a mobile terminal such as a mobile phone, a tablet computer, a palm computer, a navigation device, a wearable device, an intelligent bracelet and the like.
As shown in fig. 1, the present invention provides a parking navigation system based on a block chain, which includes:
the vehicle-mounted terminal is used for acquiring a driving path and navigation information of a vehicle;
and the dispatching server is used for providing navigation information for the vehicles entering the parking lot.
In the embodiment of the invention, the vehicle-mounted terminal may include a first processor (e.g., a CPU), a communication bus, a user interface, a network interface, and a memory. The communication bus is used for realizing connection communication among the components; the user interface may include a Display screen (Display), an input unit such as a Keyboard (Keyboard); the network interface optionally may include a standard wired interface, a wireless interface (e.g., WI-FI interface); the memory may be a high-speed RAM memory, or may be a non-volatile memory (e.g., a disk memory), and the memory may optionally be a storage device independent of the processor.
Those skilled in the art will appreciate that the above hardware configuration does not constitute a limitation of the in-vehicle terminal, and may include more or less components than those illustrated, or some components may be combined, or a different arrangement of components.
Wherein the memory, which is a computer readable storage medium, includes a parking guidance program, and the first processor may be configured to call the parking guidance program stored in the memory and perform the following operations:
all vehicles entering the parking lot store the data of the driving paths of the vehicles in the parking lot into the block head;
extracting data in block heads of block chains constructed by the relevant information of all vehicles to form a parking space map of the whole parking lot;
and transmitting the information of the vehicle bitmap to a dispatching server of a parking lot.
In the embodiment of the present invention, all the in-vehicle terminals store the parking guidance program. All vehicles entering the parking lot area act as a node.
The parking space map refers to coordinate information of all parking spaces in a parking lot in a certain plane, and if the parking lot includes a plurality of layers of parking planes, the parking space map should further include three-dimensional coordinate information of the whole parking lot, wherein the three-dimensional coordinate information may include the number of layers of the parking spaces and coordinate information of the parking spaces in the current plane.
In the embodiment of the invention, when the complete parking space map of the parking lot is obtained, all the vehicle-mounted terminals adopt a public chain architecture form, and all the vehicle-mounted terminals are used as peer nodes. And after the complete parking space map is acquired, the acquired complete parking space map is sent to a scheduling server. And then, the dispatching server acquires real-time information of all vehicles entering the parking lot in real time, and at the moment, the vehicles in the parking lot and the dispatching server are constructed into a private chain architecture form.
If a certain parking space has no vehicle to stop, the position information of the parking space does not exist, and the parking space cannot be displayed on the parking space map.
Or, in the parking lot, a certain parking stall does not belong to public parking stall, belongs to private parking stall, and this parking stall does not allow other users to stop, then just can not show this parking stall on the car bitmap.
In the embodiment of the invention, the number of the parking spaces can be obtained according to the parking space sensors managed by the whole scheduling server.
In the embodiment of the invention, the parking space map data in the block head of the block chain constructed by the related information of all vehicles is extracted to form the parking space map of the whole parking lot, and the parking space map is an ideal state that vehicles are supposed to stop in all stoppable parking spaces. Under the condition that the parking spaces in the current large and medium-sized cities are short, the parking space map information of the whole parking lot can be acquired within one day. Therefore, it does not have a problem of being difficult to implement.
Whether the parking space map is complete or not can be verified by the vehicle-mounted terminal in the parking lot, namely when the vehicle-mounted terminal added to the block chain network of the parking lot reaches the maximum value, vehicles which are not parked in the parking space are excluded, and the vehicle-mounted terminal is considered to have the most complete parking space information map. And summarizing the parking space map information of all the vehicle-mounted terminals at the moment to obtain the parking space map of the whole parking lot.
When the parking space map data of the block heads of all vehicles parked in the parking lot are combined, a complete vehicle map of the parking lot is formed.
In this context, unless otherwise indicated, a vehicle bitmap is to be understood as a complete vehicle bitmap with an entire parking lot.
At this time, the scheduling server is in an information acquisition mode, which keeps acquiring the complete vehicle bitmap state all the time.
In another embodiment of the present invention, the dispatch server may include a second processor (e.g., CPU), a communication bus, a network interface, a control interface, and a database. The communication bus is used for realizing connection communication among the components; the network interface optionally may include a standard wired interface, a wireless interface (e.g., WI-FI interface); the database may be a high-speed RAM memory, or may be a non-volatile memory, such as a disk memory, and optionally may be a storage device separate from the processor.
Those skilled in the art will appreciate that the above hardware configuration does not constitute a limitation of the in-vehicle terminal, and may include more or less components than those illustrated, or some components may be combined, or a different arrangement of components.
Wherein the database, which is a type of computer-readable storage medium, includes an application program, and the second processor may be configured to call up the program stored in the database and perform the following operations:
and the dispatching server switches the working mode and provides navigation information for the vehicle.
In addition to providing navigation information to the vehicle, the dispatch server may perform other functions.
And after the parking space map of the whole parking lot is acquired, the parking space map is sent to the dispatching server. At this time, the scheduling server may also verify whether the vehicle bitmap is complete. The dispatching server can verify whether the parking space map is complete according to the number of the parking space sensors and the maximum number of parked vehicles in the parking lot. For example, if the vehicle in the parking lot reaches a peak value in a certain period of time and does not exceed the value for a later period of time, the maximum peak value can be considered as the total number of parking spaces in the parking lot, and thus the maximum peak value is used as a standard for verifying whether the vehicle bitmap is complete.
And after the dispatching server confirms that the complete parking space map is obtained, sending a prompt to an administrator to start a navigation mode of the parking lot.
In one embodiment, after the scheduling server enters the navigation mode, when a new vehicle enters the parking lot, the scheduling server acquires information of the vehicle in the parking lot in real time, wherein the information includes information of the vehicle already parked at the parking lot and the vehicle running in the parking lot.
Among the vehicles that are traveling in the parking lot include a vehicle that is about to exit the parking lot, and a vehicle that has entered into a parking lot.
The vehicle can be known whether to drive in or drive out at the moment by combining the state of the vehicle and the state of the parking space.
For example, whether the vehicle is in a stopped state or a moving state can be known according to a vehicle-mounted terminal on the vehicle, and if the vehicle is in the stopped state, coordinate information of a parking space where the vehicle stops can be known through positioning; if the parking space is changed from a stopped state to a moving state, the vehicle is considered to be about to exit the parking lot.
When a vehicle enters a parking lot, namely the vehicle enters the parking lot through near field communication of the parking lot or shooting of a camera and the like, the scheduling server knows that a new vehicle enters the parking lot, a parking space is allocated to the vehicle, and a driving path of the parking space is sent to the vehicle.
A vehicle that has entered a vehicle that has not yet parked is a vehicle that has been assigned a slot.
If the parking lot has no parking space available for parking, no vehicle is assigned to the vehicle, i.e. the vehicle is not allowed to enter.
Wherein the second processor may be configured to call a program stored in a database and perform the following operations:
and the dispatching server updates the vehicle bitmap once a vehicle is driven out of or into the dispatching server.
Wherein the vehicle is driven away may include two situations, 1) driving away from the parking space. Through a sensor on the parking space, once the vehicle is known to leave the parking space, the default is that the vehicle is about to drive away from the parking lot; 2) and driving away from the parking lot. The driving-away information of the vehicle is acquired by an identification device at an exit of the parking lot.
In the first case, if the car is driven away from the parking space, the car is updated, and for some car owners, who do not comply with the public morality, do not stop the allocated parking space, but stop the car nearby, and occupy the parking space. It may leave the allocated parking space just parked and stop another parking space. This easily causes management confusion.
For the second case, the entire bitmap will not be updated as long as the vehicle is exiting the exit. And the updating can only send inquiry information aiming at the parking space where the vehicle is driven away, and confirm whether the vehicle is vacant or not and whether other vehicles stop illegally.
If other vehicles stop illegally, the restriction can be carried out through various modes such as broadcasting, punishing, manager law enforcement and the like, and good habits are gradually developed. Or the vehicle information of the illegal parking is re-associated with the parking space, the previously allocated parking space is cancelled, and the previously allocated parking space is secondarily allocated.
In a word, the partial real-time updating is adopted for updating the car bitmap, namely, the updating is only carried out on the changed parking spaces, but not on the changed parking spaces, and the data do not need to be updated.
Wherein the second processor may be configured to call a database and perform the following operations:
once a vehicle is driven off the parking lot, the dispatch server deletes the vehicle from the blockchain network.
The vehicle is deleted from the block chain network, so that parking spaces can be managed conveniently, and meanwhile, the load of the system is relieved conveniently, so that blocks in the block chain network can keep certain data.
Wherein the second processor may be configured to call a program stored in a database and perform the following operations:
and when the vehicle is successfully paid from the parking lot, confirming that the vehicle is driven away from the parking lot.
Typically, in a parking lot, the balustrade is lifted if the user is successful in allowing the vehicle to exit the parking lot.
Wherein the second processor may be configured to call a program stored in a database and perform the following operations:
and the dispatching server starts to send the navigation map to the vehicles entering the parking lot after acquiring the vehicle map.
After the scheduling server acquires the complete bitmap, the scheduling server prompts a manager to start using the bitmap. Many commercial parking lots are typically parked free of charge for a period of time before a formal charge is made, during which time the entire bitmap of vehicles can be obtained.
Wherein the second processor may be configured to call a program stored in a database, and further perform the following operations:
and verifying whether the finished vehicle bitmap exists or not according to the number of the vehicle digits of the parking lot.
The number of slots in a parking lot is determined by the peak vehicle in the parking lot.
If a car owner stops the car on two sides of the road, the data collection can be influenced, and the parking space data can be accurately acquired by strengthening manual management and other modes.
In addition, whether the car has a complete car bitmap or not can be verified through data transmitted by the car position sensors.
Wherein the second processor may be configured to call a program stored in a database, and further perform the following operations:
and providing a navigation path for the new vehicle by using a path optimization algorithm according to the latest vehicle bitmap.
The latest parking space map is the updated parking space map.
The path optimization algorithm is an algorithm for realizing the most efficient parking mode by comprehensively considering the opposite driving of the vehicles, the shortest path, whether the vehicle will cause congestion and the like. Such algorithms are common in the art. And will not be described in detail herein.
Wherein the second processor may be configured to call a program stored in a database, and further perform the following operations:
and acquiring the real-time position of each vehicle in the parking lot in real time.
For the existing system, the real-time position of each vehicle in the parking lot is mastered in real time, the operation burden is not too large, the position is mastered in real time, and the management of the whole parking lot is facilitated.
Based on the hardware structures of the nodes in the vehicle-mounted terminal and the dispatching server, the invention provides various embodiments of the parking navigation method based on the block chain.
In order to synchronize and integrate real-time data information of each parking space, a scheduling server is constructed; the dispatching server is connected with the parking place sensors through a network, and the dispatching server can send information of the parking places to nodes entering the parking lot.
The parking space sensor uploads parking space use information in real time according to the use condition of a parking space so as to ensure the real-time performance and effectiveness of data information in the scheduling server; for example, a parking space of a parking lot may be provided with a ground sensing coil or a camera, and when detecting that a vehicle enters/leaves the parking space of the parking lot through the road testing device, the parking space sensor may send corresponding parking record information to the scheduling server; when the dispatching server receives the parking record information, the parking lot information is updated according to the parking record information, so that the real-time performance and the effectiveness of the parking lot information in the dispatching server are guaranteed.
Through constructing the dispatching server, a parking navigation system based on the block chain is established, the parking navigation system comprises a vehicle-mounted terminal and a dispatching server, real-time data information of a parking lot is synchronized and integrated, so that a vehicle owner can inquire parking space information of each parking lot recorded in the dispatching server through the vehicle-mounted terminal, a navigation function is provided for the vehicle owner, the vehicle owner can conveniently find parking spaces, and the problem that the vehicle owner is difficult to park is solved
As shown in fig. 2, the present invention provides a parking navigation method based on a block chain, which includes:
all vehicles entering the parking lot store the data of the driving paths of the vehicles in the parking lot into the block head;
extracting data in block heads of block chains constructed by the relevant information of all vehicles to form a parking space map of the whole parking lot;
transmitting the information of the car bitmap to a dispatching server of a parking lot;
and the dispatching server switches the working mode and provides navigation information for the vehicle.
In practice, the vehicle-mounted terminal acquires the current network state information and automatically selects a proper positioning mode for positioning according to the network state so as to ensure the positioning accuracy; of course, the positioning mode can also be selected by the owner's specification. Vehicles entering the parking lot can transmit respective position information in real time in an ad hoc network mode through the vehicle-mounted terminal, and particularly the vehicles moving in the parking lot.
Before the vehicle bitmap is acquired, all vehicle-mounted terminals entering a parking lot need to be used as public nodes.
Wherein the dispatch server updates the vehicle bitmap once a vehicle is driven off or on.
Wherein the dispatch server deletes a vehicle from the blockchain network once the vehicle has driven off the parking lot.
And when the vehicle is successfully paid from the parking lot, the vehicle is confirmed to drive away from the parking lot.
And the dispatching server starts to send the navigation map to the vehicles entering the parking lot after acquiring the vehicle map.
And verifying whether the finished vehicle bitmap exists or not according to the number of the vehicle digits of the parking lot.
When a new vehicle enters the parking lot, the sending of the parking space map to the vehicle-mounted terminal of the new vehicle by the scheduling server specifically includes:
and the scheduling server provides a navigation path for the new vehicle by using a path optimization algorithm according to the latest vehicle bitmap.
And the dispatching server acquires the real-time position of each vehicle in the parking lot in real time.
Embodiments of the invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, and the like. Furthermore, the invention can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system.
For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a Random Access Memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Examples of current optical disks include compact disk-read only memory (CD-ROM), compact disk-read/write (CD-R/W), and DVD.
A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory deployed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution. Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening I/O controllers. Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.