Elevator dispatching method, system, device and medium

Abstract

The present invention discloses an elevator dispatching method, system, device and medium, the method relates to the field of elevator control, and specifically comprises: obtaining an elevator request from at least one mobile terminal; extracting the floor information of the elevator request, the floor information including the current floor of the mobile terminal and the target floor; calculating the best path of the elevator according to the floor information and the current floor of the elevator, and issuing a corresponding call instruction to control the current elevator to run according to the best path. The elevator dispatching method of the present invention can shorten the waiting time of the mobile terminal for the elevator, improve the elevator efficiency of the robot calling the elevator, and reduce the phenomenon of elevator congestion.

Description

Technical Field

[0001] The present invention relates to the field of elevator control, and in particular to an elevator scheduling method, system, device and computer-readable storage medium for a mobile terminal. Background Art

[0002] Indoor self-driving robots are currently widely used in hospitals, epidemic prevention stations and other places. As an important means of unmanned delivery of indoor materials, they have functions such as automatic path planning, automatic obstacle avoidance, and automatic charging. In addition, they also have the function of automatically taking the elevator in scenarios where floor switching is required for delivery, which greatly saves the time and labor costs of material delivery, especially in the scenario of epidemic stations, it also greatly reduces the risk of contact infection.

[0003] When a robot takes an elevator, it performs the task in the order in which it calls the elevator. If a single robot calls for a single elevator, there will be basically no efficiency problem. However, when multiple robots call for a single elevator at the same time, the elevator route is not optimized, resulting in a long waiting time for the elevator, which is likely to affect the efficiency of the robots that call the elevator later. It may cause a timeout and continuous retries while waiting for the elevator. In severe cases, it may cause a circular retry and wait, causing congestion in the elevator. Summary of the invention

[0004] In order to overcome the deficiencies of the prior art, one of the purposes of the present invention is to provide an elevator scheduling method for a mobile terminal, rationally plan elevator routes, and improve the elevator efficiency of multiple mobile terminals.

[0005] A second object of the present invention is to provide an elevator dispatching system for a mobile terminal.

[0006] A third object of the present invention is to provide an electronic device.

[0007] A fourth object of the present invention is to provide a computer-readable storage medium.

[0008] One of the purposes of the present invention is achieved by the following technical solution:

[0009] A method for dispatching elevators of a mobile terminal, comprising:

[0010] Obtaining an elevator ride request from at least one mobile terminal;

[0011] Extract the floor information of the elevator request, the floor information including the current floor of the mobile terminal and the target floor; calculate the best path of the elevator according to the floor information and the current floor of the elevator, and issue a corresponding call instruction to control the current elevator to run according to the best path.

[0012] Furthermore, in response to new elevator requests initiated by other mobile terminals while the elevator is traveling to the target floor, the current elevator is controlled to stop, and it is determined whether the new elevator request is a valid request, and the optimal path is recalculated based on the valid request.

[0013] Furthermore, the method for determining whether the new elevator request is a valid request includes:

[0014] Mark the initiation time of the elevator ride request currently being executed by the elevator as the initial time;

[0015] The initiation time of each new elevator request is compared with the initial time to calculate the time difference, and it is determined whether the time difference is within a preset range. If so, the new elevator request is marked as a valid request; otherwise, it is marked as a timed-out request.

[0016] Furthermore, the method for determining whether the new elevator request is a valid request also includes:

[0017] The elevator ride request currently being executed is also marked as a valid request, and the number of requests marked as valid requests is counted, and all valid requests are sorted according to the initiation time of the request. If the number of requests marked as valid requests is greater than the preset value, the valid requests arranged within the preset ranking are retained, and the valid requests arranged outside the preset ranking are eliminated and converted into timeout requests.

[0018] Furthermore, the elevator request marked as a timeout request generates a timeout reminder and sends it to the mobile terminal corresponding to the request, so that the mobile terminal re-initiates a new elevator request after a set time interval.

