CN118138633B

CN118138633B - Network contract automobile management method and system applied to large public places

Info

Publication number: CN118138633B
Application number: CN202410533658.2A
Authority: CN
Inventors: 郑城
Original assignee: Chengdu Paier Zhixin Technology Co ltd
Current assignee: Chengdu Paier Zhixin Technology Co ltd
Priority date: 2024-04-30
Filing date: 2024-04-30
Publication date: 2024-07-05
Anticipated expiration: 2044-04-30
Also published as: CN118138633A

Abstract

The invention relates to the technical field of intelligent transportation, and provides a network bus management method and a network bus management system applied to large public places, in particular to a network bus management method and a network bus management system applied to large public places.

Description

Network contract automobile management method and system applied to large public places

Technical Field

The invention relates to the technical field of intelligent transportation, in particular to a network contract automobile management method and system applied to large public places.

Background

Existing vehicle dispatch systems employed by ride call applications (apps) typically employ a 1-to-1 pairing method, wherein a 1-to-1 pairing method is to pair a particular vehicle with a particular requester once the vehicle receives a request for a ride by the particular requester and is completed before the vehicle has traveled to a ride location specified by the particular requester. Thus, the traditional 1-to-1 pairing approach has 4 inefficiency drawbacks at the system level:

1) When scheduling a response-to-demand transportation service, the requester or the vehicle may need to wait for a longer unnecessary time. For example, at a particular ride location, a requester has arrived at the particular ride location, and because the vehicle for which it is paired has not yet arrived at the particular ride location, the requester may need to wait for the arrival of the paired vehicle, while at the same time, a vehicle that has arrived at the particular ride location is waiting for another requester for which it has paired because the other requester has not yet arrived at the particular ride location. In particular, if the vehicle is waiting for a longer period of time at the particular ride location, other vehicles that arrive and/or leave the particular ride location may be adversely affected, the vehicle travel speed at the particular ride location may be slowed, or even traffic jams at the particular ride location may be caused.

2) The completed pairing in the existing 1-to-1 pairing method can be easily canceled by either the paired requester or the paired vehicle. Any party initiating a unpaired party breaks the paired party's pairing status or forces the paired party to re-pair 1 to 1.

3) When scheduling a prompt response transportation service, the requester is often inevitably required to wait for a period of time, since the 1-to-1 pairing method can schedule a vehicle for which it is paired only after a requester initiates a prompt response ride request. For example, if a requester initiates a request to ride from a certain ride location using a 1-to-1 pairing method, unless the requester's paired vehicle is coincidentally present at the ride location (or is about to reach the ride location) at the time the requester initiates the request, it is highly likely that the requester will take a short time to wait for the vehicle for which the pairing is being made to arrive.

4) In a predetermined transportation service, a paired vehicle is often unable to efficiently operate a passenger when approaching a predetermined departure time. For example, if a vehicle has accepted a predetermined ride request to pick up a requester at a particular departure time at a particular ride location, the vehicle has to restrict its ability to move only about the ride location when approaching the predetermined departure time so that the vehicle can reach the ride location at the predetermined departure time.

In view of the above-mentioned drawbacks, the prior art proposes to avoid the above-mentioned drawbacks of 1-to-1 pairing by adopting a "pool queue pairing" manner, for example, the chinese patent publication No. CN107527315B discloses a system and method for improving the efficiency in scheduling immediate response and reservation of transportation services, which avoid the problem of low transportation service efficiency caused by the fact that in the conventional 1-to-1 pairing manner, a requester pool for initiating a riding request and a vehicle pool for receiving the riding request are paired with vehicles in the vehicle pool that have reached or approached the same riding position only when the requester reaches or approaches the riding position, respectively, the requester reaches the riding position and the vehicles do not reach or the requester does not reach.

However, for some large public places, such as large transportation hubs (airports, railway stations, etc.), large malls, concert sites, comprehensive medical institutions, border gates, etc., a car storage place is established for ensuring transport capacity in an area having a certain distance from a boarding location, so that various vehicles and the like can be queued for receiving passengers, therefore, even if the vehicles reach the car storage place, that is, the vicinity of the boarding location, pairing is completed, the queuing can only be continued, and the boarding location (for example, a certain position in the boarding area) designated by a requester cannot be reached immediately for carrying passengers. And only when the passenger calls the driver, the driver can drive into the boarding area from the parking lot to carry the passenger, or the passenger is informed by the call after the vehicle reaches the boarding area, and then the passenger walks to the boarding area to carry the vehicle. This has the following problems:

I. Because the vehicle needs a certain time from the storage area to the boarding area, when the passenger reaches the boarding area, the vehicle paired with the passenger may not arrive, so that the passenger may need to wait a certain time, and a large number of passengers are generally piled up at the entrance of the boarding area to wait for the vehicle to be carried, if the traffic flow is large, the vehicle may need to be queued to arrive at the position of the passenger even if the vehicle enters the boarding area, so that the time for waiting for the vehicle by the passenger is further increased, and the user experience is reduced;

