地形
线路规划
计算机科学
算法
数学优化
近似算法
数学
地理
地图学
作者
Erdi Daşdemir,Murat Köksalan,Diclehan Tezcaner Öztürk
标识
DOI:10.1016/j.ejor.2024.11.015
摘要
• UAV route planning in continuous terrain with distance, radar threat, and information objectives • An MIP that models the movement in the continuous terrain • Continuous terrain representation outperforms discretized terrain representation by far • An approximation algorithm with a desired level of precision lowers computational requirements Unmanned Aerial Vehicles (UAVs) are widely used for military and civilian purposes. Effective route planning is an important component of their successful missions. In this study, we address the route planning problem of a UAV tasked with collecting information from various target locations in a protected terrain. We consider multiple targets, three objectives, and time-dependent information availability. Modeling the movement of UAVs in a continuous terrain in the presence of multiple objectives is complex. Conflicting objectives typically lead to a continuum of efficient trajectory options between two targets. We formulate the routing problem as a mixed-integer programming (MIP) model that captures the movement in the continuous terrain. We demonstrate the superiority of the continuous terrain formulation over the simplified discretized terrain formulation. We also develop an approximation algorithm that reduces the computational requirements of the MIP model substantially while ensuring a desired level of precision.
科研通智能强力驱动
Strongly Powered by AbleSci AI