Research Article

A Path-Planning Approach Based on Potential and Dynamic Q-Learning for Mobile Robots in Unknown Environment

Figure 6

Compared mean computing time of various path-planning algorithms for MR (the interval on each bar denotes the standard deviation of the computing time). (a) M01. (b) M02. (c) M03. (d) M04. (e) M05. (f) M06. (g) M07. (h) M08. (i) M09.