CN112633634A

CN112633634A - Automatic scheduling method applied to airport non-trailing unmanned luggage transport vehicle

Info

Publication number: CN112633634A
Application number: CN202011360298.9A
Authority: CN
Inventors: 刘志洋; 杜强; 王建楹; 王少参; 刘建伟; 刘浩江; 王玉龙
Original assignee: Beijing Capital International Airport Co ltd; CISC Haiwei Zhengzhou High Tech Co Ltd
Current assignee: Beijing Capital International Airport Co ltd; CISC Haiwei Zhengzhou High Tech Co Ltd
Priority date: 2020-11-27
Filing date: 2020-11-27
Publication date: 2021-04-09
Anticipated expiration: 2040-11-27
Also published as: CN112633634B

Abstract

An automatic scheduling method applied to an airport non-towed unmanned luggage transfer cart comprises a container luggage cart to operation machine position scheduling method and a bulk luggage to operation machine position scheduling method, wherein a luggage conveying task assigned by a superior system is received, the input task is added into an operation sequence, and then the input task is sequenced according to the sequence of the arrival time of the luggage; checking whether the work L is borne by a nearby luggage van; checking whether the operation L is bulk luggage or container luggage, carrying the bulk luggage or the container luggage on a luggage van of the L operation machine position, selecting the shortest path or the path designated by an airport, and conveying the luggage to a designated luggage loading platform to unload the luggage; the container luggage van needs to travel to an empty container unloading area to unload the container; and checking whether all the jobs are executed. The invention can automatically schedule the baggage transportation vehicle all weather, realizes the fine management of the baggage transportation vehicle, improves the utilization rate of equipment, greatly reduces the number of scheduling personnel and reduces the labor cost.

Description

Automatic scheduling method applied to airport non-trailing unmanned luggage transport vehicle

Technical Field

The invention relates to an automatic scheduling method applied to an airport non-trailing unmanned luggage transport vehicle.

Background

In the existing airport, the baggage transportation vehicle still adopts the traditional manual driving mode to transport the baggage. The dispatching of baggage transportation vehicles typically takes the form of: the computer receives the luggage conveying task, the dispatcher manually dispatches the order according to experience, and the computer outputs the task order. The driver completes the transportation of the luggage according to the task list. The traditional luggage transport vehicle dispatching mode mainly depends on the experience of a dispatcher, and the fine management of equipment is difficult to realize. For a large-scale or hub airport with a large luggage amount, a considerable number of experienced dispatchers are usually required to be trained to carry out a 24-hour shift duty mode, so that dispatching of luggage vehicles is realized, the equipment utilization rate is low, the working intensity of personnel is high, and the labor cost is high. With the rapid development of the unmanned technology, it is expected that the unmanned baggage transportation vehicle will replace the existing baggage transportation vehicle in the near future, and the equipment equipped on the unmanned baggage transportation vehicle, such as wireless communication, precise positioning, automatic navigation, and the like, provides a hardware basis for realizing the automatic dispatching of the baggage transportation vehicle in an airport.

Disclosure of Invention

In order to solve the problems, an automatic scheduling method applied to the non-towed unmanned baggage transportation vehicle in the airport is provided based on the use of the non-towed unmanned baggage transportation vehicle in the airport.

The object of the invention is achieved in the following way:

an automatic scheduling method applied to an airport non-trailing unmanned baggage transfer cart comprises a container baggage cart-to-operation-place scheduling method and a bulk baggage-to-operation-place scheduling method, and the scheduling method comprises the following steps:

s1: receiving a luggage conveying task assigned by a superior system, adding the input task into an operation sequence, and then sequencing the operation sequence according to the sequence of the arrival time of the luggage;

s2: checking whether the work L is borne by a nearby luggage van; if so, finishing scheduling the job L and scheduling the next job; if not, entering the following steps;

s3: checking whether the operation L is bulk luggage or container luggage, if the operation L is the bulk luggage, entering a dispatching module of the bulk luggage vehicle to an operation dispatching machine position, and dispatching the bulk luggage vehicle to the operation dispatching machine position for waiting the luggage; if the container luggage is the container luggage, the container luggage vehicle needs to enter an operation machine position dispatching module, and the container luggage vehicle is dispatched to an L operation machine position;

s4: loading bulk luggage or container luggage on a luggage van of the L-shaped operation machine position, selecting the shortest path or the path designated by an airport, and conveying the luggage to a designated luggage loading platform to unload the luggage; the container luggage van needs to travel to an empty container unloading area to unload the container;

