IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i12p2630-d1167054.html
   My bibliography  Save this article

Swarm Robots Search for Multiple Targets Based on Historical Optimal Weighting Grey Wolf Optimization

Author

Listed:
  • Qian Zhu

    (Software College, Northeastern University, Shenyang 110169, China)

  • Yongqing Li

    (Software College, Northeastern University, Shenyang 110169, China)

  • Zhen Zhang

    (Software College, Northeastern University, Shenyang 110169, China)

Abstract

This study investigates the problem of swarm robots searching for multiple targets in an unknown environment. We propose the Historical Optimal Weighting Grey Wolf Optimization (HOWGWO) algorithm based on an improved grouping strategy. In the HOWGWO algorithm, we gather and update every individual grey wolf’s historical optimal position and rank grey wolves based on the merit of their historical optimal position. The position of the prey is dynamically estimated by the leader wolf, and all grey wolves move towards the prey’s estimated position. To solve the multi-target problem of swarm robots search, we integrate the HOWGWO algorithm with an improved grouping strategy and divide the algorithm into two stages: the random walk stage and the dynamic grouping stage. During the random walk stage, grey wolves move randomly and update their historical optimal positions. During the dynamic grouping stage, the HOWGWO algorithm generates search auxiliary points (SAPs) by adopting an improved grouping strategy based on individual grey wolves’ historical optimal positions. These SAPs are then utilized for grouping grey wolves to search for different prey. The SAPs are re-generated using the optimum historical positions of every single grey wolf after positions have been updated, rather than just those belonging to a specific group. The effectiveness of the proposed HOWGWO algorithm is extensively assessed in 30 dimensions using the CEC 2017 test suite, which simulates unimodal, multimodal, hybrid, and composition problems. Then, the obtained results are compared with competitors, including GWO, PSO and EGWO, and the results are statistically analyzed through Friedman’s test. Ultimately, simulations are performed to simulate the problem of searching multiple targets by swarm robots in a real environment. The experimental results and statistical analysis confirm that the proposed HOWGWO algorithm has a fast convergence speed and solution quality for solving global optimization problems and swarm robots searching multiple targets problems.

Suggested Citation

  • Qian Zhu & Yongqing Li & Zhen Zhang, 2023. "Swarm Robots Search for Multiple Targets Based on Historical Optimal Weighting Grey Wolf Optimization," Mathematics, MDPI, vol. 11(12), pages 1-19, June.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:12:p:2630-:d:1167054
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/12/2630/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/12/2630/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Prodhon, Caroline, 2011. "A hybrid evolutionary algorithm for the periodic location-routing problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 204-212, April.
    2. Agoston E. Eiben & Jim Smith, 2015. "From evolutionary computation to the evolution of things," Nature, Nature, vol. 521(7553), pages 476-482, May.
    3. Dražen Prelec & H. Sebastian Seung & John McCoy, 2017. "A solution to the single-question crowd wisdom problem," Nature, Nature, vol. 541(7638), pages 532-535, January.
    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. Dai, Min & Jia, Yanwei & Kou, Steven, 2021. "The wisdom of the crowd and prediction markets," Journal of Econometrics, Elsevier, vol. 222(1), pages 561-578.
    2. Hashemi Doulabi, Seyed Hossein & Seifi, Abbas, 2013. "Lower and upper bounds for location-arc routing problems with vehicle capacity constraints," European Journal of Operational Research, Elsevier, vol. 224(1), pages 189-208.
    3. Alvarez, Jose A. Lopez & Buijs, Paul & Deluster, Rogier & Coelho, Leandro C. & Ursavas, Evrim, 2020. "Strategic and operational decision-making in expanding supply chains for LNG as a fuel," Omega, Elsevier, vol. 97(C).
    4. Shinitzky, Hilla & Shemesh, Yhonatan & Leiser, David & Gilead, Michael, 2024. "Improving geopolitical forecasts with 100 brains and one computer," International Journal of Forecasting, Elsevier, vol. 40(3), pages 958-970.
    5. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    6. Peng, Diefeng & Rao, Yulei & Sun, Xianming & Xiao, Erte, 2025. "Optional disclosure and observational learning," Journal of Economic Behavior & Organization, Elsevier, vol. 229(C).
    7. Gläser, Sina & Stücken, Mareike, 2021. "Introduction of an underground waste container system–model and solution approaches," European Journal of Operational Research, Elsevier, vol. 295(2), pages 675-689.
    8. Manuel Chica & Joaquín Bautista & Jesica de Armas, 2019. "Benefits of robust multiobjective optimization for flexible automotive assembly line balancing," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 75-103, March.
    9. Michael D. Lee & Megan N. Lee, 2017. "The relationship between crowd majority and accuracy for binary decisions," Judgment and Decision Making, Society for Judgment and Decision Making, vol. 12(4), pages 328-343, July.
    10. Yuqing Kong, 2021. "Information Elicitation Meets Clustering," Papers 2110.00952, arXiv.org.
    11. J. Aislinn Bohren & Daniel N. Hauser, 2023. "Behavioral Foundations of Model Misspecification," PIER Working Paper Archive 23-007, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    12. Luciano Ferreira Cruz & Flavia Bernardo Pinto & Lucas Camilotti & Angelo Marcio Oliveira Santanna & Roberto Zanetti Freire & Leandro Santos Coelho, 2022. "Improved multiobjective differential evolution with spherical pruning algorithm for optimizing 3D printing technology parametrization process," Annals of Operations Research, Springer, vol. 319(2), pages 1565-1587, December.
    13. Shane Greenstein & Grace Gu & Feng Zhu, 2021. "Ideology and Composition Among an Online Crowd: Evidence from Wikipedians," Management Science, INFORMS, vol. 67(5), pages 3067-3086, May.
    14. Jon Atwell & Marlon Twyman II, 2023. "Metawisdom of the Crowd: How Choice Within Aided Decision Making Can Make Crowd Wisdom Robust," Papers 2308.15451, arXiv.org.
    15. Salcedo-Sanz, S. & Cuadra, L., 2019. "Quasi scale-free geographically embedded networks over DLA-generated aggregates," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1286-1305.
    16. Sonja Radas & Drazen Prelec, 2019. "Whose data can we trust: How meta-predictions can be used to uncover credible respondents in survey data," PLOS ONE, Public Library of Science, vol. 14(12), pages 1-16, December.
    17. repec:osf:metaar:rxmh7_v1 is not listed on IDEAS
    18. Hilla Shinitzky & Dan Avraham & Yizhak Vaisman & Yakir Tsizer & Yaniv Leedon & Yuval Shahar, 2024. "Exploiting Meta-cognitive Features for a Machine-Learning-Based One-Shot Group-Decision Aggregation," Group Decision and Negotiation, Springer, vol. 33(1), pages 87-111, February.
    19. Nir Billfeld & Moshe Kim, 2019. "Semiparametric correction for endogenous truncation bias with Vox Populi based participation decision," Papers 1902.06286, arXiv.org.
    20. Gobeyn, Sacha & Mouton, Ans M. & Cord, Anna F. & Kaim, Andrea & Volk, Martin & Goethals, Peter L.M., 2019. "Evolutionary algorithms for species distribution modelling: A review in the context of machine learning," Ecological Modelling, Elsevier, vol. 392(C), pages 179-195.
    21. Nadizadeh, Ali & Hosseini Nasab, Hasan, 2014. "Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 458-470.

    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:gam:jmathe:v:11:y:2023:i:12:p:2630-:d:1167054. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.