CN114937352B - Intelligent scheduling method and system suitable for fleet cloud service - Google Patents

Intelligent scheduling method and system suitable for fleet cloud service Download PDF

Info

Publication number
CN114937352B
CN114937352B CN202210874496.XA CN202210874496A CN114937352B CN 114937352 B CN114937352 B CN 114937352B CN 202210874496 A CN202210874496 A CN 202210874496A CN 114937352 B CN114937352 B CN 114937352B
Authority
CN
China
Prior art keywords
vehicle
positioning data
distance
fleet
latitude
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
CN202210874496.XA
Other languages
Chinese (zh)
Other versions
CN114937352A (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.)
Feibao Nanjing Intelligent Technology Co ltd
Original Assignee
Feibao Nanjing Intelligent 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 Feibao Nanjing Intelligent Technology Co ltd filed Critical Feibao Nanjing Intelligent Technology Co ltd
Priority to CN202210874496.XA priority Critical patent/CN114937352B/en
Publication of CN114937352A publication Critical patent/CN114937352A/en
Application granted granted Critical
Publication of CN114937352B publication Critical patent/CN114937352B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/22—Platooning, i.e. convoy of communicating vehicles
    • 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
    • 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/029—Location-based management or tracking services
    • 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]

Abstract

The invention provides an intelligent scheduling method and system suitable for fleet cloud service, comprising the steps that a vehicle machine of each vehicle uploads positioning data to a fleet cloud server, and the fleet cloud server generates a driving direction according to a starting point and a stopping point; determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating a sequencing set in the driving direction; calculating to obtain a first interval distance and a second interval distance according to the number of vehicles and the types of the vehicles in the sorting set; if the first positioning data and the third positioning data do not meet the requirement of the first spacing distance, sending a deceleration scheduling prompt to a vehicle machine of a vehicle code corresponding to the first positioning data; and if the second positioning data and the third positioning data do not meet the requirement of the second spacing distance, sending a speed-up scheduling prompt to the vehicle machine of the vehicle code corresponding to the second positioning data.

Description