II. Also, a certain time is required for the passenger to walk to the boarding area, so that there is a case where the passenger may not yet arrive when the vehicle reaches the vicinity of the boarding position in advance, and if the vehicle stays in the boarding area for a long time at this time, traffic jam may be caused; in addition, even if the passenger arrives, the corresponding vehicle is searched according to the license plate number, and if the vehicle flow is large and the number of wheels is large, the passenger can stay in the boarding area for a long time due to the fact that the passenger only arrives at the place according to the license plate number.

In view of this, there is a need for a method and system for web-based vehicle management that is adaptable to large public places.

Disclosure of Invention

The invention aims to provide a network bus management method and system applied to a large public place, which partially solve or alleviate the defects in the prior art, and the method and system can be used for informing a vehicle to go to a boarding zone and carry the requester by firstly distributing a boarding zone for the requester reaching the boarding zone, so that the requester can go to the area where an actual riding position is located while the vehicle is also going to the boarding zone, and when the vehicle reaches the boarding zone, a definite boarding zone is dynamically distributed for passengers and corresponding vehicles, so that the passengers can simultaneously go to the boarding zone, and the waiting time of the passengers is reduced to a certain extent.

In order to solve the technical problems, the invention adopts the following technical scheme:

in a first aspect of the present invention, there is provided a network contract car management method applied to a large public place, comprising the steps of:

Receiving a plurality of riding requests from a plurality of requesters in the same public place, and storing the plurality of riding requests into a first requester pool in the public place;

receiving a plurality of acceptance signals representing a plurality of requesters to be carried in the public place, and storing the plurality of acceptance signals in a first vehicle pool of the public place;

When at least one vehicle in the first vehicle pool is detected to reach or approach a parking lot of the public place, adopting a pool queue pairing method to pair the at least one vehicle with a requester in the first requester pool;

When at least one requester successfully paired in the first requester pool reaches a boarding area of the public place, transferring at least one boarding request of the at least one requester to a second requester pool of the boarding area, and respectively distributing a boarding pool for each requester according to a preset rule; simultaneously informing at least one requester that the paired vehicle is going to the boarding zone; the boarding zone comprises a plurality of boarding pools, each boarding pool comprises a plurality of adjacent boarding sites, and the preset rule comprises the following steps: preferentially distributing the passenger pool containing the passenger seats in the most idle state;

When at least one vehicle successfully paired in the first vehicle pool is detected to reach the entrance of the boarding zone, transferring an acceptance signal of the at least one vehicle to a second vehicle pool of the boarding zone;

Dynamically allocating an upper passenger position for each vehicle in the second vehicle pool, and simultaneously transmitting the allocated unique identification code of the upper passenger position to the vehicle and a matched requester thereof; wherein the assigned boarding location is a boarding location in the boarding location pool of the requester paired with the vehicle that is in a free state or is about to be free.

In some embodiments, the network about car management method further comprises the steps of:

Timing the occupied time of each passenger station and identifying the current state of each passenger station based on the occupied time;

If the occupied time is smaller than or equal to a preset first time threshold value, judging that the state of the boarding guest is an idle state;

and if the occupied time is larger than a preset third time threshold, judging that the state of the boarding guest is an idle state.

In some embodiments, when assigning an idle state of the upper passenger space to the vehicle, preferentially assigning the upper passenger space whose occupied time is greater than a preset fourth time threshold from the pool of upper passenger spaces of its paired requesters; and if the occupied time is not more than the preset fourth time threshold, distributing the passenger positions of which the occupied time is more than the third time threshold but less than or equal to the fourth time threshold from the passenger position pool of the paired requesters.

In some embodiments, the preset rules further comprise: when the upper passenger pool comprises at least one upper passenger in an idle state, and the upper passenger pool comprises the same number of upper passenger in the idle state, preferentially matching the upper passenger pool closest to the requester; and when all the boarding pools have no boarding in the idle state, randomly distributing a boarding pool for the requester.

In some embodiments, the network about car management method further comprises the steps of: and when the occupied time of any passenger seat is identified to be larger than a preset fourth time threshold value, alarming is carried out.

In some embodiments, the network about car management method further comprises the steps of: and when the number of the passenger seats in the idle state is detected to be smaller than a preset number threshold, prompting passenger seat tension.

In a second aspect, the present invention provides a network contract automobile management system applied to a large public place, comprising:

At least one first terminal for transmitting a riding request;

At least one second terminal for transmitting an acceptance signal indicating that the requester is to be mounted;

