Grassland restoration is a critical means to safeguard grassland ecological degradation. To alleviate the extensive human labors and boost the restoration efficiency, UAV is promising for its fully automatic capability yet still waits to be exploited. This paper progresses this emerging technology by explicitly considering the realistic constraints of the UAV and the grassland degradation while planning the grassland restoration. To this end, the UAV-enabled restoration process is first mathematically modeled as the maximization of restoration areas of the UAV under the limited battery energy of UAV, the grass seeds weight, the number of restored areas, and the corresponding sizes. Then we analyze that, by considering these constraints, this original problem emerges two conflict objectives, namely the shortest flight path and the optimal areas allocation. As a result, the maximization of restoration areas turns out to be a composite of a trajectory design problem and an areas allocation problem that are highly coupled. From the perspective of optimization, this requires solving two NP-hard problems of both the traveling salesman problem (TSP) and the multidimensional knapsack problem (MKP) at the same time. To tackle this complex problem, we propose a cooperative optimization algorithm, called CHAPBILM, to solve those two problems interlacedly by utilizing the interdependencies between them. Multiple simulations verify the conflicts between the trajectory design and areas allocation. The effectiveness of the cooperative optimization algorithm is also supported by the comparisons with traditional optimization methods which do not utilize the interdependencies between the two problems. As a result, the proposed algorithm successfully solves the multiple simulation instances in a near-optimal way.
翻译:草原恢复是保护草原生态退化的关键手段。为了减轻广泛的人类劳动,提高恢复效率,无人驾驶飞行器具有完全自动的能力,但仍等待开发。本文通过明确考虑无人驾驶飞行器的现实限制和草地退化,同时规划草地恢复,推进了这一新兴技术。为此,无人驾驶飞行器启动的恢复进程首先以数学模型的形式进行,在无人驾驶飞行器有限的电池能量、草籽重量、恢复地区数目和相应规模下最大限度地增加无人驾驶飞行器的恢复地区。然后我们分析,通过考虑这些限制因素,这一传统问题产生了两个冲突目标,即最短的飞行路径和最佳的区域分配。结果,使恢复地区的最大化成为轨迹设计问题和高度交错的地区的综合体。从优化的角度看,这需要解决旅行销售商问题(TTP)和多维度对流地区间比较问题(MKP)两个棘手的问题。为了解决这一复杂的冲突,我们提议采用合作性最短的飞行路径,我们提议在设计过程中采用两个合作性优化的方法,即对设计区域进行核查。