Drone-based Bug Detection in Orchards with Nets: A Novel Orienteering Approach

IF 3.9 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS ACM Transactions on Sensor Networks Pub Date : 2024-03-22 DOI:10.1145/3653713
Francesco Betti Sorbelli, Federico Corò, Sajal K. Das, Lorenzo Palazzetti, Cristina M. Pinotti
{"title":"Drone-based Bug Detection in Orchards with Nets: A Novel Orienteering Approach","authors":"Francesco Betti Sorbelli, Federico Corò, Sajal K. Das, Lorenzo Palazzetti, Cristina M. Pinotti","doi":"10.1145/3653713","DOIUrl":null,"url":null,"abstract":"<p>The use of drones for collecting information and detecting bugs in orchards covered by nets is a challenging problem. The nets help in reducing pest damage, but they also constrain the drone’s flight path, making it longer and more complex. To address this issue, we model the orchard as an aisle-graph, a regular data structure that represents consecutive aisles where trees are arranged in straight lines. The drone flies close to the trees and takes pictures at specific positions for monitoring the presence of bugs, but its energy is limited, so it can only visit a subset of positions. To tackle this challenge, we introduce the Single-drone Orienteering Aisle-graph Problem (SOAP), a variant of the orienteering problem, where likely infested locations are prioritized by assigning them a larger profit. Additionally, the drone’s movements have a cost in terms of energy, and the objective is to plan a drone’s route in the most profitable locations under a given drone’s battery. We show that SOAP can be optimally solved in polynomial time, but for larger orchards/instances, we propose faster approximation and heuristic algorithms. Finally, we evaluate the algorithms on synthetic and real data sets to demonstrate their effectiveness and efficiency.</p>","PeriodicalId":50910,"journal":{"name":"ACM Transactions on Sensor Networks","volume":"1 1","pages":""},"PeriodicalIF":3.9000,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Sensor Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3653713","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The use of drones for collecting information and detecting bugs in orchards covered by nets is a challenging problem. The nets help in reducing pest damage, but they also constrain the drone’s flight path, making it longer and more complex. To address this issue, we model the orchard as an aisle-graph, a regular data structure that represents consecutive aisles where trees are arranged in straight lines. The drone flies close to the trees and takes pictures at specific positions for monitoring the presence of bugs, but its energy is limited, so it can only visit a subset of positions. To tackle this challenge, we introduce the Single-drone Orienteering Aisle-graph Problem (SOAP), a variant of the orienteering problem, where likely infested locations are prioritized by assigning them a larger profit. Additionally, the drone’s movements have a cost in terms of energy, and the objective is to plan a drone’s route in the most profitable locations under a given drone’s battery. We show that SOAP can be optimally solved in polynomial time, but for larger orchards/instances, we propose faster approximation and heuristic algorithms. Finally, we evaluate the algorithms on synthetic and real data sets to demonstrate their effectiveness and efficiency.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于无人机的果园虫害探测网:一种新颖的定向方法
使用无人机收集信息和探测果园中的虫子是一个具有挑战性的问题。防护网有助于减少虫害,但也限制了无人机的飞行路径,使其变得更长、更复杂。为了解决这个问题,我们将果园建模为一个过道图,这是一种规则的数据结构,表示树木排列成直线的连续过道。无人机飞近树木并在特定位置拍照,以监测虫子的存在,但它的能量有限,因此只能访问部分位置。为了应对这一挑战,我们引入了单无人机定向过道图问题(SOAP),它是定向问题的一个变体,通过给可能出没的位置分配较大的利润来确定其优先级。此外,无人机的移动需要耗费能量,因此目标是在给定无人机电池电量的情况下,在最有利可图的地点规划无人机路线。我们的研究表明,SOAP 可以在多项式时间内优化求解,但对于较大的果园/情况,我们提出了更快的近似和启发式算法。最后,我们在合成数据集和真实数据集上对算法进行了评估,以证明其有效性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ACM Transactions on Sensor Networks
ACM Transactions on Sensor Networks 工程技术-电信学
CiteScore
5.90
自引率
7.30%
发文量
131
审稿时长
6 months
期刊介绍: ACM Transactions on Sensor Networks (TOSN) is a central publication by the ACM in the interdisciplinary area of sensor networks spanning a broad discipline from signal processing, networking and protocols, embedded systems, information management, to distributed algorithms. It covers research contributions that introduce new concepts, techniques, analyses, or architectures, as well as applied contributions that report on development of new tools and systems or experiences and experiments with high-impact, innovative applications. The Transactions places special attention on contributions to systemic approaches to sensor networks as well as fundamental contributions.
期刊最新文献
Fair and Robust Federated Learning via Decentralized and Adaptive Aggregation based on Blockchain PnA: Robust Aggregation Against Poisoning Attacks to Federated Learning for Edge Intelligence HCCNet: Hybrid Coupled Cooperative Network for Robust Indoor Localization HDM-GNN: A Heterogeneous Dynamic Multi-view Graph Neural Network for Crime Prediction A DRL-based Partial Charging Algorithm for Wireless Rechargeable Sensor Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1