Maximizing the Coverage of Roadmap Graph for Optimal Motion Planning

<div>Nodes neighboring <svg height="9.330292pt" id="M97" style="vertical-align:-3.29111pt" version="1.1" viewbox="-0.049816 -6.039182 10.14944 9.330292" width="10.14944pt" 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="M534 -230V-198C472 -191 467 -186 467 -127V336C467 404 469 422 470 442L465 446C441 437 423 434 414 434C403 434 396 435 381 440C370 444 350 451 309 454C158 455 29 343 29 201C29 103 99 -12 259 -12L339 22V-126C339 -187 330 -190 260 -198V-230H534ZM339 58C327 52 317 50 303 50C247 50 170 115 170 235C170 358 226 413 271 413C293 413 319 398 339 372V58Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.994,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g></svg> within radius <svg height="11.489872pt" id="M98" style="vertical-align:-5.528964pt" version="1.1" viewbox="-0.049816 -5.960908 10.102436 11.489872" width="10.102436pt" 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="M393 379C402 394 400 411 393 422C384 437 365 448 348 448C301 448 237 372 186 285H182L193 335C210 408 205 448 178 448C150 448 80 402 29 344L45 321C80 355 114 373 122 373C128 373 130 365 124 330C106 228 76 98 50 -5L57 -12C82 -5 112 3 132 6L172 203C196 256 234 304 254 329C275 355 293 367 306 367C318 367 330 360 342 348C347 343 355 343 365 350S386 367 393 379Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,4.919,3.132)"><path d="M478 400C478 445 461 451 447 451C425 451 399 442 369 425C316 395 241 339 172 252H170L191 340C198 371 203 395 203 412C203 439 194 451 178 451C147 451 81 411 24 351L43 324C68 349 101 371 111 371C117 371 122 363 115 334L35 -4L42 -11C61 -4 87 3 117 9C130 72 144 130 158 181C241 296 342 379 383 379C398 379 404 370 384 285L330 60C302 -58 282 -164 282 -190S323 -257 354 -257L361 -243C357 -223 359 -177 382 -73L464 303C474 347 478 378 478 400Z"></path></g></svg> [<a href="/journals/complexity/2018/9104720/#B23">23</a>].</div>

Complexity

Maximizing the Coverage of Roadmap Graph for Optimal Motion Planning

Figure 3