论文部分内容阅读
This paper presents two solution methodologies for the Visual Area Coverage Scheduling problem. The objective is to schedule a number of dynamic observers over a given 3D terrain such that the total visual area covered (viewed) over a planning horizon is