the vehicle dispatching terminal is in data communication with the first terminal and the second terminal, and is used for receiving a plurality of riding requests from a plurality of requesters in any public place and storing the plurality of riding requests sent from the same public place into a first requester pool in the public place; and receiving a plurality of acceptance signals representing a plurality of vehicles to be carried on a requester at the public place, and storing the plurality of acceptance signals in a first vehicle pool of the public place; when at least one vehicle in the first vehicle pool is detected to reach or approach a storage yard of the public place, adopting a pool queue pairing method to pair the at least one vehicle with requesters in the first requester pool; when at least one requester successfully paired in the first requester pool is detected to reach a boarding area, transferring at least one riding request of the at least one requester to a second requester pool of the boarding area, and respectively distributing a boarding pool for each requester according to a preset rule; and when at least one vehicle successfully paired in the first vehicle pool is detected to reach the boarding area, transferring an acceptance signal of the at least one vehicle to a second vehicle pool of the boarding area; dynamically allocating an upper passenger position for each vehicle in the second vehicle pool, and simultaneously transmitting the allocated unique identification code of the upper passenger position to the vehicle and a paired requester thereof; wherein the allocated boarding location is a boarding location in a free state or about to be free in the boarding location pool of the requester paired with the vehicle; the boarding area comprises a plurality of boarding pools, each boarding pool comprises a plurality of adjacent boarding sites, and the preset rule comprises the following steps: the pool of boarding sites containing the most free state of boarding sites is preferentially allocated.

In some embodiments, the vehicle dispatching terminal is further configured to identify a state of each boarding location based on an occupied time of each boarding location in the boarding area, and determine that the state of the boarding location is an idle state if the occupied time is less than or equal to a preset first time threshold; and if the occupied time is greater than a preset third time threshold, judging that the state of the boarding guest is an idle state.

In some embodiments, when the vehicle dispatching terminal allocates the upper passenger seat in an idle state for the vehicle, preferentially allocating the upper passenger seat with occupied time greater than a preset fourth time threshold value from the upper passenger seat pool of the pairing requester; and if the occupied time is not more than the preset fourth time threshold, distributing the passenger positions of which the occupied time is more than the third time threshold but less than or equal to the fourth time threshold from the passenger position pool of the paired requesters.

In some embodiments, the vehicle dispatching terminal is further configured to alarm when it is identified that the occupied time of any passenger station is greater than a preset fourth time threshold.

In some embodiments, the vehicle dispatching terminal is further configured to prompt that the number of boarding seats in the idle state is less than a preset number threshold.

The beneficial effects are that: according to the invention, a plurality of boarding pools (for example, a plurality of rows of carport are arranged in parallel, each carport corresponds to one boarding, each boarding pool comprises a plurality of adjacent boarding), and when a requester arrives at the boarding area, the boarding pools are allocated for the requester, and matched vehicles are notified, so that the requester is enabled to go to the corresponding area to enable the vehicle to go to the boarding area while the vehicle goes to the boarding area, once the matched vehicles enter the boarding area, an idle state or a boarding position to be idle is dynamically allocated for the vehicle and the requester from the boarding pools of the requester, and simultaneously, the unique identification codes of the boarding positions are respectively notified to the requester and the vehicle, so that the vehicle and the requester simultaneously go to the designated boarding positions, the time of waiting the requester (namely, passengers) by the vehicle is greatly reduced, the traffic jam is balanced to a certain extent, and the driver does not need to be notified by telephone to the requester in the whole process; on the other hand, the requester does not need to wait for the vehicle at the boarding station for a long time, so that the turnover rate or the turnover rate of each boarding station is improved.

Further, when the passenger pool is distributed for each requester, at least 1 passenger in idle state is kept in each passenger pool as much as possible, so that the vehicle body can conveniently and completely enter without obstructing the traffic lane.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. Like elements or portions are generally identified by like reference numerals throughout the several figures. In the drawings, elements or portions thereof are not necessarily drawn to scale. It will be apparent to those of ordinary skill in the art that the drawings in the following description are of some embodiments of the invention and that other drawings may be derived from these drawings without inventive faculty.

FIG. 1 is a flow chart of a method of network contract automotive management for use in large public places according to an exemplary embodiment of the present invention;

FIG. 2 is a functional block diagram of a network contract automotive management system for use in large public places according to an exemplary embodiment of the present invention;

FIG. 3 is an exemplary diagram of allocation of occupancy for each requester and vehicle based on the management method shown in FIG. 1;

FIG. 4 is a schematic diagram reflecting different passenger status.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention more clear, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. It will be apparent that the described embodiments are some, but not all, embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

In this document, suffixes such as "module", "component", or "unit" used to represent elements are used only for facilitating the description of the present invention, and have no particular meaning in themselves. Thus, "module," "component," or "unit" may be used in combination.

The terms "upper," "lower," "inner," "outer," "front," "rear," "one end," "the other end," and the like herein refer to an orientation or positional relationship based on that shown in the drawings, merely for convenience of description and to simplify the description, and do not denote or imply that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus should not be construed as limiting the invention. Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.

The terms "mounted," "configured to," "connected," and the like, herein, are to be construed broadly as, for example, "connected," whether fixedly, detachably, or integrally connected, unless otherwise specifically defined and limited; the two components can be mechanically connected, can be directly connected or can be indirectly connected through an intermediate medium, and can be communicated with each other. The specific meaning of the above terms in the present invention will be understood in specific cases by those of ordinary skill in the art.

Herein, "and/or" includes any and all combinations of one or more of the associated listed items. Herein, "plurality" means two or more, i.e., it includes two, three, four, five, etc.

Noun paraphrasing:

