IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0297066.html

A PSO-based energy-efficient data collection optimization algorithm for UAV mission planning

Author

Listed:
  • Lianhai Lin
  • Zhigang Wang
  • Liqin Tian
  • Junyi Wu
  • Wenxing Wu

Abstract

With the development of the Internet of Things (IoT), the use of UAV-based data collection systems has become a very popular research topic. This paper focuses on the energy consumption problem of this system. Genetic algorithms and swarm algorithms are effective approaches for solving this problem. However, optimizing UAV energy consumption remains a challenging task due to the inherent characteristics of these algorithms, which make it difficult to achieve the optimum solution. In this paper, a novel particle swarm optimization (PSO) algorithm called Double Self-Limiting PSO (DSLPSO) is proposed to minimize the energy consumption of the unmanned aerial vehicle (UAV). DSLPSO refers to the operational principle of PSO and incorporates two new mechanisms. The first mechanism is to restrict the particle movement, improving the local search capability of the algorithm. The second mechanism dynamically adjusts the search range, which improves the algorithm’s global search capability. DSLPSO employs a variable population strategy that treats the entire population as a single mission plan for the UAV and dynamically adjusts the number of stopping points. In addition, the proposed algorithm was also simulated using public and random datasets. The effectiveness of the proposed DSLPSO and the two new mechanisms has been verified through experiments. The DSLPSO algorithm can effectively improve the lifetime of the UAV, and the two newly proposed mechanisms have potential for optimization work.

Suggested Citation

  • Lianhai Lin & Zhigang Wang & Liqin Tian & Junyi Wu & Wenxing Wu, 2024. "A PSO-based energy-efficient data collection optimization algorithm for UAV mission planning," PLOS ONE, Public Library of Science, vol. 19(1), pages 1-24, January.
  • Handle: RePEc:plo:pone00:0297066
    DOI: 10.1371/journal.pone.0297066
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0297066
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0297066&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0297066?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
    ---><---

    References listed on IDEAS

    as
    1. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Quoc Bao Diep & Thanh-Cong Truong & Ivan Zelinka, 2025. "Planning trajectory for UAVs using the self-organizing migrating algorithm," PLOS ONE, Public Library of Science, vol. 20(7), pages 1-23, July.
    2. Jian Kong & Jinsong Li & Peng Li, 2024. "Optimization of chaotic light output in semiconductor laser systems based on multi-objective optimization algorithm," PLOS ONE, Public Library of Science, vol. 19(4), pages 1-23, April.

    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. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    2. Long Wang & Jiongzhi Zheng & Zhengda Xiong & Kun He, 2026. "Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem and its Variants," Journal of Heuristics, Springer, vol. 32(1), pages 1-32, March.
    3. A. Scholz & G. Wäscher, 2017. "Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 491-520, June.
    4. Lang, Jan Christian & Shen, Zuo-Jun Max, 2011. "Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions," European Journal of Operational Research, Elsevier, vol. 214(3), pages 595-605, November.
    5. Löhndorf, Nils & Riel, Manuel & Minner, Stefan, 2014. "Simulation optimization for the stochastic economic lot scheduling problem with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 157(C), pages 170-176.
    6. van Gils, Teun & Ramaekers, Katrien & Braekers, Kris & Depaire, Benoît & Caris, An, 2018. "Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions," International Journal of Production Economics, Elsevier, vol. 197(C), pages 243-261.
    7. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    8. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    9. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    10. B. I. Goldengorin & D. S. Malyshev & P. M. Pardalos & V. A. Zamaraev, 2015. "A tolerance-based heuristic approach for the weighted independent set problem," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 433-450, February.
    11. Krešimir Mihić & Kevin Ryan & Alan Wood, 2018. "Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 295-308, May.
    12. Toni Pacheco & Rafael Martinelli & Anand Subramanian & Túlio A. M. Toffolo & Thibaut Vidal, 2023. "Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem," Transportation Science, INFORMS, vol. 57(2), pages 463-481, March.
    13. Banafsheh Amiri & Koorush Ziarati & Somayeh Sohrabi, 2025. "A memetic algorithm for the flexible periodic vehicle routing problem," Journal of Heuristics, Springer, vol. 31(1), pages 1-26, March.
    14. Vig, Vikrant & Palekar, Udatta S., 2008. "On estimating the distribution of optimal traveling salesman tour lengths using heuristics," European Journal of Operational Research, Elsevier, vol. 186(1), pages 111-119, April.
    15. Jiang, Zhongzhou & Liu, Jing & Wang, Shuai, 2016. "Traveling salesman problems with PageRank Distance on complex networks reveal community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 293-302.
    16. Jean-Charles Créput & Amir Hajjam & Abderrafiaa Koukam & Olivier Kuhn, 2012. "Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 437-458, November.
    17. Zongxu Mu & Jérémie Dubois-Lacoste & Holger H. Hoos & Thomas Stützle, 2018. "On the empirical scaling of running time for finding optimal solutions to the TSP," Journal of Heuristics, Springer, vol. 24(6), pages 879-898, December.
    18. Lin, Shih-Wei & Ying, Kuo-Ching, 2016. "Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics," Omega, Elsevier, vol. 64(C), pages 115-125.
    19. Henke, Tino & Speranza, M. Grazia & Wäscher, Gerhard, 2015. "The multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 246(3), pages 730-743.
    20. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.

    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:plo:pone00:0297066. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.