考虑运动随机性和能量分配的异构机器人持续监控。

IF 6.5
Tiedan Hua, Yang Chen
{"title":"考虑运动随机性和能量分配的异构机器人持续监控。","authors":"Tiedan Hua, Yang Chen","doi":"10.1016/j.isatra.2025.08.007","DOIUrl":null,"url":null,"abstract":"<p><p>This paper addresses a new persistent surveillance problem where heterogeneous robots measure task nodes, taking into account movement randomness and energy allocation. The heterogeneous robots, which consist of an unmanned ground vehicle (UGV) and unmanned aerial vehicles (UAVs), are deployed in real-time counteracting environmental inspection applications. To avoid hostile intruders from predicting their future routing information and to improve measurement efficiency, this paper seeks to: (1) address the privacy of persistent surveillance, and (2) make balanced programs about the energy cost. Specifically, this paper first proposes a framework in which UAVs perform stochastic movement based on Markov Chain and leverage the probabilistic measurement to fulfill the overall frequency of the task nodes. Then, persistent surveillance with movement randomness and energy allocation (PSREA) is formulated as an optimization problem, which is non-convex and becomes quite complex when regarding excessive task nodes. A clustering-based task network simplification algorithm and an iterative two-stage algorithm are proposed to cover an enormous number of task nodes and to deal with the non-convex problem, respectively. The numerical results demonstrate that the proposed algorithms can significantly improve the inspection performance compared to the benchmark results.</p>","PeriodicalId":94059,"journal":{"name":"ISA transactions","volume":" ","pages":""},"PeriodicalIF":6.5000,"publicationDate":"2025-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Persistent surveillance for heterogeneous robots considering movement randomness and energy allocation.\",\"authors\":\"Tiedan Hua, Yang Chen\",\"doi\":\"10.1016/j.isatra.2025.08.007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>This paper addresses a new persistent surveillance problem where heterogeneous robots measure task nodes, taking into account movement randomness and energy allocation. The heterogeneous robots, which consist of an unmanned ground vehicle (UGV) and unmanned aerial vehicles (UAVs), are deployed in real-time counteracting environmental inspection applications. To avoid hostile intruders from predicting their future routing information and to improve measurement efficiency, this paper seeks to: (1) address the privacy of persistent surveillance, and (2) make balanced programs about the energy cost. Specifically, this paper first proposes a framework in which UAVs perform stochastic movement based on Markov Chain and leverage the probabilistic measurement to fulfill the overall frequency of the task nodes. Then, persistent surveillance with movement randomness and energy allocation (PSREA) is formulated as an optimization problem, which is non-convex and becomes quite complex when regarding excessive task nodes. A clustering-based task network simplification algorithm and an iterative two-stage algorithm are proposed to cover an enormous number of task nodes and to deal with the non-convex problem, respectively. The numerical results demonstrate that the proposed algorithms can significantly improve the inspection performance compared to the benchmark results.</p>\",\"PeriodicalId\":94059,\"journal\":{\"name\":\"ISA transactions\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":6.5000,\"publicationDate\":\"2025-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISA transactions\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/j.isatra.2025.08.007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISA transactions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.isatra.2025.08.007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了一种新的持续监视问题,即异构机器人在考虑运动随机性和能量分配的情况下测量任务节点。由无人地面车辆(UGV)和无人机(uav)组成的异构机器人被部署在实时对抗环境检测应用中。为了避免恶意入侵者预测其未来的路由信息并提高测量效率,本文寻求:(1)解决持久监视的隐私问题;(2)制定关于能源成本的平衡方案。具体而言,本文首先提出了一种基于马尔可夫链的无人机随机移动框架,并利用概率测量来完成任务节点的总体频率。然后,将具有运动随机性和能量分配的持续监视(PSREA)定义为一个非凸的优化问题,当任务节点过多时,该问题变得非常复杂。提出了一种基于聚类的任务网络简化算法和一种迭代两阶段算法,分别用于覆盖大量任务节点和处理非凸问题。数值结果表明,与基准测试结果相比,所提算法能显著提高检测性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Persistent surveillance for heterogeneous robots considering movement randomness and energy allocation.

This paper addresses a new persistent surveillance problem where heterogeneous robots measure task nodes, taking into account movement randomness and energy allocation. The heterogeneous robots, which consist of an unmanned ground vehicle (UGV) and unmanned aerial vehicles (UAVs), are deployed in real-time counteracting environmental inspection applications. To avoid hostile intruders from predicting their future routing information and to improve measurement efficiency, this paper seeks to: (1) address the privacy of persistent surveillance, and (2) make balanced programs about the energy cost. Specifically, this paper first proposes a framework in which UAVs perform stochastic movement based on Markov Chain and leverage the probabilistic measurement to fulfill the overall frequency of the task nodes. Then, persistent surveillance with movement randomness and energy allocation (PSREA) is formulated as an optimization problem, which is non-convex and becomes quite complex when regarding excessive task nodes. A clustering-based task network simplification algorithm and an iterative two-stage algorithm are proposed to cover an enormous number of task nodes and to deal with the non-convex problem, respectively. The numerical results demonstrate that the proposed algorithms can significantly improve the inspection performance compared to the benchmark results.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信