Managing object routing in computing environments

A computer program product comprising a non-transitory processor-readable storage medium having stored therein program code of one or more software programs, wherein the program code when executed by at least one processing device causes the at least one processing device to:

• receive a request for a given mobile object to traverse from a first location to a second location in a physical environment which is logically partitioned into a plurality of grid locations;
• compute a route for the given mobile object to traverse from the first location to the second location, the computed route comprising a sequence of grid locations which are reserved at corresponding times over a time period comprising a plurality of prespecified time intervals, wherein each grid location of the computed route is reserved for one or more corresponding prespecified time intervals of the plurality of prespecified time intervals, for which the given mobile object is expected to traverse through that grid location;
• command the given mobile object to traverse the computed route;
• determine whether a current location of the given mobile object at a given time corresponds to an expected grid location of the given mobile object at the given time;
• and
• compute a new route for the given mobile object from the current location to the second location, in response to determining that the current location of the given mobile object at the given time does not correspond to the expected grid location of the given mobile object at the given time;
• wherein computing the new route comprises determining a new sequence of grid locations, from the current location to the second location, which are reserved at corresponding times over a new time period comprising one or more of the prespecified time intervals.

A system, comprising:

• a plurality of mobile objects;
• and
• one of more server nodes that host an object routing system, wherein the object routing system is configured to:
• receive a request for a given mobile object to traverse from a first location to a second location in a physical environment which is logically partitioned into a plurality of grid locations;
• compute a route for the given mobile object to traverse from the first location to the second location, the computed route comprising a sequence of grid locations which are reserved at corresponding times over a time period comprising a plurality of prespecified time intervals, wherein each grid location of the computed route is reserved for one or more corresponding prespecified time intervals of the plurality of prespecified time intervals, for which the given mobile object is expected to traverse through that grid location;
• command the given mobile object to traverse the computed route;
• determine whether a current location of the given mobile object at a given time corresponds to an expected grid location of the given mobile object at the given time;
• and
• compute a new route for the given mobile object from the current location to the second location, in response to determining that the current location of the given mobile object at the given time does not correspond to the expected grid location of the given mobile object at the given time;
• wherein computing the new route comprises determining a new sequence of grid locations, from the current location to the second location, which are reserved at corresponding times over a new time period comprising one or more of the prespecified time intervals.