Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    An Enhanced Equilibrium Optimizer for Solving Optimization Tasks

    Yuting Liu1, Hongwei Ding1,*, Zongshan Wang1,*, Gaurav Dhiman2,3,4, Zhijun Yang1, Peng Hu5

    CMC-Computers, Materials & Continua, Vol.77, No.2, pp. 2385-2406, 2023, DOI:10.32604/cmc.2023.039883

    Abstract The equilibrium optimizer (EO) represents a new, physics-inspired metaheuristic optimization approach that draws inspiration from the principles governing the control of volume-based mixing to achieve dynamic mass equilibrium. Despite its innovative foundation, the EO exhibits certain limitations, including imbalances between exploration and exploitation, the tendency to local optima, and the susceptibility to loss of population diversity. To alleviate these drawbacks, this paper introduces an improved EO that adopts three strategies: adaptive inertia weight, Cauchy mutation, and adaptive sine cosine mechanism, called SCEO. Firstly, a new update formula is conceived by incorporating an adaptive inertia weight to reach an appropriate balance… More >

  • Open Access

    ARTICLE

    Improved Dijkstra Algorithm for Mobile Robot Path Planning and Obstacle Avoidance

    Shaher Alshammrei1, Sahbi Boubaker2,*, Lioua Kolsi1,3

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5939-5954, 2022, DOI:10.32604/cmc.2022.028165

    Abstract Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots (MRs) in both research and education. In this paper, an optimal collision-free algorithm is designed and implemented practically based on an improved Dijkstra algorithm. To achieve this research objectives, first, the MR obstacle-free environment is modeled as a diagraph including nodes, edges and weights. Second, Dijkstra algorithm is used offline to generate the shortest path driving the MR from a starting point to a target point. During its movement, the robot should follow the previously obtained path and stop at each node to test if there… More >

  • Open Access

    ARTICLE

    Novel Algorithm for Mobile Robot Path Planning in Constrained Environment

    Aisha Muhammad1,5, Mohammed A. H. Ali2,*, Sherzod Turaev3, Ibrahim Haruna Shanono4,5, Fadhl Hujainah6, Mohd Nashrul Mohd Zubir2, Muhammad Khairi Faiz2, Erma Rahayu Mohd Faizal1, Rawad Abdulghafor8

    CMC-Computers, Materials & Continua, Vol.71, No.2, pp. 2697-2719, 2022, DOI:10.32604/cmc.2022.020873

    Abstract This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. This approach gives the possibility to find the path for a wheel mobile robot considering some constraints during the robot movement in both known and unknown environments. The feasible path is determined between the start and goal positions by generating wave of points in all direction towards the goal point with adhering to constraints. In simulation, the proposed method has been tested in several working environments with… More >

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