An assembly problem with mobile robots

This paper proposes a solution for solving a specific problem that requires a team of identical robots to collect in a specific order different types of resources scattered throughout an environment. A Petri net with outputs models the environment, the team possible movements and the regions with resources. An iterative solution plans the team such that each robot collects and assembles resources in the required order. Each iteration step is based on a linear programming problem that is guaranteed to return a feasible firing vector for the Petri net system. A pseudocode description of the procedure is given and a simulation example is included.