Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr class="thead"><td class="align_left">Planning algorithm</td><td class="align_center">Average fitness</td><td class="align_center">Optimal fitness</td><td class="align_center">The percentage of the optimal path</td></tr><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr><td class="align_left">EGA</td><td class="align_center">
                  6.1634</td><td class="align_center">6.1843</td><td class="align_center">95%</td></tr><tr><td class="align_left">BMFGA</td><td class="align_center">5.9974</td><td class="align_center">6.1843</td><td class="align_center">12%</td></tr><tr><td class="align_left">SAGA</td><td class="align_center">5.9880</td><td class="align_center">6.1843</td><td class="align_center">18%</td></tr><tr class="table-tr"><td colspan="4"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Journal of Electrical and Computer Engineering

tab3

Table 3

Table 3: Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment 