CN115994673B - Grain base monitoring method, system and storage medium based on Internet of things - Google Patents

Grain base monitoring method, system and storage medium based on Internet of things Download PDF

Info

Publication number
CN115994673B
CN115994673B CN202310256147.6A CN202310256147A CN115994673B CN 115994673 B CN115994673 B CN 115994673B CN 202310256147 A CN202310256147 A CN 202310256147A CN 115994673 B CN115994673 B CN 115994673B
Authority
CN
China
Prior art keywords
scheduling
target
granary
task
time
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
CN202310256147.6A
Other languages
Chinese (zh)
Other versions
CN115994673A (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.)
China Waterborne Transport Research Institute
Original Assignee
China Waterborne Transport Research Institute
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 China Waterborne Transport Research Institute filed Critical China Waterborne Transport Research Institute
Priority to CN202310256147.6A priority Critical patent/CN115994673B/en
Publication of CN115994673A publication Critical patent/CN115994673A/en
Application granted granted Critical
Publication of CN115994673B publication Critical patent/CN115994673B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to the field of granary monitoring, in particular to a grain base monitoring method, a grain base monitoring system and a grain base storage medium based on the Internet of things. The method comprises the following steps: step S1: matching the historical information of the vehicle type stored in the monitoring system with all dispatching tasks of a dispatching list; step S2: all dispatching tasks in the dispatching list are sent to the corresponding target granary; step S3: the target granary adds the corresponding scheduling tasks into a scheduling list thereof, and dynamically adjusts the sequence of the scheduling tasks in the scheduling list; step S4: the monitoring unit receives the scheduling time sent by each target granary, the positioning unit calculates the running time of the current position of the vehicle to each target granary in real time, and acquires the position information of the target granary for executing the scheduling task next based on the running time and the scheduling time; step S5: executing a scheduling task corresponding to the next target granary; the invention solves the problem of low dispatching efficiency of the grain base and improves the dispatching efficiency.

Description

Grain base monitoring method, system and storage medium based on Internet of things
Technical Field
The invention relates to the field of granary monitoring, in particular to a grain base monitoring method, a grain base monitoring system and a storage medium based on the Internet of things.
Background
In a grain storage base, the speed of grain scheduling is an important factor affecting the operation of the whole grain base, particularly in a fast-forward and fast-out grain base, vehicles entering the grain base to execute scheduling tasks are more, the executed scheduling tasks are more complex, generally each scheduling list corresponds to a plurality of scheduling tasks and needs to be executed at a plurality of target grain bins, the corresponding running time of the vehicles to each target grain bin and the scheduling time of each target grain bin to execute the scheduling tasks need to be considered, however, in the prior art, the scheduling tasks in the scheduling list are not considered to be adjusted according to the scheduling sequence and the scheduling content in the target grain bins, for example, the full time and the running time of grain bins are not considered in the technical schemes of Chinese patent CN109559067B and CN109548467B, but the problem of the quantity of grain bins is solved, when the scheduling among the scheduling of the plurality of vehicles is needed to be completed, the time of the vehicles to the grain bins and the grain storage quantity of the grain bins need not to be considered, for example, the time of the vehicles to reach the grain bins in the vehicle, if the grain storage machine needs to wait for the grain to be restarted in the grain bins, the waiting time of the grain storage machine is not considered, and the waiting time is reduced.
Disclosure of Invention
In order to better solve the problems, the invention provides a grain base monitoring method based on the Internet of things, which comprises the following steps:
step S1: the method comprises the steps that a monitoring unit receives a scheduling list sent by a vehicle-mounted terminal in a vehicle entering a grain base, obtains the vehicle type of the vehicle through image information, matches historical information of the vehicle type stored in a monitoring system with all scheduling tasks of the scheduling list, and binds identification information of the vehicle-mounted terminal with all scheduling tasks of the scheduling list through matching; if the matching is not passed, giving a prompt of a reason for not passing;
step S2: when matching is passed, the monitoring unit determines the positions of all target granaries according to all scheduling tasks of the scheduling list, and sends all scheduling tasks in the scheduling list to the corresponding target granaries, wherein the all scheduling tasks contain vehicle terminal identification information;
step S3: the target granary adds the corresponding scheduling tasks into a scheduling list thereof, dynamically adjusts the sequence of the scheduling tasks in the scheduling list based on the grain stock of the target granary and the scheduling tasks in the scheduling list thereof, calculates the scheduling time of the scheduling tasks corresponding to the scheduling list, and sends the scheduling time to the monitoring unit;
step S4: the monitoring unit receives the scheduling time sent by each target granary, the positioning unit calculates the running time of the current position of the vehicle reaching each target granary in real time, acquires the position information of the next target granary for executing the scheduling task based on the running time and the scheduling time, and sends the navigation information of the next target granary generated by the positioning unit to the vehicle-mounted terminal;
step S5: the vehicle-mounted terminal receives and arrives at the next target granary based on the navigation information of the next target granary, and after passing the identity verification, the scheduling task corresponding to the next target granary is executed;
step S6: and removing the target granary after the task is executed from all target granaries corresponding to the schedule, and repeating the steps S4-S5 to finish all the task in the schedule.
As a more preferable technical scheme of the invention, in step S3, the scheduling task corresponding to the ith target granary is ranked as n-th in a scheduling list, and based on the grain stock of the ith target granary and the content of the first n-1 scheduling tasks in the scheduling list, whether the ith target granary can meet the requirement of any one of the first n scheduling tasks in the scheduling list according to the sequence of the scheduling list is judged, and if so, the scheduling tasks are executed according to the sequence of the scheduling list;
when at least one scheduled task cannot be met, determining abnormal tasks which cannot be sequentially executed according to a list order, when the abnormal tasks are at least one of the first n-1 tasks in the scheduled list, according to the order of the abnormal tasks in the scheduled list, when the nth scheduled task is the scheduled task which is closest to the at least one abnormal task and can meet the at least one abnormal task, adjusting the nth scheduled task to be before the abnormal task, shortening the scheduled time of the nth scheduled task, and the scheduled time of the ith target granary after adjustment is as follows:
Figure SMS_1
wherein ,
Figure SMS_2
adjusting the front-end scheduling time of the nth task after abnormal task occurrence, +.>
Figure SMS_3
Scheduling time for sequential execution of the nth scheduled task,/->
Figure SMS_4
The time shortened after the sequence adjustment is executed for the nth scheduling task;
when the abnormal task is at least one of the first n-1 tasks and the nth scheduling task cannot meet the at least one abnormal task or the nth scheduling task is the abnormal task, searching the kth scheduling task which is closest to the abnormal task and can meet the abnormal task after the nth scheduling task in a scheduling list, adding the kth scheduling task to the front of the abnormal task, prolonging the scheduling time of the nth scheduling task, wherein the scheduling time of the nth scheduling task in the ith target granary is as follows:
Figure SMS_5
wherein ,
Figure SMS_6
for the adjusted scheduling time of the nth task after the occurrence of the abnormal task, < >>
Figure SMS_7
Scheduling time for sequential execution of the nth scheduled task,/->
Figure SMS_8
An extended time is performed after the order adjustment for the nth scheduled task.
As a more preferable embodiment of the present invention, the step S4 includes the following steps:
step S41: a positioning unit calculates based on a current position of the vehicleTravel time to ith target grain bin
Figure SMS_9
I is a continuous positive integer from 1 to N, wherein the value range of N is a positive integer greater than or equal to 2, and N is the total amount of the target granary corresponding to the scheduling content;
step S42: the monitoring unit receives the scheduling time of the ith target granary
Figure SMS_10
Step S43: repeating the steps S41-S42 to obtain the total scheduling time of completing the scheduling task corresponding to the ith target granary at the current position, wherein the total scheduling time expression of the ith target granary is as follows:
Figure SMS_11
wherein ,
Figure SMS_12
total scheduling time for the ith target granary,/->
Figure SMS_13
For the travel time of the vehicle from the current position to the ith target grain bin, +.>
Figure SMS_14
For the scheduling time of the ith target granary, i is a continuous positive integer from 1 to N, wherein the value range of N is a positive integer greater than or equal to 2, and N is the total amount of the target granary corresponding to the scheduling list;
step S44: the monitoring unit obtains the total scheduling time through calculation
Figure SMS_15
The shortest ith target granary sends the position information of the ith target granary to a positioning unit, the ith target granary is the target granary which is required to execute the scheduling task first, and the positioning unit generates navigation information according to the position information and sends the navigation informationAnd giving the vehicle-mounted terminal.
As a more preferable technical scheme of the invention, the total scheduling time of the ith target granary
Figure SMS_16
Total scheduling time with jth target granary +.>
Figure SMS_17
When the total scheduling time is equal and is the shortest, according to the current position, the distance S1 to the ith target granary and the distance S2 to the jth target granary are respectively, and the distance S3 from the ith target granary to the jth target granary, when S1+S3 is smaller than S2+S3, the scheduling task corresponding to the ith target granary is executed first, otherwise, the scheduling task corresponding to the jth target granary is executed first.
As a more preferable technical scheme of the invention, all vehicles entering the grain base are provided with first electronic tags, a plurality of second electronic tags are arranged in the middle of road surfaces of the grain base, the second electronic tags receive first position information transmitted by the first electronic tags on the vehicles, the first position information carries transmitting time, the second electronic tags transmit second position information obtained by adding receiving time to the first position information to the positioning unit, the positioning unit determines the position and the moving speed of the vehicles based on the second position information and the IDs of the second electronic tags, and meanwhile, the positioning unit also receives second position signals of vehicles corresponding to other road sections transmitted by other second electronic tags, so as to acquire traffic jam states and expected passing time of other road sections.
As a more preferable technical solution of the present invention, in the step S5, after the vehicle arrives at the next target grain bin, identification information is sent through a vehicle terminal; and the target granary receives the identification information, searches a scheduling task containing the identification information in a scheduling list based on the identification information, completes authentication after the scheduling task is searched, starts to execute the scheduling task, and fails authentication if the scheduling task is not searched.
As a more preferable technical scheme of the invention, the grain stock is detected and obtained by a ground pressure sensor of the target granary.
As a more preferable technical scheme of the invention, the dispatching tasks in the dispatching list comprise grain types, dispatching types and dispatching grain weights.
The invention also provides a grain base monitoring system based on the Internet of things, as shown in fig. 2, wherein the system is used for realizing the method, and the system comprises the following steps:
the vehicle-mounted terminal is used for sending the scheduling list and the identification information to the monitoring unit; receiving navigation information of a next target granary generated by a positioning unit, reaching the next target granary based on the navigation information, and sending the identification information to the target granary for identity verification;
the monitoring unit is configured to: receiving a scheduling list and identification information sent by a vehicle-mounted terminal in a vehicle entering a grain base, acquiring the vehicle type of the vehicle through image information, matching the history information of the vehicle type stored in a monitoring system with all scheduling tasks of the scheduling list, and binding the identification information of the vehicle terminal with all scheduling tasks of the scheduling list through matching; if the matching is not passed, giving a prompt of a reason for not passing; when matching is passed, all dispatching tasks in a dispatching list are sent to corresponding target granaries, the all dispatching tasks contain vehicle terminal identification information, and the positions of all the target granaries are determined according to all the dispatching tasks of the dispatching list; the navigation information of the next target granary generated by the positioning unit is also sent to the vehicle-mounted terminal;
at least two target grain bins, the target grain bins comprising a scheduling unit configured to: adding the corresponding scheduling tasks into a scheduling list of the grain bin, dynamically adjusting the execution sequence of the scheduling tasks in the scheduling list based on the grain stock of the target grain bin and the scheduling tasks in the scheduling list of the grain bin, simultaneously calculating the scheduling time of the scheduling tasks corresponding to the scheduling list, and sending the scheduling time to the monitoring unit; the identification information sent by the vehicle-mounted terminal is also received for identity verification;
the positioning unit is used for acquiring the current position of the vehicle, calculating the running time of the vehicle reaching each target granary, and generating navigation information according to the position information and the current position of the next target granary;
and the storage unit is used for storing the history information of different vehicle types.
The invention also provides a computer storage medium storing program instructions, wherein the program instructions, when run, control a device in which the computer storage medium is located to perform the method of any one of claims 1 to 8.
Compared with the prior art, the invention has the following beneficial effects:
according to the invention, by matching the vehicle type historical information of the vehicles entering the grain base with the dispatching tasks on the dispatching list, the vehicles are prevented from entering the grain base when the vehicles do not meet the dispatching requirements of the dispatching list, the workload of re-distributing the vehicles according to the dispatching list is reduced, as for the grain base with fast-in and fast-out, the stock of the grains in the grain bin changes faster, and the current position of the vehicle-mounted terminal also changes in real time along with the execution of the dispatching tasks, the current position of the vehicle-mounted terminal is acquired in real time through the positioning unit, the running time of the vehicle-mounted terminal reaching any target grain bin is calculated in real time, the execution sequence and the dispatching time of the dispatching tasks in the dispatching list are regulated in real time according to the grain stock and the type of the dispatching tasks in the dispatching list, the dispatching requirements of each dispatching task are met, the dispatching time regulated by the vehicle-mounted terminal is sent to the monitoring unit, the monitoring unit regulates the execution sequence of the target grain bin based on the dispatching time of the target grain bin and the running time reaching the target grain bin, and meanwhile, the running time of the target dispatching time with the shortest total dispatching time of each target grain bin is acquired based on the total dispatching time of each target grain bin, and the running time of the target grain bin is used as the target dispatching task, and the efficiency of the vehicle-mounted dispatching task is further improved.
Drawings
FIG. 1 is a flow chart of a grain base monitoring method based on the Internet of things of the invention;
fig. 2 is a structural diagram of a grain base monitoring system based on the internet of things.
Detailed Description
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The invention provides a grain base monitoring method based on the Internet of things, which is shown in fig. 1 and comprises the following steps:
step S1: the method comprises the steps that a monitoring unit receives a scheduling list sent by a vehicle-mounted terminal in a vehicle entering a grain base, obtains the vehicle type of the vehicle through image information, matches historical information of the vehicle type stored in a monitoring system with all scheduling tasks of the scheduling list, and binds identification information of the vehicle terminal with all scheduling tasks of the scheduling list through matching; if the matching is not passed, giving a prompt of a reason for not passing; specifically, by matching the history information of the type of the vehicle with the dispatching task of the dispatching list, the situation that the vehicle needs to return again when the type of the vehicle cannot finish the dispatching task of the dispatching list is avoided, road resources and granary resources of a grain base are wasted, and if the situation that the dispatching task cannot be finished is found in the loading process, the vehicle needs to be rearranged, so that the dispatching workload is increased, and the total load of the dispatching task on the dispatching list is 5 tons when the load of the vehicle is 3 tons, which is an example; when the matching is passed, matching the identification information of the vehicle with the scheduling task of the scheduling list;
step S2: when matching is passed, the monitoring unit determines the positions of all target granaries according to all scheduling tasks of the scheduling list, and sends all scheduling tasks in the scheduling list to the corresponding target granaries, wherein the all scheduling tasks contain vehicle terminal identification information; specifically, the monitoring unit allocates a corresponding target granary according to each of all scheduling tasks of a scheduling list, and sends each of all scheduling tasks to the corresponding target granary;
step S3: each target granary adds a corresponding scheduling task into a scheduling list of the target granary, dynamically adjusts a scheduling sequence based on the grain stock of each target granary and all scheduling tasks in the scheduling list, predicts the scheduling time of the scheduling task based on the scheduling sequence of the scheduling task corresponding to the scheduling list, and sends the scheduling time to the monitoring unit;
specifically, the grain stock of the target granary is obtained through a ground pressure sensor, the ground pressure sensor is arranged near the corresponding target granary, pressure information is sent to a dispatching module in the target granary, and the dispatching module calculates the grain stock in the target granary according to the pressure information; the scheduling module dynamically adjusts the scheduling sequence according to the grain stock in the target granary and the scheduling content of all scheduling tasks in the scheduling list;
step S4: the monitoring unit receives the scheduling time sent by each target granary, the positioning unit calculates the running time of the current position of the vehicle reaching each target granary in real time, acquires the position information of the next target granary for executing the scheduling task based on the running time and the scheduling time, and sends the navigation information of the next target granary generated by the positioning unit to the vehicle-mounted terminal;
specifically, the positioning unit obtains the position of the vehicle-mounted terminal and the running time for reaching the target granary according to the first electronic tag on the vehicle and the second electronic tag arranged on the road surface, the monitoring unit calculates the sum of the running time for reaching each target granary and the scheduling time corresponding to any target granary as the total scheduling time, obtains the target granary with the shortest total scheduling time in all the target granaries which do not execute the scheduling task as the next target granaries which are required to reach the scheduling task, and meanwhile, the positioning unit generates navigation information according to the position information of the next target granaries and sends the navigation information to the vehicle-mounted terminal, and the vehicle-mounted terminal executes the corresponding scheduling task according to the fact that the vehicle-mounted terminal reaches the next target granaries;
step S5: the vehicle-mounted terminal receives and arrives at the next target granary based on the navigation information of the next target granary, and after passing the identity verification, the scheduling task corresponding to the next target granary is executed; specifically, after the vehicle-mounted terminal reaches the position corresponding to the next target granary, the vehicle-mounted terminal needs to send identification information to the next target granary, the target granary receives and searches a scheduling task through the identification information of the vehicle-mounted terminal, and after the scheduling task corresponding to the vehicle-mounted terminal is found, the identity verification is passed, otherwise, the identity verification is not passed;
step S6: and removing the target granary after the task is executed from all target granaries corresponding to the schedule, and repeating the steps S4-S5 to finish all the task in the schedule.
Specifically, after the current dispatching task is completed, the target granary corresponding to the current dispatching task is removed from all the target granaries corresponding to the dispatching list, step S4 and step S5 are re-executed, the position information of the next target granary is determined by calculating the running time of any target granary in all the remaining target granaries and the dispatching time of any target granaries for executing the corresponding dispatching task, the vehicle-mounted terminal completes the corresponding dispatching task based on the navigation information of the next target granaries, and the steps are repeated until all the dispatching tasks on the dispatching list are completed.
Further, in step S3, the order of the scheduled task corresponding to the ith target granary in the scheduled list thereof is nth, and based on the grain stock of the ith target granary and the content of the first n-1 scheduled tasks in the scheduled list thereof, whether the ith target granary can meet the requirement of any one of the first n scheduled tasks in the scheduled list according to the sequence of the scheduled list is judged, and if so, the method is executed according to the sequence of the scheduled list;
specifically, the target granary orders according to the receiving time of the scheduled tasks, the scheduled content of the scheduled tasks comprises scheduling in and scheduling out, when the scheduled tasks in the scheduled list of the ith target granary are executed, the grain stock in the ith target granary can meet the requirement of each scheduled task, and when the scheduled tasks are scheduled out, the grain stock in the granary needs to be greater than or equal to the weight of the scheduled out grains, and when the scheduled tasks are scheduled out, the grain stock in the granary needs to be subtracted from the maximum storage amount of the granary to be greater than the weight of the scheduled in grains;
when at least one scheduled task cannot be met, determining abnormal tasks which cannot be sequentially executed according to a list order, when the abnormal tasks are at least one of the first n-1 tasks in the scheduled list, according to the order of the abnormal tasks in the scheduled list, when the nth scheduled task is the scheduled task which is closest to the at least one abnormal task and can meet the at least one abnormal task, adjusting the nth scheduled task to be before the abnormal task, shortening the scheduled time, and the scheduled time of the ith target granary after adjustment is as follows:
Figure SMS_18
wherein ,
Figure SMS_19
adjusting the front-end scheduling time of the nth task after abnormal task occurrence, +.>
Figure SMS_20
Scheduling time before order adjustment is performed for nth scheduled task, +.>
Figure SMS_21
The time shortened after the sequence adjustment is executed for the nth scheduling task;
specifically, after the previous scheduling task in the scheduling list is calculated to be executed, judging whether the grain stock can meet the requirement of the next scheduling task or not based on the grain stock in the target granary and the scheduling type and the scheduling weight of the next scheduling task, searching for abnormal tasks which cannot be executed sequentially from the first unexecuted scheduling task in the scheduling list through the scheme, at the moment, inserting other scheduling tasks in front of the abnormal tasks, wherein the inserted other scheduling tasks are scheduling tasks which are closest to the abnormal task and can meet the abnormal task, and when the inserted other scheduling tasks are the nth scheduling tasks, the execution position is prepositioned, so that the scheduling time of the nth scheduling task is shortened;
when the abnormal task is at least one of the first n-1 tasks and the nth scheduling task cannot meet the at least one abnormal task or the nth scheduling task is the abnormal task, searching the kth scheduling task which is closest to the abnormal task and can meet the abnormal task after the nth scheduling task in a scheduling list, adding the kth scheduling task to the front of the abnormal task, prolonging the scheduling time of the nth scheduling task, wherein the scheduling time of the nth scheduling task in the ith target granary is as follows:
Figure SMS_22
wherein ,
Figure SMS_23
adjusting the front-end scheduling time of the nth task after abnormal task occurrence, +.>
Figure SMS_24
Scheduling time before order adjustment is performed for nth scheduled task, +.>
Figure SMS_25
An extended time is performed after the order adjustment for the nth scheduled task.
Specifically, if the nth scheduled task is an abnormal task and the kth scheduled task that can satisfy the abnormal task is not found after the nth task,
Figure SMS_26
the mth scheduled task waiting for the abnormal task can be satisfied.
According to the scheme, the scheduling sequence of the corresponding scheduling task is dynamically adjusted through each target granary, at least one of the first n-1 tasks in the scheduling list is used as the abnormal task, and the nth scheduling task which is closest to the abnormal task and can meet the requirements of the abnormal task is used, so that the scheduling time of the nth scheduling task is shortened, the execution of the abnormal task is ensured, and meanwhile, the ordering of the scheduling task corresponding to the target granary in all scheduling tasks to be executed is improved under the condition that the running time of the target granary is not greatly changed, so that the scheduling efficiency is improved; when the abnormal task is at least one of the first n-1 tasks and the nth scheduling task cannot meet the at least one abnormal task or the nth scheduling task is the abnormal task, the requirement of the nth scheduling task is met by adding the kth scheduling to the abnormal task, meanwhile, a scheduling module in a target granary calculates the scheduling time of the scheduling task in real time, and a monitoring unit determines the next target granary based on the scheduling time and the running time of the vehicle to the target granary and the scheduling time of the scheduling task corresponding to other target granaries and the running time to the target granaries, so that the scheduling efficiency is improved, the scheduling efficiency is prevented from being reduced due to the fact that the scheduling time of the target granaries is prolonged, and the time of the whole scheduling flow is prolonged;
further, the step S4 includes the following steps:
step S41: the positioning unit calculates the travel time to the ith target grain bin based on the current position of the vehicle
Figure SMS_27
Specifically, the positioning unit calculates the travel time reaching each target granary according to the distance of the current position of the vehicle reaching each target granary and the congestion state of the road;
step S42: the monitoring unit receives the scheduling time of the ith target granary
Figure SMS_28
Step S43: repeating the steps S41-S42 to obtain the total scheduling time of completing the scheduling task corresponding to the ith target granary at the current position, wherein the total scheduling time expression of the ith target granary is as follows:
Figure SMS_29
wherein ,
Figure SMS_30
total scheduling time for the ith target granary,/->
Figure SMS_31
For the travel time of the vehicle from the current position to the ith target grain bin, +.>
Figure SMS_32
For the scheduling time of the ith target granary, i is a continuous positive integer from 1 to N, wherein the value range of N is a positive integer greater than or equal to 2, and N is the total amount of the target granary corresponding to the scheduling list;
step S44: the monitoring unit obtains the total scheduling time through calculation
Figure SMS_33
And the shortest i-th target granary sends the position information of the i-th target granary to a positioning unit, the i-th target granary is the target granary which is required to execute the scheduling task first, and the positioning unit generates navigation information according to the position information and sends the navigation information to the vehicle-mounted terminal.
Specifically, the monitoring unit calculates the total scheduling time of each target granary based on the scheduling time of each target granary and the running time of each target granary, takes the target granary with the shortest total scheduling time as the target granary of the next first scheduling task, and when the vehicle does not reach the next target granary and the scheduling task corresponding to the target granary is waiting, the target granary can execute the next scheduling task of the scheduling tasks in the scheduling list, and when the vehicle reaches, the next scheduling task is completed, the scheduling task corresponding to the vehicle is immediately started to be executed, so that the time is saved and the scheduling efficiency is improved.
Further, the total schedule time at the ith target grain bin
Figure SMS_34
Total scheduling time with jth target granary +.>
Figure SMS_35
When the total scheduling time is equal and is the shortest, according to the current position, the distance S1 to the ith target granary and the distance S2 to the jth target granary are respectively, and the distance S3 from the ith target granary to the jth target granary, when S1+S3 is smaller than S2+S3, the scheduling task corresponding to the ith target granary is executed first, otherwise, the scheduling task corresponding to the jth target granary is executed first. Specifically, when the total scheduling time of the two target granaries is equal and is the shortest total scheduling time, a route with a shorter distance from the current position to the two target granaries is selected, the driving distance is reduced, the scheduling route is optimized, and the scheduling time of the whole scheduling flow is reduced.
Further, all vehicles entering the grain base are provided with first electronic tags, two sides of a road of the grain base are provided with second electronic tags, the second electronic tags receive first position information transmitted by the first electronic tags on the vehicles, the first position information carries transmission time, the second electronic tags send second position information obtained by adding the first position information with the reception time to the monitoring unit, the monitoring unit determines the position and the moving speed of the vehicles based on the second position information, and meanwhile the monitoring unit also receives second position signals of other road sections corresponding to the vehicles and transmitted by other second electronic tags, so that traffic jam states and expected passing time of other road sections are obtained.
Further, in the step S5, after the vehicle arrives at the next target grain bin, identification information is sent through a vehicle terminal; and the target granary receives the identification information, searches a scheduling task containing the identification information in a scheduling list based on the identification information, completes authentication after the scheduling task is searched, starts to execute the scheduling task, and fails authentication if the scheduling task is not searched.
Further, the grain stock is detected and obtained by a ground pressure sensor of the target granary.
Further, the scheduling tasks in the schedule include grain types, scheduling types and scheduling grain weights.
The invention also provides a grain base monitoring system based on the Internet of things, which is used for realizing the method, and comprises the following steps:
the vehicle-mounted terminal is used for sending the scheduling list and the identification information to the monitoring unit; receiving navigation information of a next target granary generated by a positioning unit, reaching the next target granary based on the navigation information, and sending the identification information to the target granary for identity verification;
the monitoring unit is configured to: receiving a scheduling list and identification information sent by a vehicle-mounted terminal in a vehicle entering a grain base, acquiring the vehicle type of the vehicle through image information, matching the history information of the vehicle type stored in a monitoring system with all scheduling tasks of the scheduling list, and binding the identification information of the vehicle terminal with all scheduling tasks of the scheduling list through matching; if the matching is not passed, giving a prompt of a reason for not passing; when matching is passed, all dispatching tasks in a dispatching list are sent to corresponding target granaries, the all dispatching tasks contain vehicle terminal identification information, and the positions of all the target granaries are determined according to all the dispatching tasks of the dispatching list; the navigation information of the next target granary generated by the positioning unit is also sent to the vehicle-mounted terminal;
at least two target grain bins, the target grain bins comprising a scheduling unit configured to: adding the corresponding scheduling tasks into a scheduling list of the grain bin, dynamically adjusting the execution sequence of the scheduling tasks in the scheduling list based on the grain stock of the target grain bin and the scheduling tasks in the scheduling list of the grain bin, simultaneously calculating the scheduling time of the scheduling tasks corresponding to the scheduling list, and sending the scheduling time to the monitoring unit; the identification information sent by the vehicle-mounted terminal is also received for identity verification;
the positioning unit is used for acquiring the current position of the vehicle, calculating the running time of the vehicle reaching each target granary, and generating navigation information according to the position information and the current position of the next target granary;
and the storage unit is used for storing the history information of different vehicle types.
The invention also provides a computer storage medium storing program instructions, wherein the program instructions, when run, control a device in which the computer storage medium is located to perform the method of any one of claims 1 to 8.
In summary, the invention matches the history information of the vehicle type of the vehicle entering the grain base with the dispatching task on the dispatching list, so as to avoid entering the grain base when the vehicle does not meet the dispatching requirement of the dispatching list, reduce the workload of dispatching the vehicle again according to the dispatching list, because the vehicles participating in dispatching are more in the grain base with fast-forward and fast-out, the stock of the grain in the grain bin changes faster, and the current position of the vehicle-mounted terminal changes in real time along with the execution of the dispatching task, the current position of the vehicle-mounted terminal is obtained in real time by the positioning unit, the running time of the vehicle-mounted terminal reaching any target grain bin is calculated in real time, the execution sequence and the dispatching time of the dispatching task in the dispatching list are adjusted in real time according to the stock of the grain and the type of the dispatching task in the dispatching list, the dispatching task corresponding to each dispatching task is met, the dispatching time adjusted by the vehicle-mounted terminal is sent to the monitoring unit, the monitoring unit adjusts the execution sequence of the target grain bin based on the dispatching time of the target grain bin and the running time reaching the target grain bin, and meanwhile, the running time of the target grain bin is obtained based on the total dispatching time of each target grain bin, and the overall dispatching time of the target dispatching time is calculated, and the overall dispatching task is saved on the basis of the overall dispatching time of the target dispatching task and the target dispatching time is also matched with the target dispatching task.
The technical features of the above embodiments may be arbitrarily combined, and for brevity, all of the possible combinations of the technical features of the above embodiments are not described, however, they should be considered as the scope of the description of the present specification as long as there is no contradiction between the combinations of the technical features.
The foregoing examples have been presented to illustrate only a few embodiments of the invention and are described in more detail and are not to be construed as limiting the scope of the invention. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the invention, which are all within the scope of the invention. Accordingly, the scope of protection of the present invention is to be determined by the appended claims.
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 (7)