Intelligent scheduling method and system suitable for cloud service of fleet
Technical Field
The invention relates to the technical field of data processing, in particular to an intelligent scheduling method and system suitable for cloud service of a fleet.
Background
When large quantities of goods are transported and a large number of personnel are dispatched, the goods are generally transported by using a plurality of vehicles in a unified way, and at the moment, the plurality of vehicles form a transportation fleet. In order to ensure that goods uniformly arrive at a specified place (such as a certain gas station and a certain service area), and simultaneously enable a plurality of vehicles to assist each other when an emergency occurs, and facilitate a manager to manage the vehicles in a fleet, the overall length of the fleet needs to be controlled to prevent the vehicles from falling behind.
On the premise of achieving the purpose of controlling the overall length of a fleet, the distance between vehicles needs to be monitored, and corresponding scheduling is performed when the distance between the vehicles does not meet corresponding requirements. Therefore, a scheduling method is needed to monitor the distance between vehicles in a fleet and schedule corresponding vehicles so that all vehicles in the fleet have a suitable distance.
Disclosure of Invention
The embodiment of the invention provides an intelligent scheduling method and system suitable for a fleet cloud service, which can monitor the distance between vehicles in a fleet, and remind and schedule a driver in time when the distance between certain vehicles in the fleet does not meet the requirement, so that all vehicles in the fleet have a proper distance.
In a first aspect of the embodiments of the present invention, an intelligent scheduling method applicable to a fleet cloud service is provided, including:
receiving fleet configuration data of a user, the fleet configuration data including vehicle codes, starting points, and ending points of a plurality of vehicles;
in the running process of a motorcade, the vehicle machine of each vehicle uploads positioning data to a motorcade cloud server, and the motorcade cloud server generates a running direction according to the starting point and the ending point after judging that the positioning data corresponding to each vehicle code is received in real time;
determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating a sequencing set in the driving direction;
extracting first positioning data of a vehicle closest to the end point, second positioning data of a vehicle closest to the start point and third positioning data of a vehicle centered in the sequencing set in real time;
calculating a first spacing distance and a second spacing distance according to the number of vehicles and the types of the vehicles in the sorting set, wherein the first spacing distance is the required distance between the vehicle closest to the end point and the vehicle in the middle, and the second spacing distance is the required distance between the vehicle closest to the start point and the vehicle in the middle;
if the first positioning data and the third positioning data do not meet the requirement of the first spacing distance, sending a deceleration scheduling prompt to a vehicle machine of a vehicle code corresponding to the first positioning data;
and if the second positioning data and the third positioning data are judged not to meet the requirement of the second spacing distance, sending a speed-up scheduling prompt to a vehicle machine of the vehicle code corresponding to the second positioning data.
In a second aspect of the embodiments of the present invention, an intelligent scheduling system suitable for a fleet cloud service is provided, including:
a receiving module for receiving fleet configuration data of a user, the fleet configuration data including vehicle codes, starting points, and ending points of a plurality of vehicles;
the generation module is used for uploading positioning data to a fleet cloud server by a vehicle machine of each vehicle in the running process of a fleet, and the fleet cloud server generates a running direction according to the starting point and the end point after judging that the positioning data corresponding to each vehicle code is received in real time;
the determining module is used for determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code and generating a sequencing set in the driving direction;
the extraction module is used for extracting first positioning data of a vehicle closest to an end point, second positioning data of a vehicle closest to a start point and third positioning data of a vehicle in the middle in the sequencing set in real time;
the calculation module is used for calculating a first spacing distance and a second spacing distance according to the number of vehicles and the types of the vehicles in the sorting set, wherein the first spacing distance is the required distance between the vehicle closest to the end point and the vehicle in the center, and the second spacing distance is the required distance between the vehicle closest to the start point and the vehicle in the center;
the first reminding module is used for sending a deceleration scheduling reminding to a vehicle machine of a vehicle code corresponding to the first positioning data if the first positioning data and the third positioning data are judged not to meet the requirement of the first spacing distance;
and the second reminding module is used for sending a speed-up scheduling reminder to a vehicle machine of a vehicle code corresponding to the second positioning data if the second positioning data and the third positioning data are judged not to meet the requirement of the second spacing distance.
Has the beneficial effects that:
1. according to the scheme, the vehicles are sequenced according to the positioning data and the driving directions corresponding to the vehicle codes in the fleet to obtain a sequencing set in the corresponding driving directions, then a head vehicle, a middle vehicle and a tail vehicle are determined by combining the sequencing set, and a first spacing distance and a second spacing distance are calculated. Controlling the speed of the head car by using the first spacing distance so as to control the distance between the head car and the middle car and realize the management of all the cars between the head car and the middle car; controlling the speed of the tail car by using the second spacing distance so as to control the distance between the tail car and the middle car and realize the management of all the cars between the tail car and the middle car; the sectional adjustment and control of the motorcade are realized through the mode, and the control of the overall length of the motorcade can be effectively realized;
2. the scheme can obtain the sequencing set by adopting two modes. One is to combine the longitude direction and the longitude value to obtain a corresponding sorting set, and meanwhile, in the process of obtaining the sorting set, the scheme adopts different sorting modes in combination with different pairs of sorting sets in the longitude direction, so that the last vehicle in the sorting set is the vehicle closest to the end point, and the first vehicle in the sorting set is the vehicle closest to the start point; the other method is to combine the latitude direction and the latitude value to obtain a corresponding sequencing set, and meanwhile, in the process of obtaining the sequencing set, different sequencing modes are adopted for the sequencing sets according to different latitude directions, so that the last vehicle in the sequencing set is the vehicle closest to the end point, and the first vehicle in the sequencing set is the vehicle closest to the start point; according to the scheme, the vehicles in the sorted set are sorted in sequence in the driving direction, and the head data, the tail data and the middle data in the sorted set are directly processed in the subsequent calculation, so that the data processing efficiency is improved, and the data processing amount is reduced;
3. in the process of calculating the first spacing distance and the second spacing distance, the first spacing distance and the second spacing distance which are suitable for the types of the vehicles and the number of the vehicles can be obtained by comprehensively calculating by referring to the number of the vehicles, the types of the vehicles and other factors, so that the first spacing distance and the second spacing distance can be adjusted by adapting to different scenes, a proper adjustment range can be obtained, and the fleet can be flexibly adjusted and controlled.
Drawings
Fig. 1 is a schematic flowchart of an intelligent scheduling method suitable for a cloud service of a fleet according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an intelligent scheduling system suitable for a fleet cloud service according to the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein.
It should be understood that, in various embodiments of the present invention, the sequence numbers of the processes do not mean the execution sequence, and the execution sequence of the processes should be determined by the functions and the internal logic of the processes, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
It should be understood that in the present application, "comprising" and "having" and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that, in the present invention, "a plurality" means two or more. "and/or" is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "comprising a, B and C", "comprising a, B, C" means that all three of a, B, C are comprised, "comprising a, B or C" means comprising one of a, B, C, "comprising a, B and/or C" means comprising any 1 or any 2 or 3 of a, B, C.
It should be understood that in the present invention, "B corresponding to a", "a corresponds to B", or "B corresponds to a" means that B is associated with a, and B can be determined from a. Determining B from a does not mean determining B from a alone, but may be determined from a and/or other information. And the matching of A and B means that the similarity of A and B is greater than or equal to a preset threshold value.
As used herein, the term "if" may be interpreted as "at \8230; …" or "in response to a determination" or "in response to a detection" depending on the context.
The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Referring to fig. 1, which is a schematic flow diagram of an intelligent scheduling method suitable for a fleet cloud service provided in an embodiment of the present invention, the intelligent scheduling method suitable for the fleet cloud service includes S1-S7:
s1, fleet configuration data of a user are received, wherein the fleet configuration data comprise vehicle codes, starting points and ending points of a plurality of vehicles.
The scheme firstly allocates relevant data to the motorcade, and the allocation data comprises vehicle codes, a starting point and an ending point.
Illustratively, the fleet includes 5 vehicles, and needs to reach point B from point a, the scheme sets a vehicle code, for example {1,2,3,4,5}, with a starting point at point a and an ending point at point B.
And S2, in the running process of the motorcade, the vehicle machine of each vehicle uploads positioning data to a motorcade cloud server, and the motorcade cloud server generates a running direction according to the starting point and the end point after judging that the positioning data corresponding to each vehicle code is received in real time.
In the process that the motorcade reaches the point B from the point A, the motorcade cloud server uploads positioning data to the motorcade cloud server, and the motorcade cloud server generates a driving direction according to the starting point and the ending point after judging that the positioning data corresponding to each vehicle code is received in real time, for example, after judging that the motorcade cloud server receives the positioning data corresponding to 5 vehicle codes in real time, the driving direction is generated according to the point A and the point B.
In some embodiments, S2 (in the process of driving the fleet, the vehicle machine of each vehicle uploads positioning data to a fleet cloud server, and the fleet cloud server generates a driving direction according to the starting point and the ending point after determining that the positioning data corresponding to each vehicle code is received in real time) includes S21-S24:
s21, acquiring a starting coordinate of the starting point and an ending coordinate of the ending point, wherein the starting coordinate comprises a starting longitude and a starting latitude, and the ending coordinate comprises an ending longitude and an ending latitude.
Illustratively, the starting coordinate of the starting point A is: (A) ((B))
Figure 542843DEST_PATH_IMAGE001
，
Figure 194404DEST_PATH_IMAGE002
) Wherein the starting longitude may be
Figure 66152DEST_PATH_IMAGE001
The starting dimension may be
Figure 195782DEST_PATH_IMAGE002
(ii) a The termination point B has termination coordinates of (A)
Figure 744575DEST_PATH_IMAGE003
，
Figure 426092DEST_PATH_IMAGE004
) Wherein the end longitude may be
Figure 161967DEST_PATH_IMAGE003
The terminating dimension may be
Figure 954342DEST_PATH_IMAGE004
。
And S22, comparing the starting longitude with the ending longitude to obtain a longitude direction, wherein the longitude direction is a longitude value increment or a longitude value decrement.
It will be appreciated that the present scheme will start longitude
Figure 357642DEST_PATH_IMAGE001
And end longitude
Figure 85426DEST_PATH_IMAGE003
By comparison, if the starting longitude
Figure 433231DEST_PATH_IMAGE001
Less than end longitude
Figure 639085DEST_PATH_IMAGE003
A longitude value indicating a longitude direction is incremented; similarly, if the start longitude
Figure 896891DEST_PATH_IMAGE001
Greater than end longitude
Figure 687254DEST_PATH_IMAGE004
The longitude value in the longitude direction is described as decreasing.
And S23, comparing the starting latitude with the ending latitude to obtain a latitude direction, wherein the latitude direction is latitude value increase or latitude value decrease.
It will be appreciated that the present scheme will start dimension
Figure 663301DEST_PATH_IMAGE002
And terminating dimension
Figure 407266DEST_PATH_IMAGE004
Comparing if starting dimension
Figure 909791DEST_PATH_IMAGE002
Less than the terminal dimension
Figure 713799DEST_PATH_IMAGE004
The dimension value of the dimension direction is stated to be increased; similarly, if the starting dimension is
Figure 177141DEST_PATH_IMAGE002
Greater than the terminating dimension
Figure 849431DEST_PATH_IMAGE004
The dimension values in the dimension direction are said to be decreasing.
And S24, obtaining the driving direction of the motorcade according to any one or more of the longitude direction and the latitude direction.
It can be understood that the driving direction of the fleet can be determined according to the longitude direction, the driving direction of the fleet can also be determined according to the latitude direction, and the driving direction of the fleet can also be obtained by combining the longitude direction and the latitude direction.
And S3, determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating a sequencing set in the driving direction.
According to the scheme, the queuing sequence of each vehicle is determined according to the positioning data and the driving direction obtained in the step, and a sequencing set in the driving direction is obtained.
The scheme may utilize the following two embodiments to determine the relevant sorted sets:
first, a related sorting set is obtained according to the longitude direction, which is as follows:
in some embodiments, S3 (determining the queuing order of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating the sorted set in the driving direction) includes S31-S33:
and S31, when the driving direction is the longitude direction, extracting longitude positioning information in positioning data corresponding to each vehicle code.
It can be understood that the present solution is to determine in the longitudinal direction, so longitudinal positioning information in the positioning data corresponding to each vehicle code is extracted.
And S32, if the driving direction is the longitudinal direction and the longitudinal value is increased, sorting all the vehicle codes in an ascending order according to the longitudinal positioning information of the vehicle codes, and generating a sorting set in the driving direction.
It will be appreciated that if the direction of travel is longitudinal and the longitude value increases, the present solution will sort all vehicle codes in ascending order according to their longitudinal position information, generating a sorted set in the direction of travel.
Illustratively, the sorted set in the direction of travel may be {1,2,3,4,5}. Among them, the longitudinal positioning information in {1,2,3,4,5} is sequentially enlarged.
When the longitude information increases in the longitudinal direction and the longitude values increase in sequence, the vehicle corresponding to the number 5 in {1,2,3,4,5} is closest to the ending point B, and similarly, the vehicle corresponding to the number 1 is farthest from the ending point B.
And S33, if the driving direction is the longitudinal direction and the longitudinal value is decreased, sorting all the vehicle codes in descending order according to the longitudinal positioning information thereof, and generating a sorting set in the driving direction.
Contrary to step S32, if the driving direction is the longitudinal direction and the longitudinal value decreases, the present solution sorts all vehicle codes in descending order according to their longitudinal positioning information, and generates a sorted set in the driving direction.
Illustratively, the sorted set in the direction of travel may be {5,4,3,2,1}. Wherein the longitude positioning information in {5,4,3,2,1} is successively smaller.
When the longitude is decreased in the longitudinal direction and the longitude is sequentially decreased, the vehicle corresponding to the number 1 in {5,4,3,2,1} is closest to the end point B, and similarly, the vehicle corresponding to the number 5 is farthest from the end point B.
Secondly, a related sorting set is obtained according to the latitude direction, which specifically includes:
in other embodiments, S3 (determining the queuing order of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating the sorted set in the driving direction) includes S34 to S36:
and S34, when the driving direction is the latitude direction, latitude positioning information in the positioning data corresponding to each vehicle code is extracted.
It can be understood that the present solution is judged in the latitudinal direction, so that the latitudinal positioning information in the positioning data corresponding to each vehicle code is extracted.
And S35, if the driving direction is the latitude direction and the latitude value is increased, sorting all the vehicle codes in an ascending order according to the latitude positioning information of the vehicles, and generating a sorting set in the driving direction.
It can be understood that if the driving direction is the latitude direction and the latitude value is increased, the scheme sorts all the vehicle codes according to the latitude positioning information in an ascending order, and generates a sorted set in the driving direction.
Illustratively, the sorted set in the direction of travel may be {1,2,3,4,5}. Among them, the latitude positioning information in {1,2,3,4,5} is sequentially larger.
When the latitude position information increases in the latitude direction and the latitude values increase in order, the vehicle number 5 corresponding to {1,2,3,4,5} is closest to the ending point B, and similarly, the vehicle number 1 is farthest from the ending point B.
And S36, if the driving direction is the latitude direction and the latitude value is reduced, sorting all the vehicle codes in a descending order according to the latitude positioning information of the vehicle codes, and generating a sorting set in the driving direction.
Contrary to step S35, if the driving direction is the latitude direction and the latitude value decreases, the present solution sorts all the vehicle codes in descending order according to their latitude positioning information, and generates a sorted set in the driving direction.
Illustratively, the sorted set in the direction of travel may be {5,4,3,2,1}. Among them, the latitude positioning information in {5,4,3,2,1} becomes smaller in turn.
It should be noted that, when the latitude is decreased in the latitude direction, and the latitude positioning information is sequentially decreased, the vehicle numbered 1 in {5,4,3,2,1} is closest to the ending point B, and similarly, the vehicle numbered 5 is farthest from the ending point B.
It can be understood that the vehicle corresponding to the last code in the sorted set determined by the two methods is closest to the termination point B, and the vehicle corresponding to the first code is farthest from the termination point B.
And S4, extracting the first positioning data of the vehicle closest to the end point, the second positioning data of the vehicle closest to the start point and the third positioning data of the vehicle in the middle in the sequencing set in real time.
This scheme will obtain 3 positioning data, be the first positioning data of the nearest vehicle of distance termination point in the sequencing set respectively to and the second positioning data of the nearest vehicle of distance starting point, and the third positioning data of the vehicle placed in the middle.
It can be understood that the scheme can acquire the positioning data of the head car, the tail car and the intermediate car.
In some embodiments, S4 (said extracting in real time first positioning data of a vehicle closest to the end point, second positioning data of a vehicle closest to the start point, third positioning data of a vehicle centered within the sorted set) comprises S41-S44:
s41, extracting the vehicle corresponding to the last vehicle code in the sequencing set as the vehicle closest to the end point, and determining the positioning data of the vehicle closest to the end point as the first positioning data.
It can be understood that the vehicle corresponding to the last code in the sorted set determined in step S3 is closest to the termination point B, and the vehicle corresponding to the first code is farthest from the termination point B.
According to the scheme, the vehicle corresponding to the last vehicle code in the sequencing set is extracted as the vehicle closest to the end point, and then the positioning data of the vehicle closest to the end point is determined as the first positioning data.
Illustratively, the vehicle closest to the end point corresponds to 5 of {1,2,3,4,5} or 1 of {5,4,3,2,1}.
And S42, extracting a vehicle corresponding to the first vehicle code in the sequencing set as a vehicle closest to the starting point, and determining the positioning data of the vehicle closest to the starting point as second positioning data.
According to the scheme, the vehicle corresponding to the first vehicle code in the sequencing set is extracted to serve as the vehicle closest to the starting point, and then the positioning data of the vehicle closest to the starting point is determined to serve as the second positioning data.
Illustratively, the vehicle closest to the starting point corresponds to 1 of {1,2,3,4,5} or 5 of {5,4,3,2,1}.
And S43, if the number of the vehicle codes in the sorting set is judged to be an odd number, the positioning data corresponding to the vehicle code in the middle of the sorting set is taken as third positioning data.
Illustratively, if the number of vehicle codes in {1,2,3,4,5} is 5,5 is odd, the present solution will set the positioning data corresponding to the vehicle code (3) centered in the sorted set as the third positioning data.
And S44, if the number of the vehicle codes in the sequencing set is judged to be an even number, taking the positioning data corresponding to 2 centered vehicle codes in the sequencing set as fourth positioning data, and taking the average value of the two fourth positioning data as third positioning data.
For example, if the number of vehicle codes in {1,2,3,4} is 4,4 is an even number, the present solution will take the positioning data corresponding to the vehicle codes (2 and 3) located in the middle of the sorted set as the fourth positioning data, and then take the average of the two fourth positioning data as the third positioning data.
It should be noted that this scheme is applicable to 3 and scenes more than 3, need 3 cars at least and can form the motorcade of this scheme, and to 2 and 1 scenes, because the vehicle is less, fine regulation and control between the driver need not this scheme and intervene the calculation.
And S5, calculating to obtain a first spacing distance and a second spacing distance according to the number of the vehicles and the types of the vehicles in the sorting set, wherein the first spacing distance is the required distance between the vehicle closest to the end point and the vehicle in the middle, and the second spacing distance is the required distance between the vehicle closest to the start point and the vehicle in the middle.
This scheme will calculate the required distance of the nearest vehicle of distance termination point and the vehicle placed in the middle, obtain first separation distance, will calculate the required distance of the nearest vehicle of distance starting point and the vehicle placed in the middle, obtain the second separation distance.
In some embodiments, S5 (the first separation distance and the second separation distance are calculated according to the number of vehicles and the types of vehicles in the sorted set, the first separation distance is a required distance between a vehicle closest to the end point and a centered vehicle, and the second separation distance is a required distance between a vehicle closest to the start point and the centered vehicle) includes S51:
and S51, acquiring a standard spacing distance corresponding to the vehicle type.
It is understood that the vehicles are of different types and the standard separation distance is different, for example, the standard separation distance for large trucks may be 1000 meters, and the standard separation distance for small trucks may be 600 meters.
And S52, comparing the number of the vehicles with a preset number to obtain a distance conversion coefficient, and calculating according to the distance conversion coefficient and the standard spacing distance to obtain the current spacing distance.
The distance conversion coefficient is larger, the number of vehicles indicating a fleet is larger, the number of vehicles is larger, the corresponding current spacing distance is larger, and therefore the current spacing distance can be calculated according to the distance conversion coefficient and the standard spacing distance, and the current spacing distance is obtained.
The current separation distance is calculated by the following formula,
Figure 81829DEST_PATH_IMAGE005
wherein, the first and the second end of the pipe are connected with each other,
Figure 587897DEST_PATH_IMAGE006
for the purpose of the current separation distance,
Figure 132011DEST_PATH_IMAGE007
as to the number of vehicles,
Figure 748937DEST_PATH_IMAGE008
in order to be a predetermined number of the components,
Figure 835842DEST_PATH_IMAGE009
the value is normalized for the quantity,
Figure 870401DEST_PATH_IMAGE010
in order to convert the coefficients for the distance,
Figure 42756DEST_PATH_IMAGE011
is a standard separation distance, and is,
Figure 56848DEST_PATH_IMAGE012
is a preset constant value;
number of vehicles in the above formula
Figure 263839DEST_PATH_IMAGE006
The larger the corresponding distance conversion coefficient
Figure 111709DEST_PATH_IMAGE010
The larger the corresponding current separation distance
Figure 630415DEST_PATH_IMAGE006
The larger.
Wherein the preset number
Figure 589144DEST_PATH_IMAGE013
May be 2, preset constant value
Figure 385061DEST_PATH_IMAGE012
May be 3.
S53, acquiring the number of first intervals between the vehicle closest to the end point and the vehicle in the middle, and calculating according to the number of the first intervals, the current interval distance and the first distance weight value to obtain the first interval distance.
It should be noted that, the larger the number of the first spacing segments is, the larger the current spacing distance is, and the larger the corresponding first spacing distance is.
And S54, acquiring the number of second interval segments of the vehicle closest to the starting point and the vehicle in the middle, and calculating according to the number of the second interval segments, the current interval distance and the second distance weight value to obtain a second interval distance.
It should be noted that, the larger the number of the second spacing segments is, the larger the current spacing distance is, and the larger the corresponding second spacing distance is.
Wherein the first spacing distance and the second spacing distance are calculated by the following formulas,
Figure 403833DEST_PATH_IMAGE014
wherein, the first and the second end of the pipe are connected with each other,
Figure 675414DEST_PATH_IMAGE015
the first distance is a distance between the first and second electrodes,
Figure 172255DEST_PATH_IMAGE016
the number of the first interval segments is,
Figure 88258DEST_PATH_IMAGE017
is a first weight value of the distance,
Figure 638451DEST_PATH_IMAGE018
for the second separation distance, the first separation distance,
Figure 272694DEST_PATH_IMAGE019
the number of the second interval segments is,
Figure 573225DEST_PATH_IMAGE020
is the second distance weight value.
In the above formula, the first distance weight value
Figure 609315DEST_PATH_IMAGE017
And a second distance weight value
Figure 828943DEST_PATH_IMAGE021
May be preset manually.
And S6, if the first positioning data and the third positioning data are judged not to meet the requirement of the first spacing distance, sending a deceleration scheduling prompt to a vehicle machine of the vehicle code corresponding to the first positioning data.
It can be understood that, if the first positioning data and the third positioning data do not satisfy the requirement of the first separation distance, which indicates that the distance between the head car and the intermediate car is too large, the scheme can send the deceleration scheduling prompt to the car machine of the car code corresponding to the first positioning data, so as to reduce the distance between the head car and the intermediate car, and enable the first positioning data and the third positioning data to satisfy the requirement of the first separation distance.
In some embodiments, S6 (if it is determined that the first positioning data and the third positioning data do not satisfy the requirement of the first separation distance, sending a deceleration scheduling reminder to a vehicle machine of a vehicle code corresponding to the first positioning data) includes:
and calculating according to the first positioning data and the third positioning data to obtain the first monitoring distance information, and if the first monitoring distance information is greater than the first spacing distance, sending a deceleration scheduling prompt to a vehicle machine of a vehicle code corresponding to the first positioning data. It can be understood that, this scheme can be calculated first locating data, third locating data, obtains first monitoring distance information, if first monitoring distance information is greater than first interval distance explains that the distance between first car and the middle car is too big, can send the speed reduction scheduling to the car machine of the vehicle code that first locating data corresponds and remind this moment to reduce the distance between first car and the middle car, make first locating data and third locating data satisfy the requirement of first interval distance.
The first monitoring distance information is calculated by the following formula,
Figure 950483DEST_PATH_IMAGE022
wherein, the first and the second end of the pipe are connected with each other,
Figure 54705DEST_PATH_IMAGE023
in order to monitor the distance information for the first time,
Figure 538776DEST_PATH_IMAGE024
as the longitude information in the first positioning data,
Figure 70252DEST_PATH_IMAGE025
as the longitude information in the third positioning data,
Figure 413508DEST_PATH_IMAGE026
as latitude information in the first positioning data,
Figure 321422DEST_PATH_IMAGE027
for the latitude information in the third positioning data,
Figure 191158DEST_PATH_IMAGE028
is a distance conversion value.
In the above formula, the first monitoring distance information can be obtained by using longitude difference and latitude difference
Figure 627955DEST_PATH_IMAGE023
. Wherein the distance conversion value
Figure 458508DEST_PATH_IMAGE028
May be preset manually.
And S7, if the second positioning data and the third positioning data are judged not to meet the requirement of the second spacing distance, sending a speed-up scheduling prompt to the vehicle machine with the vehicle code corresponding to the second positioning data.
It can be understood that, if the second positioning data and the third positioning data do not satisfy the requirement of the second spacing distance, it indicates that the distance between the tail car and the intermediate car is too large, and the speed-raising scheduling reminder can be sent to the car machine of the vehicle code corresponding to the second positioning data in the scheme, so as to reduce the distance between the tail car and the intermediate car, and the second positioning data and the third positioning data satisfy the requirement of the second spacing distance.
In some embodiments, S7 (if it is determined that the second positioning data and the third positioning data do not satisfy the requirement of the second separation distance, the sending of the speed-up scheduling reminder to the vehicle machine of the vehicle code corresponding to the second positioning data) includes:
and calculating according to the second positioning data and the third positioning data to obtain second monitoring distance information, and if the second monitoring distance information is greater than the second spacing distance, sending a speed-up scheduling prompt to a vehicle machine of a vehicle code corresponding to the second positioning data. It can be understood that this scheme can be calculated second positioning data, third positioning data, obtains second monitoring distance information, if second monitoring distance information is greater than second interval distance explains that the distance between trailer and the middle car is too big, can send the speed raising dispatch to the car machine of the vehicle code that the second positioning data corresponds and remind this moment to reduce the distance between trailer and the middle car, make second positioning data and third positioning data satisfy the requirement of second interval distance.
The second monitoring distance information is calculated by the following formula,
Figure 527702DEST_PATH_IMAGE029
wherein the content of the first and second substances,
Figure 127310DEST_PATH_IMAGE030
for the second monitored-distance information to be,
Figure 588DEST_PATH_IMAGE031
as the longitude information in the second positioning data,
Figure 318437DEST_PATH_IMAGE025
as the longitude information in the third positioning data,
Figure 427207DEST_PATH_IMAGE032
for the latitude information in the second positioning data,
Figure 146902DEST_PATH_IMAGE033
for the latitude information in the third positioning data,
Figure 191081DEST_PATH_IMAGE028
is a distance conversion value.
In the above formula, the second monitoring distance information can be obtained by using longitude difference and latitude difference
Figure 996226DEST_PATH_IMAGE030
. Wherein the distance conversion value
Figure 908687DEST_PATH_IMAGE028
May be preset manually.
Referring to fig. 2, the schematic structural diagram of the intelligent scheduling system suitable for the cloud service of the fleet according to the present embodiment is shown, and the intelligent scheduling system suitable for the cloud service of the fleet includes:
a receiving module for receiving fleet configuration data of a user, the fleet configuration data including vehicle codes, starting points, and ending points of a plurality of vehicles;
the generation module is used for uploading positioning data to a fleet cloud server by a vehicle machine of each vehicle in the running process of a fleet, and the fleet cloud server generates a running direction according to the starting point and the end point after judging that the positioning data corresponding to each vehicle code is received in real time;
the determining module is used for determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code and generating a sequencing set in the driving direction;
the extraction module is used for extracting first positioning data of a vehicle closest to the end point, second positioning data of the vehicle closest to the start point and third positioning data of a vehicle centered in the sequencing set in real time;
the calculation module is used for calculating a first spacing distance and a second spacing distance according to the number of vehicles and the types of the vehicles in the sorting set, wherein the first spacing distance is the required distance between the vehicle closest to the end point and the vehicle in the center, and the second spacing distance is the required distance between the vehicle closest to the start point and the vehicle in the center;
the first reminding module is used for sending a deceleration scheduling reminding to a vehicle machine of a vehicle code corresponding to the first positioning data if the first positioning data and the third positioning data are judged not to meet the requirement of the first spacing distance;
and the second reminding module is used for sending a speed-up scheduling reminding to the vehicle machine of the vehicle code corresponding to the second positioning data if the requirement of the second spacing distance is not met between the second positioning data and the third positioning data.
The apparatus in the embodiment shown in fig. 2 may be correspondingly used to perform the steps in the method embodiment shown in fig. 1, and the implementation principle and technical effects are similar, which are not described herein again.
The present invention also provides a storage medium having a computer program stored therein, the computer program being executable by a processor to implement the methods provided by the various embodiments described above.
The storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, a storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuits (ASIC). Additionally, the ASIC may reside in user equipment. Of course, the processor and the storage medium may reside as discrete components in a communication device. The storage medium may be read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, optical data storage devices, and the like.
The present invention also provides a program product comprising execution instructions stored in a storage medium. The at least one processor of the device may read the execution instructions from the storage medium, and the execution of the execution instructions by the at least one processor causes the device to implement the methods provided by the various embodiments described above.
In the embodiment of the terminal or the server, it should be understood that the Processor may be a Central Processing Unit (CPU), other general-purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), and the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (8)