[0019] Furthermore, the method for calculating the optimal path of the elevator is:

[0020] Extract the floor information corresponding to each valid request, the floor information includes the current floor of the mobile terminal and the target floor; and combine the elevator paths in combination with the current floor of the elevator, calculate the number of floors passed by each elevator path after the combination, and mark the elevator path with the least number of floors as the best path; when multiple best paths appear, randomly select one best path to execute and issue the corresponding call instruction.

[0021] Furthermore, when the elevator runs according to the optimal path, it also includes:

[0022] In response to an arrival message fed back when the elevator arrives at the floor where the mobile terminal is located or the target floor, a long door opening instruction is issued to keep the elevator door open before the mobile terminal enters or leaves the elevator;

[0023] In response to the feedback message generated after the mobile terminal enters and exits the elevator, an elevator door closing command is issued and the elevator is controlled to continue to the next target floor, or switched to an idle stop state.

[0024] The second object of the present invention is achieved by adopting the following technical solution:

[0025] A mobile terminal elevator dispatching system comprises a mobile terminal, a server and an elevator controller; the server executes the mobile terminal elevator dispatching method as described above.

[0026] The third object of the present invention is achieved by adopting the following technical solution:

[0027] An electronic device comprises a processor, a memory and a computer program stored in the memory and executable on the processor, wherein the processor implements the elevator scheduling method for a mobile terminal as described above when executing the computer program.

[0028] The fourth object of the present invention is achieved by adopting the following technical solution:

[0029] A computer-readable storage medium stores a computer program, which, when executed, implements the above-mentioned elevator scheduling method for a mobile terminal.

[0030] Compared with the prior art, the present invention has the following beneficial effects:

[0031] When multiple mobile terminals initiate elevator requests at the same time, the best path is planned based on the floor where each mobile terminal is located, the target floor and the current floor of the elevator, so that the elevator can follow the best path; when the elevator receives an elevator request initiated by another mobile terminal on the way to the target floor, the validity of the elevator request can be judged, the best elevator path can be re-planned based on the valid request, and control instructions can be issued to the elevator to allow the elevator to follow the best elevator path, shortening the waiting time for the mobile terminal, improving the elevator efficiency of the robot that calls the elevator, and reducing elevator congestion. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 This is a terminal connection diagram of the elevator dispatching system of the present invention;

[0033] Figure 2 It is a schematic diagram of the flow of the elevator scheduling method of the present invention. DETAILED DESCRIPTION

[0034] The present invention is further described below in conjunction with the accompanying drawings and specific implementation methods. It should be noted that, under the premise of no conflict, the various embodiments or technical features described below can be arbitrarily combined to form a new embodiment.

[0035] Embodiment 1

[0036] This embodiment provides a method for scheduling elevator rides of mobile terminals, which is used to coordinate the elevator ride demands of multiple mobile terminals, shorten the time that mobile terminals wait for elevators as much as possible, and improve elevator ride efficiency.

[0037] like Figure 1 As shown, the method includes a mobile terminal, a server and an elevator controller; wherein the mobile terminal can be an indoor autonomous driving robot, or other movable intelligent devices.

[0038] The mobile terminal may be provided with a human-computer interaction system, a navigation control system, a drive control unit, etc., and the human-computer interaction system is used to realize human-computer interaction and command sending and receiving; the navigation control system is used to determine the position of the mobile terminal and guide the mobile terminal to travel along the planned route; the drive control unit is used to control the mobile terminal to move along the route.

[0039] The various system functions of the mobile terminal can be realized through auxiliary equipment installed on the robot. The auxiliary equipment includes infrared cameras, ordinary cameras, sensors, ultrasonic radars, etc. to assist the normal operation of the robot. At the same time, the mobile terminal also contains a router and a 4G communication module to achieve signal exchange with the server.

[0040] In this embodiment, the elevator mainly includes a car, a control panel, an elevator controller, a 4G communication module, etc. The elevator communicates signals with the server through its 4G communication module.

