“…Table 2 shows a comparison between both cases in terms of total time t total needed to traverse the path, average speed v, the ratio of average speed to the desired speedv/v desired , total slack time t slacktotal over the whole path, t slack average slack time over the whole path, and t slacktotal /t total is the ratio of the total slack time to the total time needed to complete the path. The result shows that the processing window adjustment algorithm improved the average speed for the robot over the whole path by 16.74% relative to the desired speed assuming a linear for approximating speed transitions and 19.96% assuming ideal speed transitions [20]. The simulation result also shows that there is more slack time gained by using the processing window adjustment algorithm.…”