This paper concerns fault-tolerant power transmission line inspection planning as a generalization of the multiple traveling salesmen problem. The addressed inspection planning problem is formulated as a single-depot multiple-vehicle scenario, where the inspection vehicles are constrained by the battery budget limiting their inspection time. The inspection vehicle is assumed to be an autonomous multi-copter with a wide range of possible flight speeds influencing battery consumption. The inspection plan is represented by multiple routes for vehicles providing full coverage over inspection target power lines. On an inspection vehicle mission interruption, which might happen at any time during the execution of the inspection plan, the inspection is re-planned using the remaining vehicles and their remaining battery budgets. Robustness is introduced by choosing a suitable cost function for the initial plan that maximizes the time window for successful re-planning. It enables the remaining vehicles to successfully finish all the inspection targets using their respective remaining battery budgets. A combinatorial metaheuristic algorithm with various cost functions is used for planning and fast re-planning during the inspection.
翻译:本文涉及将防故障输电线路检查规划作为多位旅行推销员问题的一般处理; 处理的检查规划问题被作为一种单一罐装多车设想方案,检查车辆受电池预算限制,限制其检查时间; 假定检查车辆是一个自主的多机组机,具有影响电池消耗的广泛可能飞行速度; 检查计划由提供检查目标输电线路全面覆盖的车辆的多道线路代表; 检查车辆任务中断,可能在执行检查计划期间随时发生; 检查车辆任务中断,使用其余车辆及其剩余电池预算进行重新规划; 采用稳健性做法,为初步计划选择一个适当的成本功能,以尽量扩大成功再规划的时间窗口; 使其余车辆能够利用各自的剩余电池预算成功完成所有检查目标; 检查期间,使用具有各种成本功能的组合计量算法进行规划和快速再规划。