Maximizing the Coverage of Roadmap Graph for Optimal Motion Planning

<div>Results of evaluation of the total cumulative path of the proposed method and PRM<svg height="6.010724pt" id="M245" style="vertical-align:-0.04981613pt" version="1.1" viewbox="-0.049816 -5.960908 7.759248 6.010724" width="7.759248pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M471 153C471 170 463 194 452 212C400 220 373 229 322 255C373 281 400 290 452 298C463 316 471 339 471 357C456 366 431 371 410 370C377 329 356 310 308 279C311 336 317 364 336 413C326 432 310 451 294 459C279 451 262 432 252 413C271 364 277 336 280 279C232 310 211 329 178 370C157 371 132 367 117 357C117 340 125 316 136 298C188 290 215 281 266 255C215 229 188 220 136 212C125 194 117 171 117 153C132 144 157 139 178 140C211 181 232 200 280 231C277 174 271 146 252 97C262 78 278 59 294 51C309 59 326 78 336 97C317 146 311 174 308 231C356 200 377 181 410 140C431 139 456 143 471 153Z"></path></g></svg> algorithm with respect to the number of nodes in the test environment.</div>

Complexity

fig22

Figure 22

Figure 22: Maximizing the Coverage of Roadmap Graph for Optimal Motion Planning 