IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v28y2022i4d10.1007_s10732-022-09502-7.html
   My bibliography  Save this article

Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds

Author

Listed:
  • Leandro R. Costa

    (Polytechnique Montréal)

  • Daniel Aloise

    (Polytechnique Montréal)

  • Luca G. Gianoli

    (Humanitas Solutions)

  • Andrea Lodi

    (Polytechnique Montréal)

Abstract

Drones have been getting more and more popular in many economy sectors. Both scientific and industrial communities aim at making the impact of drones even more disruptive by empowering collaborative autonomous behaviors—also known as swarming behaviors—within fleets of multiple drones. In swarming-powered 3D mapping missions, unmanned aerial vehicles typically collect the aerial pictures of the target area whereas the 3D reconstruction process is performed in a centralized manner. However, such approaches do not leverage computational and storage resources from the swarm members. We address the optimization of a swarm-powered distributed 3D mapping mission for a real-life humanitarian emergency response application through the exploitation of a swarm-powered ad hoc cloud. Producing the relevant 3D maps in a timely manner, even when the cloud connectivity is not available, is crucial to increase the chances of success of the operation. In this work, we present a mathematical programming heuristic based on decomposition and a variable neighborhood search heuristic to minimize the completion time of the 3D reconstruction process necessary in such missions. Our computational results reveal that the proposed heuristics either quickly reach optimality or improve the best known solutions for almost all tested realistic instances comprising up to 1000 images and fifteen drones.

Suggested Citation

  • Leandro R. Costa & Daniel Aloise & Luca G. Gianoli & Andrea Lodi, 2022. "Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds," Journal of Heuristics, Springer, vol. 28(4), pages 539-582, August.
    • Handle: RePEc:spr:joheur:v:28:y:2022:i:4:d:10.1007_s10732-022-09502-7
    DOI: 10.1007/s10732-022-09502-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-022-09502-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10732-022-09502-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xiaoting Ji & Xiangke Wang & Yifeng Niu & Lincheng Shen, 2015. "Cooperative Search by Multiple Unmanned Aerial Vehicles in a Nonconvex Environment," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-19, August.
    2. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    3. Hyondong Oh & Seungkeun Kim & Antonios Tsourdos & Brian A. White, 2014. "Coordinated road-network search route planning by a team of UAVs," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(5), pages 825-840, May.
    4. Caraballo, L.E. & Díaz-Báñez, J.M. & Maza, I. & Ollero, A., 2017. "The block-information-sharing strategy for task allocation: A case study for structure assembly with aerial robots," European Journal of Operational Research, Elsevier, vol. 260(2), pages 725-738.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    2. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2018. "Minimizing Piecewise-Concave Functions Over Polyhedra," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 580-597, May.
    3. Amina Lamghari & Roussos Dimitrakopoulos & Jacques Ferland, 2015. "A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines," Journal of Global Optimization, Springer, vol. 63(3), pages 555-582, November.
    4. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    5. Ali Shahabi & Sadigh Raissi & Kaveh Khalili-Damghani & Meysam Rafei, 2021. "Designing a resilient skip-stop schedule in rapid rail transit using a simulation-based optimization methodology," Operational Research, Springer, vol. 21(3), pages 1691-1721, September.
    6. Wilson, Duncan T. & Hawe, Glenn I. & Coates, Graham & Crouch, Roger S., 2013. "A multi-objective combinatorial model of casualty processing in major incident response," European Journal of Operational Research, Elsevier, vol. 230(3), pages 643-655.
    7. Felipe, Ángel & Ortuño, M. Teresa & Righini, Giovanni & Tirado, Gregorio, 2014. "A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 111-128.
    8. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    9. Véronique François & Yasemin Arda & Yves Crama, 2019. "Adaptive Large Neighborhood Search for Multitrip Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 53(6), pages 1706-1730, November.
    10. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2014. "The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," FEMM Working Papers 140006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    11. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    12. Olcay Polat & Can B. Kalayci & Özcan Mutlu & Surendra M. Gupta, 2016. "A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 722-741, February.
    13. Janssens, Jochen & Van den Bergh, Joos & Sörensen, Kenneth & Cattrysse, Dirk, 2015. "Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning," European Journal of Operational Research, Elsevier, vol. 242(1), pages 222-231.
    14. Jiang, Min & Huang, George Q., 2022. "Intralogistics synchronization in robotic forward-reserve warehouses for e-commerce last-mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    15. Xiao, Yiyong & Kaku, Ikou & Zhao, Qiuhong & Zhang, Renqian, 2011. "A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 214(2), pages 223-231, October.
    16. Bani, Abderrahman & El Hallaoui, Issmail & Corréa, Ayoub Insa & Tahir, Adil, 2023. "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 154-172.
    17. Roe, R.A. & Smeelen, M. & Hoefeld, C., 2005. "Outsourcing and organizational change : an employee perspective," Research Memorandum 045, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    18. Bruglieri, Maurizio & Liberti, Leo, 2008. "Optimal running and planning of a biomass-based energy production process," Energy Policy, Elsevier, vol. 36(7), pages 2430-2438, July.
    19. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    20. Drezner, Zvi, 2005. "The extended concentric tabu for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 160(2), pages 416-422, January.

    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:spr:joheur:v:28:y:2022:i:4:d:10.1007_s10732-022-09502-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.