The requestor: an entity consisting of one or more persons, and which takes a ride from a place and transmits a request for taking a ride by using a user device such as a mobile terminal; or by a third party (e.g., a friend or family, etc.).

Vehicle: an unmanned or driver operated motor vehicle that provides predetermined transportation services, such as network booking of taxi cabs via a network. In this specification, the term "vehicle" may also be understood to include various types of vehicles.

Reservation: the term "scheduled" in this specification refers to a transportation service arrangement, unless otherwise required, when the requester intends to begin the journey at or before and after a scheduled time with the vehicle.

The user: in this specification, the term "user" refers to a user who uses the present invention, which may be a requester or a vehicle as defined above. The user interacts with the system of the present invention, i.e. the vehicle management system, via a user device, e.g. a mobile terminal owned by the requester or an in-vehicle terminal installed on the vehicle, for arranging the predetermined transportation service.

User equipment or user terminal: a mobile terminal connected to a network, or a stationary device, and may be operated by a user. In this specification, the term "mobile device" refers to any user-portable device that is connectable to a network (e.g., the internet). For example, "mobile device" includes: a cell phone (e.g., a function cell phone or a smart phone), a tablet computer, a computer (e.g., a notebook computer, a netbook), a PDA (Personal DIGITAL ASSISTANT, a Personal digital assistant), a wearable device (e.g., iWatch), or a computer device mounted on a vehicle (which may also be referred to as an "in-vehicle device"). The stationary device refers to any computer device (e.g., a multimedia station (Kiosk)) that is installed in a riding location.

Unique identification code: refers to a unique identifier for identifying the device or the boarding pass, such as a code of the boarding pass corresponding to the parking space, or a code according to the boarding pass (the code rule can be set by itself). Also known as a device specific ID, identifying the mobile device. The device specific ID includes: mobile phone number in cellular network, MAC (MEDIA ACCESS Control) address, IMEI (International Mobile Equipment Identity ) number, UDID of apple device (Unique device identifier DEVICE IDENTIFIER), or Unique ID generated by vehicle management server for each user.

Network about automobile management system: in this specification, unless otherwise required herein, the term "network about car management system" refers to the entire system of the present invention, which is capable of scheduling predetermined transportation services. The "network approximately automotive management system" includes a "vehicle dispatch terminal (or vehicle dispatch server)" configured to accept and transmit data from other instruments, devices, apparatus, modules and other components in the network approximately automotive dispatch system, as well as process and store the data.

Large public places: the term "large public place" herein includes various large transportation hubs (airports, train stations, etc.), large malls, concert sites, comprehensive medical institutions, border crossing, etc., places where a large number of public works are generally conducted, including places where a vehicle carrying a requester is temporarily parked to wait for the requester or to rest (e.g., a parking lot), and boarding areas dedicated to carrying the requester.

Riding position: the term "boarding location" herein refers to a pickup point, such as a boarding location defined in a large transportation hub (airport, train station, etc.), that is dedicated to boarding a requestor's boarding area.

Boarding: the term "boarding location" in this specification refers to a location where a plurality of parking spaces for parking a vehicle to carry a requester are divided in a boarding area in a large public place, that is, an actual riding location of the requester, and a certain boarding location is allocated to a vehicle and its paired requester only when both the vehicle and the requester reach the boarding area, unless otherwise specified. Preferably, at least one row or at least one line of parking spaces in the boarding zone, and each parking space is provided with an independent number as a unique identification code of the boarding space. Correspondingly, a plurality of adjacent boarding seats form a boarding seat pool, for example, boarding seats corresponding to a plurality of parking spaces with continuous numbers in each column or each row. Because the state of each boarding zone changes in real time, the boarding pool also changes in real time, so that partial boarding zones among a plurality of requesters can exist in the boarding pool, namely, the boarding pools are crossed, and only when a vehicle and the requesters simultaneously board a boarding zone, a definite boarding zone is allocated (the utilization rate of the boarding zone is improved), and then the state of each boarding zone is dynamically updated.

Occupied time: the term "occupied time" in this specification is a time period obtained by starting to count a unique identification code (such as a license plate number) once a corresponding vehicle approaches a parking space where an boarding guest is located and is recognized by a vehicle recognition terminal installed in advance on the parking space when the boarding guest is assigned to a vehicle and its paired requester, or a time period obtained by starting to count a time from when the boarding guest is assigned. And when the vehicle leaves the parking space, the timing is ended until the upper passenger space is redistributed or a new vehicle approaches the parking space of the upper passenger space.

Dynamic allocation: the term "dynamic allocation" herein means that, since the status of each upper passenger pool is changed in real time, and accordingly, the number of upper passenger pools and the status of each upper passenger in an upper passenger pool are also changed in real time, the allocation of an upper passenger pool to a requester is based on the number of upper passenger pools at the current time and the real-time status of each upper passenger in each upper passenger pool; meanwhile, when an boarding location is allocated to the vehicle and the pairing requester thereof, the boarding location is also allocated according to the real-time state in the corresponding boarding location pool.

