EP3401750B1 - Procédé et dispositif de retour de robots à partir d'un site - Google Patents

Procédé et dispositif de retour de robots à partir d'un site Download PDF

Info

Publication number
EP3401750B1
EP3401750B1 EP16883134.5A EP16883134A EP3401750B1 EP 3401750 B1 EP3401750 B1 EP 3401750B1 EP 16883134 A EP16883134 A EP 16883134A EP 3401750 B1 EP3401750 B1 EP 3401750B1
Authority
EP
European Patent Office
Prior art keywords
robot
coordinates
robots
crowding point
idle state
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.)
Active
Application number
EP16883134.5A
Other languages
German (de)
English (en)
Other versions
EP3401750A4 (fr
EP3401750A1 (fr
Inventor
Jianqiang Zhu
Juejing XU
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Libiao Robots Co Ltd
Original Assignee
Zhejiang Libiao Robots Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority claimed from CN201610005062.0A external-priority patent/CN105488892B/zh
Priority claimed from CN201610003129.7A external-priority patent/CN105446342B/zh
Application filed by Zhejiang Libiao Robots Co Ltd filed Critical Zhejiang Libiao Robots Co Ltd
Publication of EP3401750A1 publication Critical patent/EP3401750A1/fr
Publication of EP3401750A4 publication Critical patent/EP3401750A4/fr
Application granted granted Critical
Publication of EP3401750B1 publication Critical patent/EP3401750B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
    • G05D1/02—Control of position or course in two dimensions
    • G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0212—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory
    • G05D1/0217—Control of position or course in two dimensions specially adapted to land vehicles with means for defining a desired trajectory in accordance with energy consumption, time reduction or distance reduction criteria
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00—Programme-controlled manipulators
    • B25J9/16—Programme controls
    • B25J9/1656—Programme controls characterised by programming, planning systems for manipulators
    • B25J9/1664—Programme controls characterised by programming, planning systems for manipulators characterised by motion, path, trajectory planning
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00—Programme-controlled manipulators
    • B25J9/0084—Programme-controlled manipulators comprising a plurality of manipulators
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00—Programme-controlled manipulators
    • B25J9/16—Programme controls
    • B25J9/1602—Programme controls characterised by the control system, structure, architecture
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00—Programme-controlled manipulators
    • B25J9/16—Programme controls
    • B25J9/1628—Programme controls characterised by the control loop
    • B25J9/163—Programme controls characterised by the control loop learning, adaptive, model based, rule based expert control
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00—Programme-controlled manipulators
    • B25J9/16—Programme controls
    • B25J9/1679—Programme controls characterised by the tasks executed
    • B25J9/1682—Dual arm manipulator; Coordination of several manipulators
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
    • G05D1/02—Control of position or course in two dimensions
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
    • G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
    • G05D1/02—Control of position or course in two dimensions
    • G05D1/021—Control of position or course in two dimensions specially adapted to land vehicles
    • G05D1/0287—Control of position or course in two dimensions specially adapted to land vehicles involving a plurality of land vehicles, e.g. fleet or convoy travelling
    • G05D1/0291—Fleet control
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00—Program-control systems
    • G05B2219/30—Nc systems
    • G05B2219/40—Robotics, robotics mapping to robotics vision
    • G05B2219/40417—For cooperating manipulators
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00—Program-control systems
    • G05B2219/30—Nc systems
    • G05B2219/45—Nc applications
    • G05B2219/45083—Manipulators, robot

Definitions

  • the present invention relates to the communication field, and particularly to a method and a device for returning robots from site (a method and an apparatus for working-place backflow of robots).
  • Examples of robots designed for this purpose can be found in US 2008/109114 , relating to a robot control apparatus for controlling tasks to be executed by a plurality of robots which are capable of moving, or in US5220263 , relating to a moving robot system employing a charging control system for robots, which is configured by plural moving robots, at least one charging station and a control station.
  • a further similar example is disclosed in EP0618523 , providing a transport management apparatus for controlling the transport of a plurality of unmanned vehicles traveling over a travel grid formed from a plurality of node provided at stationary positions, and connection routes connecting the intervals between these nodes.
  • the robot can serve as a transport device, which is provided therein with a walking device and a carrying device. Goods in a storage area at a fixed position are carried by the carrying device, and then the carried goods is transported by the walking device to a specified goods arrangement area.
  • the carried goods is delivered or unloaded by the carrying device in the current goods arrangement area, in order to ensure that the robot can normally and orderly work cyclically, each robot needs to return to a specified storage area according to a specified path, to further repeat the work of picking up the goods-transporting the goods-unloading the goods-returning to pick up the goods.
  • An object of the present invention is to provide a method and an apparatus for working-place backflow of robots, so as to ensure that the robot orderly leaves a working area place as soon as possible after delivering goods, effectively reduce the quantity of idle robots in the place, and meanwhile also reduce the possibility of intersection of paths of the robots; moreover, when intersection of paths of the robots occurs, it avoids occurrence of crowding of the robots in a crowding point zone, increases the speeds of the robots passing through the crowding point, and improves the working efficiency of the robots in the place and the overall working efficiency of the robot cluster.
  • the invention is defined by the method of claim 1 and the apparatus of claim 6.
  • an example of the present invention provides a method for working-place backflow of robots, comprising:
  • calculating a backflow path from the current coordinates of the robot to coordinates of each of the destinations comprises:
  • a second possible embodiment of the first aspect is provided in an example of the present invention, wherein the method further comprises:
  • a third possible embodiment of the first aspect is provided in an example of the present invention, wherein the calculating, according to distances from the current coordinates of the to-be-charged robot to coordinates of all the charging stations and time for the to-be-charged robot, coordinates of a target charging station nearest to the current coordinates of the to-be-charged robot comprises:
  • data connections with a plurality of robots are respectively established, and it further comprises:
  • a fourth possible embodiment of the first aspect is provided in an example of the present invention, wherein the setting, according to pass requests sent by individual robots in the crowding point zone, scheduling commands respectively for individual robots in the crowding point zone comprises: Setting, according to time sequence of the pass requests sent by individual robots in the crowding point zone and positions of the individual robots in the crowding point zone included in the pass requests, the scheduling commands respectively for the individual robots in the crowding point zone.
  • a fifth possible embodiment of the first aspect is provided in an example of the present invention, wherein the scheduling command includes: time when a robot starts to operate in the crowding point zone, a path for the robot passing through the crowding point zone and a speed for the robot passing through the crowding point zone.
  • an example of the present invention further provides an apparatus for working-place backflow of robots, comprising:
  • the first calculating unit comprises:
  • the apparatus further comprises:
  • a third possible embodiment of the second aspect is provided in an example of the present invention, wherein the second calculating module comprises:
  • the apparatus respectively establishes data connections with a plurality of robots, and further comprises:
  • a third possible embodiment of the second aspect is provided in an example of the present invention, wherein the setting module is configured to set, according to time sequence of the pass requests sent by the individual robots in the crowding point zone and positions of the individual robots in the crowding point zone included in the pass requests, the scheduling commands respectively for the individual robots in the crowding point zone.
  • a fourth possible embodiment of the second aspect is provided in an example of the present invention, wherein the scheduling command includes: time when a robot starts to operate in the crowding point zone, a path for the robot passing through the crowding point zone and a speed for the robot passing through the crowding point zone
  • the methods and the apparatuses for working-place backflow of robots comprise: firstly acquiring the current coordinates of a robot currently in an idle state in the working place and coordinates of all destinations to be returned to; then calculating, according to distances from the current coordinates of the robot to the coordinates of all the destinations and time for the robot, coordinates of a target destination nearest to the current coordinates; and finally controlling the robot to move out of the working place according to a backflow path corresponding to the coordinates of target the destination, so as to ensure that the robot in an idle state departs orderly.
  • robots when applied to the logistics field, can be used as a transport device to carry the goods in a storage area from the storage area to a delivering area (i.e. goods arrangement area) and deliver the goods, and returns to the corresponding storage area.
  • a delivering area i.e. goods arrangement area
  • an example of the present invention provides a method for working-place backflow of robots, and the method comprises the following steps: S101: acquiring current coordinates of a robot currently in an idle state in a working area.
  • the robot in the working area after delivering carried goods, is then in an idle state, at this time, firstly current coordinates of the robot currently in an idle state are acquired, i.e. the current coordinates of the robot currently in an idle state are determined.
  • the working place is provided with a plurality of delivering areas (i.e. goods arrangement areas) for the robots, and determining the current coordinates of the robot broadly refers to determining a position of a delivering area where the robot is performing delivery currently.
  • delivering areas i.e. goods arrangement areas
  • the above working area for the robot can be divided into a plurality of spaces (the spaces can be construed as those having a predetermined length and width), and each space is corresponding to coordinates of a position, wherein each space only can receive one robot, and when one space is occupied by one robot, this space can no longer receive another robot, that is, two or more robots cannot simultaneously occupy one and the same space.
  • determining the current coordinates of the robot having finished the delivery of goods refers to acquiring (i.e. determining) a position of the space where the robot having finished the delivery of goods is located.
  • S102 acquiring coordinates of all destinations which the robot currently in an idle state is going to return to, wherein the coordinates of the destinations comprise coordinates of a plurality of destinations and the coordinates of the plurality of destinations are all located at outside of the working area; a plurality of storage areas are located outside of the working area, with the plurality of storage areas at different zones, and the coordinates of the plurality of destinations are all set in the storage areas at predetermined zones outside the working area.
  • an optimal combination corresponding to the combination of the distance and the time is calculated, and then the coordinates of the destination corresponding to the optimal combination serve as the coordinates of the target destination nearest to the current coordinates.
  • the distances (i.e. travel paths) from the current coordinates of the robot currently in an idle state to the coordinates of individual destinations are determined upon comprehensively considering paths of a plurality of robots, and paths of the robot currently in an idle state corresponding to the distances (i.e. travel paths) will not overlap with those of other robots (including other robots in an idle state and robots in a working state) (i.e. avoiding that two or more robots simultaneously occupy one idle space), thus all the robots in an idle state may orderly return to the coordinates of the destinations in the storage areas, so as to carry out the next cyclic working process of picking up the goods, transporting, unloading the goods (i.e. delivering) and departing.
  • S104 controlling the robot currently in an idle state to move out of the working area according to a backflow path corresponding to the coordinates of the target destination, so as to ensure that the robot currently in an idle state departs orderly.
  • the robot currently in an idle state is controlled to move out of the working area according to the backflow path corresponding to the coordinates of the target destination calculated above, and to return to the coordinates of the target destination in the corresponding storage area, so as to ensure that the robot orderly moves out of the working area place as soon as possible after delivering the goods, effectively reduce the quantity of the idle robots in the place, meanwhile also reduce the probability of intersection of the paths for the robots, and improve the working efficiency of the robots in the place.
  • the method for working-place backflow of robots provided in the example of the present invention, in which the coordinates of the target destination are calculated according to the distances from the current coordinates of the real-time positioned robot in an idle state to coordinates of all destinations and time for the robot and the robot is controlled to move out of the working area according to the backflow path corresponding to the calculated coordinates of the target destination, ensures that the robot orderly moves out of the working area place as soon as possible after delivering the goods, effectively reduces the quantity of the idle robots in the place, meanwhile also reduces the possibility of intersection of the paths for the robots, and improves the working efficiency of the robots in the place.
  • a plurality of storage areas are located outside of the working area, with the plurality of storage areas at different zones, and the coordinates of the plurality of destinations are all set in the storage areas at the predetermined zones outside the working area.
  • the storage area of the coordinates of the target destination nearest to the robot in an idle state may be calculated according to the current coordinates of the robot in an idle state, and then the robot in an idle state is controlled to move out of the working area along the backflow path of the storage area of the target destination coordinates, thus the robot can be enabled to depart more quickly.
  • step S103 specifically comprises: S201: calculating a backflow path from the current coordinates of the robot currently in an idle state to the coordinates of each of the destination.
  • a plurality of storage areas are located outside of the working area, with the plurality of storage areas at different zones, and the coordinates of the plurality of the destinations are all set in the storage areas at the predetermined zones outside the working area.
  • the backflow path from the current coordinates of the robot currently in an idle state to the coordinates of each of the destinations is calculated, and the backflow path carries distance and time parameters.
  • a manner of determining the backflow path comprises: firstly acquiring current coordinates of other robots in the place, and then calculating, according to the current coordinates of the robot currently in an idle state and the current coordinates of other robots in the place, the backflow path from the current coordinates of the robot currently in an idle state to the coordinates of each of the destinations, for the purpose of ensuring that the path for the robot in an idle state moving out of the working area will not overlap with those for other robots, i.e. avoiding that two or more robots simultaneously occupy one idle space.
  • S202 calculating, according to the distances and time corresponding to the backflow paths, a first matching cost between the current coordinates of the robot currently in an idle state and the coordinates of each of the destinations.
  • the manner of calculating the first matching cost in the example of the present invention is not merely limited to the above two calculating manners, and this calculating manner in the present invention is not specifically limited.
  • any one of the above calculating manners is chosen to calculate the first matching cost, and then all of the first matching costs obtained from the above calculation are compared, to choose the matching cost whose obtained numerical value result is the smallest, so as to subsequently take coordinates of a destination corresponding to the chosen matching cost, whose numerical value is smallest, as the coordinates of the target destination nearest to the current coordinates.
  • the electric quantity condition of the robot should also be detected in real time, and the robot, which is in the case of low electric quantity, is controlled to go to a robot charging station outside the working area for charging.
  • S301 judging whether electric quantity of the robot currently in an idle state reaches standard electric quantity.
  • the standard electric quantity in the example of the present invention is the electric quantity that can enable a robot to complete the farthest path from picking up the goods, carrying the goods, unloading the goods to returning to the storage area; after the current robot has completed the process of unloading the goods, firstly whether the residual electric quantity of this robot in an idle state is lower than the standard electric quantity, and if the residual electric quantity of this robot in an idle state is lower than the standard electric quantity, there is a need to timely dispatch this robot to go to the robot charging station for charging, so as to ensure that this robot in an idle state can successfully complete the next round of work from picking up the goods, carrying the goods, unloading the goods to returning to the storage area.
  • S302 determining, when the electric quantity of the robot currently in an idle state is detected to be lower than the standard electric quantity, the corresponding robot as a to-be-charged robot.
  • this robot is determined as a to-be-charged robot, so as to subsequently unifiedly dispatch the to-be-charged robot to go to the robot charging station.
  • S303 acquiring coordinates of all charging stations which the to-be-charged robot is going to return to, wherein coordinates of the charging stations comprise coordinates of a plurality of the charging stations and the coordinates of the plurality of charging stations are all located in the predetermined zones outside the working area.
  • S304 calculating, according to the distances from the current coordinates of the to-be-charged robot to the coordinates of all the charging stations and time for the to-be-charged robot, coordinates of the target charging station nearest to the current coordinates of the to-be-charged robot.
  • the distances (i.e. travel paths) from the current coordinates of the to-be-charged robot to the coordinates of the individual charging stations are determined upon comprehensive consideration of the paths of a plurality of robots, and paths of the to-be-charged robot corresponding to the distances (i.e. travel paths) will not overlap with those of other robots (including to-be-charged robots and the robots returning to the coordinates of target destinations later) (i.e.
  • the to-be-charged robot can be enabled to orderly return to the target charging station, so as to be subjected to charging, and then to carry out the next cyclic working process of picking up the goods, carrying, unloading the goods (i.e. delivering) and departing.
  • S305 controlling the to-be-charged robot to move out of the working area according to the backflow path corresponding to the coordinates of the target charging station, so as to ensure that the to-be-charged robot orderly moves into the target charging station for charging.
  • this to-be-charged robot is controlled to move out of the working area according to the backflow path corresponding to the coordinates of the target charging station calculated above, and to move into the robot charging station corresponding to the coordinates of the charging station, so as to ensure that the to-be-charged robot orderly moves out of the working area place as soon as possible for charging, effectively reduce the quantity of the idle robots in the place, and meanwhile also reduce the probability of intersection of paths for the robots, and improve the working efficiency of the robots in the place.
  • a plurality of robot charging stations are located outside of the working area, with the plurality of storage areas at different zones, and the coordinates of the plurality of charging stations are all set in the storage areas at predetermined zones.
  • coordinates of the target charging station nearest to this robot in an idle state may be calculated according to the current coordinates of this robot in an idle state, and then this robot in an idle state is controlled to move out of the working area along the backflow path of the coordinates of the target charging station, thus the robot can be enabled to depart more quickly.
  • step 304 is as follows: S401: calculating a backflow path from the current coordinates of the to-be-charged robot to the coordinates of each of the charging stations.
  • the backflow path from the current coordinates of the above to-be-charged robot to the coordinates of each of the charging stations, and the backflow path carries distance and time parameters.
  • a manner of determining the backflow path comprises: firstly acquiring current coordinates of other robots; then calculating, according to the current coordinates of the to-be-charged robot and the current coordinates of other robots, the backflow path from the current coordinates of the to-be-charged robot to the coordinates of each of the charging stations, for the purpose of ensuring that the path for the to-be-charged robot moving out of the working area will not overlap with those for other robots, i.e. avoiding that two or more robots simultaneously occupy one idle space.
  • S402 calculating, according to distances and time corresponding to the backflow path, a second matching cost between the current coordinates of the to-be-charged robot and the coordinates of each of the charging stations.
  • any one of the above calculating manners is chosen to calculate the second matching cost, and then all of the second matching costs obtained from the above calculation are compared, to choose the matching cost whose obtained numerical value result is the smallest, so as to subsequently take coordinates of a charging station corresponding to the chosen matching cost, whose numerical value is smallest, as the coordinates of the target charging station nearest to the current coordinates.
  • S404 determining coordinates of the charging station in the backflow path corresponding to the chosen smallest second matching cost as the coordinates of the target charging station nearest to the current coordinates of the to-be-charged robot.
  • Step S501 determining a crowding point zone
  • a server establishes data connections with a plurality of robots (including the robots in an idle state and the robots in a working state) in the place, to further acquire paths of the plurality of robots (including the backflow paths of the robots in an idle state and the travel paths of the robots in a working state), and analyzes the backflow paths of the plurality of robots, to determine a site with a high occurrence frequency in the paths as a crowding point, and to determine a crowding point zone from zones adjacent to the crowding point, wherein the crowding point zone is different from a queuing zone where the robots are arranged in one row with the robot first entering the crowding point zone standing first, but comprises respective positions where the robots scatter in the crowding point zone.
  • Step S502 setting, according to pass requests sent by individual robots in the crowding point zone, scheduling commands respectively for the individual robots in the crowding point zone.
  • the pass request includes, but not limited to: a position of the robot in the crowding point zone.
  • Each robot, entering the crowding point zone will be triggered to send a pass request to the server, and the server sets, according to the time sequence of the pass requests sent by individual robots in the crowding point zone and positions of individual robots in the crowding point zone included in the pass requests, scheduling commands respectively for the individual robots in the crowding point zone.
  • each request sent by the robots has time limitation, and in order to avoid timeout of response to the pass requests sent by the robots, and to avoid that the robot preferentially arriving at the crowding point zone cannot preferentially pass through the crowding point zone, when the server sets the scheduling commands for the robots, setting needs to be performed according to the time sequence of the pass requests sent by the robots.
  • the crowding point zone is a zone adjacent to the crowding point, individual robots, after entering the crowding point zone, scatter at various positions in the crowding point zone, rather than being arranged in one row, with the robot preferentially entering the crowding point zone standing first, when a path for a certain robot passing through the crowding point is blocked by other robots, in order to be capable of quickly passing through the crowding point zone, the scheduling commands can be set for the robot blocking other robots, to make the same preferentially pass through the crowding point zone.
  • the preferential level of the factors (1) and (2) can be adaptively adjusted. For example, when the server has a relatively high timeliness requirement on the pass requests of the robots entering the crowding point zone, the proportion of the factor (1) is increased; and when the server has a relatively low timeliness requirement on the pass requests of the robots entering the crowding point zone and a relatively high overall efficiency requirement on the robot passing through the crowding point zone, the proportion of the factor (2) is increased.
  • each robot should pass through the crowding point zone at the maximum travel speed, moreover, considering that the maximum travel speeds of individual robot are different, in order to avoid crowding of the robots in the crowding point zone, the server should set the scheduling command for each robot according to the maximum travel speed of each robot.
  • the scheduling command includes, but not limited to: the time when a robot starts to operate in the crowding point zone, a path for the robot passing through the crowding point zone and a speed for the robot passing through the crowding point zone.
  • a manner of the scheduling command including the time when the robot starts to operate in the crowding point zone comprises:
  • the robot after entering the crowding point zone, the robot is in a standby state, and starts to pass through the crowding point zone according to the scheduling command only after receiving the scheduling command, wherein since the time period for the server setting the scheduling command is negligible for being very short, the time period for the robot in the standby state is not long, and it will not affect the speed for the robot passing through the crowding point zone.
  • Step S503 sending the scheduling commands respectively to individual robots in the crowding point zone, so as to make the robot having received the scheduling command pass through the crowding point zone according to the scheduling command.
  • the server after setting the scheduling command for each robot in the crowding point zone, sends the scheduling command for each robot to the corresponding robot, and the robot, upon receiving the scheduling command, starts, according to the time when starting to operate in the scheduling command, to pass through the crowding point zone in the path and at the speed in the scheduling command.
  • the crowding point zone is determined; according to the pass requests sent by individual robots in the crowding point zone and the paths of individual robots in the crowding point zone, the scheduling commands are set respectively for the individual robots in the crowding point zone; the scheduling commands are respectively sent to the individual robots in the crowding point zone, so as to make the robots having received the scheduling commands pass through the crowding point zone according to the scheduling commands.
  • the pass request of each robot in the crowding point zone is analyzed, and the respective scheduling command is set for each robot, avoiding occurrence of crowding of the robots in the crowding point zone, increasing the speeds for the robots passing through the crowding point, and further improving the overall working efficiency of the robot cluster.
  • the server acquires that the path of the robot 1 is embodied as a certain position in the working area-A-C1, and that the path of the robot 2 is embodied as a certain position in the working area-A-C2.
  • the server determines that all of the robots will pass through the point A, and the frequency of occurrence of the point A is the highest, therefore, A is determined as a crowding point, and a crowding point zone is chosen from zones adjacent to A.
  • the robot is set to be triggered when entering the crowding point zone to send a pass request to the server.
  • Fig. 6 is a position view of the robot 1 and the robot 2 in the crowding point zone provided in the present example, wherein coordinates of the position of the robot 1 are (5,6), with a gravity value of 11; coordinates of the position of the robot 2 are (5,0), with a gravity value of 5, and the robot 1 and the robot 2 have the smallest paths that do not overlap, wherein the path of the robot 1 is referred to as S1, and the path of the robot 2 is referred to as S2.
  • the robot 2 has a smaller gravity value, and is nearer to the position of the crowding point, if the time T1 for the robot 1 to pass through the crowding point A is later than the time T2 for the robot 2 to pass through the crowding point A, in order to improve the efficiency of the robots passing through the crowding point A, the smallest paths are chosen for the robot 1 and the robot 2 to pass through the crowding point A, and without affecting the robot 1 passing through the crowding point A at the same time, a scheduling command having the same time when starting to operate as the robot 1 is set for the robot 2, and in the scheduling command the path S1 of the robot 1 does not overlap with the path S2 of the robot 2, such as the paths S1 and S2 shown in Fig. 6 , thus, the time for the robot 2 to pass through the crowding point A in the path S2 is saved, and further the overall speed of the robots 1, 2 passing through the crowding point A is increased.
  • the scheduling commands including the same time when starting to operate also can be set for the robot 1 and the robot 2, such that after the robot 1 passes through the crowding point A, the time of the robot 2 passing through the crowding point A is not affected, and further the overall speed of the robots 1, 2 passing through the crowding point A is improved.
  • the time when starting to operate included in the scheduling command set for the robot 1 can be prior to the time when starting to operate included in the scheduling command set for the robot 2, and the path S1 of the robot 1 and the path S2 of the robot 2 in the scheduling commands do not overlap, for example, the scheduling command set for the robot 1 is "pass through the crowding point A at 10:00 at a speed of 3 km/hour according to the path S1", and the scheduling command set for the robot 2 is "pass through the crowding point A at 10:01 at a speed of 3.5 km/hour according to the path S2".
  • FIG. 7 it is another position view of the robot 1 and the robot 2 in the crowding point zone provided in the present example, wherein coordinates of the position of the robot 1 are (6,0), with a gravity value of 6; coordinates of the position of the robot 2 are (5,0), with a gravity value of 5, and the path of the robot 1 is S1, the path of the robot 2 is S2, and the robot 2 is in the smallest path of the robot 1.
  • the robot 1 sends the pass request to the server first, the robot 2 is nearer to the crowding point A, if the time T1 for the robot 1 to pass through the crowding point A is later than the time T2 for the robot 2 to pass through the crowding point A, in order to improve the efficiency of the robots passing through the crowding point A, the scheduling commands including the same time when starting to operate are set for the robot 1 and the robot 2, wherein the path of the robot 1 is A1, the path of the robot 2 is S2, i.e. the time for the robot 2 to pass through the crowding point A is saved while not affecting the robot 1 passing through the crowding point A, and further the overall speed of the robots 1, 2 passing through the crowding point A is increased.
  • the time when starting to operate included in the scheduling command set for the robot 1 may be prior to the time when starting to operate included in the scheduling command set for the robot 2, wherein the path of the robot 1 is S1', wherein S1' is a path bypassing the robot 2 and passing through the crowding point A, such as S1' shown in Fig. 8 .
  • the time when starting to operate included in the scheduling command set for the robot 2 can be prior to the time when starting to operate included in the scheduling command set for the robot 1, and the path of the robot 1 is S1', and the path of the robot 2 is S2, so that the robot 2 passes through the crowding point A before the robot 1.
  • Fig. 6 and Fig. 7 are merely specific application scenes provided in the present example, and in practical application, the robot cluster are not limited to two robots, and all methods of setting the scheduling commands for individual robots in the crowding point zone according to the time sequence of the pass requests sent by the individual robots in the crowding point zone and the positions of the individual robots in the crowding point zone included in the pass requests provided in the present example should fall within the protection scope of the present invention.
  • the crowding point zone is determined; the scheduling commands are set respectively for individual robots in the crowding point zone according to the pass requests sent by the individual robots in the crowding point zone and the paths of the individual robots in the crowding point zone; the scheduling commands are sent respectively to the individual robots in the crowding point zone, so as to make the robots having received the scheduling commands pass through the crowding point zone according to the scheduling commands.
  • the pass request of each robot in the crowding point zone is analyzed, and the respective scheduling command is set for each robot, avoiding occurrence of crowding of the robots in the crowding point zone, increasing the speeds for the robots passing through the crowding point, and improving the overall working efficiency of the robot cluster.
  • the method for working-place backflow of robots calculates coordinates of the target destination according to the distances from the current coordinates of the real-time positioned robot in an idle state to coordinates of all destinations and time for the robot, and controls the robot to move out of the working area according to the backflow path corresponding to the calculated coordinates of the target destination, ensuring that the robot orderly moves out of the working area place as soon as possible after delivering the goods, effectively reducing the quantity of the idle robots in the place, and meanwhile also reducing the possibility of intersection of the paths for the robots; moreover, when intersection of the robot paths occurs, the robots are subjected to queuing management, and the crowding point zone is determined by respectively establishing data connections with a plurality of robots; the scheduling commands are respectively set for individual robots in the crowding point zone according to the pass requests sent
  • An example of the present invention further provides an apparatus for working-place backflow of robots.
  • the apparatus is used to perform the above method for working-place backflow of robots.
  • the apparatus can be provided in a server for controlling the operation of the robot. Referring to Fig. 9 , the apparatus comprises:
  • the apparatus for working-place backflow of robots calculates coordinates of the target destination according to the distances from the current coordinates of the real-time positioned robot in an idle state to coordinates of all destinations and time for the robot in an idle state, and controls the robot to move out of the working area according to the backflow path corresponding to the calculated coordinates of the target destination, ensuring that the robot orderly moves out of the working area place as soon as possible after delivering the goods, effectively reducing the quantity of the idle robots in the place, meanwhile also reducing the possibility of intersection of the paths for the robots, and improving the working efficiency of the robots in the place.
  • the first calculating module 13 comprises:
  • the first calculating unit 131 comprises:
  • the apparatus further comprises:
  • a plurality of robot charging stations (including the charging station coordinates) are located outside of the working area, with the plurality of storage areas at different zones, and the coordinates of the plurality of charging stations are all set in the storage areas at the predetermined zones.
  • the working area place as soon as possible to go to the robot charging station, coordinates of the target charging station nearest to this robot in an idle state can be calculated according to the current coordinates of this robot in an idle state, and then this robot in an idle state is controlled to move out of the working area along the backflow path of the coordinates of the target charging station, such that the robot can be enabled to depart more quickly.
  • the second calculating module 18 comprises:
  • the robots are subjected to queuing management, and the above apparatus respectively establishes data connections with a plurality of robots, and further comprises:
  • the second determining module 51 comprises:
  • the pass request includes: a position of the robot in the crowding point zone.
  • the setting module 52 is configured to set, according to the time sequence of the pass requests sent by individual robots in the crowding point zone and positions of the individual robots in the crowding point zone included in the pass requests, the scheduling commands respectively for the individual robots in the crowding point zone.
  • the scheduling command includes: the time when the robot starts to operate in the crowding point zone, a path for the robot passing through the crowding point zone and a speed for the robot passing through the crowding point zone.
  • the crowding point zone is determined; the scheduling commands are set respectively for the individual robots in the crowding point zone according to the pass requests sent by individual robots in the crowding point zone and the paths of individual robots in the crowding point zone; the scheduling commands are sent respectively to the individual robots in the crowding point zone, so as to make the robots having received the scheduling commands pass through the crowding point zone according to the scheduling commands.
  • the pass request of each robot in the crowding point zone is analyzed, and the respective scheduling command is set for each robot, avoiding occurrence of crowding of the robots in the crowding point zone, increasing the speeds for the robots passing through the crowding point, and further improving the overall working efficiency of the robot cluster.
  • the apparatus for working-place backflow of robot calculates coordinates of the target destination coordinates according to the distances from the current coordinates of the real-time positioned robot in an idle state to coordinates of all destinations and time for the robot, and controls the robot to move out of the working area according to the backflow path corresponding to the calculated coordinates of the target destination, ensuring that the robot orderly moves out of the working area place as soon as possible after delivering the goods, effectively reducing the quantity of the idle robots in the place, meanwhile also reducing the possibility of intersection of the paths of the robots, and improving the working efficiency of the robot in the place; moreover, when intersection of the robot paths occurs, the robots are subjected to queuing management, and the crowding point zone is determined by respectively establishing data connections with a plurality of robots; the scheduling commands are respectively set for individual robots
  • the disclosed system, apparatus and method can be realized in other manners.
  • the apparatus examples described above are merely illustrative, for example, the dividing of the units is merely a kind of logic function division, and other dividing modes can be used in practical implementation, and for another example, a plurality of units or components can be combined or integrated into another system, or some features can be omitted, or not implemented.
  • Another point is that the displayed or discussed mutual coupling or direct coupling or communication connection can be realized through some communication interfaces, and indirect coupling or communication connection of the apparatus or units may be electrical, mechanical or in other forms.
  • the units explained as separate parts may be physically separated or not, the parts displayed as units may be a physical unit or not, i.e. may be located in one place, or also may be distributed onto a plurality of network units. Part or all of the units may be chosen according to practical requirements to realize the objects of the solution of the present example.
  • various functional units in respective examples of the present invention may be integrated in one processing unit, various units also may independently and physically exist, and two or more units also may be integrated in one unit.
  • the function is realized in a form of software functional unit and is sold or used as an individual product, it may be stored in one computer readable storage medium.
  • the technical solution of the present invention essentially or the part making contribution to the prior art or part of this technical solution may be embodied in a form of software product, and this computer software product is stored in one storage medium, including several commands used to make one computer device (which may be a personal computer, a sever, or a network device etc.) execute all or part of the steps of the methods of various examples of the present invention.
  • the aforementioned storage medium includes various media capable of storing program codes, such as U disk, mobile hard disk, Read-Only Memory (ROM), Random Access Memory (RAM), diskette or compact disk and so on.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Robotics (AREA)
  • Mechanical Engineering (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
  • Manipulator (AREA)
  • Navigation (AREA)

Claims (11)

  1. Procédé pour le retour de robots à partir d'une aire de travail, comprenant :
    une acquisition de coordonnées courantes d'un emplacement courant d'un robot dans une aire de travail dans laquelle des marchandises portées par le robot peuvent être livrées avec le robot couramment dans un état de veille ;
    une acquisition de coordonnées de toutes les destinations auxquelles le robot couramment dans un état de veille va revenir, les coordonnées de toutes les destinations étant toutes situées à l'extérieur de l'aire de travail ; dans lequel une pluralité d'aires de stockage dans lesquelles des marchandises sont stockées sont situées à l'extérieur de l'aire de travail, la pluralité d'aires de stockage étant définies dans des zones différentes, et les coordonnées de toutes les destinations sont toutes réglées dans les aires de stockage dans des zones prédéterminées à l'extérieur de l'aire de travail ;
    un calcul, en fonction de distances depuis les coordonnées courantes du robot couramment dans un état de veille jusqu'aux coordonnées de toutes les destinations et d'une durée de déplacement du robot depuis l'emplacement courant jusqu'à toutes les destinations, de coordonnées d'une destination cible la plus proche des coordonnées courantes ; et
    une commande au robot couramment dans un état de veille de se déplacer à l'extérieur de l'aire de travail selon un trajet de retour correspondant aux coordonnées de la destination cible, afin d'assurer le départ ordonné du robot couramment dans un état de veille, en quittant l'aire de travail dès que possible après la livraison des marchandises,
    dans lequel l'étape de calcul, en fonction de distances depuis les coordonnées courantes du robot couramment dans un état de veille jusqu'aux coordonnées de toutes les destinations et de la durée de déplacement du robot depuis un emplacement courant jusqu'à toutes les destinations, de coordonnées d'une destination cible la plus proche des coordonnées courantes comprend :
    un calcul d'une pluralité de trajets de retour, chaque trajet de retour étant calculé depuis des coordonnées courantes du robot couramment dans un état de veille jusqu'à des coordonnées de chacune des destinations ;
    un calcul, en fonction de distances et d'une durée correspondant aux trajets de retour, d'une pluralité de premiers coûts de mise en correspondance, chaque premier coût de mise en correspondance étant calculé entre les coordonnées courantes du robot couramment dans un état de veille et les coordonnées de chacune des destinations ;
    une comparaison de la pluralité des premiers coûts de mise en correspondance calculés, et un choix du plus petit parmi la pluralité des premiers coûts de mise en correspondance ; et
    une détermination de coordonnées de la destination dans le trajet de retour correspondant au plus petit premier coût de mise en correspondance choisi en tant que les coordonnées de la destination cible la plus proche des coordonnées courantes,
    dans lequel des connexions de données avec une pluralité de robots sont respectivement établies, et le procédé comprend en outre :
    une détermination d'une zone de point d'encombrement ;
    un réglage, en fonction de demandes de passage envoyées par des robots individuels dans la zone de point d'encombrement, d'instructions d'ordonnancement pour les robots individuels dans la zone de point d'encombrement ; et
    un envoi des instructions d'ordonnancement respectivement aux robots individuels dans la zone de point d'encombrement, de sorte que des robots ayant reçu les instructions d'ordonnancement passent à travers la zone de point d'encombrement selon les instructions d'ordonnancement,
    l'étape de détermination d'une zone de point d'encombrement comprend : une acquisition de trajets de la pluralité de robots ; une détermination d'un point d'encombrement en fonction des trajets de la pluralité de robots ; et une détermination de la zone de point d'encombrement à partir de zones adjacentes au point d'encombrement,
    la demande de passage comprend : une position du robot dans la zone de point d'encombrement, et
    l'instruction d'ordonnancement comprend : un instant auquel un robot commence à fonctionner dans la zone de point d'encombrement, un trajet du robot passant à travers la zone de point d'encombrement et une vitesse du robot passant à travers la zone de point d'encombrement.
  2. Procédé selon la revendication 1, dans lequel l'étape de calcul de la pluralité de trajets de retour depuis les coordonnées courantes du robot couramment dans un état de veille jusqu'aux coordonnées de chacune des destinations comprend pour chaque trajet de retour :
    une acquisition de coordonnées courantes d'autres robots ; et
    un calcul, en fonction des coordonnées courantes du robot couramment dans un état de veille et des coordonnées courantes des autres robots, du trajet de retour depuis les coordonnées courantes du robot couramment dans un état de veille jusqu'aux coordonnées de chacune des destinations.
  3. Procédé selon la revendication 1 ou 2, dans lequel le procédé comprend en outre :
    une évaluation si une quantité électrique du robot couramment dans un état de veille atteint une quantité électrique standard ;
    une détermination, lorsqu'il est détecté que la quantité électrique du robot couramment dans un état de veille est inférieure à la quantité électrique standard, du robot correspondant couramment dans un état de veille en tant qu'un robot à charger ;
    une acquisition de coordonnées de toutes les stations de chargement auxquelles le robot à charger va retourner, dans lequel les coordonnées des stations de chargement sont toutes situées dans d'autres zones prédéterminées à l'extérieur de l'aire de travail ;
    un calcul, en fonction de distances depuis les coordonnées courantes du robot à charger jusqu'aux coordonnées de toutes les stations de chargement et d'une durée de déplacement du robot à charger depuis l'emplacement courant jusqu'à toutes les stations de chargement, de coordonnées d'une station de chargement cible la plus proche des coordonnées courantes du robot à charger ; et
    une commande au robot à charger de se déplacer à l'extérieur de l'aire de travail selon un trajet de retour correspondant aux coordonnées de la station de chargement cible, de manière à assurer le déplacement ordonné du robot à charger dans la station de chargement cible pour son chargement.
  4. Procédé selon la revendication 3, dans lequel le calcul, en fonction de distances depuis les coordonnées courantes du robot à charger jusqu'aux coordonnées de toutes les stations de chargement et de la durée de déplacement du robot à charger depuis l'emplacement courant jusqu'à toutes les stations de chargement, de coordonnées d'une station de chargement cible la plus proche des coordonnées courantes du robot à charger comprend :
    un calcul d'une pluralité de trajets de retour, chaque trajet de retour étant calculé depuis les coordonnées courantes du robot à charger jusqu'aux coordonnées de chacune des stations de chargement ;
    un calcul, en fonction de distances et de la durée correspondant aux trajets de retour, d'une pluralité de deuxièmes coûts de mise en correspondance, chaque deuxième coût de mise en correspondance étant calculé entre les coordonnées courantes du robot à charger et les coordonnées de chacune des stations de chargement ;
    une comparaison de la pluralité des deuxièmes coûts de mise en correspondance calculés, et le choix du plus petit parmi les deuxièmes coûts de mise en correspondance ; et
    une détermination de coordonnées d'une station de chargement dans le trajet de retour correspondant au plus petit deuxième coût de mise en correspondance choisi en tant que les coordonnées de la destination cible la plus proche des coordonnées courantes du robot à charger.
  5. Procédé selon la revendication 1, dans lequel l'étape de réglage, en fonction de demandes de passage envoyées par des robots individuels dans la zone de point d'encombrement, d'instructions d'ordonnancement pour des robots individuels dans la zone de point d'encombrement comprend :
    un réglage, en fonction d'une séquence temporelle des demandes de passage envoyées par des robots individuels dans la zone de point d'encombrement et de positions des robots individuels dans la zone de point d'encombrement incluses dans les demandes de passage, des instructions d'ordonnancement respectivement pour les robots individuels dans la zone de point d'encombrement.
  6. Appareil pour le retour de robots à partir d'une aire de travail, comprenant :
    un premier module d'acquisition (11), configuré pour acquérir des coordonnées courantes d'un emplacement courant d'un robot couramment dans un état de veille dans une aire de travail dans laquelle des marchandises portées par le robot peuvent être livrées ;
    un deuxième module d'acquisition (12), configuré pour acquérir des coordonnées de toutes les destinations auxquelles le robot couramment dans un état de veille va revenir, les coordonnées de toutes les destinations étant toutes situées à l'extérieur de l'aire de travail ; dans lequel une pluralité d'aires de stockage dans lesquelles des marchandises sont stockées sont situées à l'extérieur de l'aire de travail, la pluralité d'aires de stockage étant définies dans des zones différentes, et les coordonnées de toutes les destinations sont toutes réglées dans les aires de stockage dans des zones prédéterminées à l'extérieur de l'aire de travail ;
    un premier module de calcul (13), configuré pour calculer, en fonction de distances depuis les coordonnées courantes du robot couramment dans un état de veille jusqu'aux coordonnées de toutes les destinations et d'une durée de déplacement du robot couramment dans un état de veille depuis l'emplacement courant jusqu'à toutes les destinations, des coordonnées d'une destination cible la plus proche des coordonnées courantes ; et
    un premier module de commande (14), configuré pour commander au robot couramment dans un état de veille de se déplacer à l'extérieur de l'aire de travail selon un trajet de retour correspondant aux coordonnées de la destination cible, afin d'assurer le départ ordonné du robot couramment dans un état de veille, en quittant l'aire de travail dès que possible après la livraison des marchandises,
    dans lequel le premier module de calcul (13) comprend :
    une première unité de calcul (131), configurée pour calculer une pluralité de trajets de retour, chaque trajet de retour étant calculé depuis les coordonnées courantes du robot couramment dans un état de veille jusqu'à des coordonnées de chacune des destinations ;
    une deuxième unité de calcul (132), configurée pour calculer, en fonction de distances et de la durée correspondant aux trajets de retour, une pluralité de premiers coûts de mise en correspondance, chaque premier coût de mise en correspondance étant calculé entre les coordonnées courantes du robot couramment dans un état de veille et les coordonnées de chacune des destinations ;
    une première unité de comparaison (133), configurée pour comparer la pluralité des premiers coûts de mise en correspondance calculés ;
    une première unité de choix (134), configurée pour choisir le plus petit parmi les premiers coûts de mise en correspondance obtenus par une comparaison de la première unité de comparaison ; et
    une première unité de détermination (135), configurée pour déterminer des coordonnées de la destination dans le trajet de retour correspondant au plus petit premier coût de mise en correspondance choisi en tant que les coordonnées de la destination cible la plus proche des coordonnées courantes,
    dans lequel l'appareil établit respectivement des connexions de données avec une pluralité de robots, et comprend en outre :
    un deuxième module de détermination (51), configuré pour déterminer une zone de point d'encombrement ;
    module de réglage (52), configuré pour régler, en fonction de demandes de passage envoyées par des robots individuels dans la zone de point d'encombrement, des instructions d'ordonnancement respectivement pour les robots individuels dans la zone de point d'encombrement ; et
    un module d'envoi (53), configuré pour envoyer les instructions d'ordonnancement respectivement aux robots individuels dans la zone de point d'encombrement, de sorte que des robots ayant reçu les instructions d'ordonnancement passent à travers la zone de point d'encombrement selon les instructions d'ordonnancement,
    la demande de passage comprend : une position du robot dans la zone de point d'encombrement, et
    l'instruction d'ordonnancement comprend : un instant auquel un robot commence à fonctionner dans la zone de point d'encombrement, un trajet du robot passant à travers la zone de point d'encombrement et une vitesse du robot passant à travers la zone de point d'encombrement.
  7. Appareil selon la revendication 6, dans lequel la première unité de calcul (131) comprend :
    une sous-unité d'acquisition (1311), configurée pour acquérir des coordonnées courantes d'autres robots ; et
    une sous-unité de calcul (1312), configurée pour calculer, en fonction des coordonnées courantes du robot couramment dans un état de veille et des coordonnées courantes des autres robots, chaque trajet de retour parmi la pluralité de trajets de retour depuis les coordonnées courantes du robot couramment dans un état de veille jusqu'aux coordonnées de chacune des destinations.
  8. Appareil selon la revendication 6 ou 7, dans lequel l'appareil comprend en outre :
    un module d'évaluation (15), configuré pour évaluer si une quantité électrique du robot couramment dans un état de veille atteint une quantité électrique standard ;
    un premier module de détermination (16), configuré pour déterminer, lorsqu'il est détecté que la quantité électrique du robot couramment dans un état de veille est inférieure à la quantité électrique standard, le robot correspondant en tant qu'un robot à charger ;
    un deuxième module d'acquisition (17), configuré pour acquérir des coordonnées de toutes les stations de chargement auxquelles le robot à charger va retourner, dans lequel les coordonnées des stations de chargement sont toutes situées dans d'autres zones prédéterminées à l'extérieur de l'aire de travail ;
    un deuxième module de calcul (18), configuré pour calculer, en fonction de distances depuis les coordonnées courantes du robot à charger jusqu'aux coordonnées de toutes les stations de chargement et d'une durée de déplacement du robot à charger depuis l'emplacement courant du robot couramment dans un état de veille jusqu'à toutes les stations de chargement, des coordonnées d'une station de chargement cible la plus proche des coordonnées courantes du robot à charger ; et
    un deuxième module de commande (19), configuré pour commander au robot à charger de se déplacer à l'extérieur de l'aire de travail selon un trajet de retour correspondant aux coordonnées de la station de chargement cible, de manière à assurer le déplacement ordonné du robot à charger dans la station de chargement cible pour son chargement.
  9. Appareil selon la revendication 8, dans lequel le deuxième module de calcul (18) comprend :
    une troisième unité de calcul (181), configurée pour calculer une pluralité de trajets de retour, chaque trajet de retour étant calculé depuis les coordonnées courantes du robot à charger jusqu'aux coordonnées de chacune des stations de chargement ;
    une quatrième unité de calcul (182), configurée pour calculer, en fonction de distances et de la durée correspondant aux trajets de retour, une pluralité de deuxièmes coûts de mise en correspondance, chaque deuxième coût de mise en correspondance étant calculé entre les coordonnées courantes du robot à charger et les coordonnées de chacune des stations de chargement ;
    une deuxième unité de comparaison (183), configurée pour comparer la pluralité des deuxièmes coûts de mise en correspondance calculés ;
    une deuxième unité de choix (184), configurée pour choisir le plus petit parmi les deuxièmes coûts de mise en correspondance obtenus par une comparaison de la deuxième unité de comparaison ; et
    une deuxième unité de détermination (185), configurée pour déterminer des coordonnées d'une station de chargement dans le trajet de retour correspondant au plus petit deuxième coût de mise en correspondance choisi en tant que les coordonnées de la station de chargement cible la plus proche des coordonnées courantes du robot à charger.
  10. Appareil selon la revendication 6, dans lequel le deuxième module de détermination comprend :
    une unité d'acquisition, configurée pour acquérir des trajets de la pluralité de robots ;
    une unité de détermination de point d'encombrement, configurée pour déterminer un point d'encombrement selon les trajets de la pluralité de robots ; et
    une unité de détermination de zone de point d'encombrement, configurée pour déterminer la zone de point d'encombrement parmi des zones adjacentes au point d'encombrement.
  11. Appareil selon la revendication 6, dans lequel le module de réglage est configuré pour régler, en fonction d'une séquence temporelle des demandes de passage envoyées par des robots individuels dans la zone de point d'encombrement et de positions des robots individuels dans la zone de point d'encombrement incluses dans les demandes de passage, les instructions d'ordonnancement respectivement pour les robots individuels dans la zone de point d'encombrement.
EP16883134.5A 2016-01-04 2016-08-03 Procédé et dispositif de retour de robots à partir d'un site Active EP3401750B1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN201610005062.0A CN105488892B (zh) 2016-01-04 2016-01-04 一种用于机器人排队管理的方法及服务器
CN201610003129.7A CN105446342B (zh) 2016-01-04 2016-01-04 用于机器人终端场地回流的方法和装置
PCT/CN2016/093123 WO2017118001A1 (fr) 2016-01-04 2016-08-03 Procédé et dispositif de retour de robots à partir d'un site

Publications (3)

Publication Number Publication Date
EP3401750A1 EP3401750A1 (fr) 2018-11-14
EP3401750A4 EP3401750A4 (fr) 2019-01-02
EP3401750B1 true EP3401750B1 (fr) 2023-01-11

Family

ID=59273376

Family Applications (1)

Application Number Title Priority Date Filing Date
EP16883134.5A Active EP3401750B1 (fr) 2016-01-04 2016-08-03 Procédé et dispositif de retour de robots à partir d'un site

Country Status (8)

Country Link
US (1) US10421186B2 (fr)
EP (1) EP3401750B1 (fr)
JP (1) JP6671507B2 (fr)
KR (1) KR102080424B1 (fr)
AU (1) AU2016384096B2 (fr)
MY (1) MY200573A (fr)
SG (1) SG11201805378XA (fr)
WO (1) WO2017118001A1 (fr)

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106483943B (zh) * 2016-10-13 2019-05-03 北京京东尚科信息技术有限公司 机器人的调度方法、装置以及计算机可读存储介质
DE102017206291B4 (de) * 2017-04-12 2024-05-23 Audi Ag Verfahren zum Betreiben eines Transportsystems sowie entsprechendes Transportsystem
CN110059900B (zh) * 2018-01-19 2024-03-05 北京京东乾石科技有限公司 用于控制仓库中运输车的方法和装置
EP3812865A4 (fr) * 2018-06-21 2022-07-13 Beijing Geekplus Technology Co., Ltd. Procédé d'ordonnancement de robot et de commande de trajet de robot, serveur et support de stockage
JP2020035385A (ja) * 2018-08-31 2020-03-05 三菱重工業株式会社 スケジュール作成装置、スケジュール作成方法及びプログラム
CN109670224B (zh) * 2018-12-07 2023-11-21 天津理工大学 一种多机器人服务圆形区域搜索算法
CN109709983B (zh) * 2019-01-09 2022-08-02 南京邮电大学 一种物流无人机安全返航控制方法
CN109676611B (zh) * 2019-01-25 2021-05-25 北京猎户星空科技有限公司 多机器人协同服务方法、装置、控制设备及系统
US11745345B2 (en) * 2019-08-30 2023-09-05 Intrinsic Innovation Llc Planning by work volumes to avoid conflicts
CN111142513B (zh) * 2019-12-02 2024-01-26 深圳优地科技有限公司 初始化坐标的获取方法、调度方法、电子设备及存储介质
CN112902979B (zh) * 2019-12-04 2024-04-19 北京极智嘉科技股份有限公司 一种机器人集合控制系统及方法
SE544293C2 (en) * 2019-12-04 2022-03-29 Husqvarna Ab Method of operating a robotic work tool based on a charge level and an estimated distance value for a plurality of work areas
CN112101602A (zh) * 2020-09-11 2020-12-18 深圳市海柔创新科技有限公司 机器人充电分配方法、装置、设备、系统及存储介质
CN112256024A (zh) * 2020-09-27 2021-01-22 北京京东乾石科技有限公司 控制机器人充电的方法、装置、设备和计算机可读介质
CN112114587B (zh) * 2020-11-23 2021-02-05 炬星科技（深圳）有限公司 一种分布式拥堵控制方法和机器人
JPWO2022124004A1 (fr) * 2020-12-09 2022-06-16
CN112947414B (zh) * 2021-01-26 2024-01-19 深圳市普渡科技有限公司 机器人调度方法、装置、计算机设备及存储介质
CN113050577B (zh) * 2021-03-29 2022-05-27 深圳市商汤科技有限公司 智能移动设备的调度方法及装置
CN114715591B (zh) * 2022-04-19 2024-02-23 深圳市海柔创新科技有限公司 仓储管理方法、装置、系统、设备和机器人
CN115156090B (zh) * 2022-05-31 2024-04-05 北京旷视机器人技术有限公司 料箱分配方法、电子设备及存储介质
CN115157263A (zh) * 2022-08-01 2022-10-11 无锡市健齿生物科技有限公司 一种护理机器人的智能调度方法、装置、设备及存储介质

Family Cites Families (99)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6337552B1 (en) * 1999-01-20 2002-01-08 Sony Corporation Robot apparatus
US5570992A (en) * 1954-07-28 1996-11-05 Lemelson; Jerome H. Free-traveling manipulator with optical feedback control and methods
US6708385B1 (en) * 1954-07-28 2004-03-23 Lemelson Medical, Education And Research Foundation, Lp Flexible manufacturing systems and methods
JP2679346B2 (ja) * 1990-03-28 1997-11-19 神鋼電機株式会社 移動ロボットシステムにおける充電制御方式
JP2700710B2 (ja) * 1990-06-21 1998-01-21 新キャタピラー三菱株式会社 建設機械の警報装置
EP0618523B1 (fr) * 1993-04-02 1998-12-09 Shinko Electric Co. Ltd. Méthode et dispositif de contrÔle pour la gestion d'un système de transport avec véhicules sans conducteur
JP2953282B2 (ja) * 1993-12-10 1999-09-27 神鋼電機株式会社 運行管理制御装置およびその方法
JP3031109B2 (ja) * 1993-04-02 2000-04-10 神鋼電機株式会社 最適経路決定装置
JP3364021B2 (ja) * 1993-12-10 2003-01-08 神鋼電機株式会社 運行管理制御装置およびその方法
US5939986A (en) * 1996-10-18 1999-08-17 The United States Of America As Represented By The United States Department Of Energy Mobile machine hazardous working zone warning system
US6061617A (en) * 1997-10-21 2000-05-09 Case Corporation Adaptable controller for work vehicle attachments
WO2002082195A2 (fr) * 2001-04-05 2002-10-17 Siemens Aktiengesellschaft Intelligence robotique en environnement naturel
US6687571B1 (en) * 2001-04-24 2004-02-03 Sandia Corporation Cooperating mobile robots
US6784800B2 (en) * 2001-06-19 2004-08-31 Signal Tech Industrial vehicle safety system
US6963278B2 (en) * 2002-02-13 2005-11-08 Frame Gary M Method and apparatus for enhancing safety within a work zone
JP4448024B2 (ja) * 2002-05-31 2010-04-07 富士通株式会社 遠隔操作ロボットおよびロボット自己位置同定方法
US7310439B2 (en) * 2002-07-29 2007-12-18 Hewlett-Packard Development Company, L.P. Robot having an imaging capability
KR100506533B1 (ko) * 2003-01-11 2005-08-05 삼성전자주식회사 이동로봇 및 그에 따른 자율주행 시스템 및 방법
US20040221790A1 (en) * 2003-05-02 2004-11-11 Sinclair Kenneth H. Method and apparatus for optical odometry
US7113848B2 (en) * 2003-06-09 2006-09-26 Hanson David F Human emulation robot system
US6845311B1 (en) * 2003-11-04 2005-01-18 Caterpillar Inc. Site profile based control system and method for controlling a work implement
US20050107934A1 (en) * 2003-11-18 2005-05-19 Caterpillar Inc. Work site tracking system and method
US7079931B2 (en) * 2003-12-10 2006-07-18 Caterpillar Inc. Positioning system for an excavating work machine
CN1925988A (zh) * 2004-03-27 2007-03-07 微型机器人株式会社 用于位置自控制机器人的导航系统以及用于提供该导航系统使用的绝对坐标的地板材料
JP2005288646A (ja) * 2004-04-01 2005-10-20 Toshiba Corp ロボット
US7353089B1 (en) * 2004-04-13 2008-04-01 P.E.M. Technologies, Llc Method and system for a signal guided motorized vehicle
KR101050512B1 (ko) * 2004-06-21 2011-07-21 이정철 이동로봇의 파라미터 보정방법
US7400959B2 (en) * 2004-08-27 2008-07-15 Caterpillar Inc. System for customizing responsiveness of a work machine
JP4460411B2 (ja) * 2004-10-01 2010-05-12 本田技研工業株式会社 ロボット制御装置
US20100222925A1 (en) * 2004-12-03 2010-09-02 Takashi Anezaki Robot control apparatus
JP4135715B2 (ja) * 2005-01-17 2008-08-20 村田機械株式会社 搬送車システム
WO2006130497A2 (fr) * 2005-05-27 2006-12-07 The Charles Machine Works, Inc. Determination de position d'operateur de telecommande
EP1728601A1 (fr) * 2005-06-03 2006-12-06 Abb Ab Système robotique industriel comprenant une unité de programmation portable et des moyens pour détecter si cette unité quitte la cellule robotique
US7062381B1 (en) * 2005-08-30 2006-06-13 Deere & Company Method and system for determining relative position of mobile vehicles
WO2007041295A2 (fr) * 2005-09-30 2007-04-12 Irobot Corporation Robot compagnon pour une interaction personnelle
WO2007047510A2 (fr) * 2005-10-14 2007-04-26 Aethon, Inc. Procedes et logiciel utilises dans un systeme robotique de classement et de distribution
KR100748245B1 (ko) * 2005-12-09 2007-08-10 한국전자통신연구원 인공표식과 지역좌표계를 이용한 이동로봇의 환경지도 작성방법 및 이동 방법
US7620477B2 (en) * 2006-07-05 2009-11-17 Battelle Energy Alliance, Llc Robotic intelligence kernel
US8115650B2 (en) * 2006-07-11 2012-02-14 PSST Mobile Equipment Ltd. - Richard Shervey Radio frequency identification based personnel safety system
US7728729B2 (en) * 2006-08-16 2010-06-01 Insight Holding Group, Inc. Methods for locating an entity within a structure using RFID
US7683782B2 (en) * 2006-08-16 2010-03-23 Insight Holding Group, Inc. RFID entity locating system
US8970363B2 (en) * 2006-09-14 2015-03-03 Crown Equipment Corporation Wrist/arm/hand mounted device for remotely controlling a materials handling vehicle
US9122276B2 (en) * 2006-09-14 2015-09-01 Crown Equipment Corporation Wearable wireless remote control device for use with a materials handling vehicle
US8180486B2 (en) * 2006-10-02 2012-05-15 Honda Motor Co., Ltd. Mobile robot and controller for same
US9041561B2 (en) * 2006-10-05 2015-05-26 Trimble Navigation Limited Method for controlling power usage of a reporting device
JP4853277B2 (ja) * 2006-12-25 2012-01-11 パナソニック電工株式会社 自律移動装置群制御システム
US8265793B2 (en) * 2007-03-20 2012-09-11 Irobot Corporation Mobile robot for telecommunication
JP4957799B2 (ja) * 2007-06-15 2012-06-20 富士通株式会社 ロボットおよび案内方法
US7898419B2 (en) * 2007-07-27 2011-03-01 Lucomm Technologies, Inc. Systems and methods for object localization and path identification based on RFID sensing
EP2020625B1 (fr) * 2007-08-02 2012-06-06 Siemens Aktiengesellschaft Procédé de rattachement d'un organe de commande dans un environnement de sécurité
KR100902343B1 (ko) * 2007-11-08 2009-06-12 한국전자통신연구원 로봇 영상 시스템 및 검출 방법
KR101408657B1 (ko) * 2007-12-18 2014-06-17 삼성전자주식회사 원격 제어 로봇 시스템의 사용자 인터페이스 장치 및 방법
EP2381697B1 (fr) * 2008-12-24 2014-11-12 Doosan Infracore Co., Ltd. Système et procédé de télécommande pour la télécommande d'engins de chantier
US8706297B2 (en) * 2009-06-18 2014-04-22 Michael Todd Letsky Method for establishing a desired area of confinement for an autonomous robot and autonomous robot implementing a control system for executing the same
US20110010024A1 (en) * 2009-07-01 2011-01-13 Curt Salisbury System and method for accompanying a user with an automated vehicle
JP2011129095A (ja) * 2009-12-18 2011-06-30 Korea Electronics Telecommun 自律走行ロボットを利用した地図生成方法、これを利用した最適走行経路算出方法およびこれらを遂行するロボット制御装置
JP2013517545A (ja) * 2010-01-12 2013-05-16 オムニセンス セイフティー プロプライエタリー リミテッド 保護遵守システム
US8340820B2 (en) * 2010-02-26 2012-12-25 Agilent Technologies, Inc. Robot arm and method of controlling robot arm to avoid collisions
US8564452B2 (en) * 2010-03-19 2013-10-22 Marlex Engineering Inc. Radio-frequency identification (RFID) safety system
US9400503B2 (en) * 2010-05-20 2016-07-26 Irobot Corporation Mobile human interface robot
US9014848B2 (en) * 2010-05-20 2015-04-21 Irobot Corporation Mobile robot system
AU2010353477B2 (en) * 2010-05-21 2014-09-25 Max-Planck-Gesellschaft Zur Forderung Der Wissenschaften E.V. Motion simulator and corresponding method
US8174358B2 (en) * 2010-05-24 2012-05-08 General Electric Company Handheld X-ray system interface with tracking feature
JP5503419B2 (ja) * 2010-06-03 2014-05-28 株式会社日立製作所 無人搬送車および走行制御方法
JP5572018B2 (ja) * 2010-07-08 2014-08-13 株式会社日立製作所 自律移動装置同乗エレベータシステム
US9286810B2 (en) * 2010-09-24 2016-03-15 Irobot Corporation Systems and methods for VSLAM optimization
US9323250B2 (en) * 2011-01-28 2016-04-26 Intouch Technologies, Inc. Time-dependent navigation of telepresence robots
US8718837B2 (en) * 2011-01-28 2014-05-06 Intouch Technologies Interfacing with a mobile telepresence robot
JP5754604B2 (ja) * 2011-07-07 2015-07-29 村田機械株式会社 搬送車システムと搬送車の制御方法
JP5208262B1 (ja) * 2011-12-19 2013-06-12 株式会社レクサー・リサーチ 経路計画立案システム
ES2827192T3 (es) * 2012-02-08 2021-05-20 Omron Tateisi Electronics Co Sistema de gestión de tareas para una flota de robots móviles autónomos
US9463574B2 (en) * 2012-03-01 2016-10-11 Irobot Corporation Mobile inspection robot
EP2852475A4 (fr) * 2012-05-22 2016-01-20 Intouch Technologies Inc Règles de comportement social pour robot de téléprésence médical
CA3155221A1 (fr) * 2012-05-28 2013-11-28 Tulip.Io Inc. Systemes de traitement de commandes utilisant des robots de ramassage
CN102830702B (zh) * 2012-09-07 2014-10-22 无锡普智联科高新技术有限公司 一种用于密集存储区域的移动机器人路径规划方法
CN102865877B (zh) * 2012-10-08 2014-12-17 无锡普智联科高新技术有限公司 基于密集存储区域的多移动机器人路径冲突解决方法
JP5549724B2 (ja) * 2012-11-12 2014-07-16 株式会社安川電機 ロボットシステム
US10110805B2 (en) * 2012-12-06 2018-10-23 Sandisk Technologies Llc Head mountable camera system
US9233472B2 (en) * 2013-01-18 2016-01-12 Irobot Corporation Mobile robot providing environmental mapping for household environmental control
US8965561B2 (en) * 2013-03-15 2015-02-24 Cybernet Systems Corporation Automated warehousing using robotic forklifts
JP5846145B2 (ja) * 2013-03-18 2016-01-20 株式会社安川電機 ロボットシステム、及び、ロボットシステムの制御方法
US9085424B2 (en) * 2013-05-03 2015-07-21 Siemens Industry, Inc. Extendible conveyor and parcel handling system
US8972045B1 (en) * 2013-09-23 2015-03-03 Amazon Technologies, Inc. Inter-facility transport in inventory management and fulfillment systems
CN103645733B (zh) * 2013-12-02 2014-08-13 江苏建威电子科技有限公司 自寻充电机器人及其自寻充电系统和方法
US9446512B1 (en) * 2014-03-26 2016-09-20 Stc.Unm iAnt swarm robotic platform and evolutionary algorithms
US9256944B2 (en) * 2014-05-19 2016-02-09 Rockwell Automation Technologies, Inc. Integration of optical area monitoring with industrial machine control
CN104199428A (zh) * 2014-09-17 2014-12-10 上海畔慧信息技术有限公司 群体机器人管理服务器及其方法
US9606544B2 (en) * 2014-10-31 2017-03-28 Clearpath Robotics, Inc. System, computing device and method for unmanned vehicle fleet control
GB201419883D0 (en) * 2014-11-07 2014-12-24 F Robotics Acquisitions Ltd Domestic robotic system and method
US9733646B1 (en) * 2014-11-10 2017-08-15 X Development Llc Heterogeneous fleet of robots for collaborative object processing
US9420741B2 (en) * 2014-12-15 2016-08-23 Irobot Corporation Robot lawnmower mapping
JP6511806B2 (ja) * 2014-12-25 2019-05-15 シンフォニアテクノロジー株式会社 多関節ロボット及び多関節ロボットの制御方法
US9588519B2 (en) * 2015-03-17 2017-03-07 Amazon Technologies, Inc. Systems and methods to facilitate human/robot interaction
US9649766B2 (en) * 2015-03-17 2017-05-16 Amazon Technologies, Inc. Systems and methods to facilitate human/robot interaction
US9665095B1 (en) * 2015-03-19 2017-05-30 Amazon Technologies, Inc. Systems and methods for removing debris from warehouse floors
US20170028549A1 (en) * 2015-07-28 2017-02-02 Comprehensive Engineering Solutions, Inc. Robotic navigation system and method
US10195740B2 (en) * 2015-09-10 2019-02-05 X Development Llc Using object observations of mobile robots to generate a spatio-temporal object inventory, and using the inventory to determine monitoring parameters for the mobile robots
CN105488892B (zh) * 2016-01-04 2018-03-30 杭州亚美利嘉科技有限公司 一种用于机器人排队管理的方法及服务器
CN105446342B (zh) * 2016-01-04 2019-02-05 杭州亚美利嘉科技有限公司 用于机器人终端场地回流的方法和装置

Also Published As

Publication number Publication date
EP3401750A4 (fr) 2019-01-02
WO2017118001A1 (fr) 2017-07-13
KR102080424B1 (ko) 2020-02-21
KR20180096703A (ko) 2018-08-29
SG11201805378XA (en) 2018-07-30
MY200573A (en) 2024-01-03
US20180333847A1 (en) 2018-11-22
AU2016384096B2 (en) 2019-10-24
AU2016384096A1 (en) 2018-07-12
US10421186B2 (en) 2019-09-24
EP3401750A1 (fr) 2018-11-14
JP6671507B2 (ja) 2020-03-25
JP2019503024A (ja) 2019-01-31

Similar Documents

Publication Publication Date Title
EP3401750B1 (fr) Procédé et dispositif de retour de robots à partir d'un site
CN108469786B (zh) 大规模智能仓储分布式拣选系统
US10969780B2 (en) Delivery method and delivery control device
CN105446342B (zh) 用于机器人终端场地回流的方法和装置
CN105488892B (zh) 一种用于机器人排队管理的方法及服务器
US20200293063A1 (en) Travel planning system, travel planning method, and non-transitory computer readable medium
CN110059926B (zh) 拣选调度方法、装置、仓储系统及可读存储介质
US9663292B1 (en) Forecasted robotic drive unit dispatch
CN106228302A (zh) 一种用于在目标区域内进行任务调度的方法与设备
US20230130011A1 (en) Collaborative charging method and apparatus, and logistics devices
CN111539574B (zh) 用于多机器人的订单派送方法及系统
CN112700193A (zh) 订单配送方法及装置、计算设备、计算机可读存储介质
TWI701622B (zh) 用於機器人場地回流的方法和裝置
Zhao et al. Temporal and spatial routing for large scale safe and connected uas traffic management in urban areas
CN116214496A (zh) 机器人的调度方法、装置、设备及存储介质
US20220197304A1 (en) Systems and methods for centralized control of a fleet of robotic devices
CN114474052A (zh) 控制机器人与货柜交互的方法、系统及机器人
US11926060B2 (en) Transport of objects using robots
Adinandra et al. Flexible transportation in warehouses
US20240131703A1 (en) Local Idle Time Utilization in Centrally Controlled Mobile Robots
US20230359223A1 (en) Drone control system, drone, drone control method, and recording medium
Miyashita et al. Scheduling and Negotiation Method for Double Synchronized Multi-Agent Pickup and Delivery Problem.
Al-Turjman et al. Drones Path Planning for Collaborative Data Collection in ITS
Guo et al. Decision-making of Emergent Incident based on P-MADDPG
JP2023039228A (ja) ナビゲーション装置、移動体システム、ナビゲーション方法及びコンピュータプログラム

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20180710

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

A4 Supplementary search report drawn up and despatched

Effective date: 20181203

RIC1 Information provided on ipc code assigned before grant

Ipc: G05D 1/02 20060101AFI20181127BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20190301

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20220805

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602016077451

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1543801

Country of ref document: AT

Kind code of ref document: T

Effective date: 20230215

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20230111

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1543801

Country of ref document: AT

Kind code of ref document: T

Effective date: 20230111

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230511

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230411

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230511

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230412

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602016077451

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230822

Year of fee payment: 8

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602016077451

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: G05D0001020000

Ipc: G05D0001430000

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20230822

Year of fee payment: 8

26N No opposition filed

Effective date: 20231012

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230803

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230803

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230831

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20230831

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20230111