1. The grain base monitoring method based on the Internet of things is characterized by comprising the following steps of:
step S1: the method comprises the steps that a monitoring unit receives a scheduling list sent by a vehicle-mounted terminal in a vehicle entering a grain base, obtains the vehicle type of the vehicle through image information, matches historical information of the vehicle type stored in a monitoring system with all scheduling tasks of the scheduling list, and binds identification information of the vehicle-mounted terminal with all scheduling tasks of the scheduling list through matching; if the matching is not passed, giving a prompt of a reason for not passing;
step S2: when matching is passed, the monitoring unit determines the positions of all target granaries according to all scheduling tasks of the scheduling list, and sends all scheduling tasks in the scheduling list to the corresponding target granaries, wherein the all scheduling tasks contain vehicle terminal identification information;
step S3: the target granary adds the corresponding scheduling tasks into a scheduling list of the target granary, dynamically adjusts the sequence of the scheduling tasks in the scheduling list based on the grain stock of the target granary and the scheduling tasks in the scheduling list of the target granary, calculates the scheduling time of the scheduling tasks corresponding to the scheduling list, and sends the scheduling time to the monitoring unit;
step S4: the monitoring unit receives the scheduling time sent by each target granary, the positioning unit in the monitoring system calculates the running time of the current position of the vehicle to each target granary in real time, acquires the position information of the target granary for executing the scheduling task next based on the running time and the scheduling time, and sends the navigation information of the next target granary generated by the positioning unit based on the position information to the vehicle-mounted terminal;
step S5: the vehicle-mounted terminal receives and reaches the next target granary based on the navigation information of the next target granary, and after passing the identity verification, the scheduling task corresponding to the next target granary is executed;
step S6: removing the target granary after the task is executed from all target granaries corresponding to the schedule, and repeating the steps S4-S5 to complete all the task in the schedule;
the grain stock is detected and obtained through a ground pressure sensor of a target granary;
wherein, in step S3, it includes:
the method comprises the steps that the sequence of a scheduling task corresponding to an ith target granary in a scheduling list of the ith target granary is the nth, whether the ith target granary can meet the requirement of any scheduling task of the first n scheduling tasks in the scheduling list according to the sequence of the scheduling list is judged based on the grain stock of the ith target granary and the content of the first n-1 scheduling tasks in the scheduling list of the ith target granary, and if so, the scheduling tasks are executed according to the sequence of the scheduling list;
when at least one scheduled task cannot be satisfied, determining abnormal tasks which cannot be sequentially executed according to a list order, when the abnormal tasks are at least one of the first n-1 tasks in the scheduled list, according to the order of the abnormal tasks in the scheduled list, when the nth scheduled task is the scheduled task which is closest to the at least one abnormal task and can satisfy the at least one abnormal task, shortening the scheduled time of the nth scheduled task before the nth scheduled task is adjusted to the abnormal task, wherein the scheduled time of the nth scheduled task corresponding to the ith target granary is as follows:
Figure QLYQS_1
wherein ,
Figure QLYQS_2
for the adjusted scheduling time of the nth task after the occurrence of the abnormal task, < >>
Figure QLYQS_3
Scheduled time before adjustment for nth scheduled task order execution, +.>
Figure QLYQS_4
The time shortened after the adjustment for the nth scheduling task;
when the abnormal task is at least one of the first n-1 tasks and the nth scheduling task cannot meet the at least one abnormal task or the nth scheduling task is the abnormal task, searching the kth scheduling task which is closest to the abnormal task and can meet the abnormal task after the nth scheduling task in a scheduling list, adding the kth scheduling task to the front of the abnormal task, and prolonging the scheduling time of the nth scheduling task, wherein the scheduling time of the nth scheduling task in the ith target granary is as follows:
Figure QLYQS_5
wherein ,
Figure QLYQS_6
after abnormal task occursScheduling time after the n-th task adjustment, < ->
Figure QLYQS_7
Scheduled time before adjustment for nth scheduled task order execution, +.>
Figure QLYQS_8
An extended time after adjustment for the nth scheduled task;
the step S4 includes the following steps:
step S41: the positioning unit calculates the travel time to the ith target grain bin based on the current position of the vehicle
Figure QLYQS_9
Step S42: the monitoring unit receives the scheduling time of the ith target granary
Figure QLYQS_10
Step S43: repeating the steps S41-S42 to obtain the total scheduling time of completing the scheduling task corresponding to the ith target granary at the current position, wherein the total scheduling time expression of the ith target granary is as follows:
Figure QLYQS_11
wherein ,
Figure QLYQS_12
total scheduling time for the ith target granary,/->
Figure QLYQS_13
For the travel time of the vehicle from the current position to the ith target grain bin, +.>
Figure QLYQS_14
Scheduling time for the ith target granary;
wherein, the value of i is a continuous positive integer from 1 to N, the value range of N is a positive integer greater than or equal to 2, and N is the total amount of the target granary corresponding to the scheduling list;
step S44: the monitoring unit obtains the total scheduling time through calculation
Figure QLYQS_15
And the shortest i-th target granary sends the position information of the i-th target granary to a positioning unit, the i-th target granary is the target granary which is required to execute the scheduling task first, and the positioning unit generates navigation information according to the position information and sends the navigation information to the vehicle-mounted terminal.
2. The method for monitoring grain base based on the Internet of things according to claim 1, wherein the total scheduling time of the ith target granary
Figure QLYQS_16
Total scheduling time with jth target granary +.>
Figure QLYQS_17
When the total scheduling time is equal and the total scheduling time is the shortest, the distance S1 from the current position to the ith target granary, the distance S2 from the ith target granary to the jth target granary and the distance S3 from the ith target granary to the jth target granary are respectively obtained, and when the S1+ S3 is smaller than the S2+ S3, the scheduling task corresponding to the ith target granary is firstly executed, otherwise, the scheduling task corresponding to the jth target granary is firstly executed.
3. The grain base monitoring method based on the Internet of things according to claim 1, wherein all vehicles entering the grain base are provided with first electronic tags, a plurality of second electronic tags are arranged in the middle of road surfaces of the grain base, the second electronic tags receive first position information transmitted by the first electronic tags on the vehicles, the first position information carries transmitting time, the second electronic tags transmit second position information with the first position information added with receiving time to the positioning unit, the positioning unit determines the position and the moving speed of the vehicles based on the second position information and the IDs of the second electronic tags, and meanwhile the positioning unit also receives second position signals of other road sections corresponding to the vehicles transmitted by other second electronic tags, so that traffic jam states and expected passing time of other road sections are obtained.
4. The grain base monitoring method based on the internet of things according to claim 1, wherein in the step S5, after the vehicle arrives at the next target grain bin, identification information is sent through a vehicle terminal; and the target granary receives the identification information, searches a scheduling task containing the identification information in a scheduling list based on the identification information, completes authentication after the scheduling task is searched, starts to execute the scheduling task, and fails authentication if the scheduling task is not searched.
5. The method for monitoring grain bases based on the Internet of things according to claim 1, wherein the scheduling tasks in the scheduling list comprise grain types, scheduling types and scheduling grain weights.
6. A grain base monitoring system based on the internet of things, wherein the system is configured to implement the method of any one of claims 1 to 5, the system comprising:
the vehicle-mounted terminal is used for sending the scheduling list and the identification information to the monitoring unit; receiving navigation information of a next target granary generated by a positioning unit, reaching the next target granary based on the navigation information, and sending the identification information to the target granary for identity verification;
the monitoring unit is configured to: receiving a dispatching list and identification information sent by a vehicle-mounted terminal in a vehicle entering a grain base, acquiring the vehicle type of the vehicle through image information, matching the history information of the vehicle type stored in a monitoring system with all dispatching tasks of the dispatching list, binding the identification information of the vehicle terminal with all dispatching tasks of the dispatching list when the matching is passed, sending all dispatching tasks in the dispatching list to corresponding target granaries, wherein all dispatching tasks contain vehicle terminal identification information, determining the positions of all target granaries according to all dispatching tasks of the dispatching list, and sending navigation information of the next target granaries generated by a positioning unit to the vehicle-mounted terminal; if the matching is not passed, giving a prompt of a reason for not passing;
at least two target grain bins, the target grain bins comprising a scheduling unit configured to: adding corresponding scheduling tasks into a scheduling list of the target granary, dynamically adjusting the execution sequence of the scheduling tasks in the scheduling list based on the grain stock of the target granary and the scheduling tasks in the scheduling list of the target granary, simultaneously calculating the scheduling time of the scheduling tasks corresponding to the scheduling list, and sending the scheduling time to the monitoring unit; the identification information sent by the vehicle-mounted terminal is also received for identity verification;
the positioning unit is used for acquiring the current position of the vehicle, calculating the running time of the vehicle reaching each target granary, and generating navigation information according to the position information and the current position of the next target granary;
and the storage unit is used for storing the history information of different vehicle types.
7. A computer storage medium storing program instructions, wherein the program instructions, when executed, control a device in which the computer storage medium is located to perform the method of any one of claims 1 to 5.
CN202310256147.6A 2023-03-16 2023-03-16 Grain base monitoring method, system and storage medium based on Internet of things Active CN115994673B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310256147.6A CN115994673B (en) 2023-03-16 2023-03-16 Grain base monitoring method, system and storage medium based on Internet of things

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310256147.6A CN115994673B (en) 2023-03-16 2023-03-16 Grain base monitoring method, system and storage medium based on Internet of things

