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. 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.
    2. 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.
    3. Agoston E. Eiben & Jim Smith, 2015. "From evolutionary computation to the evolution of things," Nature, Nature, vol. 521(7553), pages 476-482, May.
    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. Huang, He & Chen, Yahong & Ma, Yefeng, 2021. "Modeling the competitive diffusions of rumor and knowledge and the impacts on epidemic spreading," Applied Mathematics and Computation, Elsevier, vol. 388(C).
    2. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    3. Yuqing Kong, 2019. "Dominantly Truthful Multi-task Peer Prediction with a Constant Number of Tasks," Papers 1911.00272, arXiv.org.
    4. 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.
    5. Funk, Patrick & Davis, Alex & Vaishnav, Parth & Dewitt, Barry & Fuchs, Erica, 2020. "Individual inconsistency and aggregate rationality: Overcoming inconsistencies in expert judgment at the technical frontier," Technological Forecasting and Social Change, Elsevier, vol. 155(C).
    6. 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.
    7. Jaspersen, Johannes G., 2022. "Convex combinations in judgment aggregation," European Journal of Operational Research, Elsevier, vol. 299(2), pages 780-794.
    8. Bergemann, Dirk & Ottaviani, Marco, 2021. "Information Markets and Nonmarkets," CEPR Discussion Papers 16459, C.E.P.R. Discussion Papers.
    9. 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).
    10. 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.
    11. Dong Liu & Zhihuai Xiao & Hongtao Li & Dong Liu & Xiao Hu & O.P. Malik, 2019. "Accurate Parameter Estimation of a Hydro-Turbine Regulation System Using Adaptive Fuzzy Particle Swarm Optimization," Energies, MDPI, vol. 12(20), pages 1-21, October.
    12. 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.
    13. Jaller, Miguel & Pahwa, Anmol, 2023. "Coping with the Rise of E-commerce Generated Home Deliveries through Innovative Last-mile Technologies and Strategies," Institute of Transportation Studies, Working Paper Series qt5t76x0kh, Institute of Transportation Studies, UC Davis.
    14. Fister, Iztok & Iglesias, Andres & Galvez, Akemi & Del Ser, Javier & Osaba, Eneko & Fister, Iztok & Perc, Matjaž & Slavinec, Mitja, 2019. "Novelty search for global optimization," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 865-881.
    15. 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.
    16. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    17. Tang, Ming & Liao, Huchang, 2024. "Group efficiency and individual fairness tradeoff in making wise decisions," Omega, Elsevier, vol. 124(C).
    18. 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.
    19. Moshref-Javadi, Mohammad & Lee, Seokcheon, 2016. "The Latency Location-Routing Problem," European Journal of Operational Research, Elsevier, vol. 255(2), pages 604-619.
    20. 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.

    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.