s5: checking whether all the jobs are executed; if yes, the luggage van is checked whether charging is needed. If necessary, the luggage van is charged to the parking area, and the state of the luggage van is updated to be 'charged'; after the charging is finished, the state is updated to be idle. If the luggage van does not need to be charged, the luggage van returns to the parking area, and the state is updated to be idle. If not, the next operation is executed.

The dispatching steps from the container luggage van to the operation machine position are as follows:

1) firstly, checking whether a container luggage van in an idle state exists at an empty container unloading position on the same side with the L operation; if so, checking whether the luggage van needs to be charged; if the charging is not needed, calculating whether the time lead meets the operation requirement; if charging is needed, sending the luggage van back to the parking area for charging, and then executing the step 3); if the time lead meets the requirement, the vehicle is dispatched to an operation machine position, and the step 2) is executed; if the container luggage van with the side not in the idle state or the time lead does not meet the requirement, inquiring the condition of the unloading position of the empty container on the opposite side, and executing the step 3);

2) the container luggage van dispatched from the same side selects a path to the machine position and then runs to the machine position; during the driving process, the position and the state of the luggage van are monitored in real time, the stop time of the luggage van during the driving process is accumulated, and the consumed waiting time percentage lambda is calculated. And if the lambda does not reach the critical value, the luggage van reaches the machine position, and the L operation is finished. If lambda reaches the critical value and the luggage vehicle does not reach the machine position, another container luggage vehicle is dispatched from the parking area to execute the L operation;

3) checking whether the container luggage van with the state of being idle exists on the different side, and if not, dispatching the container luggage van from the parking area to execute the operation; if so, checking whether the luggage van needs to be charged; if the charging is not needed, checking whether the product of the time lead, the time interval Tj from the current container luggage task to the next container luggage task at the side and the correction factor Ky meets the requirement or not; if charging is needed, the luggage van is sent back to the parking area for charging, and then the luggage van is dispatched from the parking area for executing operation. If the requirements are not met, dispatching the car from the parking area to execute the operation; if yes, dispatching the vehicle from the side to execute the operation;

4) and monitoring the arrival situation of the luggage van at the parking space in real time. After the luggage vehicle arrives at the machine position, if the luggage vehicle which does not arrive at the machine position and executes the same operation exists, the operation task of the luggage vehicle is cancelled, and whether the operation can be executed or not is searched within the specified time range and the specified distance range; if so, the unreachable vehicle executes the selected job and deletes the executed job from the job sequence; if not, the luggage van drives to the parking area to be standby.

The dispatching steps from the bulk luggage van to the operation machine position are as follows:

1) firstly, checking whether a loading platform at the same side of the L operation has a bulk luggage van in an idle state; if so, checking whether the luggage van needs to be charged; if the charging is not needed, calculating whether the time lead meets the operation requirement; if charging is needed, sending the luggage van back to the parking area for charging, and then executing the step 3); if the time lead meets the requirement, the vehicle is dispatched to an operation machine position, and the step 2) is executed; if the bulk luggage vehicles with the side not in the idle state or the time lead does not meet the requirement, inquiring the unloading situation of the empty container on the opposite side, and executing the step 3);

2) the bulk luggage van dispatched from the same side selects a path to the machine position and then drives to the machine position; during the driving process, the position and the state of the luggage van are monitored in real time, the stop time of the luggage van during the driving process is accumulated, and the consumed waiting time percentage lambda is calculated. And if the lambda does not reach the critical value, the luggage van reaches the machine position, and the L operation is finished. If lambda reaches the critical value and the luggage vehicle does not reach the machine position, another container luggage vehicle is dispatched from the parking area to execute the L operation;

3) checking whether a bulk luggage vehicle in an idle state exists on the opposite side, and if not, dispatching the bulk luggage vehicle from the parking area to execute operation; if so, checking whether the luggage van needs to be charged; if the charging is not needed, checking whether the product of the time lead, the time interval Tj from the current container luggage task to the next container luggage task at the side and the correction factor Ky meets the requirement or not; if charging is needed, the luggage van is sent back to the parking area for charging, and then the luggage van is dispatched from the parking area for executing operation. If the requirements are not met, dispatching the car from the parking area to execute the operation; if yes, dispatching the vehicle from the side to execute the operation;

The invention has the beneficial effects that: the automatic scheduling method applied to the non-towed unmanned baggage transport vehicle in the airport can automatically schedule the baggage transport vehicle all day long, realize the fine management of the baggage transport vehicle, improve the utilization rate of equipment, greatly reduce the number of scheduling personnel, lighten the working intensity of the working personnel and reduce the labor cost.

Drawings

Fig. 1 is a general flowchart of an automatic dispatching method applied to an airport non-trailing unmanned baggage transportation vehicle according to the present invention.

Detailed Description

The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.

It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure as claimed. Unless defined otherwise, all technical and scientific terms used herein have the same technical meaning as commonly understood by one of ordinary skill in the art to which this application belongs.

It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise, and it should be further understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of the stated features, steps, operations, devices, components, and/or combinations thereof.

In the present invention, terms such as "upper", "lower", "left", "right", "front", "rear", "vertical", "horizontal", "side", "bottom", and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only relational terms determined for convenience in describing structural relationships of the respective parts or elements of the present invention, and are not intended to refer to any part or element of the present invention, and are not to be construed as limiting the present invention.

In the present invention, terms such as "fixedly connected", "connected", and the like are to be understood in a broad sense, and mean either a fixed connection or an integrally connected or detachable connection; may be directly connected or indirectly connected through an intermediate. The specific meanings of the above terms in the present invention can be determined according to specific situations by persons skilled in the relevant scientific or technical field, and are not to be construed as limiting the present invention.

s2: checking whether the work L is borne by a nearby luggage van; if so, the job L is scheduled, and the next job scheduling is carried out (L = L + 1); if not, entering the following steps;

s4: the baggage car at the L-work station carries bulk baggage or container baggage, selects the shortest route or a route designated at an airport, and delivers the baggage to a designated loading platform to unload the baggage. The container luggage van needs to travel to an empty container unloading area to unload the container;

s5: and checking whether all the jobs are executed. If yes, the luggage van is checked whether charging is needed. If necessary, the luggage van is charged to the parking area, and the state of the luggage van is updated to be 'charged'; after the charging is finished, the state is updated to be idle. If the luggage van does not need to be charged, the luggage van returns to the parking area, and the state is updated to be idle. If not, the next job is executed (L = L + 1).

In the description of the embodiments of the present invention, it should be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", "clockwise", "counterclockwise", etc. indicate orientations or positional relationships that are based on the orientations or positional relationships shown in the drawings, and are used only for convenience in describing the embodiments of the present invention and for simplicity in description, but do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore, should not be construed as limiting the embodiments of the present invention. Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, features defined as "first", "second", may explicitly or implicitly include one or more of the described features. In the description of the embodiments of the present invention, "a plurality" means two or more unless specifically limited otherwise.

In the description of the embodiments of the present invention, it should be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as being fixedly connected, detachably connected, or integrally connected; may be mechanically connected, may be electrically connected or may be in communication with each other; either directly or indirectly through intervening media, either internally or in any other relationship. Specific meanings of the above terms in the embodiments of the present invention can be understood by those of ordinary skill in the art according to specific situations.

In embodiments of the invention, unless expressly stated or limited otherwise, the first feature "on" or "under" the second feature may comprise the first and second features being in direct contact, or the first and second features being in contact, not directly, but via another feature therebetween. Also, the first feature being "on," "above" and "over" the second feature includes the first feature being directly on and obliquely above the second feature, or merely indicating that the first feature is at a higher level than the second feature. A first feature being "under," "below," and "beneath" a second feature includes the first feature being directly above and obliquely above the second feature, or simply meaning that the first feature is at a lesser level than the second feature.

The following disclosure provides many different embodiments or examples for implementing different configurations of embodiments of the invention. To simplify the disclosure of embodiments of the invention, the components and arrangements of specific examples are described below. Of course, they are merely examples and are not intended to limit the present invention. Furthermore, embodiments of the invention may repeat reference numerals and/or reference letters in the various examples, which have been repeated for purposes of simplicity and clarity and do not in themselves dictate a relationship between the various embodiments and/or arrangements discussed. In addition, embodiments of the present invention provide examples of various specific processes and materials, but one of ordinary skill in the art may recognize applications of other processes and/or use of other materials.

In the description herein, references to the terms "one embodiment," "some embodiments," "an illustrative embodiment," "an example," "a specific example" or "some examples" or the like mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.

Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.

The logic and/or steps represented in the flowcharts or otherwise described herein, such as an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processing module-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.

It should be understood that portions of embodiments of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.

It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and the program, when executed, includes one or a combination of the steps of the method embodiments.

In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware form, and can also be realized in a software functional module form. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.

