检索结果-内蒙古大学图书馆

On the concerted design and scheduling of Multiple Resources for Persistent UAV Operations

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2014年第1-2期74卷 479-498页

作者： Kim, Jonghoe Morrison, James R. Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Taejon 305701 South Korea

A fleet of unmanned aerial vehicles (UAVs) supported by logistics infrastructure, such as automated service stations, may be capable of long-term persistent operations. Typically, two key stages in the deployment of such a system are resource selection and scheduling. Here, we endeavor to conduct both of these phases in concert for persistent UAV operations. We develop a mixed integer linear program (MILP) to formally describe this joint design and scheduling problem. The MILP allows UAVs to replenish their energy resources, and then return to service, using any of a number of candidate service station locations distributed throughout the field. The UAVs provide service to known determin-istic customer space-time trajectories. There may be many of these customer missions occurring simultaneously in the time horizon. A customer mission may be served by several UAVs, each of which prosecutes a different segment of the customer mission. Multiple tasks may be conducted by each UAV between visits to the service stations. The MILP jointly determines the number and locations of resources (design) and their schedules to provide service to the customers. We address the computational complexity of the MILP formulation via two methods. We develop a branch and bound algorithm that guarantees an optimal solution and is faster than solving the MILP directly via CPLEX. This method exploits numerous properties of the problem to reduce the search space. We also develop a modified receding horizon task assignment heuristic that includes the design problem (RHTA(d)). This method may not find an optimal solution, but can find feasible solutions to problems for which the other methods fail. Numerical experiments are conducted to assess the performance of the RHTA(d) and branch and bound methods relative to the MILP solved via CPLEX. For the experiments conducted, the branch and bound algorithm and RHTA(d) are about 500 and 25,000 times faster than the MILP solved via CPLEX, respectively

关键词： Persistent UAV service concerted design and scheduling Replenishment stations Branch and bound algorithms UAV scheduling for persistence

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：