According to the invention, corresponding boarding pools are distributed for a plurality of requesters reaching a boarding zone in real time, the respective paired vehicles are notified to enter the boarding zone for carrying the requesters, and when the vehicles reach the boarding zone, a clear free boarding position or a boarding position to be free is dynamically distributed for the vehicles from the boarding zone, and the distributed unique identification codes of the boarding positions are simultaneously sent to the requesters and the corresponding vehicles thereof, so that the requesters and the corresponding vehicles simultaneously go to a common destination; on the other hand, by designating a target area for the requesters in advance, the problem that the entrance of a boarding area is affected by a large number of accumulated requesters is avoided.

Example 1: referring to fig. 1, a flowchart of a method for managing a network contract car applied to a large public place according to an exemplary embodiment of the present invention, specifically, the method for managing a network contract car includes the steps of:

S101, receiving a plurality of riding requests from a plurality of requesters in any public place, and storing the plurality of riding requests sent from the same public place into a first requester pool in the public place.

In general, there are a large number of requesters that send requests for taking a bus from different locations or different areas of the same public place simultaneously or sequentially, but these requesters all travel to a unified place, that is, a designated boarding area in the public place to wait for the vehicle to be carried on, so in this embodiment, a plurality of requests for taking a bus initiated from the same public place are stored in a first requester pool.

S103, receiving a plurality of receiving signals representing that a requester is to be mounted in the public place, and storing the receiving signals in a first vehicle pool of the public place.

In general, when a requester initiates a riding request, the network-based vehicle management system issues the riding request initiated by the requester, and a vehicle driver decides whether to accept the riding request by himself, if so, the corresponding user terminal (for example, an intelligent mobile terminal or an intelligent vehicle terminal) feeds back a corresponding acceptance signal indicating that the requester is accepted in the public place to the network-based vehicle management system, so in this embodiment, all the acceptance signals indicating that the requester is accepted in the same public place are stored in a first vehicle pool.

S105, when at least one vehicle in the first vehicle pool is detected to reach or approach a storage yard of the public place, the pool queue pairing method is adopted to pair the at least one vehicle with a requester in the first requester pool.

As mentioned above, to ensure the capacity, a storage yard is usually built at a designated location for vehicles to wait in line, that is, the vehicles cannot reach the designated location when the requester initiates the riding request immediately. If the conventional 1-to-1 approach is adopted, this exists: 1) After the vehicle reaches the storage yard, if the requester does not call the notification, the vehicle may wait for a long time at the storage yard; 2) The requester reaches the pick-up area but the vehicle has not yet reached the storage yard, so there is a long waiting time for the requester to wait for the vehicle. Thus, to avoid this problem, the present embodiment employs a vehicle that pairs a first pool of vehicles for a requester in the first pool of requesters only when the requester reaches a boarding zone (i.e., a ride location) or when the vehicle reaches a storage yard (i.e., a near ride location).

S107, when at least one requester successfully paired in the first requester pool is detected to reach a boarding area in the public place, transferring at least one riding request of the at least one requester to a second requester pool in the boarding area, respectively distributing a boarding pool for each requester according to a preset rule, and simultaneously notifying the paired vehicles of the requesters to go to the boarding area.

In general, when a requester arrives at a boarding zone, a driver is usually informed of the arrival of the requester at the boarding zone by telephone, and then the vehicle is driven into the boarding zone, or the driver checks the state of the requester as "arrival start point" through a system. However, on the one hand, a large number of requesters are collected in a certain area of the boarding area, for example, at the entrance of the boarding area, thereby affecting the vehicle traffic; on the other hand, a large number of vehicles are stacked in the area, so that subsequent vehicles need to be queued, congestion is easy to cause, in addition, a requester needs to find own vehicles from a large number of queued vehicles, time is needed to be spent, after the vehicles are found, the requester needs to walk to the position of the vehicles, or a certain time is needed for the vehicles to travel to the position of the vehicles, further, the time cost for the requester to carry the vehicles is increased, and the user experience is low.

In view of this, in this embodiment, by setting a plurality of boarding areas (i.e., target positions for the boarding of the requester) in advance in the boarding area, after the requester reaches the boarding area, a boarding pool is allocated in advance for the requester, and at the same time, the paired vehicles are notified to go to the boarding area, that is, the requester is assigned a boarding area to guide the vehicles to go to while the vehicles go to the boarding area, and since the time for the vehicles to reach the boarding area from the storage yard is short, the time for the vehicles to reach the target area from the boarding area is not much different from the time for the requester to reach the boarding area, therefore, when the vehicles reach the boarding area, a common target boarding area is assigned for the vehicles at the same time, so that the vehicles go to the boarding area at the same time, and the time for some persons or vehicles and the like is saved, thereby improving the efficiency. Preferably, a key device may be provided in the passenger entrance area of the boarding zone to detect whether it is reached, or whether it is reached by a navigation or positioning module in the requester's mobile terminal.

