本文针对区域覆盖任务需求对多无人机搜索问题展开研究。首先,提出一种任意搜索区域的等面积单侧区域分割方法(Unilateral Region Segmentation)。然后,每个搜索区域分派一架或一个编队的无人机进行扫描线搜索,再基于人工势场法来规避...本文针对区域覆盖任务需求对多无人机搜索问题展开研究。首先,提出一种任意搜索区域的等面积单侧区域分割方法(Unilateral Region Segmentation)。然后,每个搜索区域分派一架或一个编队的无人机进行扫描线搜索,再基于人工势场法来规避障碍物或者威胁从而获得搜索路径。最后,进行仿真分析,验证了该算法在不同情况下的有效性、鲁棒性以及适应性。该算法在面向任意搜索区域、考虑无人机机动性以及存在威胁等问题时具有明显优势。展开更多
When using the beam scanning method for particle beam therapy, the target volume is divided into many iso-energy slices and is irradiated slice by slice. Each slice may comprise thousands of discrete scanning beam pos...When using the beam scanning method for particle beam therapy, the target volume is divided into many iso-energy slices and is irradiated slice by slice. Each slice may comprise thousands of discrete scanning beam positions. An optimized scanning path can decrease the transit dose and may bypass important organs. The minimization of the scanning path length can be considered as a variation of the traveling salesman problem; the simulated annealing algorithm is adopted to solve this problem. The initial scanning path is assumed as a simple zigzag path;subsequently, random searches for accepted new paths are performed through cost evaluation and criteria-based judging. To reduce the optimization time of a given slice,random searches are parallelized by employing thousands of threads. The simultaneous optimization of multiple slices is realized by using many thread blocks of generalpurpose computing on graphics processing units hardware.Running on a computer with an Intel i7-4790 CPU and NVIDIA K2200 GPU, our new method required only 1.3 s to obtain optimized scanning paths with a total of 40 slices in typically studied cases. The procedure and optimization results of this new method are presented in this work.展开更多
文摘本文针对区域覆盖任务需求对多无人机搜索问题展开研究。首先,提出一种任意搜索区域的等面积单侧区域分割方法(Unilateral Region Segmentation)。然后,每个搜索区域分派一架或一个编队的无人机进行扫描线搜索,再基于人工势场法来规避障碍物或者威胁从而获得搜索路径。最后,进行仿真分析,验证了该算法在不同情况下的有效性、鲁棒性以及适应性。该算法在面向任意搜索区域、考虑无人机机动性以及存在威胁等问题时具有明显优势。
文摘When using the beam scanning method for particle beam therapy, the target volume is divided into many iso-energy slices and is irradiated slice by slice. Each slice may comprise thousands of discrete scanning beam positions. An optimized scanning path can decrease the transit dose and may bypass important organs. The minimization of the scanning path length can be considered as a variation of the traveling salesman problem; the simulated annealing algorithm is adopted to solve this problem. The initial scanning path is assumed as a simple zigzag path;subsequently, random searches for accepted new paths are performed through cost evaluation and criteria-based judging. To reduce the optimization time of a given slice,random searches are parallelized by employing thousands of threads. The simultaneous optimization of multiple slices is realized by using many thread blocks of generalpurpose computing on graphics processing units hardware.Running on a computer with an Intel i7-4790 CPU and NVIDIA K2200 GPU, our new method required only 1.3 s to obtain optimized scanning paths with a total of 40 slices in typically studied cases. The procedure and optimization results of this new method are presented in this work.
