A Bi-Level Probabilistic Path Planning Algorithm for Multiple Robots with Motion Uncertainty

<div>Illustration of the example of trying to plan path for three robots in the district. The original location of robots is shown in the figure. And the blue arrow indicates the next district where these three robots are heading to. <svg height="8.58131pt" id="M271" style="vertical-align:-0.2324905pt" version="1.1" viewbox="-0.0498162 -8.34882 45.5831 8.58131" width="45.5831pt" 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="M219 86C216 168 211 250 206 337C201 410 189 448 163 448C131 448 79 396 43 344L60 322C91 359 110 375 118 375S132 358 136 298C141 238 152 81 155 -12H182C242 62 331 177 390 258C435 321 451 360 451 391C450 424 432 448 408 448C390 448 372 435 366 419C362 410 362 401 366 394C373 383 376 367 376 350C376 283 262 138 221 86H219Z"></path></g><g transform="matrix(.013,0,0,-0.013,5.863,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,15.735,0)"><path d="M548 311L516 323C497 274 452 240 400 240C372 240 342 260 316 278C277 305 235 330 188 330C116 330 66 268 40 199L72 187C91 236 136 270 188 270C216 270 246 250 272 232C311 205 353 180 400 180C472 180 522 242 548 311Z"></path></g><g transform="matrix(.013,0,0,-0.013,26.998,0)"><path d="M219 86C216 168 211 250 206 337C201 410 189 448 163 448C131 448 79 396 43 344L60 322C91 359 110 375 118 375S132 358 136 298C141 238 152 81 155 -12H182C242 62 331 177 390 258C435 321 451 360 451 391C450 424 432 448 408 448C390 448 372 435 366 419C362 410 362 401 366 394C373 383 376 367 376 350C376 283 262 138 221 86H219Z"></path></g><g transform="matrix(.013,0,0,-0.013,32.861,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,39.101,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g></svg> represent different locations in the district and <svg height="8.58131pt" id="M272" style="vertical-align:-0.2324905pt" version="1.1" viewbox="-0.0498162 -8.34882 12.248 8.58131" width="12.248pt" 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="M219 86C216 168 211 250 206 337C201 410 189 448 163 448C131 448 79 396 43 344L60 322C91 359 110 375 118 375S132 358 136 298C141 238 152 81 155 -12H182C242 62 331 177 390 258C435 321 451 360 451 391C450 424 432 448 408 448C390 448 372 435 366 419C362 410 362 401 366 394C373 383 376 367 376 350C376 283 262 138 221 86H219Z"></path></g><g transform="matrix(.013,0,0,-0.013,5.863,0)"><path d="M137 343C167 482 260 545 321 574C357 591 397 603 429 609L423 641C382 634 335 622 295 608C189 570 37 457 37 238C37 84 125 -12 242 -12C362 -12 447 89 447 209C447 311 374 393 267 393C247 393 226 386 204 376L137 343ZM227 337C318 337 361 256 361 173C361 105 336 22 258 22C176 22 126 120 126 240C126 266 127 291 132 310C155 323 189 337 227 337Z"></path></g></svg> is the destination where robots are leaving from the current district.</div>

Complexity

fig7

Figure 7

Figure 7: A Bi-Level Probabilistic Path Planning Algorithm for Multiple Robots with Motion Uncertainty 