Methods and systems for path planning in a known environment

1. A method comprising:

creating, by a computing device having at least one processor, a three dimensional weighted graph representing a physical area wherein the third dimension comprise planes, wherein each plane represents a discrete time unit, further wherein nodes are connected between different planes, and

the three dimensional weighted graph being maintained on a database by the computing device;

providing by said computing device or thereby calculating initial edges information for said graph, wherein each edge represents the length of the time required for a specific moving object to move from one node of the edge to a second node in the three dimensional weighted graph;

providing by said computing device moving objects information;

receiving by said computing device missions' information, wherein each mission includes at least one starting node and a target node being defined the node at which a given mission is completed within an industrial warehouse;

calculating by said computing device a route or free path including at least one allocated node from a starting node and a starting time to a target node using said weighted graph and according to the missions' information and according to said moving objects information,

wherein calculating a route or free path comprises calculating an absolute time at which the specific moving object is allowed to leave each node;

delivering the calculated route to the specific moving object being in data communication with the computing device for execution;

navigating the specific moving object along the calculated route;

calculating affected nodes by the specific moving object, which do not allow other moving object to pass in according to said calculated route and the specific moving object information,

updating said graph by saving changes being indicative of information being indicative of blocked nodes and edges and affected nodes and by preventing using the allocated nodes and the provided or calculated edges and preventing using said affected nodes; and

calculating a next route for a next mission according to said missions' information and according to said previous changes in said graph.

2. The method of claim 1 wherein said updating said graph is performed by saving a two-dimensional physical area of the graph that comprise only the information being indicative of the blocked nodes and edges.

3. The method of claim 2 further comprising step of removing said two-dimensional physical area wherein said two-dimensional physical area is outdated.

4. The method of claim 1 further comprising steps of:

receiving, in real-time or near real-time, the location of a moving object; and

updating said graph according to any incompliance with said planned path.

5. The method of claim 4 further comprising step of:

recalculating any affected planned route according to said update according to said incompliance.

6. The method of claim 1 wherein said updated in said graph does not contain information regarding the identity of the blocking moving object.

7. The method of claim 5 wherein said recalculating involve assigning a different moving object to a previously path calculated for a mission.

8. The method of claim 1 wherein part of the moving objects are actual moving objects and part of the moving objects are simulated moving objects.

9. A system comprising:

at least two moving objects in data communication with central computing device having at least one processor; and at least one memory including computer program code configured to, with the at least one processor, cause the computing device to at least perform:

maintaining a database having a three dimensional weighted graph representing a two dimensional physical area of a warehouse, wherein the third dimension comprise planes, and wherein each one of said planes represents a time instance, further wherein nodes are connected between different planes;

receiving or calculating initial edges information for said three dimensional weighted graph, wherein each edge represents the length of the time required for a specific moving object of the at least two moving objects to move from one node of the edge to a second node of said edge in said three dimensional weighted graph;

maintaining a database of moving objects information;

receiving missions' information, wherein each mission includes at least one starting node and a target node at which the mission is completed within said warehouse;

calculating a route or free path including at least one allocated node from a starting node and a starting time to a target node using said weighted graph and according to the missions' information and according to said moving objects information, wherein calculating a route or free path comprises calculating an absolute time at which the specific moving object is allowed to leave each node;

delivering the calculated route to said specific moving object for execution;

navigating the specific moving object along the calculated route;

calculating affected nodes by the specific moving object, which do not allow other moving object to pass in according to said calculated route and the specific moving object information;

updating said graph by saving changes being indicative of information being indicative of blocked nodes and edges and affected nodes and by preventing using the allocated nodes and the provided or calculated edges and preventing using said affected nodes; and

calculating a next route for a next mission according to said missions' information and according to said previous changes in said graph.

10. The system of claim 9 wherein part of the moving objects are actual moving objects and part of the moving objects are simulated moving objects.

11. The system of claim 9 wherein said at least two moving objects comprise robots of different types.

12. The system of claim 9 further comprising a database comprising at least one of the three dimensional weighted graph or moving objects information.