[0041] The server is deployed with an elevator dispatch service, and pre-enters mobile terminal information, elevator information, etc. to manage and control the mobile terminal and the elevator. In order to reduce the possibility of data loss, the mobile terminal in this embodiment establishes a TCP long connection with the elevator dispatch service through the 4G communication module. Similarly, the elevator also establishes a TCP connection with the dispatch service through the 4G communication module, so that the server and the mobile terminal and the elevator can communicate with each other in real time.

[0042] like Figure 2 As shown, the elevator scheduling method executed by the server specifically includes the following steps:

[0043] Step S1: obtaining an elevator ride request from at least one mobile terminal;

[0044] Step S2: extract the floor information of the elevator request, the floor information includes the current floor of the mobile terminal and the target floor; calculate the best path of the elevator according to the floor information and the current floor of the elevator, and issue a corresponding call instruction to control the current elevator to run according to the best path.

[0045] When the mobile terminal arrives at the elevator call point, the mobile terminal is triggered to send an elevator request to the elevator dispatching system, and the elevator request includes the current floor and the target floor of the mobile terminal.

[0046] When only a single mobile terminal initiates an elevator request, the elevator can operate according to the single elevator request, rising or descending to the current floor of the mobile terminal that initiated the elevator request. After the mobile terminal enters the elevator, the elevator can move to the target floor.

[0047] If another mobile terminal also calls the current elevator while the elevator is on its way to the target floor, the elevator dispatch system will immediately send an instruction to cancel the current call of the elevator, causing the elevator to pause, determine whether the new elevator request is a valid request, and trigger the elevator's optimal path function. It will recalculate the optimal path based on the valid request, reasonably plan the elevator route, and reduce the time the mobile terminal waits for the elevator.

[0048] When an elevator receives an elevator request from one or more mobile terminals while it is on its way to a target floor, it is necessary to determine whether the elevator request is a valid request, and the method includes:

[0049] Mark the elevator ride request currently being executed by the elevator as the first valid request, and mark the initiation time of the elevator ride request currently being executed by the elevator as the initial time;

[0050] The initiation time of each new elevator request is compared with the initial time to calculate the time difference, and determine whether the time difference is within the preset range. If so, it means that the time interval between the new elevator request and the first valid request is relatively short, that is, the new elevator request is initiated in a short time and can be included in the optimal path planning process as the data source for the optimal path planning. The new elevator request is marked as a valid request; otherwise, it is marked as a timeout request, which means that the initiation time of the new elevator request is too late and cannot be used as the basis for the optimal path planning.

[0051] Among them, the specific value of the preset range can be set based on experience, and can be set to 5s or 10s, which means that other elevator requests received within 5s or 10s after receiving the first valid request can be regarded as valid requests, and other elevator requests received outside 5s or 10s are marked as timed out requests.

[0052] In addition, in order to prevent the mobile terminal from timing out on the elevator call, when determining whether the elevator request is a valid request, it is also necessary to count the number of requests marked as valid requests and sort the valid requests according to the initiation time of the requests; among them, the elevator requests currently being executed by the elevator are also counted as valid requests. For example, if the elevator is currently executing the best path planned by two elevator requests, the number of valid requests is 2+n, where n is the number of new elevator requests received during the operation of the elevator.

[0053] If the total number of requests marked as valid requests is greater than the preset value, the valid requests within the preset ranking are retained, and the valid requests outside the preset ranking are removed and converted to timeout requests. The preset ranking can be customized, for example, only the elevator requests from the first three mobile terminals are restricted, and the elevator requests initiated by the mobile terminals after the first three are converted to timeout requests.

[0054] The elevator request marked as a timeout request can generate a timeout reminder and send it to the mobile terminal corresponding to the request, notifying the mobile terminal to re-initiate a new elevator request after a set time interval. The timeout request can also be recorded and saved according to the initiation time of the request. After the best path is completed, the timeout request can be read and the next path planning can be continued according to the initiation time of the timeout request.

[0055] In this embodiment, the best path of the elevator is calculated according to multiple valid requests. The best path is the shortest path, and its calculation elements include the current floor of the elevator, the current floors of the mobile terminals corresponding to all valid requests, and the target floors they are going to. The path planning rule in this embodiment is the current floor of the elevator -> the current floor of robot A -> the target floor of robot A -> the current floor of robot B -> the target floor of robot B -> ... and so on;

[0056] Specifically, the floor information corresponding to each valid request is extracted, and the floor information includes the current floor of the mobile terminal and the target floor; and the elevator riding path is permuted and combined in combination with the current floor of the elevator, and all possible paths are calculated through permutations and combinations. For example, if the number of valid requests is n, all possible paths calculated according to the permutations and combinations are: n*(n-1) possible paths.

[0057] Afterwards, the number of floors passed by each elevator path after permutation and combination is calculated, and the elevator path with the least number of floors is marked as the best path. The number of floors can be calculated by the absolute value of the difference between the two adjacent floors of each path and the length of the path can be obtained by adding them up. The path with the smallest length becomes the shortest path. For example, the path is 3 floors -> 2 floors -> 1 floors -> 4 floors -> 7 floors -> 6 floors -> 9 floors, and the path length is 12 floors. When multiple best paths appear, a best path is randomly selected to run and the corresponding call instruction is issued.

[0058] When the elevator runs according to the optimal path, it also includes:

[0059] When the elevator arrives at the floor where the mobile terminal is located or the target floor, the elevator dispatching service is notified. In response to the arrival message fed back when the elevator arrives at the floor where the mobile terminal is located or the target floor, the elevator dispatching service sends a long door opening command to the elevator to keep the door open before the mobile terminal enters or leaves the elevator. In addition, in response to the feedback message generated after the mobile terminal enters or exits the elevator, the elevator door closing command can be sent and the elevator can be controlled to continue to the next target floor, or switch to an idle stop state.

[0060] Specifically, when the elevator reaches the floor where the mobile terminal is currently located, it sends an instruction to control the mobile terminal to enter the elevator. After the mobile terminal enters the elevator, it notifies the elevator dispatch service, or the elevator senses that the mobile terminal has entered the elevator and notifies the elevator dispatch service. The elevator dispatch service can then send an elevator door closing instruction based on the feedback message and control the elevator to continue to go to its target floor; after the elevator reaches the target floor that the mobile terminal needs to go to, it notifies the elevator dispatch service. The elevator dispatch service sends a long door opening instruction to the elevator to keep the door open, and sends an instruction to control the mobile terminal to exit the elevator. After the mobile terminal exits the elevator, it notifies the elevator dispatch service, and the elevator dispatch service sends a control elevator door closing instruction. If there is a next path node in the elevator path at this time, the elevator dispatch service continues to go to the departure floor of the next mobile terminal, repeating the above steps to transfer the smart terminal to the target floor it needs to reach; if there is no next path node in the elevator path, the elevator becomes idle and stops, and the elevator stays on the current floor until a new elevator request is received.

[0061] Embodiment 2

[0062] The present embodiment provides an elevator dispatching system for a mobile terminal, comprising a mobile terminal, a server and an elevator controller; the server deploys an elevator dispatching service and executes the elevator dispatching method for a mobile terminal as described in the first embodiment.

[0063] In this embodiment, the mobile terminal establishes a long connection with the elevator dispatch service through TCP. When the mobile terminal needs to take the elevator to switch floors, it will initiate an elevator request to the dispatch service. After receiving the request from the mobile terminal, the elevator dispatch service will calculate the optimal elevator path based on the current floor of the elevator, the current floor of the mobile terminal, the target floor, the time when the mobile terminal called the elevator, and other factors. According to the obtained optimal path, a control instruction is issued to the elevator to let the elevator go to the floor where the mobile terminal is located. When the elevator arrives, the elevator service will control the mobile terminal to enter the elevator and control the elevator to the target floor corresponding to the mobile terminal. After the mobile terminal exits the elevator, if there is a new mobile terminal calling the elevator at this time, the elevator dispatch service will recalculate the optimal path and continue the task, otherwise it will continue to proceed and the previously planned path will become idle.

