Online path planning of mobile robot using grasshopper algorithm in a dynamic and unknown environment

Elmi Z., EFE M. Ö.

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, vol.33, no.3, pp.467-485, 2021 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 33 Issue: 3
  • Publication Date: 2021
  • Doi Number: 10.1080/0952813x.2020.1764631
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Compendex, Computer & Applied Sciences, INSPEC, Psycinfo, zbMATH
  • Page Numbers: pp.467-485
  • Keywords: Path planning, grasshopper optimisation algorithm, dynamic environment, mobile robot navigation, obstacle avoidance
  • Hacettepe University Affiliated: Yes


The navigation of mobile robots using heuristic algorithms is one of the important issues in computer and control sciences. Path planning and obstacle avoidance are current topics of navigational challenges for mobile robots. The major drawbacks of conventional methods are the inability to plan motion in a dynamic and unknown environment, failure in crowded and complex environments, and inability to predict the velocity vector of obstacles and non-optimality of the synthesised path. This paper presents a novel path planning approach using a grasshopper algorithm for navigation of a mobile robot in dynamic and unknown environments. To accomplish this goal, two different approaches are presented. First, a sensory system is used to detect the obstacles and then a new method is developed to predict and avoid static and dynamic obstacles while the velocity of obstacles is unknown. The robot uses the obtained information and finds a collision-free, optimal and safe path. The controller proposed in this paper is tested in crowded and complex environments. Simulation results show that the approach is successful in all test environments. Also, the proposed controller is compared with several heuristic methods. The comparison work stipulates that the introduced controller here is promising in terms of running time, optimality, stability and failure rate.