CN117521994A - Park vehicle scheduling method, device, equipment and storage medium - Google Patents
Park vehicle scheduling method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN117521994A CN117521994A CN202311226336.5A CN202311226336A CN117521994A CN 117521994 A CN117521994 A CN 117521994A CN 202311226336 A CN202311226336 A CN 202311226336A CN 117521994 A CN117521994 A CN 117521994A
- Authority
- CN
- China
- Prior art keywords
- information
- pick
- vehicle
- target
- park
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000003860 storage Methods 0.000 title claims abstract description 13
- 238000013439 planning Methods 0.000 claims abstract description 83
- 238000009826 distribution Methods 0.000 claims abstract description 33
- 238000004590 computer program Methods 0.000 claims description 11
- 230000008569 process Effects 0.000 description 15
- 230000006870 function Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 8
- 239000000126 substance Substances 0.000 description 8
- 238000012545 processing Methods 0.000 description 6
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 238000006243 chemical reaction Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000012790 confirmation Methods 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000002269 spontaneous effect Effects 0.000 description 2
- 238000012384 transportation and delivery Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000002485 combustion reaction Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 231100000331 toxic Toxicity 0.000 description 1
- 230000002588 toxic effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a park vehicle dispatching method, a device, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring the pick-up intention information of the target vehicle, determining the target goods and the pick-up intention time, determining the route planning result of the target vehicle based on the target goods, the park road distribution and the park vehicle information corresponding to the pick-up intention time, and further generating the reservation pick-up information of the target vehicle based on the pick-up intention information and the route selection result. Therefore, the reservation of the vehicle to the garden for picking up the goods can be realized, a reliable running path is provided for reserving the vehicle, and the picking up efficiency of the vehicle is improved.
Description
The present application is a divisional application of chinese patent application with application number "202111242027.8" and application number "park vehicle scheduling method, apparatus, device, and storage medium" on application day 2021, 10 and 25.
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, a device, and a storage medium for dispatching a park vehicle.
Background
At present, there are a plurality of chemical enterprises to gather in the condition of a chemical industry garden, and the transportation vehicle is gone forward to chemical industry garden and is got goods time and get goods route and independently decide by the driver, in demand busy season, appears the condition that the vehicle concentrated pick up goods easily, leads to the refinery to go out traffic jam, not only influences the garden operation, also is unfavorable for improving pick up efficiency.
Disclosure of Invention
The embodiment of the invention provides a park vehicle dispatching method, a device, equipment and a storage medium, which can effectively solve the problems.
In a first aspect, an embodiment of the present invention provides a method for dispatching a campus vehicle, where the method includes:
acquiring the goods-picking intention information of a target vehicle needing to be reserved for entering the park, wherein the goods-picking intention information is related information required by the target vehicle to be reserved for entering the park and comprises target goods and goods-picking intention time;
determining a path planning result of the target vehicle based on the target goods, the park road distribution and park vehicle information corresponding to the pick-up intention time, wherein the park vehicle information comprises position prediction information and goods loading information of vehicles in the park;
and generating reserved pickup information of the target vehicle based on the pickup intention information and the path planning result, wherein the reserved pickup information comprises the expected pickup time and the target path.
Further, the path planning result includes a first path and a second path, and the determining the path planning result of the target vehicle based on the target goods, the campus road distribution, and the campus vehicle information corresponding to the pick-up intention time includes:
determining a target pick-up point according to the target goods;
determining a first path from an entrance of the target vehicle to a target pick-up point based on the target pick-up point, the campus road distribution, and the intra-campus vehicle position prediction information corresponding to the pick-up intent time;
and determining a second path of the target vehicle from the target pick-up point to leave based on the reference goods information, the park road distribution and park vehicle information corresponding to the pick-up intention time, of the target goods meeting the preset risk condition in the park.
Further, after the generating the reservation pickup information of the target vehicle, the method further includes:
and on the day of picking up the target vehicle, if the fact that the vehicle is not picked up according to the reserved picking up information is detected in the park before the target vehicle enters the park, updating the reserved picking up information of the target vehicle, and sending the updated reserved picking up information to a user of the target vehicle.
Further, the reserved picking information further includes a recommended vehicle speed, and detecting that there is a vehicle in the campus that is not picking according to the reserved picking information includes:
and if the fact that the vehicles do not travel according to the recommended vehicle speed exists in the park is detected, judging that the vehicles do not pick up according to the reserved pick-up information.
Further, the reserved picking information further includes a predicted time of each stage of entering the park, and the detecting that the vehicles exist in the park and pick up the goods not according to the reserved picking information includes:
and if the fact that the vehicles do not finish the tasks of the corresponding stages according to the predicted time is detected to exist in the park, judging that the vehicles do not pick up according to the reserved pick-up information.
Further, the park vehicle scheduling method further comprises the following steps:
and if no drivable path exists in the path planning result, adjusting the pick-up intention time, and re-determining the path planning result based on park vehicle information, the target goods and the park road distribution corresponding to the adjusted pick-up intention time.
Further, the generating the reservation pickup information of the target vehicle based on the pickup intention information and the path planning result includes:
transmitting the path planning result to a user of the target vehicle for selection by the user;
and generating reservation pickup information of the target vehicle based on the pickup intention information and a path selection result fed back by a user.
In a second aspect, an embodiment of the present invention further provides a campus vehicle scheduling apparatus, where the apparatus includes:
the system comprises an acquisition module, a storage module and a storage module, wherein the acquisition module is used for acquiring the pick-up intention information of a target vehicle needing to be reserved for entering a park, and the pick-up intention information is related information required by the target vehicle to be reserved for entering the park and comprises target goods and pick-up intention time;
the path planning module is used for determining a path planning result of the target vehicle based on the target goods, the park road distribution and park vehicle information corresponding to the pick-up intention time, wherein the park vehicle information comprises position prediction information and goods loading information of vehicles in the park;
the reservation module is used for generating reservation pickup information of the target vehicle based on the pickup intention information and the path planning result, wherein the reservation pickup information comprises expected pickup time and a target path.
In a third aspect, an embodiment of the present invention further provides an electronic device, including: a memory, a processor and a computer program stored on the memory and executable on the processor, which when executed implements the steps of the method for dispatching a campus vehicle provided in the first aspect.
In a fourth aspect, embodiments of the present invention also provide a computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of the method for dispatching a campus vehicle provided in the first aspect.
According to the park vehicle scheduling method provided by the embodiment of the invention, the target goods and the pick-up intention time are determined by acquiring the pick-up intention information of the target vehicle, then the route planning result of the target vehicle is determined based on the target goods, the park road distribution and the park vehicle information corresponding to the pick-up intention time, and further the reservation pick-up information of the target vehicle can be generated based on the pick-up intention information and the determined route selection result. Therefore, the reservation of the vehicles to enter the park for picking up the goods can be realized, a reliable running path is provided for the target vehicles reserved to enter the park, the condition that the vehicles are concentrated for picking up the goods to cause traffic jam outside the refinery is reduced, the queuing waiting time of the vehicles is reduced, and the picking up efficiency of the vehicles is improved.
The foregoing description is only an overview of the present invention, and is intended to be implemented in accordance with the teachings of the present invention in order that the same may be more clearly understood and to make the same and other objects, features and advantages of the present invention more readily apparent.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the description of the embodiments of the present application will be briefly described below.
FIG. 1 shows a flow chart of a method for dispatching a campus vehicle according to an embodiment of the present invention;
FIG. 2 shows a block diagram of a campus vehicle scheduler provided by an embodiment of the present invention;
fig. 3 shows a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
In a first aspect, an embodiment of the present invention provides a method for dispatching a campus vehicle, as shown in fig. 1, where the method may at least include the following steps S101 to S103.
Step S101, acquiring the pick-up intention information of the target vehicle, wherein the pick-up intention information includes the target goods and the pick-up intention time.
The target vehicle is a vehicle needing to reserve to enter the park, and the goods loaded by the target vehicle entering the park are target goods. For example, in one application scenario, where the campus is a chemical farm, a plurality of chemical product refineries are distributed, each chemical product refiner has its own pick-up point, and a carrier vehicle is required to enter the corresponding pick-up point in the farm to pick up a product, at this time, the target vehicle may be a carrier vehicle that is required to enter the pick-up point in the farm to pick up a product.
The intent-to-pick information is information about what is needed for the target vehicle to reserve in the campus, and may include, but is not limited to, the target item and intent-to-pick time. The target goods can be represented as target goods identification, and are used for identifying model parameters and types of the target goods. The time of the pick-up intention is the time of the target vehicle to reach the park reference location, which can be determined according to actual needs, for example, the park entrance, or the pick-up point of the target goods. Of course, in addition to the target item and the intention-to-pick time, the intention-to-pick information may include other information, for example, one or more of the amount of pick-up, the model of the target vehicle, and the contact information of the user.
In the specific implementation process, there are various ways to obtain the pick-up intention information of the target vehicle. For example, before a user needs to enter a campus to pick up goods, the user of the target vehicle may input the goods pick-up intention information through the client, or may select information such as the target goods, the goods pick-up intention time, etc. on a reservation goods pick-up interface displayed by the client, and then execute a submitting operation to generate the goods pick-up intention information.
Step S102, determining a path planning result of the target vehicle based on target goods, park road distribution and park vehicle information corresponding to the pick-up intention time, wherein the park vehicle information comprises position prediction information and goods loading information of vehicles in the park.
The campus road distribution can be obtained and stored in advance. For example, the roads in the campus can be collected through the camera, including the attributes related to navigation such as the trend, forbidden running, speed limit and the like of the roads, the road topology structure is built based on the information, and the roads are subjected to segmentation processing to generate the campus road distribution data which can be used for path planning.
After determining the pick-up intention time of the target vehicle from the pick-up intention information acquired in step S101, it is possible to further determine campus vehicle information corresponding to the pick-up intention time, including location prediction information of vehicles in the campus and goods loading information. Thus, the vehicle position distribution on the road of the garden area in the relevant time period and the goods distribution loaded by the vehicle can be fully considered to carry out the path planning of the target vehicle.
It can be understood that after the park starts the reservation queuing and park-entering mechanism provided by the embodiment of the present invention, steps S101 to S103 provided by the embodiment need to be executed in advance for the vehicles desiring to enter the park for picking up the goods, and reservation picking up information including the expected picking up time and the travel path after entering the park is determined and the reservation picking up information of these vehicles is stored. Therefore, the estimated picking time of each vehicle and the driving path information after entering the park can be planned in advance, and each link of entering, driving, loading, leaving and the like of the vehicles for picking up the goods entering the park can form standardized flow management. The estimated pickup time and the travel route of each reserved vehicle on the day of the intended pickup are counted from the reserved pickup information stored in advance, so that the park vehicle position prediction information corresponding to the pickup intended time of the target vehicle can be obtained, and specifically, the position distribution and the travel state of the vehicles in the park at each time node near the intended pickup time can be included. The time point range near the intended pickup time may be set according to experience of the vehicle entering the campus for pickup in the actual application scenario, for example, each time node from the first half hour to the second half hour of the intended pickup time, or each time node from the first hour to the second hour of the intended pickup time. The interval between adjacent time nodes can also be set according to actual needs, for example, 0.5 seconds or 1 second, etc.
Considering that the possibility of spontaneous combustion and spontaneous explosion of various goods at high temperature or high pressure exists, and the temperature and change of the carried goods are easily caused when the carried vehicles in the travelling park are in a jolt state, the carried vehicles in the park for executing loading and unloading tasks become a mobile dangerous source, and the surrounding travelling vehicles are greatly influenced. For a vehicle reserved for pick-up into a park, the vehicle is in an empty state on the way from the park entrance to the pick-up point, and in a loaded state on the way from the pick-up point to the park exit. Therefore, when the route planning is performed for the target vehicle reserved for the in-park pickup, the influence of the product loading information of the vehicles on the route planning can be further considered in addition to the position prediction information of the vehicles in the park, so that the safety of the target vehicle traveling in the park can be improved.
It should be noted that, the path planning range may be determined according to the requirements of the actual application scenario, which is not limited by the comparison in this embodiment.
In an alternative embodiment, the entry phase of the target vehicle may be divided into an entry phase, a pick-up phase, and an exit phase. The path planning range may include the whole campus, and the path planning result determined in step S102 includes a first path and a second path, where the first path is a travel path from the entrance stage, i.e., from the entrance of the campus to the target pick-up point, and the second path is a travel path from the departure stage, i.e., from the target pick-up point to the exit of the campus. The target picking point is the picking point of the target goods. Specifically, the step S102 may include: determining a target pick-up point in the campus according to the target goods; determining a first path from the entrance of the target vehicle to the target pick-up point based on the target pick-up point, the park road distribution and the in-park vehicle position prediction information corresponding to the pick-up intention time; and determining a second path of the target vehicle from the target pick-up point to the departure based on the park vehicle information corresponding to the target goods meeting the preset risk condition, the park road distribution and the pick-up intention time in the park. Of course, in other embodiments of the present invention, the route planning range may be a specific area in the campus, such as an area prone to congestion, or the route planning may be performed only in the departure phase, which is not limited herein.
In the implementation process, the corresponding relation between each picking point and the goods identifier can be stored in advance, so that the target picking point can be determined according to the target goods and the corresponding relation.
In the entering stage, considering that the target vehicle is in an empty state, the park entrance can be taken as a starting point, the position of the target pick-up point is taken as an end point, the position prediction information of the vehicle in the park corresponding to the pick-up intention time is taken as a reference, and the first path is planned from park road distribution in consideration of factors such as road conditions, vehicle speeds and the like, so that traffic jam is not caused in a safety range. Specific implementation details are set forth in the related art and are not described in detail herein.
In the departure stage, the target vehicle is in an article loading state, and as a plurality of different articles are distributed in the park, some articles and the target articles meet preset risk conditions, such as chemical reaction relations, that is, the target articles are contacted with the articles, chemical reaction can be caused, so that safety accidents can be caused; or the two are not in line with the production safety requirements of the chemical industry, such as corrosive goods, inflammable and explosive goods, and toxic and harmful goods are not contacted with each other. Therefore, the goods are considered as reference goods meeting preset risk conditions with the target goods, wherein the preset risk conditions are determined according to chemical reaction relation of the two goods and/or production safety requirements of chemical industry, for example, the preset risk conditions can be determined according to factors such as temperature, pressure, goods types and distance.
In order to improve the safety of the vehicle traveling on the campus, reference goods at risk of causing accidents can be avoided when planning the second path. There are various ways of determining the reference goods corresponding to the target goods, for example, the kinds of goods involved in the campus may be predetermined, and whether the preset risk condition is satisfied between the goods may be analyzed, and the correspondence between the goods with risks may be pre-constructed and stored. Such as a sample correspondence table or database correspondence, to store the correspondence. And searching in the corresponding relation based on the target goods to obtain a reference goods which meets the preset risk condition with the target goods in the park, namely determining the reference goods identification. For another example, the reference item identification may also be included in the pick-up intent information, at which point the reference item identification may be extracted from the pick-up intent information.
After the reference goods are determined, in the path planning process of the departure stage, the risk roads can be avoided according to the distribution of the reference goods. In a particular application scenario, the reference good may be distributed at the pick-up point and/or on a loading vehicle traveling on the campus.
In an alternative embodiment, the pick-up point of the reference article may be avoided when the second path is planned, so as to avoid potential safety hazards caused by the pick-up point of the reference article to the departure of the target vehicle. In particular, adjacent roads of the pick-up point of the reference good, which are necessary roads entering and/or leaving the pick-up point, may be excluded from the campus road distribution; and planning a second path of the target vehicle based on park vehicle information corresponding to the delivery intention time and the distribution of the residual roads in the park by taking the target delivery point as a starting point and the park outlet as an ending point.
In an alternative embodiment, the carrier vehicles with the reference goods in the park (hereinafter referred to as reference vehicles) may be avoided when the second path is planned, so as to avoid potential safety hazards caused by the reference vehicles on the target vehicles off-site. It will be appreciated that the contact of the target article with the reference article may cause a safety accident, and that a certain safety distance is required between the reference vehicle and the target vehicle, which travel in the target area, to avoid the risk of reaction, and the range of the safety distance may be determined according to practical experience.
In the implementation process, each road section of the departure stage driving can be planned in sequence, for each road section, a selectable starting road is determined from park road distribution, the target moment when the target vehicle arrives at the starting road is predicted on the basis of the pick-up intention time, then the vehicle condition of the starting road at the target moment is determined from the pre-stored reservation pick-up information, and the planning result of the road section is determined from the determined starting road at least according to the relative position and whether the reference vehicle exists and the relative position between the predicted target vehicle and the reference vehicle when the target vehicle arrives at the starting road. The road on which the intersection ahead of the target vehicle can selectively travel may be determined as the starting road. Depending on the actual scenario, there may be one or more starting roads, specifically determined according to the number of travelable roads at the intersection in front of the target vehicle.
For example, it may be determined whether a reference vehicle having a distance from the target vehicle smaller than a preset value exists on the starting road at the target time, the distance is determined according to the relative position of the two, if so, the starting road is excluded, and the planning result of the road section is determined from the remaining roads. In specific implementation, the preset value can be set according to the safe distance between the target goods and the reference goods in the actual application scene.
Alternatively, it may be determined whether or not a vehicle adjacent to the target vehicle on the starting road at the target time is a reference vehicle, and if so, the starting road is excluded and the result of planning the link is determined from the remaining roads.
And after the planning of each road section in the departure stage is completed, a second path can be obtained.
Furthermore, for the path planning process of the departure stage, besides avoiding the risk road according to the relative position of the target vehicle and the reference vehicle on the starting road at the target moment, the overall vehicle distribution and the running state on the starting road at the target moment can be referred to, so that the starting road which is jammed can be eliminated, and the departure of the road according to the second path after the goods picking stage is completed can be ensured on the basis of avoiding the risk road, and the traffic jam can not be caused in the safety range.
In the process of planning the path of the target vehicle, the related time node can predict according to the recommended speed and the planned road section on the basis of the intention time. The recommended vehicle speed may be determined according to a safe vehicle speed corresponding to the amount of goods carried by the target vehicle, that is, the amount of goods carried by the target vehicle, or may be a uniform vehicle speed limit value predefined in the park. The time spent in the pick-up stage, i.e., the time spent from the arrival of the pick-up point to the completion of the shipment, may be determined by the pick-up volume or may be a predetermined uniform pick-up duration. When the goods picking up amount is determined, the goods picking up time periods corresponding to various different goods picking up amounts can be determined in advance according to the historical data, for example, the goods picking up time periods can be obtained by a corresponding table or a function corresponding relation, and then the corresponding goods picking up time periods are searched in the corresponding table based on the obtained goods picking up amount or the function corresponding relation is brought in.
Further, if the obtained path planning result includes a travelable path, step S103 is continued to be executed. If no drivable path exists in the obtained path planning result, the goods-picking intention time is adjusted, and the path planning result is redetermined based on park vehicle information, target goods and park road distribution corresponding to the adjusted goods-picking intention time until the path planning result containing the drivable path is obtained.
In an alternative embodiment, in the process of planning the path of the target vehicle, the path planning may be performed by using a plurality of moments including the pick-up intention time as reference times in a time window corresponding to the pick-up intention time, so as to obtain a plurality of path planning results. The length of the time window may be set, for example, half an hour or one hour according to actual needs. For example, assuming that the pick-up intention time is T, the path planning process may be performed with T3 Δt, T2 Δt, T Δt, t+Δt, t+2Δt, and t+3Δt in the corresponding time window as the reference time, respectively. Thus, the method is beneficial to comprehensively considering the vehicle conditions in the park near the time of the intent to pick up the goods and providing richer path planning results so as to ensure that a drivable path is obtained.
Step S103, based on the goods-picking intention information and the path planning result, the reserved goods-picking information of the target vehicle is generated, and the reserved goods-picking information comprises the expected goods-picking time and the target path.
The reservation pick-up information is used to direct the target vehicle to pick up a pick-up on the campus. The reserved pickup information may include, in addition to the predicted pickup time and the target route, other information such as a recommended vehicle speed and a predicted time for each stage of entering the garden, and the like, and is not limited thereto. The garden entering stages comprise an entering stage, a picking stage and an exiting stage, and the prediction time for completing the task of each stage can be obtained according to the path planning result and the picking amount.
The reference location of the expected pickup time is the same as the pickup intention time, and can be specifically determined based on the time node corresponding to the travelable path in the path planning result. Taking the reference point as the campus entrance as an example, the arrival time of the arrival time node of the travelable route at the campus entrance may be taken as the estimated pickup time, and the estimated pickup time may be in the vicinity of the pickup intention time of the target vehicle. It will be appreciated that if no travelable path exists as a result of the path planning corresponding to the pick-up intention time, it is necessary to delay or advance the time of arrival at the campus entrance to ensure that a travelable path exists when the target vehicle arrives at the campus entrance.
The target path is used for indicating the running of the target vehicle in the park, and the reserved picking information can also comprise a time node corresponding to the target path, such as the starting moment of running, the moment of reaching each road in the path and the like.
In order to ensure that the obtained reserved picking information better meets the requirements of users, in an alternative implementation manner, the route planning result obtained in the step S102 may be sent to the users of the target vehicles for selection by the users, and then the reserved picking information of the target vehicles is generated based on the picking intention information and the target route selection result fed back by the users.
For example, the route planning result sent to the user may include a travel route, time nodes and time consumption of each stage of entering the garden, the user may determine whether the time is appropriate according to actual needs, if yes, the confirmation information may be fed back, after receiving the confirmation information, the travel route confirmed by the user may be taken as a target travel route, and the estimated arrival time may be determined based on the time node corresponding to the travel route. For example, assuming that the estimated arrival time is the estimated arrival time at the campus entrance, the start point of the travel path is the campus entrance, and the start time of the path plan is t1, t1 may be taken as the estimated arrival time. If the user is not satisfied with the path planning result, the cancellation information can be fed back, and the reservation is cancelled.
In addition, for the case that there are a plurality of path planning results, the user can select one path planning result feedback confirmation information which meets the requirement. For example, in the above example, if the path planning results corresponding to t3Δt, t2Δt, and t+3Δt have a drivable path, the user may select one path planning result from the paths after feeding back to the user. If the user selects the path planning result corresponding to t+3Δt, the estimated arrival time may be determined based on t+3Δt.
In other embodiments of the present invention, the reservation pickup information may be generated according to the user intention information and the path planning result determined in step S102, and then the reservation pickup information may be confirmed to the user.
For the case that the path planning results are multiple, the reservation pickup information can be generated by selecting a proper path rule result from the path planning results according to preset rules. For example, the preset rules may include: when the path planning result corresponding to the goods-picking intention time has a travelable path, the reservation goods-picking information can be generated by the path planning result corresponding to the goods-picking intention time preferentially, and if the travelable path corresponding to the goods-picking intention time does not exist, the path planning result which is closest to the goods-picking intention time and has the least time consumption is generated into the reservation goods-picking information.
After the reservation pickup information of the target vehicle is determined, the reservation pickup information and the target vehicle identification can be correspondingly stored in a pre-created reservation result library. The reservation result library is used for storing reservation picking information of reserved vehicles entering the park so as to manage the conditions of the vehicles in the park.
After the reservation is completed, the reservation pick-up information can be issued to the target vehicle, and the target vehicle needs to pick up goods in the garden according to the reservation pick-up information so as to ensure the accuracy of road condition prediction information, thereby improving the accuracy of path prediction in the reservation of the following vehicle.
Further, in order to minimize the influence of the fact that the vehicle does not pick up according to the reserved pick up information on the following vehicles, the park vehicle scheduling method provided by the embodiment may further include: on the day of picking up the target vehicle, if the fact that the vehicle is not picked up according to the reserved picking up information is detected in the park before the target vehicle enters the park, the reserved picking up information of the target vehicle is updated, and the updated reserved picking up information is sent to a user corresponding to the target vehicle. That is, the route planning result needs to be redetermined according to the vehicle condition in the campus of the current day of the target vehicle pickup, and then new reservation pickup information is regenerated, and the specific process can refer to the related content and is not described herein.
Specifically, there are various ways of detecting whether a vehicle picks up goods according to reservation pick-up information. Two examples of which are listed below.
First, the reserved picking information further includes a recommended vehicle speed, and if it is detected that there is a vehicle in the park that does not travel at the recommended vehicle speed, it is determined that the vehicle is not picking according to the reserved picking information.
Second, the reserved picking information further comprises predicted time of each stage of entering the park, and if the fact that the vehicles in the park do not finish tasks of the corresponding stages according to the predicted time is detected, the vehicles are judged to be not picked according to the reserved picking information.
For example, a smaller amount of the load actually loaded by a certain vehicle than the reserved pick-up amount will result in a shorter loading time, which is inconsistent with the predicted time of the pick-up stage, and will not only result in inconsistent vehicle conditions at the departure stage and those considered during path planning, but will also affect vehicle conditions faced by the following oncoming vehicles.
Of course, in the implementation process, other detection manners may be adopted, for example, whether the vehicle driving deviates from the target driving path in the reserved picking information may also be detected, which is not limited herein.
According to the park vehicle scheduling method, the route planning result of the target vehicle is determined by predicting the vehicle condition in the park corresponding to the pick-up intention time of the target vehicle, further reservation pick-up information of the target vehicle is generated, the reservation of the vehicle to enter the park for pick-up is achieved, a reliable driving route is provided for the target vehicle reserved to enter the park, the condition that the refinery is blocked due to centralized pick-up of the vehicle is reduced, the queuing waiting time is shortened, and the pick-up efficiency of the vehicle is improved. And moreover, through grasping the reservation and picking information of each vehicle, the recent vehicle condition in the park can be known in advance, the vehicle scheduling in the park is facilitated, the order of the transport vehicles entering and exiting the park is improved, and the operation efficiency of the park is improved.
In a second aspect, based on the same inventive concept, an embodiment of the present invention further provides a campus vehicle dispatching apparatus, as shown in fig. 2, the campus vehicle dispatching apparatus 20 may include:
an obtaining module 210, configured to obtain information about a pick-up intention of a target vehicle, where the pick-up intention information includes a target item and a pick-up intention time;
the path planning module 220 is configured to determine a path planning result of the target vehicle based on the target goods, the campus road distribution, and the campus vehicle information corresponding to the pick-up intention time, where the campus vehicle information includes location prediction information and goods loading information of vehicles in the campus;
the reservation module 230 is configured to generate reserved pickup information of the target vehicle based on the pickup intention information and the path planning result, where the reserved pickup information includes a predicted pickup time and a target path.
In an alternative embodiment, the path planning result includes a first path and a second path. The path planning module 220 is configured to determine a target pick-up point according to the target item; determining a first path from an entrance of the target vehicle to a target pick-up point based on the target pick-up point, the campus road distribution, and the intra-campus vehicle position prediction information corresponding to the pick-up intent time; and determining a second path of the target vehicle from the target pick-up point to leave based on the reference goods information, the park road distribution and park vehicle information corresponding to the pick-up intention time, of the target goods meeting the preset risk condition in the park.
In an alternative embodiment, the campus vehicle dispatcher 20 may further include:
and the updating module is used for updating the reserved goods-picking information of the target vehicle and sending the updated reserved goods-picking information to a user of the target vehicle if the fact that the vehicle is not picked according to the reserved goods-picking information is detected in the park before the target vehicle enters the park.
In an alternative embodiment, the reservation pickup information further includes a recommended vehicle speed. And the updating module is used for judging that the vehicle does not pick up goods according to the reserved goods picking information if the fact that the vehicle does not travel according to the recommended vehicle speed exists in the park is detected.
In an optional implementation manner, the reserved goods-picking information further includes a predicted time of each stage of entering the park, and the updating module is configured to determine that the vehicle is not picked up according to the reserved goods-picking information if it is detected that the vehicle in the park does not complete the task of the corresponding stage according to the predicted time.
In an alternative embodiment, the path planning module 220 is further configured to:
and if no drivable path exists in the path planning result, adjusting the pick-up intention time, and re-determining the path planning result based on park vehicle information, the target goods and the park road distribution corresponding to the adjusted pick-up intention time.
In an alternative embodiment, the reservation module 230 includes:
a sending sub-module 231, configured to send the path planning result to a user of the target vehicle, so that the user can select the path planning result;
and the generation sub-module 232 is used for generating reservation pickup information of the target vehicle based on the pickup intention information and a path selection result fed back by a user.
It should be noted that, each of the above modules may be implemented by software code or may be implemented by hardware, such as an integrated circuit chip.
It should be further noted that, for the specific process of implementing the respective functions of the above modules, please refer to the specific content described in the method embodiment provided in the first aspect, which is not repeated herein.
In a third aspect, based on the same inventive concept, the embodiment of the present invention further provides an electronic device, which may be, for example, a server or other device having a data processing function and a communication function. As shown in fig. 3, the electronic device 30 may include: the system comprises a memory 301, a processor 302 and a computer program stored on the memory 301 and executable on the processor 302, wherein the processor 302 implements the steps of the method for dispatching a campus vehicle provided by any one of the embodiments of the first aspect. Specific implementation may be found in the method embodiments provided in the first aspect.
In a fourth aspect, based on the same inventive concept, an embodiment of the present invention further provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method for dispatching a campus vehicle provided by any of the embodiments of the first aspect. Specific implementation may be found in the method embodiments provided in the first aspect.
The present description is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus, devices, and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In this document, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element. The term "plurality" means two or more, including two or more.
While preferred embodiments of the present description have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the disclosure.
It will be apparent to those skilled in the art that various modifications and variations can be made in the present specification without departing from the spirit or scope of the specification. Thus, if such modifications and variations of the present specification fall within the scope of the claims and the equivalents thereof, the present specification is also intended to include such modifications and variations.
Claims (10)
1. A method of campus vehicle dispatch, the method comprising:
acquiring the goods-picking intention information of a target vehicle needing to be reserved for entering the park, wherein the goods-picking intention information is related information required by the target vehicle to be reserved for entering the park and comprises target goods and goods-picking intention time;
determining a path planning result of the target vehicle based on the target goods, the park road distribution and park vehicle information corresponding to the pick-up intention time, wherein the park vehicle information comprises position prediction information and goods loading information of vehicles in the park;
and generating reserved pickup information of the target vehicle based on the pickup intention information and the path planning result, wherein the reserved pickup information comprises the expected pickup time and the target path.
2. The method of claim 1, wherein the path planning result comprises a first path and a second path, the determining the path planning result for the target vehicle based on the target good, a campus road distribution, and campus vehicle information corresponding to the intent-to-pick time comprising:
determining a target pick-up point according to the target goods;
determining a first path from an entrance of the target vehicle to a target pick-up point based on the target pick-up point, the campus road distribution, and the intra-campus vehicle position prediction information corresponding to the pick-up intent time;
and determining a second path of the target vehicle from the target pick-up point to leave based on the reference goods information, the park road distribution and park vehicle information corresponding to the pick-up intention time, of the target goods meeting the preset risk condition in the park.
3. The method of claim 1, wherein after generating the reservation pick-up information for the target vehicle, further comprising:
and on the day of picking up the target vehicle, if the fact that the vehicle is not picked up according to the reserved picking up information is detected in the park before the target vehicle enters the park, updating the reserved picking up information of the target vehicle, and sending the updated reserved picking up information to a user of the target vehicle.
4. The method of claim 3, wherein the scheduled pick up information further includes a recommended vehicle speed, and wherein detecting that there is a vehicle in the campus that is not picking up according to the scheduled pick up information includes:
and if the fact that the vehicles do not travel according to the recommended vehicle speed exists in the park is detected, judging that the vehicles do not pick up according to the reserved pick-up information.
5. The method of claim 3, wherein the scheduled pick-up information further includes a predicted time for each stage of entering the campus, and wherein detecting the presence of a vehicle in the campus that is not picking up according to the scheduled pick-up information comprises:
and if the fact that the vehicles do not finish the tasks of the corresponding stages according to the predicted time is detected to exist in the park, judging that the vehicles do not pick up according to the reserved pick-up information.
6. The method as recited in claim 1, further comprising:
and if no drivable path exists in the path planning result, adjusting the pick-up intention time, and re-determining the path planning result based on park vehicle information, the target goods and the park road distribution corresponding to the adjusted pick-up intention time.
7. The method of claim 1, wherein the generating the reservation pick-up information for the target vehicle based on the pick-up intent information and the path planning result comprises:
transmitting the path planning result to a user of the target vehicle for selection by the user;
and generating reservation pickup information of the target vehicle based on the pickup intention information and a path selection result fed back by a user.
8. A campus vehicle dispatch device, the device comprising:
the system comprises an acquisition module, a storage module and a storage module, wherein the acquisition module is used for acquiring the pick-up intention information of a target vehicle needing to be reserved for entering a park, and the pick-up intention information is related information required by the target vehicle to be reserved for entering the park and comprises target goods and pick-up intention time;
the path planning module is used for determining a path planning result of the target vehicle based on the target goods, the park road distribution and park vehicle information corresponding to the pick-up intention time, wherein the park vehicle information comprises position prediction information and goods loading information of vehicles in the park;
the reservation module is used for generating reservation pickup information of the target vehicle based on the pickup intention information and the path planning result, wherein the reservation pickup information comprises expected pickup time and a target path.
9. An electronic device, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, which processor implements the steps of the method of any one of claims 1 to 7 when the program is executed.
10. A computer-readable storage medium, characterized in that a computer program is stored thereon, which program, when being executed by a processor, implements the steps of the method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311226336.5A CN117521994A (en) | 2021-10-25 | 2021-10-25 | Park vehicle scheduling method, device, equipment and storage medium |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311226336.5A CN117521994A (en) | 2021-10-25 | 2021-10-25 | Park vehicle scheduling method, device, equipment and storage medium |
| CN202111242027.8A CN113919732B (en) | 2021-10-25 | 2021-10-25 | Park vehicle scheduling method, device, equipment and storage medium |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111242027.8A Division CN113919732B (en) | 2021-10-25 | 2021-10-25 | Park vehicle scheduling method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117521994A true CN117521994A (en) | 2024-02-06 |
Family
ID=79242718
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311226336.5A Pending CN117521994A (en) | 2021-10-25 | 2021-10-25 | Park vehicle scheduling method, device, equipment and storage medium |
| CN202111242027.8A Active CN113919732B (en) | 2021-10-25 | 2021-10-25 | Park vehicle scheduling method, device, equipment and storage medium |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111242027.8A Active CN113919732B (en) | 2021-10-25 | 2021-10-25 | Park vehicle scheduling method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN117521994A (en) |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006172061A (en) * | 2004-12-15 | 2006-06-29 | Hitachi Software Eng Co Ltd | Method, device and system for managing reservation object |
| JP6257808B2 (en) * | 2015-01-16 | 2018-01-10 | 三菱電機株式会社 | Travel plan creation device and travel plan change method |
| CN108106624B (en) * | 2017-12-14 | 2021-05-11 | 广东工业大学 | Multi-user reservation scheduling path planning method and related device |
| CN112418467A (en) * | 2020-11-19 | 2021-02-26 | 上海有个机器人有限公司 | Storage robot-based reservation distribution method, system, medium and terminal |
| CN113159367A (en) * | 2021-01-04 | 2021-07-23 | 重庆周游科技有限公司 | Tour route planning method and device |
| CN113537883B (en) * | 2021-07-13 | 2023-09-08 | 长安大学 | Method and related device for vehicle allocation and monitoring in logistics park |
-
2021
- 2021-10-25 CN CN202311226336.5A patent/CN117521994A/en active Pending
- 2021-10-25 CN CN202111242027.8A patent/CN113919732B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113919732A (en) | 2022-01-11 |
| CN113919732B (en) | 2023-10-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108846617A (en) | Method of servicing is sent in full-automatic logistics pool with charge free | |
| CN110580593A (en) | goods sorting method, control system and goods sorting system | |
| CN110414895A (en) | Vehicle dispatch system and method | |
| CN114819420B (en) | Overhead traveling crane transportation path planning method based on conflict resolution | |
| CN109656241B (en) | Method and device for controlling a transport vehicle in an unmanned cabin | |
| CN110275492B (en) | Method and device for determining automatic guide transport vehicle driving path based on roadway | |
| EP4131709A1 (en) | Collaborative charging method and apparatus, and logistics devices | |
| WO2021015663A1 (en) | Delivery route planning apparatus and methods of generating delivery route plans | |
| CN107085748A (en) | Predictive vehicle task scheduling | |
| WO2023024776A1 (en) | Order delivery method, apparatus and system, and electronic device and computer-readable medium | |
| CN114580996A (en) | Method for discharging bin | |
| CN115719193A (en) | Logistics vehicle scheduling planning system of Internet of things | |
| CN110400111B (en) | Article dispatch method, device and system based on automatic driving vehicle | |
| CN113743747B (en) | Multi-AGV cooperative scheduling method and device in workshop environment | |
| Chawla et al. | Material handling robots fleet size optimization by a heuristic | |
| CN113919732B (en) | Park vehicle scheduling method, device, equipment and storage medium | |
| Hu et al. | A dynamic integrated scheduling method based on hierarchical planning for heterogeneous AGV fleets in warehouses | |
| CN109683504B (en) | Warehouse-out control method and device, electronic equipment and storage medium | |
| CN111703802B (en) | Control method and device for warehouse-in and warehouse-out process and warehousing system | |
| CN113988770B (en) | Transport vehicle on-road queuing control method and device and electronic equipment | |
| CN112101831A (en) | Goods delivery method, device, medium and electronic equipment | |
| CN111950943A (en) | Dispatching method, device and equipment for distribution vehicle and storage medium | |
| TW202008244A (en) | Dynamic logistics management system and method thereof | |
| CN115373398A (en) | Method and device for planning path of carrying equipment and electronic equipment | |
| Guizzi et al. | A dynamic milk run in WEEE reverse logistics |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20240411 Address after: Room 2101, Block B, Platinum Plaza, 5-15 Wenling Road, Laoshan District, Qingdao City, Shandong Province, 266100 Applicant after: Shandong Energy Chain Holding Co.,Ltd. Country or region after: China Address before: Building 7, Yard 1, Yaojiayuan South Road, Chaoyang District, Beijing, 100123, 5th Floor, Zone G Applicant before: CHEZHUBANG (BEIJING) TECHNOLOGY Co.,Ltd. Country or region before: China |
|
| TA01 | Transfer of patent application right |