In this embodiment, the boarding pool includes a plurality of adjacent boarding sites. In general, the boarding area is provided with a plurality of boarding areas, and each boarding area is provided with a respective number, that is, the boarding areas in the boarding area are divided into a plurality of boarding areas according to a preset standard value. For example, every 4 consecutive boarding passes is a boarding pass pool.

In this embodiment, when the requester arrives at the boarding area, the corresponding boarding pool is dynamically allocated to the requester, and the specific allocation rule is as follows: preferentially distributing the passenger pool with the largest number of passenger seats in the idle state; secondly, if there are a plurality of vacant state upper passenger pools (including at least one vacant state upper passenger) having the same number of upper passenger bits, it is preferable to allocate an upper passenger pool nearest to the requester (for example, the number of upper passenger pools currently including the vacant state is the largest 4, and there are a plurality of such upper passenger pools at the same time, thus selecting one upper passenger pool nearest thereto); of course, if all the passenger pools have no passenger in the idle state, a passenger pool is allocated randomly. For example, the boarding spaces corresponding to 8 parking spaces in the boarding area at the current moment are in an idle state, the boarding spaces corresponding to 11 parking spaces are in an about-to-be-occupied state (i.e., the vehicle just enters the parking space where the corresponding boarding space is located), the boarding spaces corresponding to 2 parking spaces are in an occupied state (i.e., the vehicle is carrying a requester), and the boarding spaces corresponding to 1 parking space are in an about-to-be-idle state. Further, the status of the passenger seats can be marked with different colors. At this time, if a requester is detected to reach the boarding area, since there are currently 5 boarding areas in continuous and idle states, the requester will be preferentially allocated a boarding area pool with 4 continuous idle states.

In some embodiments, the status of each boarding location in the boarding area needs to be updated in real time, and in particular, the network-based automobile management method further includes the steps of:

timing the occupied time of each passenger seat, and identifying (or updating) the state of each passenger seat based on the occupied time;

If the occupied time is smaller than or equal to a preset first time threshold value, judging that the state of the passenger position is an idle state; (e.g., if the vehicle arrives at the parking space where the boarding station is located and is recognized by the vehicle recognition terminal to begin timing, the first time threshold is 0; if the boarding station is assigned to begin timing, the first time threshold is not zero, and specifically, can be determined based on the time required for the vehicle to arrive at the boarding station from the parking lot, e.g., based on a mean value obtained from historical data); if the occupied time is equal to the first time threshold value but is smaller than or equal to a preset second time threshold value, judging that the state of the upper passenger seat is the state to be occupied, and representing that the vehicle is driving into or just driving into a parking space corresponding to the upper passenger seat under the general condition; if the occupied time is larger than a preset second time threshold value but smaller than or equal to a preset third time threshold value, judging that the state of the boarding station is an occupied state, and representing that under general conditions, a requester is boarding or has been boarding; if the occupied time is larger than a preset third time threshold, judging that the vehicle is about to be idle, namely the vehicle is about to leave. The second time threshold to the third time threshold are obtained based on statistical analysis of historical data in the boarding zone, and the second time threshold is smaller than a minimum period T of each boarding bit, so that a sufficient time is provided for a requester to search for a car or to search for the boarding bit, and the third time threshold is larger than the minimum period T of each boarding bit, so that a sufficient time is provided for the requester to board (e.g. carry baggage, etc.).

Further, when there are a plurality of waiting boarding sites, dynamic allocation is performed according to the priority of each waiting boarding site. For example, when a requester and its paired vehicles are allocated to the waiting space, the requester is preferentially allocated to the waiting space whose occupied time is greater than a fourth time threshold (similarly, the waiting space can be obtained based on the statistical analysis of the historical data in the boarding area), if no waiting space whose occupied time is greater than the fourth time threshold, the requester is allocated to the waiting space whose occupied time is greater than the third time threshold but less than or equal to the preset fourth time threshold.

Exemplary, referring to FIG. 4, the second time threshold is 60s, the time required for the vehicle to drive into the upper parking space; The third time threshold is 180s, which is 2 times of the minimum period T of each train number of each passenger station (let T=90 s); the fourth time threshold is 300s; correspondingly, if it is judged that one upper passenger position is stopped until the current occupied time t is less than or equal to 60s, the upper passenger position is judged to be in an about-to-be-occupied state, and green is used for representing that the upper passenger position is in the about-to-be-occupied state, as shown in fig. 4, the state of the upper passenger position corresponding to 8 upper passenger positions in 22 upper passenger positions corresponding to the current 22 parking positions is the about-to-be-occupied state; if judging that the occupied time t from the last passenger position to the current passenger position meets the following conditions: when the t is more than 60s and less than or equal to 180s, judging that the upper passenger position is in an occupied state, and representing that the upper passenger position is in the occupied state by yellow, wherein the state of the upper passenger position corresponding to 2 upper passenger positions in 22 upper passenger positions corresponding to the current 22 parking positions is the occupied state as shown in fig. 4; if judging that the occupied time t from the last passenger position to the current passenger position meets the following conditions: 180s < t, judging that the upper passenger position is in an about-to-be-idle state, and representing that the upper passenger position is in the about-to-be-idle state by orange color, wherein as shown in fig. 4, the state that 1 upper passenger position corresponds to the 22 upper passenger positions corresponding to the current 22 parking positions is the about-to-be-idle state. In some embodiments, to avoid that an occupancy is always occupied, once the occupied time of an occupancy is greater than the third time threshold, the vehicle is continuously alerted to leave for a specified time (e.g., before the occupied time reaches the fourth time threshold), so the system marks the occupancy as being in an upcoming idle state. Further, if it is determined that an upper passenger space is blocked to the current occupied time t > 300s, an early warning is performed (as shown in fig. 4, and the occupied time of the upper passenger space is represented by red for more than 300 s), and the system marks the upper passenger space as a state to be idle.