[0064] In addition, in some embodiments, an electronic device is provided, which includes a processor, a memory, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the elevator scheduling method for the mobile terminal in Embodiment 1 is implemented; in addition, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed, the elevator scheduling method for the mobile terminal described above is implemented.

[0065] The system, device and storage medium in this embodiment and the method in the aforementioned embodiment are based on multiple aspects of the same inventive concept. The method implementation process has been described in detail above, so those skilled in the art can clearly understand the structure and implementation process of the system, device and storage medium in this embodiment based on the aforementioned description. For the sake of brevity, they will not be repeated here.

[0066] The above-mentioned embodiments are only preferred embodiments of the present invention and cannot be used to limit the scope of protection of the present invention. Any non-substantial changes and substitutions made by technicians in this field on the basis of the present invention shall fall within the scope of protection required by the present invention.

Claims

1. A method for dispatching elevators, characterized in that: include: Obtaining an elevator ride request from at least one mobile terminal; Extracting floor information of the elevator ride request, the floor information including the current floor of the mobile terminal and the target floor; Calculate the best path of the elevator according to the floor information and the current floor of the elevator, and issue a corresponding call instruction to control the current elevator to run according to the best path; In response to a new elevator request initiated by other mobile terminals while the elevator is heading to the target floor, the current elevator is controlled to stop, and it is determined whether the new elevator request is a valid request, and the optimal path is recalculated according to the valid request; The method for determining whether the new elevator request is a valid request includes: Mark the initiation time of the elevator ride request currently being executed by the elevator as the initial time; The initiation time of each new elevator request is compared with the initial time to calculate the time difference, and it is determined whether the time difference is within a preset range. If so, the new elevator request is marked as a valid request; otherwise, it is marked as a timed-out request; The method for determining whether the new elevator request is a valid request also includes: The elevator ride request currently being executed is also marked as a valid request, and the number of requests marked as valid requests is counted. All valid requests are sorted according to the initiation time of the request. If the number of requests marked as valid requests is greater than the preset value, the valid requests arranged within the preset ranking are retained, and the valid requests arranged outside the preset ranking are removed and converted into timeout requests; The method for calculating the optimal path of the elevator is: Extract the floor information corresponding to each valid request, the floor information includes the current floor of the mobile terminal and the target floor; and combine the elevator paths in combination with the current floor of the elevator, calculate the number of floors passed by each elevator path after the combination, and mark the elevator path with the least number of floors as the best path; when multiple best paths appear, randomly select one best path to execute and issue the corresponding call instruction.

2. The elevator dispatching method according to claim 1, characterized in that: The elevator request marked as a timeout request generates a timeout reminder and sends it to the mobile terminal corresponding to the elevator request, so that the mobile terminal re-initiates a new elevator request after a set time interval.

3. The elevator dispatching method according to claim 1, characterized in that: When the elevator runs according to the optimal path, it also includes: In response to an arrival message fed back when the elevator arrives at the floor where the mobile terminal is located or the target floor, a long door opening instruction is issued to keep the elevator door open before the mobile terminal enters or leaves the elevator; In response to the feedback message generated after the mobile terminal enters and exits the elevator, an elevator door closing command is issued and the elevator is controlled to continue to the next target floor, or switched to an idle stop state.

4. An elevator dispatching system, characterized in that: It comprises a mobile terminal, a server and an elevator controller; the server executes the elevator scheduling method as described in any one of claims 1 to 3.

5. An electronic device, characterized in that: It includes a processor, a memory, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the elevator scheduling method described in any one of claims 1 to 3 is implemented.

6. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed, the elevator scheduling method described in any one of claims 1 to 3 is implemented.

Images