Publications (2)

Publication Number Publication Date
CN115994673A CN115994673A (en) 2023-04-21
CN115994673B true CN115994673B (en) 2023-06-16

Family

ID=85990580

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310256147.6A Active CN115994673B (en) 2023-03-16 2023-03-16 Grain base monitoring method, system and storage medium based on Internet of things

Country Status (1)

Country Link
CN (1) CN115994673B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109215333A (en) * 2017-07-07 2019-01-15 杭州中策车空间汽车服务有限公司 Dispatch configuration method and system
CN112270135A (en) * 2020-11-13 2021-01-26 吉林烟草工业有限责任公司 Intelligent distribution method, device and equipment for logistics dispatching and storage medium

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109993396A (en) * 2018-01-03 2019-07-09 航天信息股份有限公司 Grain dispatching method and device
JP7035957B2 (en) * 2018-10-23 2022-03-15 トヨタ自動車株式会社 Vehicle allocation instruction device, vehicle allocation instruction method and vehicle allocation instruction program
CN212160932U (en) * 2020-04-02 2020-12-15 深圳市金溢科技股份有限公司 ETC-X system for realizing urban road vehicle-road cooperation
CN113807601A (en) * 2021-09-29 2021-12-17 河南工业大学 Efficient intelligent logistics transfer system and method for grain depot
CN115049111A (en) * 2022-05-26 2022-09-13 四川省交通运输发展战略和规划科学研究院 Multi-type intermodal transport path planning method, device, equipment and storage medium

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109215333A (en) * 2017-07-07 2019-01-15 杭州中策车空间汽车服务有限公司 Dispatch configuration method and system
CN112270135A (en) * 2020-11-13 2021-01-26 吉林烟草工业有限责任公司 Intelligent distribution method, device and equipment for logistics dispatching and storage medium

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于GPS的粮食信息管理系统;张谦;内江科技(5);第16-17、8页 *

