An Algorithm for Planning Coverage of an Area with Obstacles with a Heterogeneous Group of Drones Using a Genetic Algorithm and Parameterized Polygon Decomposition

无人机 计算机科学 树遍历 遗传算法 多边形(计算机图形学) 地形 领域(数学) 算法 运动规划 钥匙(锁) 实时计算 起飞 参数化复杂度 移动机器人 边界(拓扑) 分解 弹道 序列(生物学) 图遍历 灵活性(工程) 数学优化 障碍物 集合(抽象数据类型) 贪婪算法 机器人 模拟
作者
Kirill Yakunin,Yan Kuchin,Elena Muhamedijeva,Адилхан Сымагулов,Ravil I. Mukhamediev
出处
期刊:Drones [Multidisciplinary Digital Publishing Institute]
卷期号:9 (9): 658-658 被引量:2
标识
DOI:10.3390/drones9090658
摘要

The paper presents an algorithm for planning agricultural field surveying routes in the presence of obstacles, designed to address precision agriculture tasks. Unlike classical methods, which are typically limited to straightforward zigzag (Zamboni) traversal and basic perimeter-based obstacle avoidance, the proposed algorithm accounts for heterogeneous unmanned aerial vehicles (UAVs) of varying types, ranges, costs, and speeds, along with a mobile ground platform that enables drone takeoff and landing at multiple points along the road. The key innovation lies in a two-stage optimization procedure: initially, a random set of field partitions into multiple sub-polygons with predefined area proportions (considering internal obstacles) is generated. Subsequently, the optimal partitioning is selected, and based on this, a genetic algorithm is applied to optimize flight parameters, including flight angle, entry points, composition, and sequence of drone launches, and the ground platform route. This approach achieves more localized coverage of individual field segments, with each segment serviced by an appropriate drone type, while also enabling flexible movement of the ground platform, thereby reducing unnecessary flights. This brings down the price of the coverage by 10–30% in some cases. The concluding section discusses future directions, including the incorporation of three-dimensional terrain considerations, dynamic factors (such as changing weather conditions and drone stoppages due to technical issues), and automated collision avoidance in intersecting route segments.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
会与不会完成签到,获得积分10
刚刚
脑洞疼应助坚强亦丝采纳,获得10
刚刚
xiaomifeng发布了新的文献求助10
刚刚
AA完成签到 ,获得积分10
刚刚
刚刚
刚刚
哈哈哈哈完成签到,获得积分10
刚刚
Fani发布了新的文献求助30
刚刚
科研通AI2S应助苦苦采纳,获得10
1秒前
1秒前
天蓬元帅发布了新的文献求助10
3秒前
3秒前
100完成签到,获得积分10
3秒前
3秒前
wxysanctuary完成签到,获得积分10
4秒前
科研通AI6.4应助典雅尔曼采纳,获得10
4秒前
默成发布了新的文献求助10
4秒前
科研通AI6.2应助以念采纳,获得10
5秒前
5秒前
orixero应助学习的小张采纳,获得10
5秒前
wscy29发布了新的文献求助10
5秒前
5秒前
6秒前
6秒前
林荣容发布了新的文献求助10
6秒前
GakkieZ关注了科研通微信公众号
7秒前
8秒前
9秒前
arniu2008应助lululu采纳,获得20
9秒前
缥缈忆安发布了新的文献求助10
10秒前
共享精神应助xiaomifeng采纳,获得10
10秒前
jackmilton发布了新的文献求助10
11秒前
11秒前
糊涂的万发布了新的文献求助10
12秒前
12秒前
核桃发布了新的文献求助10
13秒前
13秒前
李爱国应助喝杯水再走采纳,获得30
14秒前
闪闪羊完成签到,获得积分10
15秒前
15秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
CLSI VET01S-2024 Performance Standards for Antimicrobial Disk and Dilution Susceptibility Tests for Bacteria Isolated From Animals (7th Ed) 500
A Case Study on Hotels as Noncongregate Emergency Living Accommodations for Returning Citizens 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7765161
求助须知:如何正确求助?哪些是违规求助? 9309488
关于积分的说明 20311129
捐赠科研通 7349938
什么是DOI,文献DOI怎么找? 3314730
关于科研通互助平台的介绍 2464132
邀请新用户注册赠送积分活动 2329189