A Bi-Level Probabilistic Path Planning Algorithm for Multiple Robots with Motion Uncertainty

Figure 5

Illustration of the candidate actions. Green squares represent the robots in the district. The blue arrow indicates the next district where these robots are heading to. Therefore, the orange arrows for each robot represent the candidate actions they can take. Besides the actions represented by these orange arrows, staying still is also included in the candidate actions for each time step.