As described above, the minimum cycle T per number of passes of each upper passenger is smaller than the third time threshold, and therefore, in general, even an upper passenger currently in an occupied state becomes an idle state in a short time. For example, after the vehicle arrives at the boarding location, the paired requesters arrive at the boarding location at the same time, get on the boarding location immediately, and leave the boarding location, and the time consumed by the whole process (i.e. the occupied time of the boarding location) is smaller than the third time threshold, so that when the vehicle leaves, the boarding location is automatically updated to an idle state. Of course, not every requester will immediately find his or her paired vehicle and get on the vehicle immediately, so the third time threshold is set to give the requester sufficient time, for example, to place baggage or the like. Of course, the system also needs to dynamically update the state of each passenger seat in real time, and accordingly, each passenger seat pool also changes in real time.

And S109, when at least one vehicle successfully paired in the first vehicle pool is detected to reach the entrance of the boarding zone, transferring the receiving signal of the at least one vehicle into a second vehicle pool of the boarding zone.

In some embodiments, since the vehicles have been paired with the requesters in step S105, but the corresponding vehicles will go to the boarding zone for the requesters only when a notification is received that their paired requesters have reached the boarding zone, they will be moved from the first pool of vehicles to the second pool of vehicles corresponding to the boarding zone in order to dynamically allocate a boarding location for each vehicle in the second pool of vehicles in the following.

S111, dynamically allocating an idle state or an upper passenger position to be idle for each vehicle in the second vehicle pool, and simultaneously respectively transmitting the unique identification codes of the allocated upper passenger positions to the vehicles and paired requesters thereof.

In some embodiments, the assigned up leg in step S111 is an up leg in a free state or about to be free up leg in the pool of up legs of the requester paired with the vehicle. Specifically, the method comprises the steps of preferentially distributing the idle upper passenger positions, and distributing the upper passenger positions to be idle in the upper passenger position pool if the idle upper passenger positions do not exist in the corresponding upper passenger position pool.

Illustratively, referring to FIG. 3, five requesters R5, R4, R3, R2, R1 each initiate ride requests from the airport in succession, i.e., the ride requests of the five requesters are stored in the first pool of requesters; five vehicles V3, V1, V5, V4, V2 are respectively network-bound vehicles which are received and represent the requester carried from the airport and have reached the storage yard, and the received signals of the five vehicles are stored in a first vehicle pool; since five vehicles have arrived in the storage yard, they are paired with the first five requesters, respectively, to obtain: R5-V3, R4-V1, R3-V5, R2-V4, R1-V2.

Wherein, three requesters of R5, R4 and R3 respectively reach the boarding areas in sequence and respectively distribute to obtain corresponding boarding pools: P1-P4, P10-P13, P16-P19, and the system sequentially informs the matched vehicles V3, V1, V5 to enter the boarding area to carry the matched requesters; and when it is detected that the vehicles V3, V1, V5 reach the boarding zone (e.g., detected by a vehicle identification terminal at the entrance of the boarding zone), the boarding seats of one idle state are allocated from the boarding seat pools of the respective requesters, respectively.

Example 2: referring to fig. 2, a network contract car management system for a large-scale public place according to an exemplary embodiment of the present invention includes:

At least one first terminal for transmitting a riding request;

A vehicle dispatching terminal which is in data communication with the first terminal and the second terminal, and is used for receiving a plurality of riding requests from a plurality of requesters in the same public place and storing the plurality of riding requests into a first requester pool in the public place; and receiving a plurality of acceptance signals representing a plurality of vehicles to be carried by a requester at the public place, and storing the plurality of acceptance signals in a first vehicle pool of the public place; when at least one vehicle in the first vehicle pool is detected to reach or approach a storage yard of the public place, adopting a pool queue pairing method to pair the at least one vehicle with a requester in the first requester pool; and when at least one requester successfully paired in the first requester pool is detected to reach a boarding area of the public place, transferring a riding request of the requester to a second requester pool of the boarding area, and respectively distributing a boarding pool for each requester based on the state of each boarding pool and the distance between each boarding pool and the at least one requester; and when at least one vehicle successfully paired in the first vehicle pool is detected to reach the boarding area, transferring an acceptance signal of the at least one vehicle to a second vehicle pool of the boarding area; and dynamically assigning an upper passenger location to each of the at least one vehicle while transmitting the assigned unique identification code of the upper passenger location to the vehicle and its paired requester; the upper passenger seat is an upper passenger seat in an idle state in the upper passenger seat pool of the vehicle pairing requester.

In some embodiments, the network about automobile management system further comprises: the vehicle identification terminals are arranged at each boarding location in the boarding zone and are used for acquiring the unique identification code of the vehicle driving into the boarding location, and when the unique identification code of the vehicle is acquired, the vehicle dispatching terminal is triggered to start timing so as to acquire the occupied time of the boarding location. Of course, in other embodiments, the timing may be started by the vehicle dispatch terminal immediately after the passenger space is allocated.

In some embodiments, the vehicle dispatching terminal is further configured to identify a state of each boarding location based on an occupied time of each boarding location in the boarding area, and determine that the state of the boarding location is an idle state if the occupied time is less than or equal to a preset first time threshold; if the occupied time is larger than a preset third time threshold, judging that the state of the passenger position is the state to be idle. Further, if the occupied time is greater than a preset first time threshold but less than or equal to a preset second time threshold, judging that the state of the boarding guest is a state to be occupied; if the occupied time is larger than a preset second time threshold value but smaller than or equal to a preset third time threshold value, judging that the state of the boarding guest is an occupied state.

In some embodiments, the vehicle dispatching terminal is further configured to alarm when it is identified that the occupied time of any passenger space is greater than a fourth time threshold; and/or prompting the passenger position tension when the number of the passenger positions in the idle state is detected to be smaller than a preset number threshold value.

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising several instructions for causing a computer terminal (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method according to the embodiments of the present invention.

The embodiments of the present invention have been described above with reference to the accompanying drawings, but the present invention is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those having ordinary skill in the art without departing from the spirit of the present invention and the scope of the claims, which are to be protected by the present invention.

Claims

1. The network about automobile management method applied to the large public places is characterized by comprising the following steps of:

When at least one requester successfully paired in the first requester pool reaches a boarding area of the public place, transferring at least one boarding request of the at least one requester to a second requester pool of the boarding area, and respectively distributing a boarding pool for each requester according to a preset rule; simultaneously notifying the requester that the paired vehicle is going to the boarding zone; the boarding zone comprises a plurality of boarding pools, each boarding pool comprises a plurality of adjacent boarding sites, and the preset rule comprises the following steps: preferentially distributing the passenger pool containing the passenger seats in the most idle state;

2. The method for managing a network contract for a vehicle applied to a large public place according to claim 1, further comprising the steps of:

and if the occupied time is larger than a preset third time threshold, judging that the state of the boarding guest is about to be idle.

3. The method of claim 2, wherein when assigning an empty upper passenger space to the vehicle, the upper passenger space having an occupied time greater than a fourth time threshold is preferentially assigned from the pool of upper passenger spaces of the paired requesters; and if the occupied time is not more than the preset fourth time threshold, distributing the passenger positions of which the occupied time is more than the third time threshold but less than or equal to the fourth time threshold from the passenger position pool of the paired requesters.

4. The network contract car management method applied to a large public place according to claim 1, wherein the preset rules further include: when the upper passenger pool comprises at least one upper passenger in an idle state, and the upper passenger pool comprises the same upper passenger number in the idle state, preferentially matching the upper passenger pool closest to the requester; and when all the boarding pools have no boarding in the idle state, randomly distributing a boarding pool for the requester.

5. The method for managing a network contract for a vehicle applied to a large-scale public place according to claim 2, further comprising the steps of: and when the occupied time of any passenger seat is identified to be larger than a preset fourth time threshold value, alarming is carried out.

6. The method for managing a network contract for a vehicle applied to a large-scale public place according to claim 2, further comprising the steps of: and when the number of the passenger seats in the idle state is detected to be smaller than a preset number threshold, prompting passenger seat tension.

7. A network contract automotive management system for use in large public places, comprising:

At least one first terminal for transmitting a riding request;

8. The network contract automobile management system applied to a large public place according to claim 7, wherein the vehicle dispatching terminal is further configured to identify a state of each boarding location based on an occupied time of each boarding location in the boarding area, and determine that the state of the boarding location is an idle state if the occupied time is less than or equal to a preset first time threshold; and if the occupied time is larger than a preset third time threshold, judging that the state of the boarding guest is an idle state.

9. The network contract automotive management system applied to a large public place according to claim 8, wherein when the vehicle dispatching terminal allocates the upper passenger seat in an idle state to the vehicle, the upper passenger seat with occupied time greater than a preset fourth time threshold is preferentially allocated from the upper passenger seat pool of a pairing requester; and if the occupied time is not more than the preset fourth time threshold, distributing the passenger positions of which the occupied time is more than the third time threshold but less than or equal to the fourth time threshold from the passenger position pool of the paired requesters.

10. The network contract automobile management system applied to the large public places according to claim 8, wherein the automobile dispatching terminal is further used for alarming when the occupied time of any passenger seat is recognized to be larger than a preset fourth time threshold; and/or prompting the passenger position tension when the number of the passenger positions in the idle state is detected to be smaller than a preset number threshold value.