IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3001812.html
   My bibliography  Save this article

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

Author

Listed:
  • Skander Htiouech
  • Khalil Chebil
  • Mahdi Khemakhem
  • Fidaa Abed
  • Monaji H. Alkiani
  • Matilde Santos

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.

Suggested Citation

  • Skander Htiouech & Khalil Chebil & Mahdi Khemakhem & Fidaa Abed & Monaji H. Alkiani & Matilde Santos, 2023. "An Extended Model for the UAVs-Assisted Multiperiodic Crowd Tracking Problem," Complexity, Hindawi, vol. 2023, pages 1-14, February.
  • Handle: RePEc:hin:complx:3001812
    DOI: 10.1155/2023/3001812
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2023/3001812.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2023/3001812.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/3001812?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:3001812. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.