System and method for utilizing non-local information to constrain robot services

Abstract

A method for constraining movements of a robot comprises: obtaining digitally stored dynamic building data describing a set of one or more temporary conditions, the dynamic building data comprising, for each temporary condition of the set of one or more temporary conditions, a location of the temporary condition and a description of the temporary location; updating, from the dynamic building data, digital cost data associated with one or more features of a digital map by calculating, for each temporary condition of the set of one or more temporary conditions, an increased cost of navigation associated with the location of the temporary condition; in response to receiving a task that is associated with a destination location, determining a route of the robot to the destination location using the digital map based in part upon the location of each temporary condition and the increased cost associated with the location, the route not including at least a location of a particular temporary condition of the set of one or more temporary conditions; causing the robot to traverse to the destination location using the route.

What is claimed is: 
     
         1 . A computer-implemented method for controlling movement of an autonomous robot comprising:
 obtaining digitally stored dynamic building data describing a set of one or more temporary conditions, the dynamic building data comprising, for each temporary condition of the set of one or more temporary conditions, a location of the temporary condition and a description of the temporary condition;   updating, from the dynamic building data, digital cost data associated with one or more features of a digital map by calculating, for each temporary condition of the set of one or more temporary conditions, an increased cost of navigation associated with the location of the temporary condition, the increased cost based on the description of the temporary condition;   in response to receiving a task that is associated with a destination location, determining whether at least one route from a current location of the robot to the destination location is possible, based in part upon the location of each temporary condition of the set of one or more temporary conditions and the increased cost associated with the location.   
     
     
         2 . The method of  claim 1 , wherein the dynamic building data further comprises, for each temporary condition of the set of one or more temporary conditions, a time frame of the temporary condition. 
     
     
         3 . The method of  claim 2 , wherein determining whether at least one route to the destination location is possible is further based on is based on a current time and the time frame of each temporary condition of the set of one or more temporary conditions. 
     
     
         4 . The method of  claim 1 , further comprising:
 in response to determining that at least one route to the destination location is possible, selecting a particular route to the destination location;   causing the robot to traverse the particular route.   
     
     
         5 . The method of  claim 4 , wherein selecting the particular route comprises determining the particular route as a fastest route from the current location of the robot to the destination location by calculating, for each temporary condition of the set of one or more temporary conditions, an expected velocity of the robot over a portion of the digital map corresponding to the location of the temporary condition. 
     
     
         6 . The method of  claim 4 , wherein selecting the particular route comprises determining the route as a shortest route from the current location of the robot to the destination location by calculating a plurality of different routes having different estimated time of arrival (ETA) values, each different route in the plurality of different routes not including the location of one or more temporary conditions of the set of one or more temporary conditions. 
     
     
         7 . The method of  claim 4 , wherein selecting the particular route comprises determining the route as an optimized route from the current location of the robot to the destination location that traverses a fewest number of locations in which personnel are likely to be located and not including at least the location of a particular temporary condition of the set of one or more temporary conditions. 
     
     
         8 . The method of  claim 4  further comprising:
 calculating an estimated time of arrival of the robot at the destination location based on the particular route; 
 causing generation of a notification indicating the estimated time of arrival of the robot at the destination location. 
 
     
     
         9 . The method of  claim 1  further comprising, in response to determining that no route to the destination location is possible, rejecting the task. 
     
     
         10 . The method of  claim 1  further comprising, in response to determining that no route to the destination location is possible, causing generation of a notification indicating that the task cannot be completed. 
     
     
         11 . A computer system comprising:
 one or more processors;   a non-transitory computer-readable medium coupled to the one or more processors and storing one or more sequences of program instructions which, when executed by the one or more processors, cause the one or more processors to perform:   obtaining digitally stored dynamic building data describing a set of one or more temporary conditions, the dynamic building data comprising, for each temporary condition of the set of one or more temporary conditions, a location of the temporary condition and a description of the temporary condition;   updating, from the dynamic building data, digital cost data associated with one or more features of a digital map by calculating, for each temporary condition of the set of one or more temporary conditions, an increased cost of navigation associated with the location of the temporary condition, the increased cost based on the description of the temporary condition;   in response to receiving a task that is associated with a destination location, determining whether at least one route from a current location of a robot to the destination location is possible, based in part upon the location of each temporary condition of the set of one or more temporary conditions and the increased cost associated with the location.   
     
     
         12 . The system of  claim 11 , wherein the dynamic building data further comprises, for each temporary condition of the set of one or more temporary conditions, a time frame of the temporary condition. 
     
     
         13 . The system of  claim 12 , wherein determining whether at least one route to the destination location is possible is further based on is based on a current time and the time frame of each temporary condition of the set of one or more temporary conditions. 
     
     
         14 . The system of  claim 11 , further comprising instructions which, when executed by the one or more processors, cause:
 in response to determining that at least one route to the destination location is possible, selecting a particular route to the destination location;   causing the robot to traverse the particular route.   
     
     
         15 . The system of  claim 14 , wherein selecting the particular route comprises determining the particular route as a fastest route from the current location of the robot to the destination location by calculating, for each temporary condition of the set of one or more temporary conditions, an expected velocity of the robot over a portion of the digital map corresponding to the location of the temporary condition. 
     
     
         16 . The system of  claim 14 , wherein selecting the particular route comprises determining the route as a shortest route from the current location of the robot to the destination location by calculating a plurality of different routes having different estimated time of arrival (ETA) values, each different route in the plurality of different routes not including the location of one or more temporary conditions of the set of one or more temporary conditions. 
     
     
         17 . The system of  claim 14 , wherein selecting the particular route comprises determining the route as an optimized route from the current location of the robot to the destination location that traverses a fewest number of locations in which personnel are likely to be located and not including at least the location of a particular temporary condition of the set of one or more temporary conditions. 
     
     
         18 . The system of  claim 14 , further comprising instructions which, when executed by the one or more processors, cause:
 calculating an estimated time of arrival of the robot at the destination location based on the particular route;   causing generation of a notification indicating the estimated time of arrival of the robot at the destination location.   
     
     
         19 . The system of  claim 11 , further comprising instructions which, when executed by the one or more processors, cause in response to determining that no route to the destination location is possible, rejecting the task. 
     
     
         20 . The system of  claim 11 , further comprising instructions which, when executed by the one or more processors, cause in response to determining that no route to the destination location is possible, causing generation of a notification indicating that the task cannot be completed.