CN116863748B - AVP intelligent scheduling method and scheduling system - Google Patents

AVP intelligent scheduling method and scheduling system Download PDF

Info

Publication number
CN116863748B
CN116863748B CN202311092165.1A CN202311092165A CN116863748B CN 116863748 B CN116863748 B CN 116863748B CN 202311092165 A CN202311092165 A CN 202311092165A CN 116863748 B CN116863748 B CN 116863748B
Authority
CN
China
Prior art keywords
service
time
parking
vehicle
avp
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202311092165.1A
Other languages
Chinese (zh)
Other versions
CN116863748A (en
Inventor
赖俊楠
燕志强
彭积祥
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu Ebo Information Technology Co ltd
Original Assignee
Chengdu Ebo Information Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu Ebo Information Technology Co ltd filed Critical Chengdu Ebo Information Technology Co ltd
Priority to CN202311092165.1A priority Critical patent/CN116863748B/en
Publication of CN116863748A publication Critical patent/CN116863748A/en
Application granted granted Critical
Publication of CN116863748B publication Critical patent/CN116863748B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/14—Traffic control systems for road vehicles indicating individual free spaces in parking areas
    • G08G1/145—Traffic control systems for road vehicles indicating individual free spaces in parking areas where the indication depends on the parking areas
    • G08G1/148—Management of a network of parking areas
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0967—Systems involving transmission of highway information, e.g. weather, speed limits
    • G08G1/096708—Systems involving transmission of highway information, e.g. weather, speed limits where the received information might be used to generate an automatic action on the vehicle control
    • G08G1/096725—Systems involving transmission of highway information, e.g. weather, speed limits where the received information might be used to generate an automatic action on the vehicle control where the received information generates an automatic action on the vehicle control
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/09—Arrangements for giving variable traffic instructions
    • G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0967—Systems involving transmission of highway information, e.g. weather, speed limits
    • G08G1/096766—Systems involving transmission of highway information, e.g. weather, speed limits where the system is characterised by the origin of the information transmission
    • G08G1/096775—Systems involving transmission of highway information, e.g. weather, speed limits where the system is characterised by the origin of the information transmission where the origin of the information is a central station
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/207—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles with respect to certain areas, e.g. forbidden or allowed areas with possible alerting when inside or outside boundaries
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02—Services making use of location information
    • H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Atmospheric Sciences (AREA)
  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses an AVP intelligent scheduling method and scheduling system, the method is that a parking lot is divided into a plurality of service areas, an area to be separated from the parking lot and a long stop area; the AVP vehicle enters and authorizes, and pre-pushes available services according to the predicted parking time length T of the vehicle; and when the total consumption of the available service is calculated, if the total consumption exceeds T pre-set, carrying out service confirmation, outputting a sequencing mode with the shortest time consumption and total time consumption according to the last reserved available service, updating T pre-set, storing a to-be-serviced list, carrying out sequential processing, and carrying out parking scheduling after completion. The invention can provide available services for the car owners when the car owners park, intelligently allocate parking spaces where the vehicles are located according to the content of the available services and the congestion condition of the parking spaces, reasonably move each service area, and move the vehicles to the areas to be left near the exit in advance when the T pre-arrival happens, thereby realizing more intelligent and efficient parking experience, reducing the congestion of the parking spaces when the car owners enter the parking spaces, and improving the resource utilization rate of the parking spaces.

Description

AVP intelligent scheduling method and scheduling system
Technical Field
The invention relates to a vehicle dispatching method and system, in particular to an AVP intelligent dispatching method and system.
Background
With the continuous development and maturity of automatic driving technology, vehicles with autonomous parking auxiliary systems are gradually increased, and new challenges and opportunities are brought to parking lot management. Autonomous parking assistance system, also known as Automated Valet Parking, abbreviated AVP.
Conventional parking space planning and parking services are often static, i.e. when a vehicle is parked in a certain space, it does not leave the space until leaving the space. However, the existing parking lot has been expanded with services after charging, car washing, etc., and if the user wants to perform these services, the user needs to autonomously send the vehicle to the service area, and the advantages of the AVP autonomous parking assistance system cannot be utilized. In addition, the occupation of the charging parking spaces and the congestion of the entrances and exits in the peak period can influence the service providing efficiency of the parking lot. For example, when a vehicle owner needs to take a vehicle through AVP service, the vehicle may not be able to move out in time due to congestion in the field, so it has been difficult to meet the personalized needs and efficient travel requirements of the vehicle owner in a manner of simply parking the vehicle in a certain fixed parking space through the autonomous parking assistance system.
Disclosure of Invention
The invention aims to provide an intelligent scheduling method and system for AVP, which can reasonably allocate vehicles to corresponding parking spaces according to the needs of vehicle owners and effectively avoid situations such as vehicle lifting delay caused by parking lot congestion.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows: an intelligent scheduling method of AVP is applied to a parking lot management end capable of carrying out V2X communication with a vehicle machine system of an AVP vehicle, and comprises the following steps:
(1) Dividing a parking lot into a plurality of service areas, an area to be separated from the parking lot and a long parking area, wherein each service area can provide one service for an AVP vehicle, different service types of the service areas are different, and each area corresponds to a plurality of parking spaces, a preset scheduling duration T1, a timeout duration T2 and a list to be serviced;
(2) AVP vehicle entry and authorization;
(21) The parking lot management end receives a parking request of an AVP vehicle and predicts the predicted parking duration T of the AVP vehicle Pre-preparation ；
(22) Determining available services of the AVP vehicle;
acquiring the expected ending time of each service at present, and setting the expected ending time to be less than or equal to T Pre-preparation As a service available to the AVP vehicle;
the estimated end time T of one of the services Y =T Waiting for +T Service Wherein T is Waiting for Queuing latency for the service, T Service Service duration corresponding to the item service for the AVP vehicle;
(23) The parking lot management end inquires available services and contact phones required by the car owners through the car machine system, the car owners select the available services and input the contact phones through the car machine system, and the parking lot management end is authorized to schedule the car to move through V2X during parking;
(3) The available services are sequenced, and a sequencing mode with the shortest time consumption, the starting time, the ending time and the total time consumption of each available service in the sequencing mode are obtained;
(4) Service confirmation;
(41) If the total time consumption is greater than T Pre-preparation Confirming, by the vehicle owner, a reduction in available services, or determining a selected available service;
(42) If the owner reduces the available services, repeating the step (3) and the step (41) until the owner determines that the selected available services are available or the available services are reduced to be less than or equal to T when the total consumption is less than or equal to Pre-preparation ；
(43) Outputting the sequencing mode P with the shortest time consumption and the total time consumption T corresponding to the P according to the last reserved available service Total (S) ；
(44) Updating the estimated parking time period T Pre-preparation If T Total (S) ＞T Pre-preparation Then use T Total (S) Update T Pre-preparation Otherwise T Pre-preparation Unchanged;
(5) Storing the finally reserved available services into a to-be-serviced list in a sequencing mode P, wherein the to-be-serviced list is composed of a plurality of pieces of service data arranged according to time, and each piece of service data comprises a service type, a scheduling time, a starting time and an ending time; if the finally selected available service is 0 items, the list to be serviced is empty;
(6) The parking lot management end sequentially processes each piece of service data in the to-be-serviced list, if a departure instruction is received before the processing is finished, the unprocessed service data is canceled, and after the current service data is processed, the vehicle is moved to a parking lot outlet, wherein the processing method of one piece of service data comprises (61) - (63);
(61) Within the scheduling duration, scheduling the AVP vehicle to a corresponding service area;
(62) Waiting for executing the service, and updating the ending time of the service data after completing the service;
(63) Updating a to-be-serviced list of the AVP vehicle: updating the scheduling time, the starting time and the ending time of each piece of follow-up service data according to the ending time of the service data;
(7) If the list to be serviced is empty or all services in the list to be serviced are completed, carrying out parking scheduling on the AVP vehicle, wherein the parking scheduling comprises the steps (71) - (73);
(71) Calculating the departure time difference delta T;
if the list to be served is empty, calculating the current time and T Pre-preparation As DeltaT;
if all the services are completed, calculating the end time and T of the last service Pre-preparation As DeltaT;
(72) If delta T is less than or equal to T1, moving the AVP vehicle to a region to be departed from, otherwise, moving to a long stop region;
(73) Long stop area scheduling and to-be-off-site area scheduling;
and (5) long-stop area scheduling: timing AVP vehicles entering long stop zone at distance T Pre-preparation Before only T1 is left, if an departure instruction is received, the parking lot is moved from the long parking area to the parking lot exit, otherwise, the parking lot is moved from the long parking area to the parking lot exit at a distance T Pre-preparation When only T1 is left, moving from the long stop area to the area to be departed;
scheduling a region to be left: and (3) timing the AVP vehicle entering the to-be-departed area, if an departure instruction is received in T2, moving the vehicle from the to-be-departed area to the parking lot exit, otherwise, moving the vehicle back to the long parking area to wait for the departure instruction.
Preferably, the step (6) further includes a step (64);
(64) The to-be-serviced list of other AVP vehicles waiting for the service is updated, including a scheduled time, a start time, and an end time for each piece of service data.
Preferably, in the step (62), when the service is waiting to be executed, if the service is interrupted, the current service is canceled and the end time of the service data is updated.
Preferably, in the step (1), the area to be separated is an area in a parking lot, and the vehicle runs to an exit of the parking lot within 5 minutes at a speed V, wherein v=8-12 km/h.
Preferably, in step (21), the estimated parking time period T of the AVP vehicle is predicted Pre-preparation The method specifically comprises the following steps of;
presetting a query time length t, and querying whether the parking lot has a history parking record of the AVP vehicle in the time length t from the current moment forward;
if so, calculating the average parking time length in the AVP vehicle history parking record as T Pre-preparation ；
If not, taking the average parking time length of all vehicles in the parking lot within the time length T as T Pre-preparation ；
In step (22), for a service, the queuing time of the service is provided by the corresponding service area, and the service duration of the service is preset or input by the vehicle owner.
An intelligent scheduling system of an AVP (automatic Voltage regulator) is applied to a parking lot management end capable of carrying out V2X communication with a vehicle machine system of an AVP vehicle, wherein the parking lot is divided into a plurality of service areas, an area to be separated and a long parking area, each service area can provide one service for the AVP vehicle, different service types of the different service areas are different, each area corresponds to a plurality of parking spaces, and the parking lot management end is preset with a scheduling duration T1, a timeout duration T2 and a list to be serviced;
further comprises:
an estimated parking time length prediction unit for receiving a parking request of an AVP vehicle at a parking lot management end and predicting an estimated parking time length T of the AVP vehicle Pre-preparation ；
An available service screening unit for determining available service of the AVP vehicle, acquiring the expected ending time of each service, and setting the expected ending time less than or equal to T Pre-preparation As available services for the AVP vehicle, wherein the estimated end time T of one service Y =T Waiting for +T Service Wherein T is Waiting for Queuing latency for the service, T Service Service duration corresponding to the item service for the AVP vehicle;
the inquiring and acquiring authorization unit is used for inquiring available services and contact phones required by the vehicle owners through the vehicle machine system by the parking lot management end, selecting the available services and inputting the contact phones through the vehicle machine system by the vehicle owners, and authorizing the parking lot management end to schedule the vehicle to move through V2X during parking;
the ordering unit is used for ordering the available services to obtain an ordering mode with the shortest time consumption, and the starting time, the ending time and the total time consumption of each available service in the ordering mode;
the service confirmation unit comprises a user interaction unit, an information output unit and an expected parking duration updating unit; wherein the user interaction unit is used for if total time consumption is more than T Pre-preparation Confirming, by the vehicle owner, a reduction in available services, or determining a selected available service; if (42) if the vehicle owner reduces the available services, the ranking unit and the service confirmation unit are performed again until the vehicle owner determines that the available services are selected or the available services are reduced to be less than or equal to T when the total consumption is less than or equal to Pre-preparation The method comprises the steps of carrying out a first treatment on the surface of the The information output unit is configured to output a ranking mode P with the shortest time consumption and a total time consumption T corresponding to P according to the last reserved available service Total (S) The method comprises the steps of carrying out a first treatment on the surface of the The predicted parking time length updating unit is used for updating the predicted parking time length T Pre-preparation If T Total (S) ＞T Pre-preparation Then use T Total (S) Update T Pre-preparation Otherwise T Pre-preparation Unchanged;
the service waiting list storing unit is used for storing the finally reserved available services into a service waiting list in a sequencing mode P, wherein the service waiting list consists of a plurality of pieces of service data arranged according to time, and each piece of service data comprises a service type, a scheduling time, a starting time and an ending time; if the available service selected by the terminal is 0 items, the list to be served is empty;
the service processing unit comprises a first departure processing unit, a first scheduling unit and a list updating unit;
the first departure processing unit is used for canceling unprocessed service data when receiving a departure instruction before finishing processing of the to-be-serviced list, and moving the vehicle to a parking lot outlet after processing the current service data;
the first scheduling unit is used for scheduling the AVP vehicle to the corresponding service area according to the service data within the scheduling duration;
the list updating unit is used for updating a to-be-serviced list of the AVP vehicle, and particularly updating the scheduling time, the starting time and the ending time of each piece of follow-up service data according to the ending time of the service data;
the parking scheduling unit is used for performing parking scheduling on the AVP vehicle after the service list is empty or all the services in the to-be-serviced list are completed, and comprises an departure time difference calculating unit, a second scheduling unit, a long parking area scheduling unit and a to-be-departed area scheduling unit;
the departure time difference calculating unit is used for calculating the departure time difference DeltaT, and if the service list is empty, calculating the current time and T Pre-preparation As DeltaT; if all the services are completed, calculating the end time and T of the last service Pre-preparation As DeltaT;
the second scheduling unit is used for moving the AVP vehicle to the area to be departed when DeltaT is less than or equal to T1, and moving the AVP vehicle to the long stop area when DeltaT is more than T1;
the long stop area scheduling unit is used for timing the AVP vehicles entering the long stop area, and is at a distance T Pre-preparation Before only T1 is left, if an departure instruction is received, the parking lot is moved from the long parking area to the parking lot exit, otherwise, the parking lot is moved from the long parking area to the parking lot exit at a distance T Pre-preparation When only T1 is left, moving from the long stop area to the area to be departed;
the to-be-off-road area scheduling unit is used for timing the AVP vehicles entering the to-be-off-road area, if an off-road instruction is received in T2, the vehicles are moved from the to-be-off-road area to the exit of the parking lot, and otherwise, the vehicles are moved back to the long-parking area to wait for the off-road instruction.
Preferably, the service processing unit further includes a subsequent vehicle updating unit for updating a to-be-serviced list of other AVP vehicles waiting for the service, including a scheduled time, a start time, and an end time of each piece of service data.
Preferably, the list updating unit is further configured to cancel the current service and update the end time of the service data if the service is interrupted when the service is waiting to be executed.
Compared with the prior art, the invention has the advantages that: and more efficient, convenient and personalized parking service is provided for vehicle owners supporting the AVP service. The invention can provide available service for the car owners when the car owners park, intelligently allocate parking spaces where the vehicles are located according to service contents planned by the AVP vehicles during parking and parking lot congestion conditions, reasonably move to service areas such as charging, car washing and the like, and move the AVP to the area to be left near the exit in advance before the predicted departure time arrives, thereby realizing more intelligent and efficient parking experience, reducing parking lot congestion when entering and exiting, and improving the resource utilization rate of the parking lot.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a block diagram of a system of the present invention;
fig. 3 is a system block diagram of embodiment 2 of the present invention.
Detailed Description
The invention will be further described with reference to the accompanying drawings.
Example 1: referring to fig. 1 and 2, an intelligent scheduling method of AVP is applied to a parking lot management end capable of V2X communication with a vehicle-to-vehicle system of an AVP vehicle, and includes the steps of:
(1) Dividing a parking lot into a plurality of service areas, an area to be separated from the parking lot and a long parking area, wherein each service area can provide one service for an AVP vehicle, different service types of the service areas are different, and each area corresponds to a plurality of parking spaces, a preset scheduling duration T1, a timeout duration T2 and a list to be serviced;
(2) AVP vehicle entry and authorization;
(21) The parking lot management end receives a parking request of an AVP vehicle and predicts the predicted parking duration T of the AVP vehicle Pre-preparation ；
(22) Determining available services of the AVP vehicle;
acquiring the expected ending time of each service at present, and setting the expected ending time to be less than or equal to T Pre-preparation As a service available to the AVP vehicle;
the estimated end time T of one of the services Y =T Waiting for +T Service Wherein T is Waiting for Queuing latency for the service, T Service Service duration corresponding to the item service for the AVP vehicle;
(23) The parking lot management end inquires available services and contact phones required by the car owners through the car machine system, the car owners select the available services and input the contact phones through the car machine system, and the parking lot management end is authorized to schedule the car to move through V2X during parking;
(3) The available services are sequenced, and a sequencing mode with the shortest time consumption, the starting time, the ending time and the total time consumption of each available service in the sequencing mode are obtained;
(4) Service confirmation;
(41) If the total time consumption is greater than T Pre-preparation Confirming, by the vehicle owner, a reduction in available services, or determining a selected available service;
(42) If the owner reduces the available services, repeating the step (3) and the step (41) until the owner determines that the selected available services are available or the available services are reduced to be less than or equal to T when the total consumption is less than or equal to Pre-preparation ；
(43) Outputting the sequencing mode P with the shortest time consumption and the total time consumption T corresponding to the P according to the last reserved available service Total (S) ；
(44) Updating the estimated parking time period T Pre-preparation If T Total (S) ＞T Pre-preparation Then use T Total (S) Update T Pre-preparation Otherwise T Pre-preparation Unchanged;
(5) Storing the finally reserved available services into a to-be-serviced list in a sequencing mode P, wherein the to-be-serviced list is composed of a plurality of pieces of service data arranged according to time, and each piece of service data comprises a service type, a scheduling time, a starting time and an ending time; if the finally selected available service is 0 items, the list to be serviced is empty;
(6) The parking lot management end sequentially processes each piece of service data in the to-be-serviced list, if a departure instruction is received before the processing is finished, the unprocessed service data is canceled, and after the current service data is processed, the vehicle is moved to a parking lot outlet, wherein the processing method of one piece of service data comprises (61) - (63);
(61) Within the scheduling duration, scheduling the AVP vehicle to a corresponding service area;
(62) Waiting for executing the service, and updating the ending time of the service data after completing the service;
(63) Updating a to-be-serviced list of the AVP vehicle: updating the scheduling time, the starting time and the ending time of each piece of follow-up service data according to the ending time of the service data;
(7) If the list to be serviced is empty or all services in the list to be serviced are completed, carrying out parking scheduling on the AVP vehicle, wherein the parking scheduling comprises the steps (71) - (73);
(71) Calculating the departure time difference delta T;
if the list to be served is empty, calculating the current time and T Pre-preparation As DeltaT;
if all the services are completed, calculating the end time and T of the last service Pre-preparation As DeltaT;
(72) If delta T is less than or equal to T1, moving the AVP vehicle to a region to be departed from, otherwise, moving to a long stop region;
(73) Long stop area scheduling and to-be-off-site area scheduling;
and (5) long-stop area scheduling: timing AVP vehicles entering long stop zone at distance T Pre-preparation Before only T1 is left, if an departure instruction is received, the parking lot is moved from the long parking area to the parking lot exit, otherwise, the parking lot is moved from the long parking area to the parking lot exit at a distance T Pre-preparation When only T1 is left, moving from the long stop area to the area to be departed;
scheduling a region to be left: and (3) timing the AVP vehicle entering the to-be-departed area, if an departure instruction is received in T2, moving the vehicle from the to-be-departed area to the parking lot exit, otherwise, moving the vehicle back to the long parking area to wait for the departure instruction.
In the step (62), when waiting for executing the service, if the service is interrupted, the current service is canceled, and the end time of the service data is updated.
In the step (1), the area to be separated is an area in a parking lot, and the vehicle runs to an exit of the parking lot within 5 minutes at a speed V, wherein v=8-12 km/h.
In step (21), the estimated parking time period T of the AVP vehicle is predicted Pre-preparation The method specifically comprises the following steps of;
presetting a query time length t, and querying whether the parking lot has a history parking record of the AVP vehicle in the time length t from the current moment forward;
if so, calculating the average parking time length in the AVP vehicle history parking record as T Pre-preparation ；
If not, taking the average parking time length of all vehicles in the parking lot within the time length T as T Pre-preparation ；
In step (22), for a service, the queuing time of the service is provided by the corresponding service area, and the service duration of the service is preset or input by the vehicle owner.
An intelligent scheduling system of an AVP (automatic Voltage regulator) is applied to a parking lot management end capable of carrying out V2X communication with a vehicle machine system of an AVP vehicle, wherein the parking lot is divided into a plurality of service areas, an area to be separated and a long parking area, each service area can provide one service for the AVP vehicle, different service types of the different service areas are different, each area corresponds to a plurality of parking spaces, and the parking lot management end is preset with a scheduling duration T1, a timeout duration T2 and a list to be serviced; further comprises:
an estimated parking time length prediction unit for receiving a parking request of an AVP vehicle at a parking lot management end and predicting an estimated parking time length T of the AVP vehicle Pre-preparation ；
An available service screening unit for determining available service of the AVP vehicle, acquiring the expected ending time of each service, and setting the expected ending time less than or equal to T Pre-preparation As available services for the AVP vehicle, wherein the estimated end time T of one service Y =T Waiting for +T Service Wherein T is Waiting for Queuing latency for the service, T Service Service duration corresponding to the item service for the AVP vehicle;
the inquiring and acquiring authorization unit is used for inquiring available services and contact phones required by the vehicle owners through the vehicle machine system by the parking lot management end, selecting the available services and inputting the contact phones through the vehicle machine system by the vehicle owners, and authorizing the parking lot management end to schedule the vehicle to move through V2X during parking;
the ordering unit is used for ordering the available services to obtain an ordering mode with the shortest time consumption, and the starting time, the ending time and the total time consumption of each available service in the ordering mode;
the service confirmation unit comprises a user interaction unit, an information output unit and an expected parking duration updating unit; wherein the user interaction unit is used for if total time consumption is more than T Pre-preparation Confirming, by the vehicle owner, a reduction in available services, or determining a selected available service; if (42) if the vehicle owner reduces the available services, the ranking unit and the service confirmation unit are performed again until the vehicle owner determines that the available services are selected or the available services are reduced to be less than or equal to T when the total consumption is less than or equal to Pre-preparation The method comprises the steps of carrying out a first treatment on the surface of the The information output unit is configured to output a ranking mode P with the shortest time consumption and a total time consumption T corresponding to P according to the last reserved available service Total (S) The method comprises the steps of carrying out a first treatment on the surface of the The predicted parking time length updating unit is used for updating the predicted parking time length T Pre-preparation If T Total (S) ＞T Pre-preparation Then use T Total (S) Update T Pre-preparation Otherwise T Pre-preparation Unchanged;
the service waiting list storing unit is used for storing the finally reserved available services into a service waiting list in a sequencing mode P, wherein the service waiting list consists of a plurality of pieces of service data arranged according to time, and each piece of service data comprises a service type, a scheduling time, a starting time and an ending time; if the available service selected by the terminal is 0 items, the list to be served is empty;
the service processing unit comprises a first departure processing unit, a first scheduling unit and a list updating unit;
the first departure processing unit is used for canceling unprocessed service data when receiving a departure instruction before finishing processing of the to-be-serviced list, and moving the vehicle to a parking lot outlet after processing the current service data;
the first scheduling unit is used for scheduling the AVP vehicle to the corresponding service area according to the service data within the scheduling duration;
the list updating unit is used for updating a to-be-serviced list of the AVP vehicle, and particularly updating the scheduling time, the starting time and the ending time of each piece of follow-up service data according to the ending time of the service data;
the parking scheduling unit is used for performing parking scheduling on the AVP vehicle after the service list is empty or all the services in the to-be-serviced list are completed, and comprises an departure time difference calculating unit, a second scheduling unit, a long parking area scheduling unit and a to-be-departed area scheduling unit;
the departure time difference calculating unit is used for calculating the departure time difference DeltaT, and if the service list is empty, calculating the current time and T Pre-preparation As DeltaT; if all the services are completed, calculating the end time and T of the last service Pre-preparation As DeltaT;
the second scheduling unit is used for moving the AVP vehicle to the area to be departed when DeltaT is less than or equal to T1, and moving the AVP vehicle to the long stop area when DeltaT is more than T1;
the long stop area scheduling unit is used for timing the AVP vehicles entering the long stop area, and is at a distance T Pre-preparation Before only T1 is left, if an departure instruction is received, the parking lot is moved from the long parking area to the parking lot exit, otherwise, the parking lot is moved from the long parking area to the parking lot exit at a distance T Pre-preparation When only T1 is left, moving from the long stop area to the area to be departed;
the to-be-off-road area scheduling unit is used for timing the AVP vehicles entering the to-be-off-road area, if an off-road instruction is received in T2, the vehicles are moved from the to-be-off-road area to the exit of the parking lot, and otherwise, the vehicles are moved back to the long-parking area to wait for the off-road instruction.
In this embodiment, the manifest updating unit is further configured to cancel the current service and update the end time of the piece of service data if the service is interrupted while waiting for executing the service.
Example 2: with reference to fig. 1 and 2, for a clearer illustration of the solution of the invention, based on example 1, we further describe the following:
queuing latency with respect to step (22) of the present invention: for a service, the queuing time of the service is provided by a corresponding service area, specifically, for example, the service is a charging service, the service area can be pre-installed with a public charging station queuing time estimation system, and the queuing time is estimated according to the number of current service vehicles, the waiting number, the service duration of the service vehicles and the like. For example, the service is a car washing service, the service area can be provided with a corresponding service queuing time estimation system in advance, and the queuing time of the service is output.
Regarding the service duration of step (22) of the present invention: for one service, the service duration can be preset, the owner inputs the setting according to the requirement, or the average duration of the service according to the specific content. For example, in the car washing service, the average duration of the service is set to 20 minutes, in the vehicle maintenance service, the average duration of the service is set to 30 minutes, and in the charging service, the charging duration can be calculated according to the remaining capacity of the vehicle.
Ordering of available services with respect to step (3) of the present invention: this ordering is prior art and one way is given here, but is not limited to this in practice.
The sorting mode is as follows: the available services selected by the vehicle owner are ordered first according to the sequence of the expected ending time, and then calibrated, for example:
(1) The owner selects 3 services in total: car washing service, overhaul service and charging service.
(2) The car washing service does not need queuing and has a service duration of 20 minutes, so the service end time=0+20 minutes=20 minutes is expected, the maintenance service needs queuing for 20 minutes and has a service duration of 30 minutes, the service end time=20 minutes+30 minutes=50 minutes is expected, the charging service does not need waiting, but the service duration is about 2 hours according to the residual capacity of the car.
(3) Sequencing: sequencing according to the sequence of the expected ending time to obtain the following sequence: car washing service, overhaul service and charging service.
(4) Calibration to get the start time and end time of each available service. The car washing service does not need to wait, the service time is 20 minutes, after the car washing service is finished, the queuing time of the maintenance service is just reached, the car washing service can be directly maintained, the total maintenance service needs 30 minutes, two services are completed for about 50 minutes, the charging service does not need to wait at present, the charging time is 2 hours, and three services are completed and are expected to be 2 hours and 50 minutes. At the current time T When (when) For example, we can get an initial service list as shown in table 1:
table 1: initial service list
In practice, vehicles cannot move instantaneously from one service area to another directly, and require time to dispatch. For example, when a first service is performed, a vehicle needs to be dispatched from a parking lot entrance to a service area of the service, and before the first service ends and a second service starts, a vehicle needs to be dispatched from a service area of the first service to a service area of the second service. Each time of scheduling has a starting time point, which is called scheduling time, each time of scheduling has a period of time, the values of the preset scheduling time periods T1 and T1 are set according to the size of a parking lot, for the convenience of statistics, a period of scheduling time period T1 is added before each service starts, and a more reasonable optimized service list can be obtained by combining with the table 1, and the optimized service list is shown in the table 2 on the assumption that the scheduling time is 10 minutes.
Table 2: optimizing a list of services
Regarding service confirmation in step (4):
assuming that the total time taken by step (3) is 200 minutes, howeverThe estimated parking time period T of the AVP vehicle Pre-preparation For 2 hours = 120 minutes, then total time consumption > T Pre-preparation Confirming by the vehicle owner that the available service is reduced or that the selected available service is determined via step (41);
if the owner does require these services, then a confirmation is made that the AVP vehicle is predicted to be parked for a period of time T Pre-preparation 200 minutes is reached, if the main service is reduced, then it is reduced as required, and if the charging service is reduced, then the total consumption becomes 70 minutes, less than T Pre-preparation The estimated parking time period T of the AVP vehicle Pre-preparation The time period was constant and was still 2 hours.
Suppose that the owner eventually reserves the available service as 2: car washing service and charging service. Assuming that the current time is 14:00 pm, we output the ranking mode P with the shortest time consumption and the total time consumption T corresponding to P Total (S) ；
1. Car washing service, scheduling time 14:00, starting time 14:10 and ending time 14:30;
2. charging service, scheduling time 14:30, start time 14:40, end time 16:40;
3. total time consuming: 2 hours and 40 minutes.
Since the total time is longer than the estimated parking time period T Pre-preparation 2 hours, so update T Pre-preparation For 2 hours 40 minutes.
Regarding step (5): storing the finally reserved available service ordering mode P in a to-be-serviced list, and table 3:
table 3: to-be-serviced inventory of AVP vehicles
The parking lot management end only needs to schedule the vehicles to the corresponding areas according to the to-be-serviced list. Assuming in step (4) that the owner does not select any available services, the list of to-be-serviced is empty.
Regarding step (6), the departure instruction sent by the vehicle owner to the vehicle-mounted system has the highest priority, if the departure instruction is received in the processing list to be serviced, the current service is completed, and otherwise, the current service is carried out according to the list to be serviced. This step consists mainly in updating the list of AVP vehicles to be serviced. Specific updating methods are given here in connection with table 3 and step (6).
Processing the first piece of service data as in steps (61) - (63):
scheduling vehicles from the entrances to the carwash service areas during 14:00-14:10;
waiting for the corresponding staff to provide the car washing service, and updating the ending time of the first piece of service data according to the time of completing the service. At this time, there may be three cases, completion in advance, completion on time, completion postponed. In any case, the corresponding end time of the service is updated, and the scheduling time, start time, and end time of each piece of service data are updated.
For example: and if the car washing service is finished 5 minutes in advance, updating the corresponding finishing time of the car washing service to be 14:25, and sequentially advancing the scheduling time, the starting time and the finishing time of the subsequent charging service by 5 minutes. And during the period 14:25-14:35, dispatching the vehicle from the carwash service area to the charging service area.
For another example, due to ingress congestion, the time for dispatching the vehicle from the ingress to the carwash service area is timed out, resulting in a delay of 5 minutes from the vehicle to the carwash service area, a delay of 5 minutes from the carwash service, and a final delay of 10 minutes from the end time of the carwash service, the end time of the updated carwash service is 14:40, and the dispatch time, start time, and end time of the subsequent charging service are sequentially delayed by 10 minutes. And during the period 14:40-14:50, dispatching the vehicle from the carwash service area to the charging service area.
For another example, at 16:00 the owner sends a departure instruction, at which time the car wash service is completed, charging service is being carried out, and the charging service is terminated immediately, and the vehicle is dispatched to the exit. If the car owner sends an departure instruction at 14:20, and car washing service is performed at the moment, and the service cannot be interrupted, waiting for car washing to finish, and dispatching the car to an outlet.
When the vehicle is being washed, or the vehicle is being charged, the service is cancelled immediately, and the cancelled time is taken as the end time of the service, and each piece of follow-up service data is updated.
Regarding step (7), mainly parking scheduling. The purpose is to make the vehicle move to the area closer to the exit when the vehicle possibly leaves the ground, so that the time for the vehicle owner to lift the vehicle is shorter and the speed is faster.
If the vehicle owner selects the service and still receives no departure instruction after the service is completed, calculating departure time difference delta T, or if the vehicle owner does not select any service, directly calculating departure time difference delta T according to the current time, judging whether the vehicle should stop in a long stop area or a departure area according to the departure time difference delta T, and executing corresponding scheduling.
The steps (6) and (7) are all the scheduling and dynamic correction of the AVP vehicle.
Example 3: with reference to fig. 1 to 3, we further perfect this solution on the basis of example 1 and example 2. The embodiment mainly adds linkage service of other AVP vehicles. In the intelligent scheduling method of AVP of the present invention, the step (6) further includes a step (64);
(64) The to-be-serviced list of other AVP vehicles waiting for the service is updated, including a scheduled time, a start time, and an end time for each piece of service data.
In the intelligent scheduling system of AVP of the present invention, the service processing unit further includes a subsequent vehicle updating unit for updating a to-be-serviced list of other AVP vehicles waiting for the service, including a scheduling time, a start time, and an end time of each service data.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, and alternatives falling within the spirit and principles of the invention.

Claims (8)

1. An intelligent scheduling method of AVP is applied to a parking lot management end capable of carrying out V2X communication with a vehicle machine system of an AVP vehicle, and is characterized by comprising the following steps:
(1) Dividing a parking lot into a plurality of service areas, an area to be separated from the parking lot and a long parking area, wherein each service area can provide one service for an AVP vehicle, different service types of the service areas are different, and each area corresponds to a plurality of parking spaces, a preset scheduling duration T1, a timeout duration T2 and a list to be serviced;
(2) AVP vehicle entry and authorization;
(21) The parking lot management end receives a parking request of an AVP vehicle and predicts the predicted parking duration T of the AVP vehicle Pre-preparation ；
(22) Determining available services of the AVP vehicle;
acquiring the expected ending time of each service at present, and setting the expected ending time to be less than or equal to T Pre-preparation As a service available to the AVP vehicle;
the estimated end time T of one of the services Y =T Waiting for +T Service Wherein T is Waiting for Queuing latency for the service, T Service Service duration corresponding to the item service for the AVP vehicle;
(23) The parking lot management end inquires available services and contact phones required by the car owners through the car machine system, the car owners select the available services and input the contact phones through the car machine system, and the parking lot management end is authorized to schedule the car to move through V2X during parking;
(3) The available services are sequenced, and a sequencing mode with the shortest time consumption, the starting time, the ending time and the total time consumption of each available service in the sequencing mode are obtained;
(4) Service confirmation;
(41) If the total time consumption is greater than T Pre-preparation Confirming, by the vehicle owner, a reduction in available services, or determining a selected available service;
(42) If the owner reduces the available services, repeating the step (3) and the step (41) until the owner determines that the selected available services are available or the available services are reduced to be less than or equal to T when the total consumption is less than or equal to Pre-preparation ；
(43) Outputting the sequencing mode P with the shortest time consumption and the total time consumption T corresponding to the P according to the last reserved available service Total (S) ；
(44) Updating the estimated parking time period T Pre-preparation If T Total (S) ＞T Pre-preparation Then use T Total (S) Update T Pre-preparation Otherwise T Pre-preparation Unchanged;
(5) Storing the finally reserved available services into a to-be-serviced list in a sequencing mode P, wherein the to-be-serviced list is composed of a plurality of pieces of service data arranged according to time, and each piece of service data comprises a service type, a scheduling time, a starting time and an ending time; if the finally selected available service is 0 items, the list to be serviced is empty;
(6) The parking lot management end sequentially processes each piece of service data in the to-be-serviced list, if a departure instruction is received before the processing is finished, the unprocessed service data is canceled, and after the current service data is processed, the vehicle is moved to a parking lot outlet, wherein the processing method of one piece of service data comprises (61) - (63);
(61) Within the scheduling duration, scheduling the AVP vehicle to a corresponding service area;
(62) Waiting for executing the service, and updating the ending time of the service data after completing the service;
(63) Updating a to-be-serviced list of the AVP vehicle: updating the scheduling time, the starting time and the ending time of each piece of follow-up service data according to the ending time of the service data;
(7) If the list to be serviced is empty or all services in the list to be serviced are completed, carrying out parking scheduling on the AVP vehicle, wherein the parking scheduling comprises the steps (71) - (73);
(71) Calculating the departure time difference delta T;
if the list to be served is empty, calculating the current time and T Pre-preparation As DeltaT;
if all the services are completed, calculating the end time and T of the last service Pre-preparation As DeltaT;
(72) If delta T is less than or equal to T1, moving the AVP vehicle to a region to be departed from, otherwise, moving to a long stop region;
(73) Long stop area scheduling and to-be-off-site area scheduling;
and (5) long-stop area scheduling: timing AVP vehicles entering long stop zone at distance T Pre-preparation Before only T1 is left, if an departure instruction is received, the parking lot is moved from the long parking area to the parking lot exit, otherwise, the parking lot is moved from the long parking area to the parking lot exit at a distance T Pre-preparation When only T1 is left, moving from the long stop area to the area to be departed;
scheduling a region to be left: and (3) timing the AVP vehicle entering the to-be-departed area, if an departure instruction is received in T2, moving the vehicle from the to-be-departed area to the parking lot exit, otherwise, moving the vehicle back to the long parking area to wait for the departure instruction.
2. The intelligent scheduling method of AVPs according to claim 1, wherein said step (6) further comprises step (64);
(64) The to-be-serviced list of other AVP vehicles waiting for the service is updated, including a scheduled time, a start time, and an end time for each piece of service data.
3. The intelligent scheduling method of AVP according to claim 1, wherein in the step (62), when waiting for the execution of the service, if the service is interrupted, the current service is canceled and the end time of the piece of service data is updated.
4. The intelligent scheduling method of AVP according to claim 1, wherein in step (1), the area to be departed is an area where a vehicle travels to an exit of a parking lot within 5 minutes at a speed V, and v=8-12 km/h.
5. The intelligent scheduling method of AVP according to claim 1, wherein in step (21), the predicted parking time period T of the AVP vehicle is predicted Pre-preparation The method specifically comprises the following steps of;
presetting a query time length t, and querying whether the parking lot has a history parking record of the AVP vehicle in the time length t from the current moment forward;
if so, calculating the average parking time length in the AVP vehicle history parking record as T Pre-preparation ；
If not, taking the average parking time length of all vehicles in the parking lot within the time length T as T Pre-preparation ；
In step (22), for a service, the queuing time of the service is provided by the corresponding service area, and the service duration of the service is preset or input by the vehicle owner.
6. An intelligent scheduling system of AVP is applied to a parking lot management end capable of carrying out V2X communication with a vehicle machine system of an AVP vehicle, and is characterized in that,
the parking lot is divided into a plurality of service areas, an area to be separated from the parking lot and a long parking area, each service area can provide one service for the AVP vehicle, different service types of the service areas are different, each area corresponds to a plurality of parking spaces, and a scheduling duration T1, a timeout duration T2 and a list to be serviced are preset at the parking lot management end;
further comprises:
an estimated parking time length prediction unit for receiving a parking request of an AVP vehicle at a parking lot management end and predicting an estimated parking time length T of the AVP vehicle Pre-preparation ；
An available service screening unit for determining available service of the AVP vehicle, acquiring the expected ending time of each service, and setting the expected ending time less than or equal to T Pre-preparation As available services for the AVP vehicle, wherein the estimated end time T of one service Y =T Waiting for +T Service Wherein T is Waiting for Queuing latency for the service, T Service Service duration corresponding to the item service for the AVP vehicle;
the inquiring and acquiring authorization unit is used for inquiring available services and contact phones required by the vehicle owners through the vehicle machine system by the parking lot management end, selecting the available services and inputting the contact phones through the vehicle machine system by the vehicle owners, and authorizing the parking lot management end to schedule the vehicle to move through V2X during parking;
the ordering unit is used for ordering the available services to obtain an ordering mode with the shortest time consumption, and the starting time, the ending time and the total time consumption of each available service in the ordering mode;
the service confirmation unit comprises a user interaction unit, an information output unit and an expected parking duration updating unit; wherein the user interaction unit is used for if total time consumption is more than T Pre-preparation Confirming, by the vehicle owner, a reduction in available services, or determining a selected available service; if the owner reduces the available service, the sorting unit and the service confirmation unit are carried out again until the owner confirms that the available service is selected or the available service is reduced to be less than or equal to T when the total consumption is reduced Pre-preparation The method comprises the steps of carrying out a first treatment on the surface of the The information output unit is configured to output a ranking mode P with the shortest time consumption and a total time consumption T corresponding to P according to the last reserved available service Total (S) The method comprises the steps of carrying out a first treatment on the surface of the The predicted parking time length updating unit is used for updating the predicted parking time length T Pre-preparation If T Total (S) ＞T Pre-preparation Then use T Total (S) Update T Pre-preparation Otherwise T Pre-preparation Unchanged;
the service waiting list storing unit is used for storing the finally reserved available services into a service waiting list in a sequencing mode P, wherein the service waiting list consists of a plurality of pieces of service data arranged according to time, and each piece of service data comprises a service type, a scheduling time, a starting time and an ending time; if the available service selected by the terminal is 0 items, the list to be served is empty;
the service processing unit comprises a first departure processing unit, a first scheduling unit and a list updating unit;
the first departure processing unit is used for canceling unprocessed service data when receiving a departure instruction before finishing processing of the to-be-serviced list, and moving the vehicle to a parking lot outlet after processing the current service data;
the first scheduling unit is used for scheduling the AVP vehicle to the corresponding service area according to the service data within the scheduling duration;
the list updating unit is used for updating a to-be-serviced list of the AVP vehicle, and particularly updating the scheduling time, the starting time and the ending time of each piece of follow-up service data according to the ending time of the service data;
the parking scheduling unit is used for performing parking scheduling on the AVP vehicle after the service list is empty or all the services in the to-be-serviced list are completed, and comprises an departure time difference calculating unit, a second scheduling unit, a long parking area scheduling unit and a to-be-departed area scheduling unit;
the departure time difference calculating unit is used for calculating the departure time difference DeltaT, and if the service list is empty, calculating the current time and T Pre-preparation As DeltaT; if all the services are completed, calculating the end time and T of the last service Pre-preparation As DeltaT;
the second scheduling unit is used for moving the AVP vehicle to the area to be departed when DeltaT is less than or equal to T1, and moving the AVP vehicle to the long stop area when DeltaT is more than T1;
the long stop area scheduling unit is used for timing the AVP vehicles entering the long stop area, and is at a distance T Pre-preparation Before only T1 is left, if an departure instruction is received, the parking lot is moved from the long parking area to the parking lot exit, otherwise, the parking lot is moved from the long parking area to the parking lot exit at a distance T Pre-preparation When only T1 is left, moving from the long stop area to the area to be departed;
the to-be-off-road area scheduling unit is used for timing the AVP vehicles entering the to-be-off-road area, if an off-road instruction is received in T2, the vehicles are moved from the to-be-off-road area to the exit of the parking lot, and otherwise, the vehicles are moved back to the long-parking area to wait for the off-road instruction.
7. The intelligent scheduling system of AVP of claim 6, wherein said service processing unit further comprises a subsequent vehicle updating unit for updating a list of to-be-serviced by other AVP vehicles waiting for the service, including a scheduling time, a start time, and an end time for each piece of service data.
8. The intelligent scheduling system of AVP according to claim 6, wherein said list updating unit is further configured to cancel the current service and update the end time of the service data if the service is interrupted while waiting for the execution of the service.
CN202311092165.1A 2023-08-29 2023-08-29 AVP intelligent scheduling method and scheduling system Active CN116863748B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311092165.1A CN116863748B (en) 2023-08-29 2023-08-29 AVP intelligent scheduling method and scheduling system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311092165.1A CN116863748B (en) 2023-08-29 2023-08-29 AVP intelligent scheduling method and scheduling system

Publications (2)

Publication Number Publication Date
CN116863748A CN116863748A (en) 2023-10-10
CN116863748B true CN116863748B (en) 2023-11-28

Family

ID=88225312

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311092165.1A Active CN116863748B (en) 2023-08-29 2023-08-29 AVP intelligent scheduling method and scheduling system

Country Status (1)

Country Link
CN (1) CN116863748B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN118470948B (en) * 2024-07-12 2024-09-06 成都宜泊信息科技有限公司 Scheduling method and system for coping with AVP parking lot congestion or emergency

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07282397A (en) * 1994-04-11 1995-10-27 Ishikawajima Harima Heavy Ind Co Ltd Method for controlling parking lot
AU2010288152A1 (en) * 2009-08-31 2012-02-16 Parx Ltd Fully automated parking system
CN106652543A (en) * 2016-12-13 2017-05-10 杭州联络互动信息科技股份有限公司 Regional and time-phased timing charge parking lot vehicle finding method, device and system
CN109658733A (en) * 2018-12-28 2019-04-19 北京摩拜科技有限公司 Acquisition methods, server and the Vehicular system of parking area
CN110047327A (en) * 2019-05-22 2019-07-23 哈尔滨工业大学 The method parked based on vehicle parking time guidance vehicle subregion
CN110555917A (en) * 2019-08-15 2019-12-10 同济大学 Differentiated charging method for parking lot based on RFID technology
CN110952815A (en) * 2019-12-16 2020-04-03 吉林大学 Automatic parking system based on parking robot and operation method thereof
CN112071115A (en) * 2020-09-17 2020-12-11 湖南汽车工程职业学院 Intelligent parking system based on 5G and Internet of things
CN112991560A (en) * 2021-05-13 2021-06-18 成都宜泊信息科技有限公司 Vehicle departure management method and system, storage medium and electronic equipment
CN113269957A (en) * 2021-03-19 2021-08-17 青岛亿联信息科技股份有限公司 Parking lot parking space scheduling system and method
CN113632133A (en) * 2019-03-29 2021-11-09 松下知识产权经营株式会社 Vehicle management device, vehicle management method, and vehicle
CN114333094A (en) * 2021-12-31 2022-04-12 宁波小遛共享信息科技有限公司 Vehicle scheduling method and device, terminal equipment and medium
CN115171423A (en) * 2022-06-24 2022-10-11 上海智能网联汽车技术中心有限公司 Parking lot system supporting unmanned area linkage and vehicle scheduling method
WO2023044721A1 (en) * 2021-09-24 2023-03-30 Intel Corporation Infrastructure-based collaborative automated parking and location management
WO2023072101A1 (en) * 2021-10-26 2023-05-04 华为技术有限公司 Vehicle control method, apparatus and system

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6683539B2 (en) * 2001-12-27 2004-01-27 Koninklijke Philips Electronics N.V. Computer vision based parking assistant
US10964209B2 (en) * 2003-12-24 2021-03-30 Mark W. Publicover Method and system for traffic and parking management
US9213957B2 (en) * 2012-09-21 2015-12-15 Palo Alto Research Center Incorporated Computer-implemented system and method for providing just-in-time loading zone parking
US20170267233A1 (en) * 2016-03-15 2017-09-21 Cruise Automation, Inc. Method for autonomous vehicle parking

Patent Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH07282397A (en) * 1994-04-11 1995-10-27 Ishikawajima Harima Heavy Ind Co Ltd Method for controlling parking lot
AU2010288152A1 (en) * 2009-08-31 2012-02-16 Parx Ltd Fully automated parking system
CN106652543A (en) * 2016-12-13 2017-05-10 杭州联络互动信息科技股份有限公司 Regional and time-phased timing charge parking lot vehicle finding method, device and system
CN109658733A (en) * 2018-12-28 2019-04-19 北京摩拜科技有限公司 Acquisition methods, server and the Vehicular system of parking area
CN113632133A (en) * 2019-03-29 2021-11-09 松下知识产权经营株式会社 Vehicle management device, vehicle management method, and vehicle
CN110047327A (en) * 2019-05-22 2019-07-23 哈尔滨工业大学 The method parked based on vehicle parking time guidance vehicle subregion
CN110555917A (en) * 2019-08-15 2019-12-10 同济大学 Differentiated charging method for parking lot based on RFID technology
CN110952815A (en) * 2019-12-16 2020-04-03 吉林大学 Automatic parking system based on parking robot and operation method thereof
CN112071115A (en) * 2020-09-17 2020-12-11 湖南汽车工程职业学院 Intelligent parking system based on 5G and Internet of things
CN113269957A (en) * 2021-03-19 2021-08-17 青岛亿联信息科技股份有限公司 Parking lot parking space scheduling system and method
CN112991560A (en) * 2021-05-13 2021-06-18 成都宜泊信息科技有限公司 Vehicle departure management method and system, storage medium and electronic equipment
WO2023044721A1 (en) * 2021-09-24 2023-03-30 Intel Corporation Infrastructure-based collaborative automated parking and location management
WO2023072101A1 (en) * 2021-10-26 2023-05-04 华为技术有限公司 Vehicle control method, apparatus and system
CN114333094A (en) * 2021-12-31 2022-04-12 宁波小遛共享信息科技有限公司 Vehicle scheduling method and device, terminal equipment and medium
CN115171423A (en) * 2022-06-24 2022-10-11 上海智能网联汽车技术中心有限公司 Parking lot system supporting unmanned area linkage and vehicle scheduling method

Also Published As

Publication number Publication date
CN116863748A (en) 2023-10-10

Similar Documents

Publication Publication Date Title
US20180361870A1 (en) Smart-charging apparatus for use with electric-vehicle-sharing stations
CN116863748B (en) AVP intelligent scheduling method and scheduling system
CN110120159B (en) Control device
CN110892601B (en) Intelligent charging scheduling device and method for electric vehicle
US20190057312A1 (en) Method and system for providing transportation service
CN107103383B (en) Dynamic taxi sharing scheduling method based on taxi-taking hotspot
CN108986503A (en) The dispatching method and system of automatic driving vehicle
CN110068347A (en) The method and apparatus of route planning for combined charge demand
JP2023169216A (en) Parking control device, parking control method, parking lot management device, and parking lot management method
CN113469514B (en) Network appointment vehicle dispatching method and device based on appointment orders and electronic equipment
CN111178716B (en) Automatic driving taxi empty scheduling method for auction type
CN112185009B (en) Intelligent scheduling method for charging pile and server
CN111815937B (en) Control method and device for dispatching of super-parking vehicles, storage medium and electronic equipment
CN112562206A (en) Intelligent scheduling method, system and server for new energy shared automobile
CN113888807A (en) Vehicle management system and vehicle management method
CN112541675A (en) Scheduling control method, device and system of vehicle system
CN107437129B (en) Reservation sheet processing method and server
CN106991484B (en) Secondary resource reservation method based on intelligent repeated reservation
CN111340984A (en) Taxi booking method and device based on digital key and electronic equipment
CN113516391A (en) Method for processing vehicle inspection task, computing device and storage medium
CN117455182A (en) Intelligent distribution method and system for network appointment vehicles
CN115409346B (en) Scheduling method and system for park low-speed unmanned vehicles and management cloud platform
CN110853333A (en) Reservation order dispatching method and device based on real-time single-stroke vehicle
CN107437208A (en) Order processing method and server
CN115187101A (en) Automatic driving network car booking operation method, device and equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant