Moving body control system
By designing a mobile body control system, using task information and building data, the moving path and task sequence are formulated, the problem of mobile body blockage in narrow areas is solved and the efficiency of mobile body is improved.
Patent Information
- Application Number
- CN202411180102.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-27
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2044-08-27
AI Technical Summary
In the prior art, when the mobile body moves in a building, it is difficult to effectively avoid blockage when encountering a narrow area, resulting in low efficiency of the mobile body.
A mobile body control system is designed. Through the reception module, storage module, processing module and control module, a mobile body performs tasks based on task information and building data, to ensure that the mobile body is not blocked. The system avoids blockage of mobile bodies in specific areas by appropriately allocating or changing tasks, adjusting task sequences and moving paths.
It effectively avoids the blockage of the moving body in a specific area, improves the movement efficiency of the moving body, and ensures the smooth execution of the task.
Abstract
Description
Technical Field
[0001] The invention relates to a control system, in particular to a mobile object control system. Background Art
[0002] When a moving body moves in a building, if a certain specific area is very narrow, only a single moving body can pass through, but two moving bodies cannot pass each other in the specific area. In order to avoid the situation where two moving bodies are blocked in a specific area because they are moving in the specific area at the same time, the only way is to control a moving body to exit the specific area, and the moving body can enter and pass through the specific area only after the other moving body passes through the specific area. For example, Reference 1 (JP2015 / 002810) proposes: In a control method for an autonomous moving body, when entering a channel, a first sensor having a first measurement plane parallel to the channel surface measures the channel. Then, based on the information from the first sensor, it is determined whether the channel can be passed. Then, if it is determined that the channel can be passed, the second measurement plane of the second sensor having a second measurement plane inclined relative to the first measurement plane is scanned in the left and right directions of the autonomous moving body, and it is determined again whether the channel can be passed based on the information from the second sensor. The result of the re-judgment is that if it is determined that the channel cannot be passed, the autonomous moving body is moved to a standby position outside the channel, and if it is determined that the channel can be passed, the autonomous moving body is allowed to enter the channel. Obviously, when two moving bodies are traveling towards each other in a specific area and a jam occurs, it is very inefficient to solve the problem by using a certain moving body to withdraw to avoid the jam.
[0003] To address this problem, a control system and a moving body proposed in reference 2 (JP2021 / 037683) are capable of suppressing congestion in the middle of a passage, specifically: a control system (3) comprises a communication unit (9), a detection unit (10) and an instruction unit (12); the communication unit (9) obtains moving body information for each moving body (2) moving in a facility; the moving body (2a) approaches a passage (r1) based on map information and moving body information related to the moving body (2a), and the passage (r1) is the initial intermediate area from the room (R1) to the room (R2); at this time, when it is determined that the width of any intermediate area is smaller than the value obtained by adding a margin (α) to the sum of the widths of the moving body (2a) and the moving body (2b) following a path passing through at least any one of the multiple intermediate areas, the instruction unit (12) makes the moving body (2a) wait to enter the passage (r1); the instruction unit (12) makes this determination based on the map information and the moving body information related to the moving body (2a) and the moving body (2b). Document 2 essentially determines that when two moving bodies are blocked when passing through a specific area (i.e., the path width is less than the sum of the widths of the two moving bodies plus the margin (α)), one moving body is controlled to wait to enter the specific area. Compared with Document 1, the disadvantage of the moving body exiting the specific area is avoided, but the waiting of the moving body in the specific area reduces the moving efficiency of the moving body. Summary of the invention
[0004] The technical problem to be solved by the present invention is to provide a control system which can avoid the blockage of moving bodies in a specific area.
[0005] In order to solve the above technical problems, the present invention provides a mobile control system, comprising: a receiving module, used to receive task information and mobile information of a task to be performed by a mobile body, the task information including a task location, and the mobile information including a mobile body position; a storage module, used to store building data of a building where the mobile body is located when performing the task, the building data including passages between different task locations in the building and information indicating a specific area in the passage, the specific area including a first specific area and / or a second specific area, the first specific area refers to an area in the passage where the space can only accommodate one mobile body at the same time, and the second specific area refers to an area in the passage where the width is less than the sum of the passing width of two mobile bodies and a certain avoidance margin; a processing module, which formulates a plan followed by the mobile body when performing the task according to the task information, the mobile body information and the building data, the plan ensuring that a preset condition will not be established during the mobile body performing the task, the preset condition referring to a condition that the mobile body is blocked in a specific area; a generation module, used to generate a control instruction for controlling the mobile body to perform its task according to the plan; and a control module, used to control the mobile body according to the control instruction so that it performs the task assigned to the mobile body.
[0006] Preferably, when the specific area is the first specific area, the preset condition is that at least two moving bodies pass through the same specific area at the same time; when the specific area is the second specific area, the preset condition is that at least two moving bodies need to pass through the specific area in opposite directions and in an interlaced manner.
[0007] Preferably, the scheme includes at least the correspondence between the mobile body and the assigned task assigned to the mobile body, the moving path of the same mobile body when performing tasks at different locations, and the passing time period when the mobile body passes through the specific area when performing the task.
[0008] Preferably, the processing module makes the preset condition invalid by formulating a scheme that makes at least one condition in the first condition group or the second condition group invalid, thereby avoiding the mobile body from being blocked in a specific area, and the first condition group includes:
[0009] Condition 11: the passing path of the moving object includes the same first specific area;
[0010] Condition 12: There is overlap in the travel time periods of the moving bodies passing through the same first specific area;
[0011] The second condition group includes:
[0012] Condition 21: the passing path of the moving object includes the same second specific area;
[0013] Condition 22: There is overlap in the travel time periods of the moving bodies passing through the same second specific area;
[0014] Condition 23: The moving direction of the moving object in the second specific area is opposite.
[0015] Preferably, the processing module formulates a solution by adopting at least one of the following means, so that at least one condition in the first condition group or the second condition group is not satisfied:
[0016] Means 1, appropriately assigning or changing the assigned tasks to each mobile body;
[0017] Means 2, appropriately setting or changing the order in which the mobile body performs each assigned task;
[0018] Means 3, appropriately setting or changing the moving path of the moving body when it rushes to the task location of the next assigned task after completing the current assigned task.
[0019] Preferably, when the processing module detects that the preset condition is met, it makes the preset condition invalid by adopting at least one of means 1 to means 3 and re-formulates the plan; the generation module regenerates and updates the control instructions based on the new plan; and the control module controls the moving body according to the updated control instructions.
[0020] Preferably, the moving body processing module needs to make constraints hold when formulating the scheme, and the constraints include:
[0021] Constraint 1: The maximum number of items to be delivered by each mobile body at the same time cannot exceed the number of items it can accommodate.
[0022] Preferably, the constraints also include:
[0023] Constraint 2: The delivery time of the mobile body to the task location of the assigned task shall not be later than the specified delivery time of the mobile body.
[0024] Preferably, the processing module formulates the scheme according to the following steps:
[0025] Step 1, obtain task information, mobile body information and building information;
[0026] Step 2, determining constraint conditions based on task information and mobile body information;
[0027] Step 3, enumerating all possible first combinations, where the first combination represents the corresponding relationship between the moving body and the assigned task;
[0028] Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task;
[0029] Step 5, for each execution order of each first combination, using the building data to plan a moving path for the moving body when it moves between different task locations when performing the assigned task;
[0030] Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list;
[0031] Step 7, determining whether there is a second combination containing the specific area in the second combination list, if not, proceeding to step 9, otherwise proceeding to the next step;
[0032] Step 8, determining whether the preset condition corresponding to the second combination including the specific area is satisfied, if so, deleting the second combination including the specific area from the second combination list, otherwise directly proceeding to the next step;
[0033] Step 9: Select one of the second combinations from the second combination list as the solution and output it.
[0034] Preferably, when specifying the solution, the processing module adopts specific measures to make condition 11 or condition 21 not hold, and the specific measures include the following steps:
[0035] Step A, determining the location of a specific area on a map based on building information;
[0036] Step B, determining whether there is at least one path between two adjacent specific areas;
[0037] Step C: for two adjacent specific areas with at least one passage between them, the two specific areas are respectively divided into two different sub-domains; for two adjacent specific areas without a passage between them, the two adjacent specific areas are merged into one sub-domain;
[0038] Step D: for tasks whose task locations are in the same subdomain, they are assigned to the same mobile body for execution; for tasks whose task locations are in different subdomains, they are assigned to different mobile bodies for execution.
[0039] Preferably, for the accumulated tasks that have not yet been responded and the mobile bodies that are currently in an idle state, the processing module formulates the plan according to the following steps:
[0040] Step 1, obtaining the task information, moving body information and building data of the accumulated tasks that have not yet been responded;
[0041] Step 2, determining constraint conditions based on task information and mobile body information;
[0042] Step 3, enumerating all possible first combinations, where the first combination represents the corresponding relationship between the moving body and the assigned task;
[0043] Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task;
[0044] Step 5, for each execution order of each first combination, using the building data to plan a moving path for the moving body when it moves between different task locations when performing the assigned task;
[0045] Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list;
[0046] Step 7, determining whether there is at least one second combination that has not been selected in the second combination list, if not, proceeding to step 9, otherwise selecting a second combination that has not been selected from the second combination list as the selected combination;
[0047] Step 8, determining whether the moving path of the mobile body currently in the idle state in the selected combination contains a specific area and whether the preset condition is satisfied, if so, deleting the selected combination from the second combination list and returning to step 7, otherwise returning to step 7;
[0048] Step 9, selecting a second combination from the second combination list as the solution;
[0049] Step 10: Allocate the accumulated unresponded tasks to the mobile body currently in the idle state according to the scheme, and end.
[0050] Preferably, for the accumulated tasks that have not yet been responded and the mobile bodies that are currently in an idle state, the processing module formulates the plan according to the following steps:
[0051] Step 1, obtaining the task information, moving body information and building data of the accumulated tasks that have not yet been responded;
[0052] Step 2, determining constraint conditions based on task information and mobile body information;
[0053] Step 3, determining a first combination, wherein the first combination represents a corresponding relationship between a moving object and an assigned task;
[0054] Step 4, for the first combination, determining an execution order for the mobile body to execute the assigned task;
[0055] Step 5, for the execution order of the first combination, using the building data to plan a moving path for the moving object to move between different task locations when performing the assigned task;
[0056] Step 6, taking the combination of the first combination, the execution order and the moving path as the second combination;
[0057] Step 7, determine whether the moving path in the second combination contains a specific area that makes the preset condition meet. If not, take the current plan as the final plan and end. Otherwise, change the plan of the mobile body that is currently in an idle state and / or the plan of the mobile body that has responded but has not completed the task until the plan makes the preset condition not meet.
[0058] Preferably, the step 7 adopts the following method to change the scheme:
[0059] The processing module makes the preset condition invalid by formulating a scheme that makes at least one condition in the first condition group or the second condition group invalid, thereby preventing the moving body from being blocked in a specific area, wherein the first condition group includes:
[0060] Condition 11: the passing path of the moving object includes the same first specific area;
[0061] Condition 12: There is overlap in the travel time periods of the moving bodies passing through the same first specific area;
[0062] The second condition group includes:
[0063] Condition 21: the passing path of the moving object includes the same second specific area;
[0064] Condition 22: There is overlap in the travel time periods of the moving bodies passing through the same second specific area;
[0065] Condition 23: The moving direction of the moving object in the second specific area is opposite.
[0066] Preferably, for the accumulated tasks that have not been responded to, when the tasks have the same content but different locations, the processing module formulates the plan according to the following steps:
[0067] Step 1, obtaining task information, mobile body information and building data of tasks to be completed, wherein the tasks to be completed include tasks that have been responded to by mobile bodies but not yet completed and accumulated tasks that have not yet been responded to, the mobile bodies include mobile bodies that are currently in an idle state and mobile bodies that are currently in task execution, and the mobile body information includes at least mobile body position information of the mobile body that is currently in task execution;
[0068] Step 2, determining constraint conditions based on task information and mobile body information;
[0069] Step 3, enumerating all possible first combinations, wherein the first combinations represent the corresponding relationship between the moving body and the assigned task;
[0070] Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task;
[0071] Step 5, for each execution order of each first combination, planning a moving path of the moving body when it moves between different task locations when performing the assigned task according to the building data and the position information of the moving body;
[0072] Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list;
[0073] Step 7, determining whether there is a second combination containing the specific area in the second combination list, if not, proceeding to step 9, otherwise proceeding to the next step;
[0074] Step 8, determining whether the preset condition corresponding to the second combination including the specific area is satisfied, if so, deleting the second combination including the specific area from the second combination list, otherwise directly proceeding to the next step;
[0075] Step 9, selecting one of the second combinations from the second combination list as the solution and outputting it;
[0076] Step 10: Allocate all pending tasks to all mobile bodies including mobile bodies currently in an idle state and mobile bodies currently in task execution according to the scheme.
[0077] Preferably, the step 9 selects the solution from the second combination that satisfies the preset conditions according to the principle of minimizing the delivery cost of the moving body or maximizing the delivery efficiency of the moving body.
[0078] Preferably, when the specific area is the first specific area, the processing device determines and judges whether the preset condition is satisfied according to the passing time period when the moving body passes through the specific area and the moving direction when the moving body passes through the specific area;
[0079] When the specific area is the second specific area, the processing device determines and judges whether a preset condition is satisfied according to a passing time period when the moving body passes through the specific area.
[0080] Preferably, the determination of the preset conditions includes the following two parts:
[0081] Part 1: whether the preset conditions are met between the mobile bodies that execute the accumulated unresponded delivery request tasks;
[0082] Part 2 is to determine whether a preset condition is satisfied between each mobile body executing the accumulated unanswered delivery request tasks and the mobile body currently executing the task.
[0083] Preferably, before step 1, the method further comprises:
[0084] Step A, judging whether the accumulation condition is satisfied, if satisfied, proceeding to the next step, otherwise returning to step A, the accumulation condition is: only when it is satisfied, the mobile body control system will control the mobile body to execute the assigned task.
[0085] Preferably, the accumulation condition refers to any one of the following conditions:
[0086] Accumulation condition 1: the number of unresponded requests accumulated under the accumulation condition reaches a preset number;
[0087] Cumulative condition 2: the time interval from the earliest received time of all unresponded requests to the current time position exceeds the time threshold;
[0088] Cumulative condition 3: when the request specifies the latest delivery time, when the current time reaches a specific time, the specific time refers to the time corresponding to a preset amount of time in advance based on the latest delivery time.
[0089] The present invention analyzes and determines the necessary conditions for two moving bodies to be blocked, and by appropriately setting the tasks of each moving body and / or the order and path of the moving body in performing the tasks, at least one necessary condition is not met. Since the necessary conditions for the blockage are no longer met, it is obvious that the phenomenon of the moving bodies being blocked in a specific area can be avoided. DETAILED DESCRIPTION
[0090] The following describes the implementation methods of the present invention through specific specific embodiments, and those skilled in the art can fully understand other advantages and technical effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through different specific implementation methods, and the details in this specification can also be applied based on different viewpoints, and various modifications or changes can be made without deviating from the overall design concept of the invention. It should be noted that the following embodiments and the features in the embodiments can be combined with each other in the absence of conflict. The following exemplary embodiments of the present invention can be implemented in a variety of different forms and should not be interpreted as being limited to the specific embodiments described herein. It should be understood that these embodiments are provided to make the disclosure of the present invention thorough and complete, and to fully convey the technical solutions of these exemplary specific embodiments to those skilled in the art.
[0091] Example 1
[0092] The present invention provides a mobile body control system, comprising: a receiving module, used for receiving task information and mobile body information of a task to be performed by a mobile body, wherein the task information includes a task location, and the mobile body information includes a mobile body position; a storage module, used for storing building data of a building where the mobile body is located when performing the task, wherein the building data includes passages between different task locations in the building and information indicating a specific area in the passage, wherein the specific area includes a first specific area and / or a second specific area, wherein the first specific area refers to an area in the passage where space can only accommodate one mobile body at the same time, and the second specific area refers to an area in the passage where the width is less than the sum of the passing width of two mobile bodies and a certain avoidance margin; a processing module, which formulates a scheme followed by the mobile body when performing the task according to the task information, the mobile body information and the building data, wherein the scheme ensures that a preset condition will not be established during the period when the mobile body performs the task, wherein the preset condition refers to a condition that the mobile body is blocked in a specific area; a generating module, used for generating a control instruction for controlling the mobile body to perform its task according to the scheme; and a control module, used for controlling the mobile body according to the control instruction so that the mobile body performs the task assigned to the mobile body.
[0093] Preferably, when the specific area is the first specific area, the preset condition is that at least two moving bodies pass through the same specific area at the same time; when the specific area is the second specific area, the preset condition is that at least two moving bodies need to pass through the specific area in opposite directions and in an interlaced manner.
[0094] Preferably, the scheme includes at least the correspondence between the mobile body and the assigned task assigned to the mobile body, the moving path of the same mobile body when performing tasks at different locations, and the passing time period when the mobile body passes through the specific area when performing the task.
[0095] Through analysis, it is found that when the moving bodies are blocked in the second specific area (i.e., the area with a width smaller than the sum of the passing width of the two moving bodies and the margin) because the width is too narrow and the two moving bodies cannot pass each other in an interlaced manner, the following conditions must be met at the same time:
[0096] Condition 1: The path of the moving object contains the same specific area;
[0097] Condition 2: There is overlap in the travel time of the moving objects passing through the same specific area;
[0098] Condition 3: The moving objects have the same direction of travel in the specific area, that is, they move towards each other in the specific area.
[0099] Obviously, in order to inevitably cause the moving bodies to be blocked due to interlacing in a specific area, it is sufficient to make at least one of the above three conditions not hold, which can be achieved by: means 1, appropriately assigning or changing the tasks to be performed by each moving body; means 2, appropriately setting or changing the order in which the moving bodies perform the assigned tasks; and means 3, appropriately setting or changing the moving paths of the moving bodies to the location of the next task after completing the current task (i.e., without changing the two endpoints of the moving path, i.e., changing the line between the two endpoints, the endpoints being determined by the task location of the task location of the assigned task).
[0100] Therefore, the processing module in the present application makes the preset condition invalid by formulating a scheme that makes at least one condition in the first condition group or the second condition group invalid, thereby avoiding the mobile body from being blocked in a specific area. The first condition group includes:
[0101] Condition 11: the passing path of the moving object includes the same first specific area;
[0102] Condition 12: There is overlap in the travel time periods of the moving bodies passing through the same first specific area;
[0103] The second condition group includes:
[0104] Condition 21: the passing path of the moving object includes the same second specific area;
[0105] Condition 22: There is overlap in the travel time periods of the moving bodies passing through the same second specific area;
[0106] Condition 23: The moving direction of the moving object in the second specific area is opposite.
[0107] Preferably, the processing module formulates a solution by adopting at least one of the following means, so that at least one condition in the first condition group or the second condition group is not satisfied:
[0108] Means 1, appropriately assigning or changing the assigned tasks to each mobile body;
[0109] Means 2, appropriately setting or changing the order in which the mobile body performs each assigned task;
[0110] Means 3, appropriately setting or changing the moving path of the moving body when it rushes to the task location of the next assigned task after completing the current assigned task.
[0111] When the processing module detects that the preset condition is met, it makes the preset condition invalid by adopting at least one of means 1 to means 3 and re-formulates the plan; the generation module regenerates and updates the control instructions based on the new plan; the control module controls the moving body according to the updated control instructions.
[0112] Preferably, the control device further controls the moving body to monitor the suspected specific area in real time using its monitoring device or a monitoring device fixedly arranged at a certain position in the moving path, and after monitoring the suspected specific area, performs verification according to the position information and parameter information of the suspected specific area, and adds the suspected specific area to the building data after passing the verification. The parameter information refers to the spatial capacity of the first specific area and the width of the second specific area.
[0113] From the above description, it can be seen that the present application essentially tries to avoid two moving bodies moving towards each other in the same specific area at the same time, thereby avoiding the possibility of congestion. This is completely different from the idea of Document 1 and Document 2 to avoid congestion by retreating or waiting when congestion has occurred or is about to occur.
[0114] For a mobile body (such as a cleaning mobile body), each cleaning task corresponds to a cleaning location, and a certain cleaning (duration) time is required to complete the cleaning of each cleaning location (for other tasks such as delivery, for tasks such as delivering milk to guests in two adjacent hotel rooms, these two tasks can be combined and processed as one task). In this way, for two cleaning mobile bodies, when scheme 1 is adopted, cleaning tasks T1, T2 and T3 are assigned to cleaning mobile body A, and the corresponding cleaning times are t1, t2 and t3, and the cleaning locations are D1, D2 and D3, respectively. Cleaning tasks Ta, Tb and Tc are assigned to cleaning mobile body B, and the corresponding cleaning times are ta, tb and tc, and the cleaning locations are Da, Db and Dc, respectively.
[0115] When different schemes are adopted to assign cleaning tasks to a mobile body or to change the cleaning tasks of a mobile body, the cleaning tasks to be completed by the mobile body change, including changes in the number of tasks and / or changes in the content of tasks. Changes in the number of tasks and / or changes in the content of tasks will inevitably cause changes in the cleaning locations, and changes in the cleaning locations will inevitably cause changes in the moving path of the mobile body when it moves from one cleaning location to the next cleaning location. Therefore, this method can be used to make the moving path of the mobile body not contain a specific area or contain a new specific area different from the original specific area. In addition, even if a cleaning task is given, means 2 and / or means 3 can be used, that is, to change the moving path of the mobile body when it moves from one cleaning location to the next cleaning location, so that the moving path of the mobile body does not contain a specific area or contains a new specific area different from the original specific area. Therefore, one or more of means 1, means 2 and means 3 can be used to make condition 1 invalid.
[0116] As can be seen from the previous description, one or more of means 1, 2 and 3 can be used to change the moving path of the mobile body so that the moving path does not include a specific area or includes different specific areas. In addition, the change of the moving path can also mean a change in the moving time spent by the mobile body on the moving path, which means that one or more of means 1, 2 and 3 can be used to change the moving path, thereby changing the moving time spent by the mobile body on the moving path, and ultimately changing the arrival time of the mobile body arriving at a specific area. On the other hand, the change of the cleaning task by means 1 means a change in the cleaning time spent by the mobile body on performing the cleaning task, which means that the cleaning task can be changed by means 1, thereby changing the cleaning time spent by the mobile body on performing the cleaning task, and ultimately changing the arrival time of the mobile body arriving at a specific area. Therefore, one or more of means 1, 2 and 3 can be used to make condition 2 invalid.
[0117] When different schemes are adopted to assign cleaning tasks to a mobile body or to change the cleaning tasks of a mobile body, the cleaning tasks to be completed by the mobile body change, including changes in the number of tasks and / or changes in the content of tasks. Changes in the number of tasks and / or changes in the content of tasks will inevitably cause changes in the cleaning locations, and changes in the cleaning locations will inevitably cause changes in the moving path of the mobile body when it moves from one cleaning location to the next cleaning location. Changes in the moving path may cause the mobile body to pass through the same specific area in different directions; in addition, even if a cleaning task is given, when the execution order of the cleaning tasks is changed, it may also cause the mobile body to pass through the same specific area in different directions. Therefore, means 1 and / or means 2 can be used to change the direction of the mobile body when it passes through the same specific area, that is, means 1 and / or means 2 can be used to make condition 3 invalid.
[0118] Example 2
[0119] This embodiment considers a scenario where the control system receives multiple delivery tasks that need to be performed by mobile bodies. In this application, it is the task of delivering milk to hotel guests. Currently, multiple mobile bodies are located in the hotel lobby in an operation area dedicated to service personnel loading the milk to be delivered into the mobile body containers. Now the task of the control system is to allocate these milk delivery tasks to each mobile body.
[0120] First, let's consider the constraints that need to be considered when allocating tasks in a control system.
[0121] Constraint 1: The maximum number of items to be delivered by each mobile body at the same time cannot exceed the number of items it can accommodate.
[0122] Constraint 2: The delivery time of the mobile body to the task location of the assigned task shall not be later than the specified delivery time of the mobile body.
[0123] In this application, the constraints that need to be considered when the control system distributes milk to the mobile object are:
[0124] Constraint 1: The number of portions of milk that each mobile body can hold at the same time;
[0125] Constraint 2: Hotel guests’ request for delivery time (optional).
[0126] Under the condition that the above constraints are met, the control system enables the mobile body to complete the given milk distribution task through control. However, this is only the most basic. On this basis, we should further optimize the task allocation to achieve one or more of the following optimization goals:
[0127] Optimization goal 1: Minimize the cost of milk distribution (such as the number of mobile units that perform milk distribution, the total distance traveled by the mobile units to complete milk distribution, and / or the distribution time - including the time from the start of distribution to the completion of distribution and the delivery time of each mobile unit, etc.);
[0128] Optimization goal 2: The delivery efficiency of the mobile body is the highest, where the delivery efficiency is defined as the quotient of the number of delivery tasks divided by the number of mobile bodies and the time from the start of delivery to the completion of delivery.
[0129] The above optimization goal can also be achieved by using the aforementioned means 1 and 2. Next, let's consider the special concern of this application, that is, when the moving path of the mobile body performing the milk delivery task may contain a specific area (that is, an area that cannot accommodate the mobile body moving in opposite directions), how to avoid the mobile body appearing in the specific area during the milk delivery process and needing to move in opposite directions. Here we take it as:
[0130] Constraint 3: Moving objects cannot move in opposite directions in a specific area.
[0131] The specific area here can be a corridor, passage, specific door, etc. in the hotel in a general sense. These areas are too narrow to accommodate only one moving body passing through at the same time and cannot allow two moving bodies to stagger towards each other. It can also be an elevator car that can only accommodate one moving body at the same time (in this case, it is necessary to delete the limitation of "moving towards each other" in the above discussion, and use different elevators as different moving paths, that is, two moving bodies cannot enter the same elevator car at the same time). Staggered passing towards each other means that the two moving bodies move in opposite directions, first approach each other, then stagger past each other, and then continue to move forward so that the distance between them gradually increases.
[0132] For problems that contain both constraints and optimization objectives, the approach of first constraining and then optimizing can be used to handle them, that is, first try to satisfy the constraints, and then select the best solution among the feasible solutions that satisfy the constraints according to the optimization objective.
[0133] For constraint 1, it is sufficient to ensure that the task assigned to each mobile body does not exceed the maximum value of the milk fraction it can accommodate.
[0134] For constraints 2 and 3, the processing module formulates the solution according to the following steps:
[0135] Step 1, obtain task information, mobile body information and building information;
[0136] Step 2, determining constraint conditions based on task information and mobile body information;
[0137] Step 3, enumerating all possible first combinations, where the first combination represents the corresponding relationship between the moving body and the assigned task;
[0138] Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task;
[0139] Step 5, for each execution order of each first combination, using the building data to plan a moving path for the moving body when it moves between different task locations when performing the assigned task;
[0140] Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list;
[0141] Step 7, determining whether there is a second combination containing the specific area in the second combination list, if not, proceeding to step 9, otherwise proceeding to the next step;
[0142] Step 8, determining whether the preset condition corresponding to the second combination including the specific area is satisfied, if so, deleting the second combination including the specific area from the second combination list, otherwise directly proceeding to the next step;
[0143] Step 9: Select one of the second combinations from the second combination list as the solution and output it.
[0144] All second combinations in the first set are feasible solutions that satisfy all three constraints.
[0145] If further optimization is to be performed, the first set is used as an optional object to be optimized, that is, the second combination with the lowest cost of milk distribution and / or the highest distribution efficiency of the mobile body is determined from the first set as the final allocation plan, including the mobile body, task, distribution order and moving path.
[0146] Example 3
[0147] In Embodiment 2, the enumeration of the first combination is considered completely separately from the subsequent constraint 3, that is, constraint 3 is not considered when enumerating the first combination, resulting in a very large number of first and second combinations. This embodiment attempts to reduce the number of first and second combinations.
[0148] The main idea is that the processing module adopts specific measures when specifying the scheme so that condition 11 or condition 21 does not hold. The specific measures include the following steps:
[0149] Step A, determining the location of a specific area on a map based on building information;
[0150] Step B, determining whether there is at least one path between two adjacent specific areas;
[0151] Step C: for two adjacent specific areas with at least one passage between them, the two specific areas are respectively divided into two different sub-domains; for two adjacent specific areas without a passage between them, the two adjacent specific areas are merged into one sub-domain;
[0152] Step D: for tasks whose task locations are in the same subdomain, they are assigned to the same mobile body for execution; for tasks whose task locations are in different subdomains, they are assigned to different mobile bodies for execution.
[0153] It is not difficult to understand that the allocation result obtained in step D, regardless of the execution order and the moving path, will satisfy constraint 3. In this way, the result obtained in step D can be used as the object to be optimized.
[0154] Although adopting the two measures in step D at the same time (i.e., different treatment methods for two different situations) can ensure that constraint 3 is satisfied, on the one hand, there are some situations where it is not possible to adopt at least one of the two measures at the same time, such as:
[0155] Case 1: There are no specific prerequisites for the adoption of these measures on site, such as the structural layout of the building not allowing, the limited number of moving bodies, etc.;
[0156] Case 2: After adopting these measures, the performance of the optimal result after optimization is far inferior to the performance of the optimal result obtained by directly adopting the steps in Example 2.
[0157] For situation 1, only one measure can be adopted respectively, and then the number of allocation results obtained by adopting one measure can be compared, and then the object to be optimized can be determined according to the number of allocation results. For example, if the number of allocation results corresponding to the previous measure is much larger than the number of allocation results corresponding to the next measure, the allocation result corresponding to the previous measure can be tried as the first combination, and then step 4 and subsequent steps in embodiment 2 can be adopted; when the number of allocation results when only one measure is adopted is still too small, these measures can be abandoned and embodiment 2 can be followed honestly.
[0158] For situation 2, a minimum number of allocation results is set in advance. When the number of allocation results obtained by taking two measures at the same time is less than the minimum number of allocation results, it is processed according to situation 1; or a minimum optimization performance index is set in advance. When two measures are taken at the same time, if the optimization result of the allocation result obtained is lower than the minimum optimization performance index, the number of measures taken is reduced (until no measures are taken at all, preferably both measures are tried once respectively), and the allocation result and the optimization result are obtained, and the index of the optimization result is not lower than the minimum optimization performance index.
[0159] The above processing method essentially uses the building data as prior knowledge to reduce the number of enumeration results in Example 2.
[0160] Example 4
[0161] In the scenarios of Example 2 and Example 3, all mobile bodies used to perform milk delivery tasks are located in the hotel's milk distribution operation area (i.e., the place where service personnel uniformly load milk into mobile body containers) before the control system assigns the task. This is a very special situation.
[0162] In engineering practice, more scenarios are that some mobile bodies are in the process of delivering milk to hotel guests, that is, on the way to the hotel rooms in front, and some mobile bodies return to the operation area after completing the last milk delivery task. The control system successively receives milk delivery requests from passengers and assigns tasks to the mobile bodies waiting in the operation area. The biggest difference between this situation and the situations in Example 2 and Example 3 is that when the control system assigns tasks to the mobile bodies in the operation area, some mobile bodies are in the process of executing tasks. This means that when the control system assigns tasks to the mobile bodies in the operation area due to receiving a new milk delivery request, it must not only consider whether the first mobile body that will execute the new task satisfies constraints 1, 2 and 3, but also whether constraint 3 is satisfied between the first mobile body and the second mobile body that is currently in the process of executing the milk delivery task.
[0163] Constraints 1 and 2 in this scenario and the processing method for ensuring that constraint 3 is satisfied between the first moving body are the same as those in Examples 2 and 3, and no further elaboration is required. The following describes how to ensure that constraint 3 is satisfied between the first moving body and the second moving body.
[0164] Under normal circumstances, considering the delivery efficiency, the control system will not immediately assign the request to a mobile body and control the mobile body to deliver milk every time it receives a request for milk delivery. Instead, it will start to assign milk delivery tasks and control the mobile body to perform the delivery tasks when the number of accumulated unresponded requests reaches a certain number, or when the time interval from the earliest received time of all unresponded requests to the current time position exceeds the time threshold, or when the request specifies the latest delivery time, it will start to assign milk delivery tasks and control the mobile body to perform the delivery tasks at a time corresponding to a certain amount of time in advance based on the latest delivery time (such as the sum of the travel time required for the mobile body to reach the location of the guest who requested milk delivery and a time margin). As a result of such processing, when the task allocation is actually implemented, multiple requests are often accumulated, and different requests usually correspond to different task locations (i.e., the guest room of the hotel guest who is the recipient of milk). In this way, the control system can coordinate and manage multiple requests and optimize the task allocation results overall.
[0165] The control system allocates milk delivery requests from hotel guests in two ways:
[0166] Mode 1: The reallocation of the accumulated unresponded milk delivery request tasks and the milk delivery request tasks that have been responded to but not completed (i.e., have not been delivered to the guest rooms) among the various mobile bodies is not considered, that is, the corresponding relationship between the milk delivery request tasks that have been responded to but not completed by the mobile bodies and the mobile bodies currently in the milk delivery task is kept unchanged. In this mode, for the accumulated unresponded milk delivery request tasks and the mobile bodies currently in the idle state, the processing module formulates the plan according to the following steps:
[0167] Step 1, obtaining the task information, moving body information and building data of the accumulated tasks that have not yet been responded;
[0168] Step 2, determining constraint conditions based on task information and mobile body information;
[0169] Step 3, enumerating all possible first combinations, where the first combination represents the corresponding relationship between the moving body and the assigned task;
[0170] Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task;
[0171] Step 5, for each execution order of each first combination, using the building data to plan a moving path for the moving body when it moves between different task locations when performing the assigned task;
[0172] Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list;
[0173] Step 7, determining whether there is at least one second combination that has not been selected in the second combination list, if not, proceeding to step 9, otherwise selecting a second combination that has not been selected from the second combination list as the selected combination;
[0174] Step 8, determining whether the moving path of the mobile body currently in the idle state in the selected combination contains a specific area and whether the preset condition is satisfied, if so, deleting the selected combination from the second combination list and returning to step 7, otherwise returning to step 7;
[0175] Step 9, selecting a second combination from the second combination list as the solution;
[0176] Step 10: Allocate the accumulated unresponded tasks to the mobile body currently in the idle state according to the scheme, and end.
[0177] If the moving path of the mobile body currently in the idle state does not include the specific area, it is directly executed after the allocation is completed (multiple allocation results may be obtained, and one of them is selected as the execution allocation result or the optimized allocation result obtained after optimization is used as the execution allocation result);
[0178] If the moving path of the mobile body currently in the idle state does not include a specific area, determine whether the mobile body currently in the idle state and the mobile body currently in the milk delivery task meet constraint 3 (specifically, determine the passing time period and moving direction of the mobile body currently in the idle state when passing through the specific area (not required for the aforementioned elevator), determine the passing time period and moving direction of the mobile body currently in the milk delivery task when passing through the specific area, and determine whether the mobile body currently in the idle state and the mobile body currently in the milk delivery task do not stagger in opposite directions when passing through the specific area, that is, the moving directions are opposite and the passing time periods overlap). That is, for the accumulated tasks that have not yet responded and the mobile body currently in the idle state, the processing module formulates the plan according to the following steps:
[0179] Step 1, obtaining the task information, moving body information and building data of the accumulated tasks that have not yet been responded;
[0180] Step 2, determining constraint conditions based on task information and mobile body information;
[0181] Step 3, determining a first combination, wherein the first combination represents a corresponding relationship between a moving object and an assigned task;
[0182] Step 4, for the first combination, determining an execution order for the mobile body to execute the assigned task;
[0183] Step 5, for the execution order of the first combination, using the building data to plan a moving path for the moving object to move between different task locations when performing the assigned task;
[0184] Step 6, taking the combination of the first combination, the execution order and the moving path as the second combination;
[0185] Step 7, determine whether the moving path in the second combination contains a specific area that satisfies the preset condition. If not, take the current solution as the final solution and end. Otherwise, change the solution of the mobile body that is currently in an idle state and / or the solution of the mobile body that has responded but has not completed the task, until the solution makes the preset condition unsatisfactory. When constraint 3 is not satisfied, step 7 changes the solution in the following manner:
[0186] The processing module makes the preset condition invalid by formulating a scheme that makes at least one condition in the first condition group or the second condition group invalid, thereby preventing the moving body from being blocked in a specific area, wherein the first condition group includes:
[0187] Condition 11: the passing path of the moving object includes the same first specific area;
[0188] Condition 12: There is overlap in the travel time periods of the moving bodies passing through the same first specific area;
[0189] The second condition group includes:
[0190] Condition 21: the passing path of the moving object includes the same second specific area;
[0191] Condition 22: There is overlap in the travel time periods of the moving bodies passing through the same second specific area;
[0192] Condition 23: The moving direction of the moving object in the second specific area is opposite.
[0193] Method 2: For mobile delivery tasks such as the hotel delivering milk to guests, since different delivery tasks only have different delivery destinations (different locations of the guest rooms) and the delivered objects (milk here) are the same, when assigning tasks, the milk delivery request tasks that have been responded to but not yet completed (i.e., not yet delivered to the guest rooms) and the accumulated milk delivery request tasks that have not yet been responded to can be merged together and uniformly assigned to all mobile bodies including the mobile bodies that are currently in an idle state and the mobile bodies that are currently performing delivery tasks. In this way, the tasks originally performed by the mobile body that is currently performing the delivery task may be performed by the mobile body that is currently in an idle state. At the same time, the accumulated milk delivery request tasks that have not yet been responded to may be performed by the mobile body that is currently performing the delivery task. Such processing involves the current location of the mobile body that is currently performing the delivery task, and this current location will affect the delivery cost and delivery efficiency of the mobile body. Therefore, for the accumulated tasks that have not yet been responded to, when the task content of each task is the same and only the task location is different, the processing module formulates the plan according to the following steps:
[0194] Step 1, obtaining task information, mobile body information and building data of tasks to be completed, wherein the tasks to be completed include tasks that have been responded to by mobile bodies but not yet completed and accumulated tasks that have not yet been responded to, the mobile bodies include mobile bodies that are currently in an idle state and mobile bodies that are currently in task execution, and the mobile body information includes at least mobile body position information of the mobile body that is currently in task execution;
[0195] Step 2, determining constraint conditions based on task information and mobile body information;
[0196] Step 3, enumerating all possible first combinations, wherein the first combinations represent the corresponding relationship between the moving body and the assigned task;
[0197] Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task;
[0198] Step 5, for each execution order of each first combination, planning a moving path of the moving body when it moves between different task locations when performing the assigned task according to the building data and the position information of the moving body;
[0199] Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list;
[0200] Step 7, determining whether there is a second combination containing the specific area in the second combination list, if not, proceeding to step 9, otherwise proceeding to the next step;
[0201] Step 8, determining whether the preset condition corresponding to the second combination including the specific area is satisfied, if so, deleting the second combination including the specific area from the second combination list, otherwise directly proceeding to the next step;
[0202] Step 9, selecting one of the second combinations from the second combination list as the solution and outputting it;
[0203] Step 10: Allocate all pending tasks to all mobile bodies including mobile bodies currently in an idle state and mobile bodies currently in task execution according to the scheme.
[0204] The judgment of the preset conditions includes the following two parts:
[0205] Part 1: whether the preset conditions are met between the mobile bodies that execute the accumulated unresponded delivery request tasks;
[0206] Part 2 is to determine whether a preset condition is satisfied between each mobile body executing the accumulated unanswered delivery request tasks and the mobile body currently executing the task.
[0207] Before step 1, the method may further include:
[0208] Step A, judging whether the accumulation condition is satisfied, if satisfied, proceeding to the next step, otherwise returning to step A, the accumulation condition is: only when it is satisfied, the mobile body control system will control the mobile body to execute the assigned task.
[0209] The accumulation condition refers to any one of the following conditions:
[0210] Accumulation condition 1: the number of unresponded requests accumulated under the accumulation condition reaches a preset number;
[0211] Cumulative condition 2: the time interval from the earliest received time of all unresponded requests to the current time position exceeds the time threshold;
[0212] Cumulative condition 3: when the request specifies the latest delivery time, when the current time reaches a specific time, the specific time refers to the time corresponding to a preset amount of time in advance based on the latest delivery time.
[0213] The present application essentially makes full use of the control system's full grasp of the mobile body information and delivery task information, that is, it is able to obtain the mobile body's task completion status and current position, pending tasks and unfinished moving paths, as well as accumulated new task information (such as task locations, etc.), and comprehensively consider and analyze the overall situation. Therefore, it is able to meet constraint 3 at a higher level, that is, from the level of task allocation, task execution order and moving path, instead of processing from a local point (that is, limited information in a specific area) as in the prior art to avoid congestion.
[0214] The present invention has been described in detail above through specific implementation modes and embodiments, but these do not constitute limitations of the present invention. Without departing from the principles of the present invention, those skilled in the art may also make many variations and improvements, which should also be regarded as the protection scope of the present invention.
Claims
1. A mobile control system, characterized in that: include: A receiving module, used for receiving task information and mobile body information of a task to be performed by a mobile body, wherein the task information includes a task location, and the mobile body information includes a mobile body position; a storage module, used to store building data of the building where the mobile body is when performing the task, the building data including passages between different task locations in the building and information indicating a specific area in the passage, the specific area including a first specific area and / or a second specific area, the first specific area refers to an area in the passage where the space can only accommodate one mobile body at the same time, and the second specific area refers to an area in the passage where the width is less than the sum of the passing width of two mobile bodies and a certain avoidance margin; A processing module, which formulates a plan followed by the mobile body when performing the task according to the task information, the mobile body information and the building data, wherein the plan ensures that a preset condition will not be met during the mobile body performing the task, wherein the preset condition refers to a condition that the mobile body is blocked in a specific area; A generating module, used for generating a control instruction for controlling the mobile body to perform its task according to the scheme; The control module is used to control the mobile body according to the control instruction so that the mobile body executes the task assigned to the mobile body.
2. The mobile body control system according to claim 1, characterized in that: When the specific area is the first specific area, the preset condition is that at least two moving bodies pass through the same specific area at the same time; when the specific area is the second specific area, the preset condition is that at least two moving bodies need to pass through the specific area in opposite directions.
3. The mobile body control system according to claim 2, characterized in that: The scheme includes at least the correspondence between the mobile body and the assigned task assigned to the mobile body, the moving path of the same mobile body when performing tasks at different locations, and the passing time period when the mobile body passes through the specific area when performing the task.
4. The mobile body control system according to claim 3, characterized in that: The processing module makes the preset condition invalid by formulating a scheme that makes at least one condition in the first condition group or the second condition group invalid, thereby preventing the moving body from being blocked in a specific area, wherein the first condition group includes: Condition 11: the passing path of the moving object includes the same first specific area; Condition 12: There is overlap in the travel time periods of the moving bodies passing through the same first specific area; The second condition group includes: Condition 21: the passing path of the moving object includes the same second specific area; Condition 22: There is overlap in the travel time periods of the moving bodies passing through the same second specific area; Condition 23: The moving direction of the moving object in the second specific area is opposite.
5. The mobile body control system according to claim 4, characterized in that: The processing module formulates a solution by adopting at least one of the following means, so that at least one condition in the first condition group or the second condition group is not satisfied: Means 1, appropriately assigning or changing the assigned tasks to each mobile body; Means 2, appropriately setting or changing the order in which the mobile body performs each assigned task; Means 3, appropriately setting or changing the moving path of the moving body when it rushes to the task location of the next assigned task after completing the current assigned task.
6. The mobile body control system according to claim 5, characterized in that: When the processing module detects that the preset condition is met, it makes the preset condition invalid by adopting at least one of means 1 to means 3 and re-formulates the plan; the generation module regenerates and updates the control instructions based on the new plan; the control module controls the moving body according to the updated control instructions.
7. The mobile body control system according to claim 1, characterized in that: The mobile body processing module also needs to make constraints meet when formulating the plan. The constraints include: Constraint 1: The maximum number of items to be delivered by each mobile body at the same time cannot exceed the number of items it can accommodate.
8. The mobile body control system according to claim 7, characterized in that: The constraints also include: Constraint 2: The delivery time of the mobile body to the task location of the assigned task shall not be later than the specified delivery time of the mobile body.
9. The mobile body control system according to claim 7, characterized in that: The processing module formulates the scheme according to the following steps: Step 1, obtain task information, mobile body information and building information; Step 2, determining constraint conditions based on task information and mobile body information; Step 3, enumerating all possible first combinations, where the first combination represents the corresponding relationship between the moving body and the assigned task; Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task; Step 5, for each execution order of each first combination, using the building data to plan a moving path for the moving body when it moves between different task locations when performing the assigned task; Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list; Step 7, determining whether there is a second combination containing the specific area in the second combination list, if not, proceeding to step 9, otherwise proceeding to the next step; Step 8, determining whether the preset condition corresponding to the second combination including the specific area is satisfied, if so, deleting the second combination including the specific area from the second combination list, otherwise directly proceeding to the next step; Step 9: Select one of the second combinations from the second combination list as the solution and output it.
10. The mobile body control system according to claim 4, characterized in that: The processing module adopts specific measures when specifying the solution so that condition 11 or condition 21 is not met, and the specific measures include the following steps: Step A, determining the location of a specific area on a map based on building information; Step B, determining whether there is at least one path between two adjacent specific areas; Step C: for two adjacent specific areas with at least one passage between them, the two specific areas are respectively divided into two different sub-domains; for two adjacent specific areas without a passage between them, the two adjacent specific areas are merged into one sub-domain; Step D: for tasks whose task locations are in the same subdomain, they are assigned to the same mobile body for execution; for tasks whose task locations are in different subdomains, they are assigned to different mobile bodies for execution.
11. The mobile body control system according to claim 7, characterized in that: For the accumulated tasks that have not yet been responded and the mobile bodies that are currently in an idle state, the processing module formulates the plan according to the following steps: Step 1, obtaining the task information, moving body information and building data of the accumulated tasks that have not yet been responded; Step 2, determining constraint conditions based on task information and mobile body information; Step 3, enumerating all possible first combinations, where the first combination represents the corresponding relationship between the moving body and the assigned task; Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task; Step 5, for each execution order of each first combination, using the building data to plan a moving path for the moving body when it moves between different task locations when performing the assigned task; Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list; Step 7, determining whether there is at least one second combination that has not been selected in the second combination list, if not, proceeding to step 9, otherwise selecting a second combination that has not been selected from the second combination list as the selected combination; Step 8, determining whether the moving path of the mobile body currently in the idle state in the selected combination contains a specific area and whether the preset condition is satisfied, if so, deleting the selected combination from the second combination list and returning to step 7, otherwise returning to step 7; Step 9, selecting a second combination from the second combination list as the solution; Step 10: Allocate the accumulated unresponded tasks to the mobile body currently in the idle state according to the scheme, and end.
12. The mobile body control system according to claim 7, characterized in that: For the accumulated tasks that have not yet been responded and the mobile bodies that are currently in an idle state, the processing module formulates the plan according to the following steps: Step 1, obtaining the task information, moving body information and building data of the accumulated tasks that have not yet been responded; Step 2, determining constraint conditions based on task information and mobile body information; Step 3, determining a first combination, wherein the first combination represents a corresponding relationship between a moving object and an assigned task; Step 4, for the first combination, determining an execution order for the mobile body to execute the assigned task; Step 5, for the execution order of the first combination, using the building data to plan a moving path for the moving object to move between different task locations when performing the assigned task; Step 6, taking the combination of the first combination, the execution order and the moving path as the second combination; Step 7, determine whether the moving path in the second combination contains a specific area that makes the preset condition meet. If not, take the current plan as the final plan and end. Otherwise, change the plan of the mobile body that is currently in an idle state and / or the plan of the mobile body that has responded but has not completed the task until the plan makes the preset condition not meet.
13. The mobile body control system according to claim 12, characterized in that: The step 7 changes the scheme in the following way: The processing module makes the preset condition invalid by formulating a scheme that makes at least one condition in the first condition group or the second condition group invalid, thereby preventing the moving body from being blocked in a specific area, wherein the first condition group includes: Condition 11: the passing path of the moving object includes the same first specific area; Condition 12: There is overlap in the travel time periods of the moving bodies passing through the same first specific area; The second condition group includes: Condition 21: the passing path of the moving object includes the same second specific area; Condition 22: There is overlap in the travel time periods of the moving bodies passing through the same second specific area; Condition 23: The moving direction of the moving object in the second specific area is opposite.
14. The mobile body control system according to claim 7, characterized in that: For the accumulated tasks that have not been responded to, when the tasks have the same content but different locations, the processing module formulates the plan according to the following steps: Step 1, obtaining task information, mobile body information and building data of tasks to be completed, wherein the tasks to be completed include tasks that have been responded to by mobile bodies but not yet completed and accumulated tasks that have not yet been responded to, the mobile bodies include mobile bodies that are currently in an idle state and mobile bodies that are currently in task execution, and the mobile body information includes at least mobile body position information of the mobile body that is currently in task execution; Step 2, determining constraint conditions based on task information and mobile body information; Step 3, enumerating all possible first combinations, wherein the first combinations represent the corresponding relationship between the moving body and the assigned task; Step 4, for each first combination, enumerate all possible execution orders of the mobile body when executing the assigned task; Step 5, for each execution order of each first combination, planning a moving path of the moving body when it moves between different task locations when performing the assigned task according to the building data and the position information of the moving body; Step 6, taking each possible combination of the first combination, the execution order and the moving path as a second combination, and adding it to a second combination list; Step 7, determining whether there is a second combination containing the specific area in the second combination list, if not, proceeding to step 9, otherwise proceeding to the next step; Step 8, determining whether the preset condition corresponding to the second combination including the specific area is satisfied, if so, deleting the second combination including the specific area from the second combination list, otherwise directly proceeding to the next step; Step 9, selecting one of the second combinations from the second combination list as the solution and outputting it; Step 10: Allocate all pending tasks to all mobile bodies including mobile bodies currently in an idle state and mobile bodies currently in task execution according to the scheme.
15. The mobile body control system according to claim 9, 11 or 14, characterized in that: The step 9 selects the solution from the second combination that satisfies the preset conditions according to the principle of minimizing the delivery cost of the moving body or maximizing the delivery efficiency of the moving body.
16. The mobile body control system according to any one of claims 1 to 14, characterized in that: When the specific area is the first specific area, the processing device determines and judges whether the preset condition is satisfied according to the passing time period when the moving body passes through the specific area and the moving direction when the moving body passes through the specific area; When the specific area is the second specific area, the processing device determines and judges whether a preset condition is satisfied according to a passing time period when the moving body passes through the specific area.
17. The mobile body control system according to claim 11, 12 or 14, characterized in that: The judgment of the preset conditions includes the following two parts: Part 1: whether the preset conditions are met between the mobile bodies that execute the accumulated unresponded delivery request tasks; Part 2 is to determine whether a preset condition is satisfied between each mobile body executing the accumulated unanswered delivery request tasks and the mobile body currently executing the task.
18. The mobile body control system according to claim 11, 12 or 14, characterized in that: Before step 1, the method further includes: Step A, judging whether the accumulation condition is satisfied, if satisfied, proceeding to the next step, otherwise returning to step A, the accumulation condition is: only when it is satisfied, the mobile body control system will control the mobile body to execute the assigned task.
19. The mobile object control system according to claim 18, characterized in that: The accumulation condition refers to any one of the following conditions: Accumulation condition 1: the number of unresponded requests accumulated under the accumulation condition reaches a preset number; Cumulative condition 2: the time interval from the earliest received time of all unresponded requests to the current time position exceeds the time threshold; Cumulative condition 3: when the request specifies the latest delivery time, when the current time reaches a specific time, the specific time refers to the time corresponding to a preset amount of time in advance based on the latest delivery time.
Citation Information
Patent Citations
Multi-robot path planning method, multi-robot system and robot
CN113985880A
Control system and moving body
CN115043272A
Delivery method and delivery system for robot and robot
CN115657659A
Control method and device, robot and storage medium
CN115657680A
Autonomous moving body elevator taking system and method
CN116675076A
