An Extended Model for the UAVs-Assisted Multiperiodic Crowd Tracking Problem

IF 1.7 4区 工程技术 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Complexity Pub Date : 2023-02-01 DOI:10.1155/2023/3001812
Skander Htiouech, Khalil Chebil, Mahdi Khemakhem, Fidaa Abed, Monaji H. Alkiani
{"title":"An Extended Model for the UAVs-Assisted Multiperiodic Crowd Tracking Problem","authors":"Skander Htiouech,&nbsp;Khalil Chebil,&nbsp;Mahdi Khemakhem,&nbsp;Fidaa Abed,&nbsp;Monaji H. Alkiani","doi":"10.1155/2023/3001812","DOIUrl":null,"url":null,"abstract":"<div>\n <p>The multiperiodic crowd tracking (MPCT) problem is an extension of the periodic crowd tracking (PCT) problem, recently addressed in the literature and solved using an iterative solver called PCTs solver. For a given crowded event, the MPCT consists of follow-up crowds, using unmanned aerial vehicles (UAVs) during different periods in a life-cycle of an open crowded area (OCA). Our main motivation is to remedy an important limitation of the PCTs solver called “PCTs solver <i>myopia</i>” which is, in certain cases, unable to manage the fleet of UAVs to cover all the periods of a given OCA life-cycle during a crowded event. The behavior of crowds can be predicted using machine learning techniques. Based on this assumption, we proposed a new mixed integer linear programming (MILP) model, called MILP-MPCT, to solve the MPCT. The MILP-MPCT was designed using linear programming technique to build two objective functions that minimize the total time and energy consumed by UAVs under a set of constraints related to the MPCT problem. In order to validate the MILP-MPCT, we simulated it using IBM-ILOG-CPLEX optimization framework. Thanks to the “<i>clairvoyance</i>” of the proposed MILP-MPCT model, experimental investigations show that the MILP-MPCT model provides strategic moves of UAVs between charging stations (CSs) and crowds to provide better solutions than those reported in the literature.</p>\n </div>","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2023 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/3001812","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity","FirstCategoryId":"5","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2023/3001812","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The multiperiodic crowd tracking (MPCT) problem is an extension of the periodic crowd tracking (PCT) problem, recently addressed in the literature and solved using an iterative solver called PCTs solver. For a given crowded event, the MPCT consists of follow-up crowds, using unmanned aerial vehicles (UAVs) during different periods in a life-cycle of an open crowded area (OCA). Our main motivation is to remedy an important limitation of the PCTs solver called “PCTs solver myopia” which is, in certain cases, unable to manage the fleet of UAVs to cover all the periods of a given OCA life-cycle during a crowded event. The behavior of crowds can be predicted using machine learning techniques. Based on this assumption, we proposed a new mixed integer linear programming (MILP) model, called MILP-MPCT, to solve the MPCT. The MILP-MPCT was designed using linear programming technique to build two objective functions that minimize the total time and energy consumed by UAVs under a set of constraints related to the MPCT problem. In order to validate the MILP-MPCT, we simulated it using IBM-ILOG-CPLEX optimization framework. Thanks to the “clairvoyance” of the proposed MILP-MPCT model, experimental investigations show that the MILP-MPCT model provides strategic moves of UAVs between charging stations (CSs) and crowds to provide better solutions than those reported in the literature.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无人机辅助多周期人群跟踪问题的扩展模型
多周期人群跟踪(MPCT)问题是周期人群跟踪(PCT)问题的扩展,最近在文献中得到了解决,并使用称为PCT求解器的迭代求解器进行求解。对于给定的拥挤事件,MPCT由在开放拥挤区域(OCA)生命周期的不同时期使用无人机(uav)跟踪人群组成。我们的主要动机是纠正pct求解器的一个重要限制,即“pct求解器近视”,在某些情况下,无法管理无人机舰队,以覆盖拥挤事件中给定OCA生命周期的所有时期。使用机器学习技术可以预测人群的行为。基于这一假设,我们提出了一种新的混合整数线性规划(MILP)模型,称为MILP-MPCT。在一组约束条件下,利用线性规划技术构建了两个目标函数,使无人机的总时间和总能量消耗最小。为了验证MILP-MPCT,我们使用IBM-ILOG-CPLEX优化框架对其进行了仿真。由于所提出的MILP-MPCT模型的“洞察力”,实验研究表明,MILP-MPCT模型提供了无人机在充电站(CSs)和人群之间的战略移动,提供了比文献报道的更好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Complexity
Complexity 综合性期刊-数学跨学科应用
CiteScore
5.80
自引率
4.30%
发文量
595
审稿时长
>12 weeks
期刊介绍: Complexity is a cross-disciplinary journal focusing on the rapidly expanding science of complex adaptive systems. The purpose of the journal is to advance the science of complexity. Articles may deal with such methodological themes as chaos, genetic algorithms, cellular automata, neural networks, and evolutionary game theory. Papers treating applications in any area of natural science or human endeavor are welcome, and especially encouraged are papers integrating conceptual themes and applications that cross traditional disciplinary boundaries. Complexity is not meant to serve as a forum for speculation and vague analogies between words like “chaos,” “self-organization,” and “emergence” that are often used in completely different ways in science and in daily life.
期刊最新文献
Prevention of EMT-Mediated Metastasis via Optimal Modulation Strategies for the Dysregulated WNT Pathway Interacting With TGF-β EIM: A Novel Evolutionary Influence Maximizer in Complex Networks Detection of Effective Devices in Information Dissemination on the Complex Social Internet of Things Networks Based on Device Centrality Measures On Novel Design Methods of Fixed-Time State Observation and Consensus Control for Linear Leader–Follower Multiagent System Complex Dynamics and Chaos Control of Discrete Prey–Predator Model With Caputo Fractional Derivative
×
引用
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