Also Published As

Publication number Publication date
CN115994673A (en) 2023-04-21

Similar Documents

Publication Publication Date Title
CN111626577B (en) Vehicle scheduling method and device
US10956211B2 (en) Method and apparatus of allocating automotive computing tasks to networked devices with heterogeneous capabilities
CN109961158A (en) Reserve order allocation method and reservation Order splitting device
CN104008642A (en) Vehicle apparatus and system for controlling platoon travel and method for selecting lead vehicle
CN108960976B (en) Method, device and storage medium for processing reservation order
CN115220752A (en) Software updating method for vehicle control device and vehicle operation system
US20210382492A1 (en) Platoon driving control system and method of vehicle
CN112581067A (en) Warehouse management method and system
CN115994673B (en) Grain base monitoring method, system and storage medium based on Internet of things
CN115923570A (en) Charging management method, device, system, electronic device and storage medium
CN111340984A (en) Taxi booking method and device based on digital key and electronic equipment
CN110620992B (en) Method and device for refueling vehicles
CN111898863B (en) Dynamic scheduling method and device for vehicles in rail transit
CN111582407B (en) Task processing method and device, readable storage medium and electronic equipment
CN110969317B (en) Order determining method and device, electronic equipment and computer readable storage medium
CN108921353B (en) Optimization method and device for yard distribution and electronic equipment
CN116415747A (en) Method and device for determining carpooling route and electronic equipment
US20230376863A1 (en) Route planning method and device, equipment and storage medium
CN116142030A (en) Automatic charging method and system for unmanned vehicle
CN114997650A (en) Multi-robot multi-task dispatching method and device and electronic equipment
CN115657616A (en) Task allocation method based on AGV (automatic guided vehicle) scheduling system
US11157004B2 (en) Real-time control system for a vehicle and a method of executing control of the vehicle via the real-time control system
CN110046795B (en) Task allocation method and device for robot
CN113320426A (en) Energy-saving emission-reducing charging navigation method and device
WO2020192878A1 (en) Method and system for operating a fleet of vehicles

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