Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access

    ARTICLE

    An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time

    Xiaoqing Wang1, Peng Duan1,*, Leilei Meng1,*, Kaidong Yang2

    CMC-Computers, Materials & Continua, Vol.80, No.1, pp. 931-947, 2024, DOI:10.32604/cmc.2024.050612 - 18 July 2024

    Abstract Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario. In this study, we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem (TSP) with life-strength constraints. To address this problem, we proposed an improved iterated greedy (IIG) algorithm. First, a push-forward insertion heuristic (PFIH) strategy was employed to generate a high-quality initial solution. Second, a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ability. Furthermore,… More >

Displaying 1-10 on page 1 of 1. Per Page