UAV Path Planning in Dynamical Environment: A Novel ICACO-IDWA Algorithm

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg1"><tr><td>(1)</td><td>Construct cellular space of hexagonal grid</td></tr><tr><td>(2)</td><td>Parameter initialization</td></tr><tr><td>(3)</td><td>for <i>i</i> = 1∼<svg height="11.6836pt" id="M90" style="vertical-align:-3.29562pt" version="1.1" viewbox="-0.0498162 -8.38798 34.3209 11.6836" width="34.3209pt" 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="M135 536C164 536 186 560 186 587C186 617 164 639 136 639C109 639 85 617 85 587C85 560 109 536 135 536ZM252 0V26C188 32 181 38 181 106V451C138 433 90 420 39 412V388C99 379 102 374 102 312V106C102 38 95 32 32 26V0H252Z"></path></g><g transform="matrix(.013,0,0,-0.013,3.327,0)"><path d="M298 36L289 62C276 55 253 45 228 45C202 45 169 60 169 141V397H276C289 405 292 426 282 437H169V574L155 576L90 509V437H45L17 408L21 397H90V107C90 28 125 -12 188 -12C198 -12 213 -8 230 1L298 36Z"></path></g><g transform="matrix(.013,0,0,-0.013,7.214,0)"><path d="M380 106C343 72 306 56 265 56C195 56 116 112 115 248C235 252 361 262 377 265C396 269 400 277 400 297C400 374 333 449 250 449H249C198 449 144 421 103 376S37 269 37 201C37 88 109 -12 232 -12C263 -12 332 6 395 84L380 106ZM225 412C281 412 315 364 314 312C314 297 308 292 290 292C232 290 176 289 120 289C135 370 180 412 225 412Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.739,0)"><path d="M181 342V451C133 431 89 419 40 411V388C98 381 102 377 102 311V104C102 38 95 32 33 26V0H263V26C186 32 181 38 181 104V287C203 343 235 372 261 372C277 372 289 366 304 352C310 346 318 345 330 350C349 359 362 379 362 399C362 422 338 449 304 449C256 449 213 393 183 342H181Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,17.562,3.132)"><path d="M810 0V30C751 35 744 40 744 106V296C744 396 694 451 614 451C583 451 558 438 537 425C512 409 485 391 454 368C434 420 390 451 342 451C309 451 285 439 260 424C228 405 206 387 185 372V453C141 434 90 421 43 413V386C102 378 105 373 105 309V106C105 41 96 35 29 30V0H243V30C194 35 185 41 185 106V335C216 360 256 389 297 389C357 389 384 348 384 275V106C384 41 374 35 312 30V0H530V30C475 35 465 41 465 104V294C465 313 464 324 463 336C502 367 539 389 576 389C637 389 663 346 663 274V109C663 41 653 35 593 30V0H810Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,25.124,3.132)"><path d="M442 39L431 68C420 63 406 57 394 57C377 57 359 71 359 118V301C359 353 349 393 314 424C291 443 261 451 230 451C171 438 107 401 79 381C59 366 46 355 46 340C46 316 72 295 91 295C106 295 117 303 122 319C131 350 139 371 152 384C163 397 178 404 197 404C246 404 281 365 281 293V278C260 262 186 232 124 213C69 194 41 161 41 112C41 47 92 -12 163 -12C195 -12 243 25 283 51C288 35 293 22 308 7C319 -4 339 -12 354 -12L442 39ZM281 87C262 68 226 51 199 51C169 51 129 74 129 126C129 162 151 181 190 198C211 208 259 229 281 240V87Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,29.21,3.132)"><path d="M482 0V30C420 38 407 48 370 103L273 248C308 299 331 332 352 357C387 397 401 404 463 409V439H277V409C318 405 324 400 307 369C290 337 270 307 251 279L194 367C175 396 180 402 220 409V439H18V409C74 401 87 395 117 349L204 213C173 168 147 130 119 95C78 46 67 38 5 30V0H195V30C144 38 143 47 162 79C181 112 202 149 225 181L297 70C314 43 307 35 264 30V0H482Z"></path></g></svg> (maximum iteration)</td></tr><tr><td>(4)</td><td> if (the ant did not find the target cellular)</td></tr><tr><td>(5)</td><td> The ant decides the next cellular according to transfer rule which introduces differential search strategy</td></tr><tr><td>(6)</td><td> end</td></tr><tr><td>(7)</td><td>Updating the pheromone value between cellular according to the adaptive strategy</td></tr><tr><td>(8)</td><td>end</td></tr></table></td></tr></table>

Mathematical Problems in Engineering

alg1

Algorithm 1

Algorithm 1: UAV Path Planning in Dynamical Environment: A Novel ICACO-IDWA Algorithm 