1. An intelligent scheduling method suitable for a fleet cloud service is characterized by comprising the following steps:
receiving fleet configuration data for a user, the fleet configuration data including vehicle codes, starting points, and ending points for a plurality of vehicles;
in the running process of a motorcade, the vehicle machine of each vehicle uploads positioning data to a motorcade cloud server, and the motorcade cloud server generates a running direction according to the starting point and the ending point after judging that the positioning data corresponding to each vehicle code is received in real time;
determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating a sequencing set in the driving direction;
extracting first positioning data of a vehicle closest to the end point, second positioning data of a vehicle closest to the start point and third positioning data of a vehicle in the middle in the sequencing set in real time;
calculating a first spacing distance and a second spacing distance according to the number of vehicles and the types of the vehicles in the sorting set, wherein the first spacing distance is the required distance between the vehicle closest to the end point and the vehicle in the middle, and the second spacing distance is the required distance between the vehicle closest to the start point and the vehicle in the middle;
if the first positioning data and the third positioning data are judged not to meet the requirement of the first spacing distance, sending a deceleration scheduling prompt to a vehicle machine of a vehicle code corresponding to the first positioning data;
if the second positioning data and the third positioning data are judged not to meet the requirement of a second spacing distance, a speed-up scheduling prompt is sent to a vehicle machine with a vehicle code corresponding to the second positioning data;
the calculating according to the number of vehicles and the types of vehicles in the sorting set to obtain a first spacing distance and a second spacing distance, wherein the first spacing distance is a required distance between a vehicle closest to the end point and a centered vehicle, and the second spacing distance is a required distance between a vehicle closest to the start point and the centered vehicle, and the method comprises the following steps:
acquiring a standard spacing distance corresponding to the vehicle type;
comparing the number of the vehicles with a preset number to obtain a distance conversion coefficient, and calculating according to the distance conversion coefficient and a standard spacing distance to obtain a current spacing distance;
the current separation distance is calculated by the following formula,
Figure 825160DEST_PATH_IMAGE002
wherein the content of the first and second substances,
Figure 324275DEST_PATH_IMAGE003
is the current separation distance and is the current separation distance,
Figure 420407DEST_PATH_IMAGE004
as to the number of vehicles,
Figure 866431DEST_PATH_IMAGE005
in order to be a predetermined number of the components,
Figure 403723DEST_PATH_IMAGE006
the value is normalized for the quantity,
Figure 73739DEST_PATH_IMAGE007
in order to convert the coefficients for the distance,
Figure 391588DEST_PATH_IMAGE008
is a standard separation distance, and is,
Figure 562675DEST_PATH_IMAGE009
is a preset constant value;
acquiring the number of first interval sections of a vehicle closest to an end point and a vehicle in the middle, and calculating according to the number of the first interval sections, the current interval distance and a first distance weight value to obtain a first interval distance;
acquiring the number of second interval sections of a vehicle closest to the starting point and a centered vehicle, and calculating according to the number of the second interval sections, the current interval distance and a second distance weight value to obtain a second interval distance;
the first spacing distance and the second spacing distance are calculated by the following formulas,
Figure 547949DEST_PATH_IMAGE011
Figure 592128DEST_PATH_IMAGE013
Figure 459590DEST_PATH_IMAGE015
wherein the content of the first and second substances,
Figure 247417DEST_PATH_IMAGE016
the first distance is a distance between the first and second electrodes,
Figure 759301DEST_PATH_IMAGE017
the number of the first interval segments is the same as the number of the first interval segments,
Figure 974382DEST_PATH_IMAGE018
is a first weight value of the distance,
Figure 63561DEST_PATH_IMAGE019
for the second separation distance, the first separation distance,
Figure 655079DEST_PATH_IMAGE020
the number of the second interval segments is,
Figure 288315DEST_PATH_IMAGE021
is the second distance weight value.
2. The intelligent scheduling method for the cloud services of the fleet according to claim 1,
in the driving process of the fleet, the vehicle machine of each vehicle uploads positioning data to the fleet cloud server, and after the fleet cloud server judges that the positioning data corresponding to each vehicle code is received in real time, the fleet cloud server generates a driving direction according to the starting point and the end point, including:
acquiring a starting coordinate of a starting point and an ending coordinate of an ending point, wherein the starting coordinate comprises a starting longitude and a starting latitude, and the ending coordinate comprises an ending longitude and an ending latitude;
comparing the starting longitude with the ending longitude to obtain a longitude direction, wherein the longitude direction is a longitude value increase or a longitude value decrease;
comparing the starting latitude with the ending latitude to obtain a latitude direction, wherein the latitude direction is the latitude value increase or the latitude value decrease;
and obtaining the driving direction of the motorcade according to any one or more of the longitude direction and the latitude direction.
3. The intelligent scheduling method for the cloud services of the fleet according to claim 2,
the method comprises the following steps of determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating a sorting set in the driving direction, wherein the sorting set comprises:
when the driving direction is the longitude direction, longitude positioning information in positioning data corresponding to each vehicle code is extracted;
if the driving direction is a longitude direction and the longitude value is increased, sorting all vehicle codes in an ascending order according to the longitude positioning information of the vehicle codes to generate a sorting set in the driving direction;
and if the driving direction is the longitude direction and the longitude value is decreased, sorting all the vehicle codes in descending order according to the longitude positioning information thereof, and generating a sorting set in the driving direction.
4. The intelligent scheduling method for the cloud services of the fleet according to claim 2,
the method comprises the following steps of determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code, and generating a sorting set in the driving direction, wherein the sorting set comprises:
when the driving direction is the latitude direction, latitude positioning information in positioning data corresponding to each vehicle code is extracted;
if the driving direction is a latitude direction and the latitude value is increased, sequencing all vehicle codes in an ascending order according to the latitude positioning information of the vehicle codes to generate a sequencing set in the driving direction;
and if the driving direction is the latitude direction and the latitude value is reduced, sorting all the vehicle codes in a descending order according to the latitude positioning information of the vehicle codes, and generating a sorting set in the driving direction.
5. The intelligent scheduling method suitable for the fleet cloud service according to any one of claims 3 or 4,
the real-time extraction of the first positioning data of the vehicle closest to the end point, the second positioning data of the vehicle closest to the start point and the third positioning data of the vehicle in the middle in the sequencing set comprises the following steps:
extracting a vehicle corresponding to the last vehicle code in the sequencing set as a vehicle closest to the end point, and determining positioning data of the vehicle closest to the end point as first positioning data;
extracting a vehicle corresponding to a first vehicle code in the sequencing set as a vehicle closest to the starting point, and determining positioning data of the vehicle closest to the starting point as second positioning data;
if the number of the vehicle codes in the sorting set is judged to be an odd number, positioning data corresponding to the vehicle codes in the middle of the sorting set is taken as third positioning data;
if the number of the vehicle codes in the sorting set is judged to be an even number, the positioning data corresponding to 2 centered vehicle codes in the sorting set is used as fourth positioning data, and the average value of the two fourth positioning data is used as third positioning data.
6. The intelligent scheduling method suitable for the fleet cloud service according to claim 1,
if the first positioning data and the third positioning data are judged not to meet the requirement of the first spacing distance, a deceleration scheduling prompt is sent to a vehicle machine of a vehicle code corresponding to the first positioning data, and the method comprises the following steps:
calculating according to the first positioning data and the third positioning data to obtain first monitoring distance information, and if the first monitoring distance information is greater than the first spacing distance, sending a deceleration scheduling prompt to a vehicle machine of a vehicle code corresponding to the first positioning data;
the first monitoring distance information is calculated by the following formula,
Figure 674297DEST_PATH_IMAGE023
wherein the content of the first and second substances,
Figure 516351DEST_PATH_IMAGE024
in order to monitor the distance information for the first time,
Figure 645981DEST_PATH_IMAGE025
is as followsThe longitude information in the piece of location data,
Figure 866878DEST_PATH_IMAGE026
as the longitude information in the third positioning data,
Figure 689340DEST_PATH_IMAGE027
as latitude information in the first positioning data,
Figure 753111DEST_PATH_IMAGE028
for the latitude information in the third positioning data,
Figure 686432DEST_PATH_IMAGE029
is a distance conversion value.
7. The intelligent scheduling method for the cloud services of the fleet according to claim 6,
if judge unsatisfied second interval distance's requirement between second positioning data, the third positioning data, then send the scheduling warning of speeding to the car machine of the vehicle code that corresponds with the second positioning data, include:
calculating according to the second positioning data and the third positioning data to obtain second monitoring distance information, and if the second monitoring distance information is larger than the second spacing distance, sending a speed-up scheduling prompt to a vehicle machine with a vehicle code corresponding to the second positioning data;
the second monitoring distance information is calculated by the following formula,
Figure 11103DEST_PATH_IMAGE031
wherein the content of the first and second substances,
Figure 4467DEST_PATH_IMAGE032
for the second monitored-distance information to be,
Figure 555534DEST_PATH_IMAGE033
as the longitude information in the second positioning data,
Figure 26967DEST_PATH_IMAGE026
as the longitude information in the third positioning data,
Figure 222456DEST_PATH_IMAGE034
for the latitude information in the second positioning data,
Figure 386721DEST_PATH_IMAGE028
for the latitude information in the third positioning data,
Figure 159505DEST_PATH_IMAGE029
is a distance conversion value.
8. The utility model provides an intelligent scheduling system suitable for car team cloud service which characterized in that includes:
a receiving module for receiving fleet configuration data of a user, the fleet configuration data including vehicle codes, starting points, and ending points of a plurality of vehicles;
the generation module is used for uploading positioning data to a fleet cloud server by a vehicle machine of each vehicle in the travelling process of a fleet, and after the fleet cloud server judges that the positioning data corresponding to each vehicle code is received in real time, the travelling direction is generated according to the starting point and the ending point;
the determining module is used for determining the queuing sequence of each vehicle according to the positioning data and the driving direction corresponding to each vehicle code and generating a sequencing set in the driving direction;
the extraction module is used for extracting first positioning data of a vehicle closest to the end point, second positioning data of the vehicle closest to the start point and third positioning data of a vehicle centered in the sequencing set in real time;
the calculation module is used for calculating a first spacing distance and a second spacing distance according to the number of the vehicles and the types of the vehicles in the sorting set, wherein the first spacing distance is a required distance between the vehicle closest to the end point and the centered vehicle, and the second spacing distance is a required distance between the vehicle closest to the start point and the centered vehicle;
the first reminding module is used for sending a deceleration scheduling reminding to a vehicle machine of a vehicle code corresponding to the first positioning data if the first positioning data and the third positioning data are judged not to meet the requirement of the first spacing distance;
the second reminding module is used for sending a speed-up scheduling reminder to a vehicle machine with a vehicle code corresponding to the second positioning data if the second positioning data and the third positioning data do not meet the requirement of the second spacing distance;
the calculating according to the number of vehicles and the types of vehicles in the sorting set to obtain a first spacing distance and a second spacing distance, wherein the first spacing distance is a required distance between a vehicle closest to the end point and a centered vehicle, and the second spacing distance is a required distance between a vehicle closest to the start point and the centered vehicle, and the method comprises the following steps:
acquiring a standard spacing distance corresponding to the vehicle type;
comparing the number of the vehicles with a preset number to obtain a distance conversion coefficient, and calculating according to the distance conversion coefficient and a standard spacing distance to obtain a current spacing distance;
the current separation distance is calculated by the following formula,
Figure 434628DEST_PATH_IMAGE036
wherein, the first and the second end of the pipe are connected with each other,
Figure 999471DEST_PATH_IMAGE003
for the purpose of the current separation distance,
Figure 69058DEST_PATH_IMAGE004
as to the number of vehicles,
Figure 594717DEST_PATH_IMAGE005
in order to be a predetermined number of the components,
Figure 673532DEST_PATH_IMAGE006
the value is normalized for the quantity,
Figure 905930DEST_PATH_IMAGE007
in order to convert the coefficients for the distance,
Figure 84102DEST_PATH_IMAGE008
in order to be the standard separation distance,
Figure 831478DEST_PATH_IMAGE009
is a preset constant value;
acquiring the number of first interval sections of a vehicle closest to an end point and a vehicle in the middle, and calculating according to the number of the first interval sections, the current interval distance and a first distance weight value to obtain a first interval distance;
obtaining the number of second interval segments of the vehicle closest to the starting point and the vehicle in the middle, and calculating according to the number of the second interval segments, the current interval distance and a second distance weight value to obtain a second interval distance;
the first and second spacing distances are calculated by the following formulas,
Figure 448404DEST_PATH_IMAGE038
Figure 722259DEST_PATH_IMAGE040
Figure 399228DEST_PATH_IMAGE042
wherein the content of the first and second substances,
Figure 633900DEST_PATH_IMAGE016
is a first distance of separation, and is,
Figure 788938DEST_PATH_IMAGE017
the number of the first interval segments is the same as the number of the first interval segments,
Figure 933612DEST_PATH_IMAGE018
is a first weight value of the distance,
Figure 515903DEST_PATH_IMAGE019
is the second separation distance and is,
Figure 441134DEST_PATH_IMAGE020
the number of the second interval segments is,
Figure 462179DEST_PATH_IMAGE021
is the second distance weight value.
CN202210874496.XA 2022-07-25 2022-07-25 Intelligent scheduling method and system suitable for fleet cloud service Active CN114937352B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210874496.XA CN114937352B (en) 2022-07-25 2022-07-25 Intelligent scheduling method and system suitable for fleet cloud service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210874496.XA CN114937352B (en) 2022-07-25 2022-07-25 Intelligent scheduling method and system suitable for fleet cloud service

Publications (2)

Publication Number Publication Date
CN114937352A CN114937352A (en) 2022-08-23
CN114937352B true CN114937352B (en) 2022-10-04

Family

ID=82868950

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210874496.XA Active CN114937352B (en) 2022-07-25 2022-07-25 Intelligent scheduling method and system suitable for fleet cloud service

Country Status (1)

Country Link
CN (1) CN114937352B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116823088B (en) * 2023-07-17 2024-01-30 中国人民解放军陆军勤务学院 Plateau food transportation method and device based on data processing

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8676466B2 (en) * 2009-04-06 2014-03-18 GM Global Technology Operations LLC Fail-safe speed profiles for cooperative autonomous vehicles
CN105160865A (en) * 2015-08-05 2015-12-16 深圳市航盛电子股份有限公司 Vehicle formation driving control system and method
DE102018001054A1 (en) * 2017-12-08 2019-06-13 Knorr-Bremse Systeme für Nutzfahrzeuge GmbH A method of moving a vehicle convoy based on a predetermined total operating strategy associated with the vehicle convoy
CN111613044B (en) * 2019-02-22 2022-07-08 青岛海信网络科技股份有限公司 Fleet following early warning method and device and electronic equipment
CN112164217B (en) * 2020-09-14 2021-09-17 南京航空航天大学 Automatic driving vehicle queue running management system and control method thereof

