<p>One barrier to persistent operations in systems of unmanned aerial vehicles (UAVs) served by logistics support stations is the need for methods to manage and efficiently schedule system resources. This paper presents a scheduling framework for UAV systems served by battery charging and battery replacement stations. We extend existing Petri net models for these systems to prevent unwanted resource overlap and impose a resource pairing rule to facilitate cyclic operation. Based on this rule, an extended Petri net that explicitly models the interactions of specific resources is derived. The detailed nature of the extended Petri net allows for the creation of linear programs that capture the structure of the net and generate optimal cyclic resource schedules. These cyclic schedules enable the persistent orchestration of tasks for UAV and logistics support stations. Computational complexity of the linear programs is explored.</p>

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

Cyclic Resource Scheduling in Systems of UAVs and Logistics Support Stations via Petri Nets and Linear Programming

  • Mirza E. Neebraz,
  • Ammar Altaweel,
  • James R. Morrison

摘要

One barrier to persistent operations in systems of unmanned aerial vehicles (UAVs) served by logistics support stations is the need for methods to manage and efficiently schedule system resources. This paper presents a scheduling framework for UAV systems served by battery charging and battery replacement stations. We extend existing Petri net models for these systems to prevent unwanted resource overlap and impose a resource pairing rule to facilitate cyclic operation. Based on this rule, an extended Petri net that explicitly models the interactions of specific resources is derived. The detailed nature of the extended Petri net allows for the creation of linear programs that capture the structure of the net and generate optimal cyclic resource schedules. These cyclic schedules enable the persistent orchestration of tasks for UAV and logistics support stations. Computational complexity of the linear programs is explored.