The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.

Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and not to be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made in the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims

1. An automatic scheduling method applied to an airport non-trailing unmanned luggage transport vehicle is characterized in that: the method comprises a container luggage vehicle-to-operation machine position scheduling method and a bulk luggage-to-operation machine position scheduling method, wherein the scheduling method comprises the following steps:

s5: checking whether all the jobs are executed; if yes, checking whether the luggage van needs to be charged;

if necessary, the luggage van is charged to the parking area, and the state of the luggage van is updated to be charged; after the charging is finished, the state is updated to be idle; if the luggage van does not need to be charged, the luggage van returns to the parking area, and the state is updated to be idle; if not, the next operation is executed.

2. The method of claim 1, applied to an automated dispatch for an airport hitless unmanned baggage claim, further comprising: the dispatching steps from the container luggage van to the operation machine position are as follows:

1) firstly, checking whether a container trolley in an idle state exists at an empty container unloading position on the same side as the L operation; if so, checking whether the luggage van needs to be charged; if the charging is not needed, calculating whether the time lead meets the operation requirement; if charging is needed, sending the luggage van back to the parking area for charging, and then executing the step 3); if the time lead meets the requirement, the vehicle is dispatched to an operation machine position, and the step 2) is executed; if the container luggage vehicles with the side having no idle state or the time lead does not meet the requirement, inquiring the condition of the unloading position of the empty container on the opposite side, and executing the step 3);

2) the container luggage van dispatched from the same side selects a path to the machine position and then runs to the machine position; in the driving process, the position and the state of the luggage van are monitored in real time, the stop time of the luggage van in the driving process is accumulated, and the consumed waiting time percentage lambda is calculated; if the lambda does not reach the critical value, the luggage van arrives at the machine position, and the L operation is finished;

if lambda reaches the critical value and the luggage vehicle does not reach the machine position, another container luggage vehicle is dispatched from the parking area to execute the L operation;

3) checking whether container luggage vehicles in idle states exist on different sides, and if not, dispatching vehicles from the parking area to execute operation; if so, checking whether the luggage van needs to be charged; if the charging is not needed, checking whether the product of the time lead, the time interval Tj from the current container luggage task to the next container luggage task at the side and the correction factor Ky meets the requirement or not; if charging is needed, the luggage van is sent to the parking area for charging, and then the luggage van is dispatched from the parking area to execute operation;

if the requirements are not met, dispatching the car from the parking area to execute the operation; if yes, dispatching the vehicle from the side to execute the operation;

4) monitoring the arrival situation of the luggage van at the machine position in real time;

after the luggage vehicle arrives at the machine position, if the luggage vehicle which does not arrive at the machine position and executes the same operation exists, the operation task of the luggage vehicle is cancelled, and whether the operation can be executed or not is searched within the specified time range and the specified distance range; if so, the unreachable vehicle executes the selected job and deletes the executed job from the job sequence; if not, the luggage van drives to the parking area to be standby.

3. The method of claim 1, applied to an automated dispatch for an airport hitless unmanned baggage claim, further comprising: the dispatching steps from the bulk luggage van to the operation machine position are as follows:

1) firstly, checking whether a loading platform at the same side of the L operation has a bulk luggage van in an idle state; if so, checking whether the luggage van needs to be charged; if the charging is not needed, calculating whether the time lead meets the operation requirement; if charging is needed, sending the luggage van back to the parking area for charging, and then executing the step 3); if the time lead meets the requirement, the vehicle is dispatched to an operation machine position, and the step 2) is executed; if the bulk cargo vehicles with the side not in idle state or the time lead does not meet the requirement, inquiring the unloading situation of the empty container on the opposite side, and executing the step 3);

2) the bulk luggage van dispatched from the same side selects a path to the machine position and then drives to the machine position; in the driving process, the position and the state of the luggage van are monitored in real time, the stop time of the luggage van in the driving process is accumulated, and the consumed waiting time percentage lambda is calculated;

if the lambda does not reach the critical value, the luggage van arrives at the machine position, and the L operation is finished;

3) checking whether a bulk luggage van in an idle state exists on the opposite side, and if not, dispatching the bulk luggage van from the parking area to execute operation; if so, checking whether the luggage van needs to be charged; if the charging is not needed, checking whether the product of the time lead, the time interval Tj from the current container luggage task to the next container luggage task at the side and the correction factor Ky meets the requirement or not; if charging is needed, the luggage van is sent to the parking area for charging, and then the luggage van is dispatched from the parking area to execute operation;