Also Published As

Publication number Publication date
CN114937352A (en) 2022-08-23

Similar Documents

Publication Publication Date Title
US20210375128A1 (en) System and method for detection and quantification of irregular traffic congestion
CN113160602B (en) Intelligent bus dispatching simulation system
CN114937352B (en) Intelligent scheduling method and system suitable for fleet cloud service
CN114743401B (en) Data visualization bus dispatching management platform based on bus digital transformation
WO2022116447A1 (en) Bus dispatching method and apparatus, and computer device and medium
CN111311950B (en) Intelligent dispatching method and system for bus in peak period
CN114049786A (en) Real-time bus dispatching duty dispatching method, system and equipment based on passenger flow data
CN113592272A (en) Dispatching method for public transport and tour bus
CN112116241B (en) Intelligent public traffic scheduling method
CN113447037B (en) Stroke yaw detection method and device
CN113963310A (en) People flow detection method and device for bus station and electronic equipment
CN109726960B (en) Order processing method and device, electronic equipment and computer readable storage medium
CN111161529B (en) Artificial intelligent traffic flow estimation system and method using mobile network signaling data
CN112465384A (en) Transportation capacity scheduling method and device, computer equipment and computer readable storage medium
CN113298350A (en) Artificial intelligence-based bus comprehensive supervision and service system
CN112037515B (en) DNN-based bus detailed scheduling method
CN112184160B (en) Countdown display method and device, electronic equipment and storage medium
CN114266490B (en) Efficient and accurate comprehensive transportation network security risk point identification method
CN114596708B (en) Intelligent scheduling system, method, apparatus and computer program product
CN117592788B (en) Bus running risk identification method and device
CN117495237B (en) Management method, device and readable storage medium for freight distribution system
CN114038225B (en) Bus route data processing method and device and electronic equipment
CN113516263A (en) Vehicle scheduling method and device based on station image recognition
CN116757427A (en) Method and device for relieving endurance anxiety, medium and electronic equipment
CN112541805A (en) Car pooling order generation method, system, platform and storage medium

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