2. A “rescue” matrix R for robots and target rooms is constructed such that each row of the rescue matrix represents a robot and each column represents a target room. The entry rij is the minimum cost of a path for robot I from the start room for robot i to target room j. The rescue matrix R can be regarded as a generalization of the “Blocking Information Matrix”