Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity

Author:

Hari Sai Krishna Kanth1ORCID,Rathinam Sivakumar2ORCID,Darbha Swaroop2,Casbeer David3

Affiliation:

1. Applied Mathematics and Plasma Physics, Los Alamos National Laboratory, Los Alamos, NM 87545, USA

2. Mechanical Engineering, Texas A&M University, College Station, TX 77843, USA

3. Autonomous Control Branch, Air Force Research Laboratory, Wright-Patterson Air Force Base, Dayton, OH 45433, USA

Abstract

We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of 3+3ρ4 when ρ≥1, and 3ρ+34 when ρ≤1.

Funder

Laboratory Directed Research & Development (LDRD) project “The Optimization of Machine Learning: Imposing Requirements on Artificial Intelligence” of the Los Alamos National Laboratory

Publisher

MDPI AG

Subject

Artificial Intelligence,Computer Science Applications,Aerospace Engineering,Information Systems,Control and Systems Engineering

Reference33 articles.

1. Walambe, R., Marathe, A., and Kotecha, K. (2021). Multiscale object detection from drone imagery using ensemble transfer learning. Drones, 5.

2. Vision-based monitoring of locally linear structures using an unmanned aerial vehicle;Rathinam;J. Infrastruct. Syst.,2008

3. Casbeer, D.W., Beard, R.W., McLain, T.W., Li, S.M., and Mehra, R.K. (2005, January 8–10). Forest fire monitoring with multiple small UAVs. Proceedings of the 2005 American Control Conference, Portland, OR, USA.

4. Bounds on Optimal Revisit Times in Persistent Monitoring Missions With a Distinct and Remote Service Station;Hari;IEEE Trans. Robot.,2022

5. Unmanned aerial vehicle for internet of everything: Opportunities and challenges;Liu;Comput. Commun.,2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3