CN114821886A - Scheduling server, scheduling robot and reminding system - Google Patents
Scheduling server, scheduling robot and reminding system Download PDFInfo
- Publication number
- CN114821886A CN114821886A CN202210717232.3A CN202210717232A CN114821886A CN 114821886 A CN114821886 A CN 114821886A CN 202210717232 A CN202210717232 A CN 202210717232A CN 114821886 A CN114821886 A CN 114821886A
- Authority
- CN
- China
- Prior art keywords
- robot
- terminal
- reminding
- scheduling
- dispatching
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- G—PHYSICS
- G08—SIGNALLING
- G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
- G08B21/00—Alarms responsive to a single specified undesired or abnormal condition and not otherwise provided for
- G08B21/18—Status alarms
- G08B21/24—Reminder alarms, e.g. anti-loss alarms
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Emergency Management (AREA)
- Manipulator (AREA)
Abstract
The application provides a scheduling server, a scheduling robot and a reminding system, wherein the scheduling server comprises a memory and a processor, a computer program which can run on the processor is stored in the memory, and the processor is used for realizing the following steps when calling and executing the computer program: receiving a first message from an application server, wherein the first message comprises the position information of a first terminal and the information of a first event; determining a first reminding robot from the scheduling robots based on the position information of the first terminal; and sending a reminding message to the first reminding robot, wherein the reminding message is used for indicating the first reminding robot to remind a user corresponding to the first terminal of the first event under the condition that the distance between the first reminding robot and the first terminal is within a first preset range. The scheduling robot is moved to the position near the user to be reminded to remind, the reminding effect is good, and the situation of number passing can be avoided.
Description
Technical Field
The application relates to the technical field of mobile robots, in particular to a scheduling server, a scheduling robot and a reminding system.
Background
With the improvement of living standard of people, more and more people like going out to have a dinner to taste various gourmets. In the peak of dining, some hot restaurants in a shopping mall are always full, and in order to improve service efficiency and user satisfaction, a queuing system is introduced into many merchants, so that users waiting in line can have meals according to the principle of coming first and coming last.
After the user finishes queuing on the queuing system, if the waiting time is long, the user usually selects to move in a market, and the user is very easy to miss the on-site calling because the user cannot master the on-site queuing state. In the related art, the user can also be informed of the queuing state by pushing the number message to the intelligent terminal of the user, however, the user still easily misses the reminding message due to the fact that the intelligent terminal is set to be in the mute state or the user is inconvenient to pay attention to the intelligent terminal and the like, and further cannot have a meal in time.
Disclosure of Invention
The application provides a dispatch server, dispatch robot and warning system, through making the dispatch robot remove near the user of treating reminding and remind, it is better to remind the effect, can avoid appearing the condition of passing a number.
In a first aspect, the present application provides a dispatch server, where the dispatch server includes a memory and a processor, the memory stores a computer program executable on the processor, and the processor is configured to call and execute the computer program to implement the following steps:
receiving a first message from an application server, wherein the first message comprises position information of a first terminal and information of a first event; determining a first reminding robot from the scheduling robots based on the position information of the first terminal; and sending a reminding message to the first reminding robot, wherein the reminding message is used for indicating the first reminding robot to remind a user corresponding to the first terminal of the first event when the first reminding robot moves to a position where the distance between the first reminding robot and the first terminal is within a first preset range.
According to the scheduling server provided by the embodiment of the application, after the scheduling server receives the first message from the application server, the first reminding robot for reminding the user corresponding to the first terminal can be determined from the scheduling robot based on the position information of the first terminal, and the first reminding robot can be directly moved to the vicinity of the user and remind the user of first events such as number arrival, meal taking and goods arrival by sending the reminding message to the first reminding robot. The reminding mode is more direct and effective, the robot equipped in some places can be fully utilized to achieve a better reminding effect, the condition that a user misses a meal and a commodity can be avoided, and the dining experience or shopping experience of the user can be improved.
With reference to the first aspect, in a possible embodiment, the determining a first reminding robot from scheduling robots based on the location information of the first terminal includes:
and determining the dispatching robot with the distance from the first terminal within a second preset range as the first reminding robot according to the position information of the first terminal and the position information of the dispatching robot.
With reference to the first aspect, in a possible embodiment, if there are multiple scheduling robots within the second preset range, the determining a first reminding robot from the scheduling robots based on the location information of the first terminal further includes:
determining a dispatching robot meeting a preset condition in the plurality of dispatching robots as the first reminding robot, wherein the preset condition comprises one or more of the following conditions: and the terminal is closest to the first terminal and is in an idle state.
With reference to the first aspect, in a possible embodiment, before the step of determining the first reminding robot from the scheduling robot based on the location information of the first terminal, the processor is configured to call and execute the computer program, and further implement the following steps:
acquiring state information corresponding to each robot in one or more robots, wherein the state information is used for indicating whether the robot is a dispatching robot or not;
and determining one or more dispatching robots from the one or more robots according to the state information corresponding to each robot.
Optionally, the information of the first event includes serial number information or store reservation and arrival information.
In a second aspect, the present application provides a dispatching robot, including a memory and a processor, where the memory stores a computer program operable on the processor, and the processor is configured to call and execute the computer program to implement the following steps:
receiving a reminding message from a scheduling server; and under the condition that the distance between the first terminal and the reminding message is within a first preset range, reminding a first event to a user corresponding to the first terminal.
With reference to the second aspect, in a possible embodiment, the reminding the user corresponding to the first terminal of the first event includes: and prompting the first event by voice and/or displaying and prompting the first event.
Optionally, the information of the first event includes serial number information or store reservation and arrival information.
With reference to the second aspect, in a possible embodiment, the prompting message includes location information of the first terminal, and moving to a distance from the first terminal within a first preset range according to the prompting message includes:
planning a temporary travelling route according to the position information of the first terminal and the current position information of the dispatching robot;
moving toward the first terminal along the temporary travel route.
With reference to the second aspect, in a possible embodiment, after the reminding the user corresponding to the first terminal of the first event, the processor is configured to further implement the following steps when invoking and executing the computer program:
moving along the original traveling route.
In a third aspect, the present application provides a reminding system, including the dispatching server provided in any one of the foregoing first aspect and possible embodiments of the first aspect, and the dispatching robot provided in any one of the foregoing second aspect and possible embodiments of the second aspect.
In a fourth aspect, the present application provides an application server, including a memory and a processor, where the memory stores a computer program executable on the processor, and the processor is configured to call and execute the computer program to implement the following steps:
acquiring position information of a first terminal;
and sending a first message to a scheduling server, wherein the first message comprises the position information of the first terminal and the information of the first event.
Optionally, the information of the first event includes a queuing event or store reservation arrival information.
It is understood that the beneficial effects of the second to fourth aspects can be seen from the description of the first aspect, and are not described herein again.
Drawings
Fig. 1 is a schematic application scenario diagram of a dispatch server according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a dispatch server according to an embodiment of the present application;
FIG. 3 is a schematic diagram illustrating an interaction process of a reminder system according to an embodiment of the present application;
FIG. 4 is a schematic diagram illustrating an interaction process of an application server according to an embodiment of the present application;
FIG. 5 is a schematic diagram illustrating an interaction process between a dispatching server and a dispatching robot according to another embodiment of the present application;
FIG. 6 is a schematic structural diagram of a dispatching robot provided in an embodiment of the present application;
fig. 7 is a schematic structural diagram of a reminder system according to an embodiment of the present application.
Detailed Description
The technical solution in the present application will be described below with reference to the accompanying drawings. It is to be understood that the embodiments described are only a few embodiments of the present application and not all embodiments.
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.
The terms "comprises" and/or "comprising" when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless expressly specified otherwise.
The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
As used herein, the term "at least one" refers to one or more, and "a plurality" refers to two or more. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.
At a meal peak, a hot restaurant in a store usually has a full seat, in order to use meals more orderly, a queuing system is introduced into a plurality of stores, and a user can take a number in an online Application (APP), a WeChat applet or a store. After the user finishes getting a number, if the number of the tables needing to wait is large, the user usually stroll in a shopping mall, and then the user easily misses a call on the spot and cannot have a meal in time. In the related art, the APP or the wechat applet can notify the user that the user is about to have a meal by pushing the number message to the smart terminal of the user, however, the user still easily misses the number notification message due to the factors of the silent mobile phone, the fact that the user does not pay attention to the message of the smart terminal in real time, and the like.
With the continuous development of the robot industry, the functions that the robot can realize are more and more abundant, and the application of the robot in the business field is more and more extensive. At present, many shopping malls are equipped with welcome robots, the welcome robots can be static at fixed points in the shopping malls or move in the shopping malls along preset paths of the system, the welcome robots can interact with users through voices or display screens, and then functions of information inquiry of the shopping malls and guiding of the positions of the shopping malls in the shopping malls can be achieved.
In order to solve the technical problem, the embodiment of the application provides a scheduling server, a scheduling robot and a reminding system. After receiving the first message from the application server, the scheduling server can determine a first reminding robot for reminding a user from the scheduling robot, and send the reminding message to the first reminding robot, so that the first reminding robot can move to the vicinity of the user and remind the user of a number, a meal, a first event such as arrival and the like.
Fig. 1 is a schematic view of an application scenario of a dispatch server provided in an embodiment of the present application, and fig. 2 is a schematic view of a structure of the dispatch server provided in an embodiment of the present application, as shown in fig. 1 and fig. 2, a dispatch server 200 provided in an embodiment of the present application includes a memory 220 and a processor 210, a computer program 230 executable on the processor 210 is stored in the memory 220, and when the processor 210 is used to invoke and execute the computer program 230, the following steps may be implemented:
step one, a first message from the application server is received (i.e. step 5 in fig. 1).
Specifically, the first message includes location information of the first terminal and information of the first event. Here, the first terminal is an intelligent device carried by a user (for example, one of the users 1 to m in fig. 1), and illustratively, the intelligent device may be a mobile phone, and may also be wearable devices such as a smart band, a smart watch, smart glasses, and the like, the intelligent device includes a positioning module so as to be positioned, and the location information of the first terminal is also the location information of the user carrying the first terminal (i.e., the user corresponding to the first terminal).
Optionally, the first terminal is usually carried by the user, and the first terminal moves along with the user in the moving process of the user, so that the application server can obtain the location information of the first terminal in real time or at preset intervals, and then send the location information of the first terminal to the scheduling server in real time or at preset intervals.
Alternatively, the first event may be a numbering event, more specifically, the first event may be a dining numbering event, a playground play item numbering event, and the like, and the information of the first event includes numbering information, and for the dining numbering event, the numbering information may include, for example, a dining number of the user corresponding to the first terminal, dining room information of the user having a meal, and the like. The first event may also be a meal taking event or a store reservation arrival event, the store reservation arrival event may be a new money arrival reminder for the user to reserve the store, and the information of the first event includes meal taking information or store reservation arrival information.
Specifically, the user corresponding to the first terminal is a user to be reminded, and illustratively, the user to be reminded may be a user who has a meal to be served, plays, or can take a meal, or a user who has reserved a new money arrival reminder for an store (and a new money arrival reminder for the store).
In the embodiment of the application, the application server establishes a communication connection with the scheduling server, and the scheduling server can receive the first message sent by the application server. Illustratively, the application server may send the first message by sending an HTTP request to the scheduling server.
And secondly, determining a first reminding robot from the dispatching robots based on the position information of the first terminal.
Optionally, based on the position information of the first terminal, it may be determined from the scheduling robots that the scheduling robot closest to the first terminal is the first reminding robot, so as to remind the user corresponding to the first terminal in time. Optionally, based on the location information of the first terminal, when the user corresponding to the first terminal is located outside the moving range of the scheduling robot (for example, the user leaves the mall after queuing at a restaurant in the mall), the first reminding robot is not determined from the scheduling robot.
Specifically, the number of the scheduling robots may be 0, 1, or more (two or more). When the number of the scheduling robots is 0 or the first reminding robot is not determined from the scheduling robots, the scheduling server may perform step two again after a certain time interval or perform step two again after responding to a certain instruction.
Optionally, the scheduling robot refers to a robot under the management of the scheduling server, and may be a same type or different types of robots, such as a welcome robot, a food delivery robot, a logistics robot, or the like, or a robot in a busy state in a task state (such as executing a circular welcome task and executing a food delivery task), or a robot in an idle state in a non-task state.
Optionally, the scheduling server immediately starts to execute step two after receiving the first message; alternatively, after receiving the first message, the scheduling server starts to execute step two (for example, in response to an operation of the scheduling robot to upload the location information) in response to another operation, that is, step one is not necessarily a trigger condition of step two.
And step three, sending a reminding message to the first reminding robot (namely step 6 in the figure 1).
As an example, the reminding message is used to instruct the first reminding robot to remind the corresponding user of the first terminal of the first event when the first reminding robot moves to a position where the distance from the first reminding robot to the first terminal is within a first preset range.
As an example, the reminding message includes location information of the first terminal and information of the first event, so that the first reminding robot can move to a first preset range of the first terminal and remind a corresponding user of the first terminal of the first event. Optionally, the reminding message may further include first indication information, where the first indication information is used to indicate that the first reminding robot reminds the user corresponding to the first terminal of the first event when the distance between the first reminding robot and the first terminal is within a first preset range. Optionally, the reminding message may further carry second indication information, where the second indication information is used to indicate that the first reminding robot moves towards the corresponding user of the first terminal. Alternatively, the first indication information and the second indication information may be the same indication information. Optionally, the reminding message may further include a temporary travel route determined by the scheduling server for the first reminding robot, and the first reminding robot may move from its current location toward the corresponding user of the first terminal along the temporary travel route. It can be understood that the starting position of the temporary travel route is the current position of the first reminding robot, and the ending position of the first reminding robot may be a position within a first preset range from the first terminal.
Optionally, the reminding the first reminding robot of the first event to the user corresponding to the first terminal may include: the voice reminds the first event and/or the display reminds the first event.
Specifically, the first reminding robot includes a voice module (for example, a speaker) and a display module (for example, a display screen), and the first reminding robot can broadcast the information of the first event through the speaker for multiple times to attract the attention of the user, and the first reminding robot can also display the information of the first event through the display screen, or the first reminding robot simultaneously broadcasts through the speaker and displays the information of the first event through the display screen, so as to achieve a better notification effect.
Illustratively, the content of the voice broadcast by the first reminding robot may be "number XX of customers, number XX of restaurant, number XX of line, and you go to XX of restaurant for dinner". Specifically, the number of the serial number and the name information of the restaurant are sent to the first reminding robot by the application server through reminding messages.
Here, the first preset range may be a range of 1 meter to 5 meters, and may also be a range of 5 meters to 10 meters, and the first preset range may be configured, and the application does not limit the specific size of the first preset range.
Optionally, the first reminding robot may move to a position 5 meters away from the first terminal, then remain still, and remind the user corresponding to the first terminal of the first event in a manner of voice reminding, display reminding, or the like; or when the distance between the first terminal and the user is less than 10 meters, the voice and the display reminding can be performed while the user corresponding to the first terminal moves close to the first terminal, so that a better reminding effect is achieved.
Further, when the robot reminds the user corresponding to the first terminal of the first event, the robot can adjust the pose of the robot to remind the user corresponding to the first terminal in a direction facing the user.
As shown in fig. 1, taking a queuing event as an example, users 1 to m may use their own terminals to send a number fetching request to an application server, upload location information, and receive queuing information returned by the application server, where the application server sends a first message including location information of a first terminal and information of a first event to a scheduling server, the scheduling server receives location information of scheduling robots 1 to n and determines, from the scheduling robots, a first reminding robot for reminding a user corresponding to the first terminal based on the location information of the first terminal, and then the scheduling server sends a reminding message to the first reminding robot so that the first reminding robot moves to a vicinity of the user corresponding to the first terminal to remind the user of the first event.
According to the scheduling server provided by the embodiment of the application, after the scheduling server receives the first message from the application server, a first reminding robot for reminding a user corresponding to the first terminal can be determined from the scheduling robot based on the position information of the first terminal, and by sending the reminding message to the first reminding robot, the first reminding robot can be directly moved to the vicinity of the user and remind the user of first events such as number arrival, meal taking, arrival and the like. The reminding mode is more direct and effective, the robot equipped in some places can be fully utilized to achieve a better reminding effect, the situation that the user misses the order and has a dinner or a goods can be avoided, and the dining experience or shopping experience of the user can be improved.
The embodiment of the present application further provides a reminding system, which includes the scheduling server provided in the foregoing embodiment and scheduling robots (i.e. scheduling robot 1 to scheduling robot n in fig. 1) for receiving the reminding message. Fig. 3 is an interaction schematic diagram of the reminding system provided in the embodiment of the present application, and as shown in fig. 3, taking a first event as a ranking event as an example, the following steps are implemented when the reminding system interacts with an application server:
s301, the terminal sends a number fetching request to the application server.
S302, the application server returns the ranking information to the terminal. Specifically, the application server calculates the queuing number of the current terminal, such as 85, 3 and the like, according to the number of the historical queuing people.
S303, the application server determines the terminal of the upcoming number as the first terminal.
Alternatively, the terminal of the number to be arrived at can be a user whose difference between the number and the current number is less than or equal to 3 or 5 (the specific numerical value can be configured). For example, for a restaurant, the number of the currently called meal is 50, and the terminals with numbers 51, 52 and 53 are all terminals with upcoming numbers, so that the first reminding robot can remind the users of the terminals of the number of the terminal of the currently called meal of the meal. Specifically, the first terminal is any one of terminals of the upcoming number.
S304, the first terminal sends the position information to the application server.
S305, the application server acquires the position information of the first terminal.
Optionally, for the application server acquiring the location information of the first terminal, the first terminal may send the location information to the application server at regular time, and for example, the frequency of sending the location information by the first terminal may be every 1 second, 5 seconds, or 10 seconds; the application server may also actively acquire the location information of the first terminal after determining the terminal to which the number is coming as the first terminal, so that the latest location information of the user corresponding to the first terminal may be acquired.
S306, the application server sends a first message to the scheduling server, wherein the first message comprises the position information of the first terminal and the information of the first event.
If the first terminal sends the position information to the application server at regular time, the position information of the first terminal included in the first message sent by the application server is the position information which is sent at the latest time.
S307, the application server sends an arrival number notification to the first terminal.
Specifically, the two steps S306 and S307 have no chronological sequence, and may occur at the same time, or the notification may be sent to the first terminal first, and then the first message is sent to the scheduling server, which is not limited in this application.
Alternatively, the step S307 may be earlier than the step S304, except that the step S306 is necessarily located after the step S304.
S308, the dispatching robot sends the position information of the dispatching robot to the dispatching server. Optionally, the scheduling robot sends the location information to the scheduling server via an HTTP request.
Specifically, the dispatching robot sends its own position information to the dispatching server automatically according to a certain frequency, for example, the dispatching robot sends the own position information to the dispatching server every 1 second, so that the dispatching server can grasp the position of the dispatching robot in real time.
S309, the dispatching server acquires state information of one or more robots, wherein the state information is used for indicating whether the robots are dispatching robots or not.
And S310, determining one or more scheduling robots from one or more robots according to the state information corresponding to each robot. Illustratively, the state information of the robot includes an idle state or an occupied state, the robot is a scheduling robot when the state information of the robot is in the idle state, and the robot is not the scheduling robot when the state information of the robot is in the occupied state (i.e., the robot cannot be currently scheduled to perform a task for reminding a user).
Optionally, the robot executes different tasks with different priorities, and the status information may also include the priority of the task currently executed by the robot. Illustratively, when the robot travels along the preset route, the priority is level 1, the priority of the robot executing the task of reminding the user is level 2 (higher than level 1), and when the robot executes the routed task, the priority is level 3 (higher than level 2). When the priority of the task currently executed by the robot is lower than the priority of the task for reminding the user, the robot can be used as a scheduling robot, namely the robot can interrupt the current task to execute the task for reminding the user; and when the priority of the task currently executed by the robot is higher than or equal to the current task, the robot is not scheduled.
S311, determining a first reminding robot from the dispatching robots based on the position information of the first terminal.
In one possible embodiment, the determining the first reminder robot from the scheduling robot based on the location information of the first terminal includes: and determining the dispatching robot with the distance from the first terminal within a second preset range as a first reminding robot according to the position information of the first terminal and the position information of the dispatching robot.
Here, the second preset range may be 0 m to 50 m, or 0 m to 100 m, and the specific size of the second preset range may be configured in the scheduling server, which is not limited in the present application.
For example, the position information of the first terminal and the position information of the scheduling robot may be two-dimensional position information or three-dimensional position information. When the three-dimensional position information is obtained, the dispatching server may determine the dispatching robots located on the same floor as the user corresponding to the first terminal, and then calculate the distances between the dispatching robots on the same floor and the first terminal. Therefore, the first reminding robot does not need to take an elevator when moving towards the user corresponding to the first terminal, and the moving process is more convenient and fast.
Further, if there are a plurality of scheduling robots within a second preset range from the first terminal, determining the first reminding robot from the scheduling robots based on the position information of the first terminal further includes: determining a dispatching robot meeting preset conditions in the plurality of dispatching robots as the first reminding robot, wherein the preset conditions comprise one or more of the following conditions: nearest to the first terminal, is in an idle state.
Illustratively, the preset condition is that the scheduling robot is closest to the first terminal, and when the distances between the three scheduling robots and the first terminal are respectively 15 meters, 35 meters and 45 meters (all located within a range of 50 meters), the scheduling robot with the distance between the three scheduling robots and the first terminal being 15 meters is determined as the first reminding robot.
In other embodiments, the preset condition may also be an idle state, and when the distances between the two scheduling robots and the first terminal are both within a second preset range, one of the scheduling robots is interacting with a user, and the other scheduling robot is currently in the idle state, it is determined that the scheduling robot in the idle state is the first reminding robot.
Further, the preset condition may also be that the first terminal is nearest and in an idle state. Therefore, the time required for the first reminding robot to move to the position in the first preset range of the first terminal is shortest, other tasks do not need to be interrupted, the reminding efficiency can be improved, and the user can be reminded in time.
In other embodiments, one of the plurality of scheduling robots may be randomly determined as the first reminding robot.
In the embodiment of the application, after the first reminding robot for reminding the user corresponding to the first terminal is determined, the scheduling server marks the first terminal as the locked state and also marks the first reminding robot as the occupied state, that is, the user corresponding to the first terminal and the first reminding robot have a one-to-one corresponding binding relationship, so that the situation that a plurality of scheduling robots repeatedly remind the user is avoided.
And S312, the scheduling server sends a reminding message to the first reminding robot.
S313, the first reminding robot receives the reminding message.
And S314, the first reminding robot reminds the user corresponding to the first terminal of the first event when the first reminding robot moves to the position where the distance between the first reminding robot and the first terminal is within a first preset range according to the reminding message.
Optionally, moving to a distance from the first terminal within a first preset range according to the reminding message includes: planning a temporary travelling route by using an off-line map stored by the first terminal according to the position information of the first terminal and the current position information of the dispatching robot; moving toward the first terminal along the temporary travel route.
After the first reminding robot finishes reminding the user corresponding to the first terminal of the first event, the first reminding robot executes the step S315 and moves along the original traveling route.
Specifically, after the first reminding robot completes voice reminding for 3 times or receives an instruction that the user has received the reminding (for example, the user performs an operation on a display screen of the first reminding robot), the first reminding robot returns to the original traveling route and moves along the original traveling route. Here, the original traveling route is a traveling route before the first reminding robot moves along the temporary traveling route.
In a possible embodiment, the first message further includes location information of the second terminal, information of the second event, and priority information, where the priority information is used to indicate that a user corresponding to the first terminal (hereinafter referred to as the first user) has a higher priority than a user corresponding to the second terminal (hereinafter referred to as the second user). At this time, the scheduling robot may determine robots for the first user and the second user at the same time, respectively, to remind the first user and the second user (i.e., parallel processing). If the distances between the first reminding robot and the first terminal and between the first reminding robot and the second terminal are both within a second preset range, namely the first reminding robot corresponds to the first user and the second user at the same time, the first reminding robot is used for reminding the first user, and one scheduling robot (for example, the scheduling robot closest to the second terminal) meeting preset conditions is determined as a second reminding robot for reminding the second user of a second event from the rest scheduling robots (namely, the determined first reminding robot is excluded).
Specifically, the first event may be the same as or different from the first event.
Specifically, the priority information may be the remaining number of waiting tables, the remaining waiting time, and the like, for example, if the remaining number of waiting tables of the first user is 1 and the remaining number of waiting tables of the second user is 3, then when the first user conflicts with the second user, the reminding robot is preferentially allocated to the first user so as to avoid missing the timing for reminding the first user.
In a possible embodiment, the scheduling server further receives a second message from the application server, the second message including location information of the third terminal, and the scheduling server receives the second message at a time later than a time at which the first message is received. Through the distance comparison step, when the distances between the first reminding robot and the first terminal and the distances between the first reminding robot and the third terminal are both within the second preset range, the scheduling server enables the first reminding robot to remind the first user, and determines one scheduling robot (for example, the scheduling robot closest to the third terminal) meeting the preset condition as a third reminding robot for reminding the user of the third terminal from the rest scheduling robots (namely, the determined first reminding robot is excluded).
Fig. 4 is an interaction schematic diagram of an application server according to an embodiment of the present application, and as shown in fig. 4, taking a first event as a queuing event as an example, when the application server interacts with a user, a queuing software client, and a scheduling server, the following steps are implemented:
s401, the user actively fetches numbers through the queuing system client.
Alternatively, the queuing software client may be an APP, a wechat applet, a pay-for-all applet, or the like installed on a terminal carried by the user. The queuing software client can also be a queuing machine on the restaurant site.
If the user carries out the queuing through the queuing machine, the communication connection between the terminal and the application server can be realized through scanning the two-dimensional code on the queuing list printed by the queuing machine.
S402, the queuing system client sends a number fetching request to the application server. Specifically, the queuing system client initiates an HTTP request to the application server in response to the active number fetching operation of the user.
And S403, the application server calculates the queuing number of the terminal.
S404, the application server sends queuing information to the queuing system client, wherein the queuing information comprises a queuing serial number.
S405, the queuing system client displays the queuing information to the user. Specifically, the queuing system client displays the queuing information to the user through a display screen of the terminal.
After the user finishes the number taking operation, the user can move in a public place such as a shopping mall.
S406, the application server determines the terminal of the upcoming number as the first terminal.
S407, the queuing software client sends the position information, namely the position information of the first terminal to the application server.
Specifically, the APP may directly call an Application Programming Interface (API) of a height map or a Baidu map to obtain the location information of the terminal and send the location information to the Application server; the WeChat applet can obtain the location information through the API of the WeChat and send it.
S408, the application server sends a number notification to the number-arranging software client.
S409, the application server sends a first message to the scheduling server.
Fig. 5 is a schematic view of an interaction process between a dispatching server and a dispatching robot according to another embodiment of the present application, and as shown in fig. 5, the dispatching robot implements the following steps when interacting with the robot:
scheduling server and robot 1: s501, the robot 1 sends position information to a scheduling server;
s502, the dispatching server acquires the state information of the robot 1, wherein the state information is used for indicating whether the robot 1 is a dispatching robot or not.
When the state information indicates that the robot 1 is a dispatching robot, step S503 is executed to determine a user corresponding to the first terminal for reminding by the robot 1 according to the position information of the robot 1 and the position information of the terminal.
After the dispatching server receives the position information sent by the robot 1 and determines that the robot 1 is a dispatching robot, the distance between the robot 1 and each terminal is calculated (one terminal corresponds to one about-to-arrive user), the terminal with the distance between the terminal and the robot 1 within a second preset range is determined to be a first terminal, and when the first terminal is not in a locking state, the robot 1 is determined to be a first reminding robot.
When there are a plurality of terminals within the second preset range of the robot 1, the terminal closest to the first terminal, or the terminal with the highest priority, or the terminal with the earliest time to receive a message may be determined as the first terminal.
S504, the application server sends a reminding message to the robot 1.
And S505, the robot 1 moves towards the first terminal and reminds the user corresponding to the first terminal of the first event.
Scheduling server and robot 2: (omitting the same steps as in the above-described interactive process)
S506, the dispatching server acquires the state information of the robot 2, and when the state information indicates that the robot 2 is not a dispatching robot;
s507, the robot 2 moves along the current travel route.
Scheduling server and robot 3: (the same steps as in the above-described interaction procedure are omitted):
s509, the scheduling server does not determine the first terminal according to the position information of the robot 3 and the position information of the terminal, namely the terminal without the number to be reached in the second preset range of the robot 3;
s507, the robot 3 moves along the current travel route.
It should be understood that the interaction process of the dispatch server with robots 1, 2 and 3 may be performed simultaneously, depending on the time instants at which robots 1-3 transmit position information.
An embodiment of the present application further provides a scheduling robot 600, fig. 6 is a schematic structural diagram of the scheduling robot provided in an embodiment of the present application, as shown in fig. 6, the scheduling robot 600 includes a memory 620 and a processor 610, a computer program 630 capable of running on the processor 610 is stored in the memory 620, and the processor 610 is configured to implement the foregoing steps S308, S313, S314, S315, S501, S505, S507 and the like when calling and executing the computer program 630, and these steps have been described in detail in the foregoing text, and are not described again here.
An embodiment of the present application further provides an application server, where the application server includes a memory and a processor, where the memory stores a computer program that can run on the processor, and the processor is configured to implement the foregoing steps S302, S303, S305, S306, S307, S403, S404, S406, S408, S409, and the like when the processor calls and executes the computer program, and these steps are described in detail in the foregoing, and are not described again here.
Fig. 7 is a schematic structural diagram of a reminding system according to an embodiment of the present application, and as shown in fig. 7, the reminding system 700 includes the scheduling server 200 according to the foregoing embodiment and the scheduling robot 600 according to the foregoing embodiment.
Specifically, the scheduling robot 600 may establish a communication connection with the scheduling server 200 through a network, and receive scheduling of the scheduling server 200.
Optionally, the scheduling server 200 may be a physical server (e.g., a computer, a switch, or other devices), or may be a cloud server, which is not limited in this application.
Alternatively, the dispatching robot 600 may be various robots deployed in a mall, including but not limited to a guest robot, a shop robot, and the like, and the dispatching robot 600 may also be an outdoor robot, such as a robot deployed in a casino, which is not limited in this application. That is to say, the reminding system 700 provided by the embodiment of the present application can be applied to various scenes in which the user needs to remind.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A dispatch server, comprising a memory having stored therein a computer program operable on a processor, and a processor operable when invoked and executed to perform the steps of:
receiving a first message from an application server, wherein the first message comprises position information of a first terminal and information of a first event;
determining a first reminding robot from scheduling robots based on the position information of the first terminal;
and sending a reminding message to the first reminding robot, wherein the reminding message is used for indicating the first reminding robot to remind a user corresponding to the first terminal of the first event when the first reminding robot moves to a position where the distance between the first reminding robot and the first terminal is within a first preset range.
2. The dispatching server of claim 1, wherein the determining a first reminding robot from the dispatching robots based on the position information of the first terminal comprises:
and determining the dispatching robot with the distance from the first terminal within a second preset range as the first reminding robot according to the position information of the first terminal and the position information of the dispatching robot.
3. The dispatching server of claim 2, wherein if there are a plurality of dispatching robots within the second preset range from the first terminal, the determining a first reminding robot from the dispatching robots based on the position information of the first terminal further comprises:
determining a dispatching robot meeting a preset condition in the plurality of dispatching robots as the first reminding robot, wherein the preset condition comprises one or more of the following conditions: and the terminal is closest to the first terminal and is in an idle state.
4. The scheduling server of any of claims 1-3 wherein before the step of determining a first alert robot from the scheduling robot based on the location information of the first terminal, the processor is further configured to invoke and execute the computer program to perform the steps of:
acquiring state information corresponding to each robot in one or more robots, wherein the state information is used for indicating whether the robot is a dispatching robot or not;
and determining one or more dispatching robots from the one or more robots according to the state information corresponding to each robot.
5. The scheduling server of any one of claims 1-3 wherein the information of the first event comprises queuing information or store reservation arrival information.
6. A scheduling robot comprising a memory and a processor, the memory having stored therein a computer program operable on the processor, the processor being configured to invoke and execute the computer program to perform the steps of:
receiving a reminding message from a scheduling server;
and under the condition that the distance between the first terminal and the reminding message is within a first preset range, reminding a first event to a user corresponding to the first terminal.
7. The scheduling robot of claim 6, wherein the alerting the user corresponding to the first terminal of the first event comprises: and prompting the first event by voice and/or displaying and prompting the first event.
8. The dispatching robot of claim 6, wherein the prompting message includes position information of the first terminal, and wherein moving to a distance from the first terminal within a first preset range according to the prompting message comprises:
planning a temporary travelling route according to the position information of the first terminal and the current position information of the dispatching robot;
moving toward the first terminal along the temporary travel route.
9. A scheduling robot as claimed in any one of claims 6-8, wherein after the alerting the user to which the first terminal corresponds of the first event, the processor when being configured to invoke and execute the computer program further implements the steps of:
moving along the original traveling route.
10. A reminder system, comprising a scheduling server according to any of claims 1-5 and a scheduling robot according to any of claims 6-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210717232.3A CN114821886B (en) | 2022-06-23 | 2022-06-23 | Scheduling server, scheduling robot and reminding system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210717232.3A CN114821886B (en) | 2022-06-23 | 2022-06-23 | Scheduling server, scheduling robot and reminding system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114821886A true CN114821886A (en) | 2022-07-29 |
| CN114821886B CN114821886B (en) | 2022-11-29 |
Family
ID=82521386
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210717232.3A Active CN114821886B (en) | 2022-06-23 | 2022-06-23 | Scheduling server, scheduling robot and reminding system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114821886B (en) |
Citations (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102005011615A1 (en) * | 2004-03-05 | 2005-12-01 | Volkswagen Ag | Process for handling production data such as weld locations on the CAD model of an automobile |
| CN101060645A (en) * | 2007-04-10 | 2007-10-24 | 华为技术有限公司 | A communication method, equipment and system |
| KR20080107553A (en) * | 2007-06-07 | 2008-12-11 | 주식회사 케이티 | The remote control active services system for ubiquitous robotic companion robots |
| DE102013001987A1 (en) * | 2013-02-06 | 2014-08-07 | Salvavidas GmbH | Method for detecting human and moving objects working in hybrid working system used for cleaning of soiled article, determines movement of human and moving object according to spatial distribution of radio frequency identification tags |
| CN105488892A (en) * | 2016-01-04 | 2016-04-13 | 杭州亚美利嘉科技有限公司 | Method and server for robot queuing management |
| US20170357256A1 (en) * | 2016-06-14 | 2017-12-14 | Fuji Xerox Co., Ltd. | Robot control system and recording medium |
| CN108960506A (en) * | 2018-07-02 | 2018-12-07 | 北京极智嘉科技有限公司 | A kind of robot dispatching method, device, server and storage medium |
| CN109215768A (en) * | 2018-08-09 | 2019-01-15 | 上海常仁信息科技有限公司 | A kind of appointment registration system and method based on robot |
| CN109949598A (en) * | 2019-04-17 | 2019-06-28 | 江苏小白兔网络科技有限公司 | A kind of automated parking system and the parking method suitable for the parking system |
| CN110880214A (en) * | 2019-11-07 | 2020-03-13 | 泰康保险集团股份有限公司 | Queuing and calling method, system and device based on small program |
| CN111131750A (en) * | 2019-12-18 | 2020-05-08 | 华为技术有限公司 | Scheduling method, device and system |
| WO2020197377A1 (en) * | 2019-03-25 | 2020-10-01 | Emerico Sdn. Bhd. | An automated self service system |
| CN112149935A (en) * | 2019-06-28 | 2020-12-29 | 坎德拉（深圳）科技创新有限公司 | Logistics piece dispatching method, dispatching server, system and storage medium |
| CN112184098A (en) * | 2019-07-05 | 2021-01-05 | 坎德拉（深圳）科技创新有限公司 | Scheduling method of intelligent distribution system, server and storage medium |
| CN112327870A (en) * | 2020-11-19 | 2021-02-05 | 上海明略人工智能(集团)有限公司 | Dispatching method of meal delivery robot and edge server |
| CN112578739A (en) * | 2019-09-29 | 2021-03-30 | 杭州海康机器人技术有限公司 | Scheduling method for mobile robot, scheduling server and storage medium |
| CN112793979A (en) * | 2021-02-06 | 2021-05-14 | 武昌理工学院 | Warehouse logistics robot cluster obstacle avoidance and collaborative path planning system and method |
| CN112835489A (en) * | 2021-01-29 | 2021-05-25 | 微民保险代理有限公司 | Service data processing method, device, storage medium and equipment |
| CN112880689A (en) * | 2021-01-29 | 2021-06-01 | 北京百度网讯科技有限公司 | Method and device for leading position, electronic equipment and storage medium |
| CN112947414A (en) * | 2021-01-26 | 2021-06-11 | 深圳市普渡科技有限公司 | Robot scheduling method and device, computer equipment and storage medium |
| CN113157409A (en) * | 2021-03-25 | 2021-07-23 | 北京来也网络科技有限公司 | AI-based RPA task scheduling method, device, electronic equipment and storage medium |
| CN113301209A (en) * | 2020-02-21 | 2021-08-24 | 佛山市云米电器科技有限公司 | Message reminding method, mobile terminal and computer readable storage medium |
| CN113326053A (en) * | 2021-06-18 | 2021-08-31 | 上海钛米机器人股份有限公司 | Robot management system and method |
| CN113359753A (en) * | 2021-06-24 | 2021-09-07 | 深圳市普渡科技有限公司 | Robot, robot welcome motion method and readable storage medium |
| CN113745788A (en) * | 2021-09-06 | 2021-12-03 | 合肥工业大学 | Dynamic inductance microstrip delay line and preparation method thereof |
| CN114186943A (en) * | 2021-12-17 | 2022-03-15 | 北京云迹科技有限公司 | Article distribution method, article distribution device, electronic equipment and computer readable storage medium |
| CN114613060A (en) * | 2022-02-28 | 2022-06-10 | 北京京东乾石科技有限公司 | Information pushing method and device, electronic equipment and computer readable medium |
-
2022
- 2022-06-23 CN CN202210717232.3A patent/CN114821886B/en active Active
Patent Citations (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102005011615A1 (en) * | 2004-03-05 | 2005-12-01 | Volkswagen Ag | Process for handling production data such as weld locations on the CAD model of an automobile |
| CN101060645A (en) * | 2007-04-10 | 2007-10-24 | 华为技术有限公司 | A communication method, equipment and system |
| KR20080107553A (en) * | 2007-06-07 | 2008-12-11 | 주식회사 케이티 | The remote control active services system for ubiquitous robotic companion robots |
| DE102013001987A1 (en) * | 2013-02-06 | 2014-08-07 | Salvavidas GmbH | Method for detecting human and moving objects working in hybrid working system used for cleaning of soiled article, determines movement of human and moving object according to spatial distribution of radio frequency identification tags |
| CN105488892A (en) * | 2016-01-04 | 2016-04-13 | 杭州亚美利嘉科技有限公司 | Method and server for robot queuing management |
| US20170357256A1 (en) * | 2016-06-14 | 2017-12-14 | Fuji Xerox Co., Ltd. | Robot control system and recording medium |
| CN108960506A (en) * | 2018-07-02 | 2018-12-07 | 北京极智嘉科技有限公司 | A kind of robot dispatching method, device, server and storage medium |
| CN109215768A (en) * | 2018-08-09 | 2019-01-15 | 上海常仁信息科技有限公司 | A kind of appointment registration system and method based on robot |
| WO2020197377A1 (en) * | 2019-03-25 | 2020-10-01 | Emerico Sdn. Bhd. | An automated self service system |
| CN109949598A (en) * | 2019-04-17 | 2019-06-28 | 江苏小白兔网络科技有限公司 | A kind of automated parking system and the parking method suitable for the parking system |
| CN112149935A (en) * | 2019-06-28 | 2020-12-29 | 坎德拉（深圳）科技创新有限公司 | Logistics piece dispatching method, dispatching server, system and storage medium |
| CN112184098A (en) * | 2019-07-05 | 2021-01-05 | 坎德拉（深圳）科技创新有限公司 | Scheduling method of intelligent distribution system, server and storage medium |
| CN112578739A (en) * | 2019-09-29 | 2021-03-30 | 杭州海康机器人技术有限公司 | Scheduling method for mobile robot, scheduling server and storage medium |
| CN110880214A (en) * | 2019-11-07 | 2020-03-13 | 泰康保险集团股份有限公司 | Queuing and calling method, system and device based on small program |
| CN111131750A (en) * | 2019-12-18 | 2020-05-08 | 华为技术有限公司 | Scheduling method, device and system |
| CN113301209A (en) * | 2020-02-21 | 2021-08-24 | 佛山市云米电器科技有限公司 | Message reminding method, mobile terminal and computer readable storage medium |
| CN112327870A (en) * | 2020-11-19 | 2021-02-05 | 上海明略人工智能(集团)有限公司 | Dispatching method of meal delivery robot and edge server |
| CN112947414A (en) * | 2021-01-26 | 2021-06-11 | 深圳市普渡科技有限公司 | Robot scheduling method and device, computer equipment and storage medium |
| CN112880689A (en) * | 2021-01-29 | 2021-06-01 | 北京百度网讯科技有限公司 | Method and device for leading position, electronic equipment and storage medium |
| CN112835489A (en) * | 2021-01-29 | 2021-05-25 | 微民保险代理有限公司 | Service data processing method, device, storage medium and equipment |
| CN112793979A (en) * | 2021-02-06 | 2021-05-14 | 武昌理工学院 | Warehouse logistics robot cluster obstacle avoidance and collaborative path planning system and method |
| CN113157409A (en) * | 2021-03-25 | 2021-07-23 | 北京来也网络科技有限公司 | AI-based RPA task scheduling method, device, electronic equipment and storage medium |
| CN113326053A (en) * | 2021-06-18 | 2021-08-31 | 上海钛米机器人股份有限公司 | Robot management system and method |
| CN113359753A (en) * | 2021-06-24 | 2021-09-07 | 深圳市普渡科技有限公司 | Robot, robot welcome motion method and readable storage medium |
| CN113745788A (en) * | 2021-09-06 | 2021-12-03 | 合肥工业大学 | Dynamic inductance microstrip delay line and preparation method thereof |
| CN114186943A (en) * | 2021-12-17 | 2022-03-15 | 北京云迹科技有限公司 | Article distribution method, article distribution device, electronic equipment and computer readable storage medium |
| CN114613060A (en) * | 2022-02-28 | 2022-06-10 | 北京京东乾石科技有限公司 | Information pushing method and device, electronic equipment and computer readable medium |
Non-Patent Citations (2)
| Title |
|---|
| 杨友良等: "快件分拣机器人群的路径规划及智能调度", 《华北理工大学学报(自然科学版)》 * |
| 林强等: "一种无线网络控制系统的时空实时任务调度算法", 《计算机科学》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114821886B (en) | 2022-11-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6993490B2 (en) | Method and apparatus for notifying a party of another party's location and estimated time of arrival at a predetermined destination | |
| US20200364810A1 (en) | Improved order management system and method | |
| US20080133283A1 (en) | Wireless remote queuing system and method | |
| WO2014205763A1 (en) | Method and apparatus for facilitating meeting | |
| US20140046718A1 (en) | Method and system for queue control | |
| US20030041105A1 (en) | Method and apparatus for queuing clients | |
| JP2006339810A (en) | Vehicle dispatch accepting system | |
| US20150088782A1 (en) | Intelligent customer queuing and notification system | |
| JP2008524743A (en) | Method and system for managing events | |
| JP2019061325A (en) | Self-propelled service provision device and service provision system | |
| CN110395634A (en) | Elevator device | |
| JP6356894B1 (en) | Reservation system, reservation method and reservation program | |
| WO2012170958A1 (en) | Electronic queuing systems and methods | |
| CN102831688A (en) | Queuing method and queuing system | |
| CN109916412A (en) | Dining room route navigation method, device, server and storage medium | |
| CN114821886B (en) | Scheduling server, scheduling robot and reminding system | |
| CN111507800A (en) | Fast food scheduling method, device and system | |
| US20160330149A1 (en) | Method for providing point of convergence in real time | |
| JP2021162912A (en) | Order management device, order management program and order management method | |
| CN109685624A (en) | A kind of intelligent hotel housekeeping scheduling system and hotel management method | |
| CN112781602B (en) | Order dispatch method, device, equipment and storage medium | |
| WO2016186261A1 (en) | Method, system, and non-transitory computer-readable recording medium for providing notification of schedule | |
| KR101751450B1 (en) | Reservation inform service system and method based on user's location | |
| JP6434599B1 (en) | Portable terminal, management server, control method thereof, program, and search distribution system | |
| KR101692840B1 (en) | Meeting reservation supplementary service system and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |