Academia.eduAcademia.edu

Figure 13. GAZEBO Scene Simulator  _ Connectivity, rayload, and Autonomy conditions are satisfactory for ali units within the Cluster.  The simulation's outcomes are presented in the subsequent Figures 11 to 15 and Tables | to 8. The plan involves finding the time to reach each victim, pinpointing the longest time to reach two victims, and averaging the maximum values. We focus on the maximum and minimum average durations. The regions in Figure 15 show designated areas in RGB colors within the All Area. These areas come from segmenting the total ROI using the greedy algorithm. The process is repeated three times. The first iteration involves a single robot over ten attempts, and the results are in Table 1. Where time distribution by number of attempts is given (with trend function) in the next chart as shown in Figure 16.

Figure 13 GAZEBO Scene Simulator _ Connectivity, rayload, and Autonomy conditions are satisfactory for ali units within the Cluster. The simulation's outcomes are presented in the subsequent Figures 11 to 15 and Tables | to 8. The plan involves finding the time to reach each victim, pinpointing the longest time to reach two victims, and averaging the maximum values. We focus on the maximum and minimum average durations. The regions in Figure 15 show designated areas in RGB colors within the All Area. These areas come from segmenting the total ROI using the greedy algorithm. The process is repeated three times. The first iteration involves a single robot over ten attempts, and the results are in Table 1. Where time distribution by number of attempts is given (with trend function) in the next chart as shown in Figure 16.