Scholarlink

This paper addresses the dynamic routing problem of aerial vehicles (AVs) deployed from a stationary origin for the maritime surveillance of moving vessels. Two models are presented: AVAMDT (Aerial Vehicle Allocation Model with Discrete Time) and AVAMCT (Aerial Vehicle Allocation Model with Continuous Time). The objective is to maximize the total reward by efficiently routing AVs to visit multiple vessels while minimizing the number of vehicles used. The models differ in how they handle time: AVAMDT divides the temporal horizon into discrete windows, while AVAMCT treats time as continuous. The results show that AVAMCT offers higher rewards due to its flexibility in route planning, although, as expected, it requires more computational resources. In comparison, AVAMDT is faster but less precise, providing optimal solutions for simple scenarios.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Dynamic Routing of Aerial Vehicles for Maritime Surveillance: A Discrete vs. Continuous Time Approach

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Sofía Veldman,
  • Miguel Ortega-Mier,
  • Miguel Gutiérrez,
  • Álvaro Herráiz Solla

摘要

This paper addresses the dynamic routing problem of aerial vehicles (AVs) deployed from a stationary origin for the maritime surveillance of moving vessels. Two models are presented: AVAMDT (Aerial Vehicle Allocation Model with Discrete Time) and AVAMCT (Aerial Vehicle Allocation Model with Continuous Time). The objective is to maximize the total reward by efficiently routing AVs to visit multiple vessels while minimizing the number of vehicles used. The models differ in how they handle time: AVAMDT divides the temporal horizon into discrete windows, while AVAMCT treats time as continuous. The results show that AVAMCT offers higher rewards due to its flexibility in route planning, although, as expected, it requires more computational resources. In comparison, AVAMDT is faster but less precise, providing optimal solutions for simple scenarios.