Methodology for Path Planning Mobile Robots: A Review

DOI : 10.17577/IJERTV11IS120099

Download Full-Text PDF Cite this Publication

Text Only Version

Methodology for Path Planning Mobile Robots: A Review

A. Chetan Gangadhara, G. Satyanarayanaa*, S.Adinarayanaa

aMVGR College of Engineering(A) , Vizianagaram-535005

Abstract:- Since the previous three decades, research in mobile robots has been growing. In the current study of mobile robots, the path planning algorithm and optimization in both static and dynamic situations are the key issues that are being addressed. The merits and drawbacks of each of these strategies / methods have been emphasized in a thorough analysis of the broad field of mobile robotic research with a specific focus on the path planning technique in varied crowded situations. Heuristic Methods and Classical Methods are two categories for the path planning strategy used by mobile robots. Additional divisions include I Analytical Methods,

  1. Enumerative Methods, (iii) Evolutionary Methods, and (iv) Meta-Heuristic Methods. Each of the aforementioned techniques has benefits and drawbacks of its own. The fundamental flaw, however, is that enumerative methods are concerned about the size of the search area, whereas analytical approaches are too difficult for intangible applications. On the other hand, several evolutionary approaches have been demonstrated to be useless when the search space in the path planning strategy is too broad. Meta-heuristic approaches have been explored a lot in this large field of research to overcome these shortcomings. The most widely used strategies in path planning for mobile robots have been developed around the globe, but are only briefly discussed here.


      For the autonomous mobile robot, path planning is a crucial task. To safely navigate from the start configuration to the destination configuration in an environment where obstacles are common, it is desired to identify a collision-free mobility [1]. Mobile robots are being used more and more in both static and dynamic contexts. For a robot to reach its destination from its starting point, there are typically many viable routes. However, in some situations, the optimal feasible route is chosen based on certain criteria, such as the shortest distance with the least amount of time required or the smoothness of the path.

      Local path planning and global path planning are the two categories into which the path planning may be divided. In the local path planning technique, the robot has a limited understanding of the navigational environment (either known or unknown). In contrast, the robot may take a predetermined path to the objective while using global path planning since it has comprehensive information of the navigational environment. Local route planning techniques, on the other hand, are more flexible in partially known or unknown situations and offer an optimum approach, but global path planning techniques have restricted uses because of their reduced resilience in terrain uncertainty [2]. It may also be divided into two categories: classical approach and heuristic method (Artificial Intelligence Technique). Medical and surgical applications, personal assistance, security, stockroom and circulation applications, as well as robotized guided vehicles for transferring goods in a factory, unmanned bomb delivery robots, and planet study robots, all make use of mobile robot path planning and arranging.


      The design of the navigational control behaviour includes crucial elements such as robot path planning. The robot must go the shortest distance possible while still completing the task in the least amount of time. Less computational complexity and power consumption are the other criteria, and only when the robot moves in the shortest path from the start configuration to the target configuration will these criteria be met. The following is a collection of many methodologies and approaches that have been put out by various researchers. The following sections outline each of these strategies along with their benefits, drawbacks, and restrictions.

      Table 1. Different Path Planning Approaches.

      Classical Approach

      Artificial Intelligence (Heuristic Approach)

      Potential Field. (1979)

      Neural Network Technique. (1943)

      Raodmap Cell Decomposition. (1987)

      Fuzzy Logic Technique. (1965)

      Grid Based . (1988)

      Genetic Algorithm Technique. (1989)

      PRM (Probabilistic Roadmap). (1996)

      Ant Colony Optimization technique. (1992)

      Rapidly Exploring Random Tree. (1998)

      Particle Swarm Optimization Technique. (1995)

      Virtual Impedance Method.

      Bacterial Foraging Optimization. (2002)

      Convex Hull and Local Search Method.

      Bee Colony Optimization Technique. (2005)

      Divide and Conquer Method.

      Firefly Algorithm Optimization Technique. (2008)

      Grey Wolf Optimization. (2014)

        1. Classical Approach

          1. Potential Field Method

            The difference between things that fascinate and repulse might be thought of as a potential field [32]. The primary inspiration for a possible field approach is nature. For instance, a charged molecule exploring an attracting field or a tiny ball descending down a slope, depending on the quality of the field or the angle of the slope, the molecule or the ball may land to the source of the field, the valley, or the magnet in this case. In robotics, the attraction of a robot may be recreated with identical effects towards its goal by creating an artificial potential field. We can construct the robot display using the fundamentals of insufficient potential field designing. Assume, for illustration, that there are no obstacles in the surroundings and that a robot must find a route to go there. When using traditional planning methods, one must first determine the robot's relative location to the objective before applying the appropriate forces to move the robot in that direction. Simply create an appealing field that moves toward the objective when using a potential field strategy. The potential field is distinct throughout the entirety of free space, and we compute the potential field at the robot's position in each step time before calculating the force this field induces. Robot should then move in accordance with this produced force. Robotic behaviour can also be programmed to avoid impediments. We just construct each barrier and create an offensive field around it. The machine or robot is pushed away from the impediment as it approaches it by the active repulsion power.

            In situations where robots must avoid obstacles, the Potential Field technique and its modified versions are frequently utilised as motion controllers [3031]. Artificial potential fields have been discussed by Cetin et al. [33], fuzzy logic-based potential fields have been used by Feilat et al. [34], multipoint potential fields have been used in an obstruction prevention problem by Subramanian et al. [35], and decentralised potential field-based controllers have been used by Song [37]. Vinoy and Tanner The potential field for collision avoidance and motion planning in non-holomonic mobile robots is described in [36] by Bence Kovacs et al.[12] According to approach, the contact between humans and robots becomes noticeably more normal and natural by changing the regular movement attributes of animal to robot movement. Additionally, it turns out to be simpleto understand the robot's current condition and aspirations for the future. Due to local minima, a lack of separation between widely spaced obstructions, movements inside the line of sight of an obstacle, or in a restricted entry or small passage, the potential field technique is constrained.

          2. Cell Decomposition Method

            The cell decomposition method offers a suggestion for distinguishing between geometric areas, or cells, that are empty and areas that are inhabited by items. This is a succinct representation of the fundamental path-planning cell decomposition method.

            • First, divide F into fundamental, connected regions known as "cells."

            • Second, create a "availability chart" by determining which open cells are adjacent.

            • Third, identify the cells in which the underlying and objective configurations are located, then look for a way to connect the underlying and objective cells in the availability chart.

            • After finding a grouping of cells using the right search technique, choose a path within each cell, such as by moving through a series of divider following movements or by the midpoints of the cell limits and developments along straight lines.

              The assignment of the boundaries between cells in cell breakdown methods is the most crucial factor. The technique is known as precise cell decomposition if the boundaries are determined based on the environment's structure, resulting in a lossless decomposition [41]. The system is known as approximate cell decomposition if it produces a map that is close to the real map [4243]. Probabilistic cell decomposition [4445] is similar to approximate cell decomposition, with the exception that cell boundaries do not have any physical significance. Robot motion planning scenarios frequently employ cell decomposition [44,46]. It was suggested by Fujii et al., Yang and Gu et al., and Park et al. [38-40] to divide up big learning environments into a number of smaller ones to facilitate exploration. The two main advantages of this technique are that the robot's workspace will deteriorate naturally and that the state of the cells will be organised in a robust and flexible manner. Both precise and approximative cell breakdown offer benefits and drawbacks. The former are guaranteed to be complete, indicating that if a free path exists, precise cell breakdown will find it; nevertheless, the trade-off for this exactness is a more challenging scientific procedure. Although approximate cell decomposition is less common, it can produce results that are comparable to, if not identical to, those of precise cell decomposition.

          3. Grid Based Method

            In a grid-based technique, a grid is superimposed on the configuration space, with the assumption that each configuration is identified by a grid point. Every grid point allows a robot to go to a neighbouring lattice focus as long as the space between them is completely contained inside Cfree (tested by collision detection). Similar to how A* search algorithms are used to establish a path from the start to the target, this discretizes the arrangement of activities. Finding a grid resolution was necessary for this kind of techniques or approaches. With coarser lattices, pursuit moves more quickly; nevertheless, this algorithm struggles to find paths across small pieces of Cfree. Furthermore, because of the exponential growth of the number of foci on the matrix in the design space measurement, they are inappropriate for high-dimensional problems. Markus Schutz et al. [11] claim that including free space data into these matrices improves both the performance of the calculation when compared to a point-following calculation and the shape estimation when compared to a box model-based calculation. It is beneficial to lessen the impact of the division and affiliation faults.

          4. Probabilistic Road Map Method

            According to the PRM approach, the configuration-free space (prearrangement of practicable motions) is removed, condensed to, or represented by a system of 1-D lines. Movement planning becomes a graph searching challenge as a result of the system-restricted response search. The terms skeleton, retreat, and highway approach are also used to describe this particular strategy. According to this method [26], the robot's locomotion is prepared in three steps: (a) the robot advances from its initial configuration to a point on the probabilistic road map (PRM), using a conventional locomotion strategy; (b) the robot advances from the target configuration through a point on the road map; and (c) finally, the start configuration and target configuration points are combined to obtain the desired path. All topologically discrete viable pathways in configuration space must be characterised by the road map [3]. The robot locomotion algorithm is lacking if not. The Subgoal Network [7], Visibility Graph [76], Cell Decomposition [6], Silhouette [5], and Voronoi Diagram [4] are the preeminent route maps. The main goal of lazy PRM, according to Robert Bohlin et al. [22], is to reduce the amount of crash checks when searching through a roadmap with respect to a PRM organiser in the quickest possible manner, which is done at the expense of standard graph seek.

            Fig. 2. Probabilistic road map with goal and end points

            According to Yan et al. [25], adaptive cross sampling is used in the design phase of multi-robot motion simulation to reduce time and the likelihood of collisions. By employing an intelligent technique in the learning phase that permits deactivation of the least probable configuration, Rantanen and Juhola [27] improve the execution time of the roadmap. Single query roadmaps are used by Nazif et al. [28] to map situations inside uncharted areas using a swarm of robots; benefits include agent failure robustness and efficiency in congested locations with constrained passageways. The configuration space is reduced using Rantanen's [77] modified probabilistic roadmap method by sensing the configuration space for difficult-to-navigate areas

            (such as places with tight pathways). With the potential to address a variety of constraints, Yang and Brock [29] used an elastic roadmap framework for motion planning. These constraints included the robot's kinematic and dynamic limitations, challenges brought on by the presence of moving obstacles, limitations resulting from the task, and workspace connectivity.

          5. Rapidly Exploring Random Tree Method

            Random trees are a new data structure and method designed for quickly exploring nonconvex high-dimensional areas with resourcefulness. These are built progressively, which quickly reduces the estimated distance between the tree and a randomly chosen location. For planning a path-oriented issue with differentiable restrictions and impediments, they are only partially accepted.

          6. Virtual Impedance Test

            Motion smoothness is improved for a flexible robot using the Virtual Impedance approach. This method improves robot performance under dynamic circumstances with movable and stationary obstacles. Furthermore, it is more effective than earlier methods, as may be seen from the simple structure of the aforementioned algorithm. On a physically movable flexible robot stage in the interior setting, analyses of the process are conducted. By switching the separation flexible robot and impediment to a virtual power dismissing robot from snags, impedance control technique is introduced into crash shirking computation [63]. The main challenge for the adaptable robot headway control is productivity and smoothness change. Teleoperated headway controller connected through self-governing impact shirking is an adequate approach in practical application, especially in light of independent crash evasion's excellent performance in constrained local space. Eun Soo, Seul, and colleagues [63] demonstrated virtual power on a mobile robot by using resistance as a spring and impedance control computation to maintain a desired separaion to avoid obstacles. A technique for impact avoidance through its condition is the non-contacting impedance limitation, which is implemented in the controller's conduct control [64]. However, it has also been included into the movement planning of portable robots [65-68]. The non-contacting impedance drive is used by Fumiaki et al. to operate a legged control adaptable robot that can avoid stairs without reaching [65].

          7. Convex Hull and Local Search Method

            Convex hulls have shown to be a very useful shape for handling a variety of computational difficulties, such as automated highlight recognition from 2-D and 3-D. The smallest arched polygon that encloses S is the curved frame of an arrangement of foci S in a plane. As it were, the encasing polygon with the smallest region and boundary is the curved structure of an arrangement of foci S in a plane. The framework employs the arched structure limit for the specified arrangement of focuses as its fundamental sub-visit in this instance. A neighbouring inquiry heuristic is gradually connected once all of the offered foci have been incorporated into the method. The relationship between each point inside the curved body limit and the arched edges may be established without a combinatorial search since each point is identified in a family pecking order. Six fundamental processes link the creation of a curved frame limit with the progressive application of a local look heuristic. The first step for a given arrangement of focuses is to create an arched body of these focuses for which a modified Graham scan algorithm is connected, after which comes the system for making locals. If every point is local, local enhancement methodology is used, which typically involves building a raised family tree, after which comes local connecting, and finally a streamlined approach is achieved. If each city is located on the edge of the curved frame, then each euclidean TSP has an optimal configuration, according to Flood [69], who studies these features. To build an inclusion strategy for the focuses that are not on the curved structure limit, the raised frame sub-visit should be combined with a heuristic hunt for a non-specific TSP.

          8. Divide and Conquer Method

      Various scholars have provided descriptions of the divide and conquer method's use in mobile robot motion planning. The interaction between the robot and its working environment was covered by Hirota et al. [70]. They have adapted the divide and conquer approach of problem-solving in order to make the search simpler, narrow the search space, make the task of defining fitness functions easier, and acquire a distributed controlling system. Instead of utilising an evolutionary method to create a straight-forward control system, they intended to decompose the overall assignment to meet the behaviour of an architecturally based controller. This would allow them to create discrete behavioural modules and arbitrators. They've also demonstrated their findings through experimentation. A technique based on the quadtree approach has been provided by Nagabhushan et al. [71] for developing the shortest path from a given goal location to any specified destination position. Recursive partition is used in calculation, which defeats plan approach. Their suggested calculations operate in a 2-D stationary state with obstacles of various kinds and virtually unrestricted machine size.

        1. Artificial Intelligence ( Heuristic approach )

          1. Neural Network Technique

            The organic sensory systems, such as the brain, which process data input are the inspiration for the notion of a neural network used for data management. The brain functions as a highly complex, parallel, nonlinear computer concept. This concept's key component is the framework for processing processed data, which has an inventive structure. Neurons, which are numerous interconnected handling components, are developed to handle certain problems. The robot's restricted 2-D operating environment is completely opaque to obstacles of any kind and does not exhibit any curved suspicion of their presence. Each

            neuron and its local has a similar association in the neural system, which uses neural system about a nearby connection to represent the arrangement space of the mechanism work. The neural system has a fairly parallel architecture and uses two paths to transmit data between neurons. Simple, short meetings are the key to the path planning technique. Different preferences are incorporated, such as adaptive learning, self-organization, real-time operation, and fault tolerance through redundant information coding, wherein a system's partial destruction causes the execution of that system to become corrupted. In any event, some system abilities may have the potential for serious system damage. An issue is that the desired quantity will increase as the number of obstructions increases; hence, the ideal path could not be ideal. Lebedev et al. [74] have introduced a new kind of neural system process called the dynamic wave expansion (DWENN) in a neural network. It is used to play out the path generating that didn't require any prior knowledge of the surroundings or a learning process. The DWENN progression causes movement waves to arise in the system field, and a summary of the exchanged action refreshes the corresponding action levels of neurons. Zhu et al. [75] present a system for movement planning that is coordinated with dynamic, many errands task to the group of robots. In light of the neural system, it resolves the problem using the self-organizing map (SOM).

          2. Fuzzy Logic Technique

            Lotfi Zadeh introduced the fuzzy logic system for the first time in 1965. Fuzzy logic provides a formal mental process for communicating with and carrying out the heuristic information and observation-based actions of hominid experts. Fuzzy logic is based on the notion that people think about concepts rather than precise numbers while making decisions. A fuzzy logic concept is used in these kinds of circumstances because self-governing mobile robot route planning involves a great deal of environmental sensitivity and is unable to categorise the scenario clearly. Fuzzy logic has the advantages of greater continuous execution, robustness, and the absence of new state changes. This can be explained by the fact that the principles are directly descended from the experience of early hominids and are hence exempt from the problem of local minimization. In a fuzzy based route controller, the problem is broken down into simpler tasks, and each action is composed of a series of fuzzy logic run articulations that are intended to reach a very specific set of destinations. The fuzzy controller divides the routine motion of a mobile robot into three discrete tasks: pursuing a goal, dodging obstacles, and following edges. There has been a thorough examination of fuzzy logic control for movement organising [72]. G. Oriolo [73] presents an algorithmic organisation technique that builds and modifies the environment map using the fuzzy system. Measurement ranges are obtained using the robot's exterior sensors and prepared for use in creating a local map-based depiction of the surrounding area.

          3. Genetic Algorithm Technique

            A genetic algorithm (GA) is a novel meta-heuristic advancement technique that relies on the principles of natural selection and genetics. Professor J. Holland of Michigan University first introduced a genetic algorithm in 1975 [47]. The underlying principle behind genetic algorithms is to mimic the concept of "survival of the fittest." These algorithms replicate the processes seen in a typical framework where the strong have a propensity to adapt and survive while the weakest have a propensity to perish [9]. For upgrading and inquiry problems that involve bio-inspired operators like mutation, crossover, and selection, GA provides excellent solutions [48]. Utilizing certain genetic processes like mutation, crossover, and selection, a new population is produced. A series of sentences can be used to address the population (referred as chromosomes). Every generation builds a new chromosome using information derived from the population's fittest chromosomes.

            A GA begins its investigation with a random collection of solutions, usually encoded as binary strings. Each agreement has a fitness that is explicitly connected to the pursuit and advancement issue's objective capacity. In this manner, the population for the arrangements is shifted to another population by applying three operators that are similar to natural genetic operatorsreproduction, mutation, and crossover. It operates iteratively by gradually applying each of these three operators until a termination requirement is satisfied. Because of their simplicity, global perspective, and inherent parallel handling, GAs have been successfully linked to a wide range of difficulties during the past ten years.

            According to Adem Tuncer et al. [23], the enhanced mutation technique simultaneously examines all of the unconnected nodes in the vicinity of the mutation node rather than arbitrarily selecting a node one at a time, and it accepts the node based on the fitness estimation of the overall path rather than the bearing of development through the mutated node. Wang Jianguo et al. [24] demonstrate that the approach prompts join at the worldwide ideal value with high speed, demonstrating the adaptable execution of the advancements of the workplaces.

          4. Ant Colony Optimization Technique

            In order to solve computational difficulties, the widely used ant colony optimization approach, which is probabilistic in nature and may be condensed in order to discover the optimal pathways from the graphs, was introduced by Marco Dorigo [59]. ACO is based on the behaviour of ant colonies. The ants' connected communication, which is the heart of their behaviour, enables them to find the shortest route between their home and their food sources. The best path is found by measuring the amount of pheromones (chemical essence) left behind by ants on their travel routes. These traits/features of actual ants are gathered by the ACO process to address the problem of discrete optimization. The ACO is therefore considerably more suitable for problems where the source and target are clearly established and specific.

            The following is the main ACO methodology:

            • Produce an ant (or ants) and loop for each ant until the entire assignment is finished.

            • pheromone storage on frequented areas and locations that are ant-covered (s).

            • Daemon exercises and pheromone dissipation.

            Fig. 3. Ant colony system

            The ant colony is combined with a sample-based location-to-location path planning approach to address multi- objective arranging challenges when obstructions are present. Execution is evaluated quantitatively using two preexisting sample-based techniques. The ACO approach provides a trade-off between speed and value of the arrangement. Given the physical constraints of robotics route planning, it is the choice that is made most frequently.

          5. Partical Swarm Optimization Technique

            A populace-based exploring technique is Particle Swarm Optimization (PSO). The most used artificial intelligence optimization technique is PSO. It is based on how fish in a pool or a flock of birds behave when looking for food. In PSO, a population is created by generating a large number of particles at random. In contrast to GA, the particles in PSO are not eliminated. The particles move around the multidimensional space in search of the perfect configuration. A possible resolution is the particle's optimization issue. Within the multidimensional space, every particle moves. The speed of the particle controls how it moves. The following formulae are used to compute the particle velocity:

            Particles are drawn to migrate toward a place in the search space by the best individual and swarm finds [49]. The PSO termination criterion may be a predetermined number of iterations, particle convergence, or if the global best remains unchanged for a predetermined number of iterations. For PSO to operate at its best, the inertia weights and constants must be chosen properly. In the case of the hill-climbing incapacity solution, it has drawbacks in terms of controlling influences, premature convergence, and a lack of dynamic velocity adjustment react [50]. Numerous adjustments are recommended [50] to address the issue of managing the parameters, and in certain cases, the algorithm would work better if one of the crucial elements of the velocity equation were removed or even if a new element were introduced [5154]. The two main advantages of PSO in relation to GA, according to Qin et al. [55], are simpler execution and fewer parameters. PSO performance has consistently outperformed GA in research investigations [48,56-58].

            According to Kun Su et al. [14], the particle swarm strategy with constant weight exhibits higher performance in quick convergence and dynamic merging and can be a good choice for resolving the robot motion planning issue. According to Md. Rakibul Islam et al. [15], one method to describe the favourable circumstances of the approach is the way that the directions collected are safe and smooth while also being free of local traps due to the incorporation of real-time sensor data in the recalculation of the path. The planned approach is flexible, allowing you to alter any parameters or regulate the importance of avoiding or moving closer to the goal.

          6. Bacterial Foraging Optimization Technique

            A new method in the family of optimization techniques inspired by nature is the bacteria foraging optimization algorithm (BFOA). The central concept of the unique approach is the utilisation of a swarm of E. coli bacteria's foraging strategy in multi-objective function optimization. An individual bacteria communicates for others by delivering signals. According to Md. Arafat Hossain et al. [18], it selects the particle separation that best fits the objective and the particle's Gaussian cost capability. The choice is then made using a high-level decision making technique, and the conclusion is then dealt with by using a simple robot sensor to deal with the local arena state. According to Xiao-dan Liang et al. [19], that robot mimics bacteria's capacity to control an optimum path free of obstacles between a starting point and a destination point in an environment filled with obstacles.

          7. Bee Colony Optimization Technique

            A swarm-based meta-heuristic approach used for improving numerical problems is the artificial bee colony (ABC) algorithm, which was first introduced by D. Karaboga in 2005 [10]. The honey bees' clever foraging techniques brought life to it. Foraging bees that are engaged and not, as well as food sources, are the three main components of the concept. The first two sections look for abundant food sources close to their hive. The two defining characteristics of model behaviour are also enrollment of foragers in rich food sources resulting in positive input and surrender of weak sources by foragers resulting in unfavourable critique, which are essential for self-sorting out and aggregating information. According to Marco Cruz et al. [16], the ABC algorithm is used to carry out local searches that progressively build a path without colliding with the beginning and ending locations of the mobile robot. Evolutionary programming is then used to carry out a refinement of the practical path. Experiments show that the suggested method outperforms the PSO and DE based path planning scheme for two unquestionably well-known metrics: ATPT and AUTD, as stated by Preetha Bhattacharjee et al. [17].

          8. Fire Fly Algorithm Optimization Technique

            A firefly produces light through a process called bioluminescence, and the light it emits serves as a signal to attract other fireflies. The rhythm of the ash light is wholly responsible for the appeal with bth male and female "reies." It is possible to examine the rate of light extinction and the duration of the process. This may be used as an objective function to describe an unique optimization technique that might be offered to be optimised. Only when the other fly has a higher light intensity is it possible for one fly to become fascinated by the other, and this essential concept served as the foundation for FA's operation.

          9. Gray Wolf Optimization Technique

      Grey wolves are at the pinnacle of the natural way of life; they like to live in packs or groups most of the time. They have an incredibly rigid social hierarchy that is quite fascinating. In GWO,,, and are frequently used to aid estimation of the hurtling. After these three wolves, it is up to the wolves.

      encompassing prey Grey wolves surround their prey during hunting, and it has been projected [13] to statistically illustrate this behaviour in relation to the surrounding circumstances:

      Where Xprey and Xwolf are the position vectors of the prey and wolves, respectively; D is the distance vector between the grey wolf and the prey; C and A are coefficient vectors; t is the current emphasis/current iteration; the vector component of an is directly decreased from 2 to 0 throughout the emphases; and finally, r1 and r2 are the irregular vectors as [0,1].

      Sen Zhang et al. [20] claim that GWO exhibits an extraordinary aberrant condition of local optima avoidance, increasing the likelihood of locating accurate approximations of the ideal weighted total cost of this approach. Additionally, due to the extensive use of the GWO, the resulting optimal values for weighted sum cost have extremely high accuracy. According to Pei-

      Wei Tsai et al. [21], the robot may expand the position of the globally best agent in each iteration using sequence permutation after two standards for distance and smooth path of the robot path arrangement issue are turned into a minimization one for fitness function.


      The most widely utilised strategies in path planning for mobile robots are described here for further study, despite the fact that several varied techniques in this regard have been created and are still being worked on globally. Particle swarm, ant colony, bee colony, bacterium forging, and firefly approaches are some of the most recently created ones. The Firefly approach is comparatively new and offers a lot of potential for mobile robot navigation. It comes into contact with every major concert, for instance, FA is able to locate the most practical approach in a comparatively short amount of time, which provides improved efficacy. This technique allows a viable path to avoid any known barrier in the area, ensuring the safety of planning. Additionally, it consistently follows the planned course with accuracy. Additionally, it lowers motion planning problems including computational complexity, local minima, and algorithm tweaking requirements. In terms of time and path attainability, it enhances the excellent arrangement.


The benefits and drawbacks of various path planning strategies for autonomous mobile robots were briefly presented and evaluated. Each strategy in this vast area of study on mobile robot route planning is thoroughly discussed. A fascinating aspect of this study is that, despite significant advancements over the previous three decades, relatively little work, particularly in multirobotics systems, has been documented. The majority of studies discuss single robotic systems, leaving a large number of topics in coordinated and networked multi-robotics systems available for future research. The motion planning method is divided into two primary folds in this manuscript: a classical approach and a heuristic approach. The traditional strategy is simple to execute, but it frequently needs reliable information about the current navigational environment, necessitating the use of more precise sensors. Heuristic (metaheuristic) techniques are more cerebral and inventive than the traditional approach because they can adapt to both uncertain (unknown) and deficient information in a constantly changing environment. At first, innovative applications such as organise directing, circuit board outline, PC motions, animations, pharmaceutical prescription plans, and computational science further logically more enliven the improvement in path planning. The scientist's team proposes many approaches for dealing with the path planning problem.


[1] Ehlert, P. A. M. "The use of Artificial Intelligence Robots." Report on research project, Delft University of Technology, Netherlands (1999).

[2] Mohanty, Prases K., and Dayal R. Parhi. "Optimal path planning for a mobile robot using cuckoo search algorithm." Journal of Experimental & Theoretical Artificial Intelligence 28.1-2 (2016): 35-52.

[3] Hwang, Yong K., and Narendra Ahuja. "Gross motion planninga survey." ACM Computing Surveys (CSUR) 24.3 (1992): 219-291.

[4] Takahashi, Osamu, and Robert J. Schilling. "Motion planning in a plane using generalized Voronoi diagrams." IEEE Transactions on robotics and automation 5.2 (1989): 143-150.

[5] Canny, John. The complexity of robot motion planning. MIT press, 1988.

[6] Keil, J. Mark, and Jorg-R. Sack. "Minimum decompositions of polygonal objects." Machine Intelligence and Pattern Recognition. Vol. 2. North- Holland, 1985. 197-216.

[7] Faverjon, Bernard, and Pierre Tournassoud. "A local based approach for path planning of manipulators with a high number of degrees of freedom." Proceedings. 1987 IEEE international conference on robotics and automation. Vol. 4. IEEE, 1987.

[8] Russell, Stuart J. Artificial intelligence a modern approach. Pearson Education, Inc., 2010.

[9] Ab Wahab, Mohd Nadhir, Samia Nefti-Meziani, and Adham Atyabi. "A comprehensive review of swarm optimization algorithms." PloS one 10.5 (2015): e0122827.

[10] Karaboga, Dervis. An idea based on honey bee swarm for numerical optimization. Vol. 200. Technical report-tr06, Erciyes university, engineering faculty, computer engineering department, 2005.

[11] Schütz, Markus, et al. "Occupancy grid map-based extended object tracking." 2014 IEEE Intelligent Vehicles Symposium Proceedings. IEEE, 2014. [12] Kovács, Bence, et al. "A novel potential field method for path planning of mobile robots by adapting animal motion attributes." Robotics and

Autonomous Systems 82 (2016): 24-34.

[13] Mirjalili, Seyedali, Seyed Mohammad Mirjalili, and Andrew Lewis. "Grey wolf optimizer." Advances in engineering software 69 (2014): 46-61. [14] Su, Kun, YuJia Wang, and XinNan Hu. "Robot path planning based on random coding particle swarm optimization." International journal of

advanced computer science and applications 6.4 (2015): 58-64.

[15] Islam, Md Rakibul, et al. "Autonomous robot path planning using particle swarm optimization in dynamic environment with mobile obstacles & multiple target." International conference on mechanical, industrial and energy engineering. 2014.

[16] Contreras-Cruz, Marco A., Victor Ayala-Ramirez, and Uriel H. Hernandez-Belmonte. "Mobile robot path planning using artificial bee colony and evolutionary programming." Applied Soft Computing 30 (2015): 319-328.

[17] Bhattacharjee, Preetha, et al. "Multi-robot path-planning using artificial bee colony optimization algorithm." 2011 Third World Congress on Nature and Biologically Inspired Computing. IEEE, 2011.

[18] Hossain, Md Arafat, and Israt Ferdous. "Autonomous robot path planning in dynamic environment using a new optimization technique inspired by bacterial foraging technique." Robotics and Autonomous Systems 64 (2015): 137-141.

[19] Liang, Xiao-dan, et al. "Mobile robot path planning based on adaptive baterial foraging algorithm." Journal of Central South University 20.12 (2013): 3391-3400.

[20] Zhang, Sen, et al. "Grey wolf optimizer for unmanned combat aerial vehicle path planning." Advances in Engineering Software 99 (2016): 121-136. [21] Tsai, Pei-Wei, and Thi-Kien Dao. "Robot path planning optimization based on multiobjective grey wolf optimizer." International Conference on

Genetic and Evolutionary Computing. Springer, Cham, 2016.

[22] Bohlin, Robert, and Lydia E. Kavraki. "Path planning using lazy PRM." Proceedings 2000 ICRA. Millennium conference. IEEE international conference on robotics and automation. Symposia proceedings (Cat. No. 00CH37065). Vol. 1. IEEE, 2000.

[23] Tuncer, Adem, and Mehmet Yildirim. "Dynamic path planning of mobile robots with improved genetic algorithm." Computers & Electrical Engineering 38.6 (2012): 1564-1572.

[24] Jianguo, Wang, et al. "Path planning of mobile robot based on improving genetic algorithm." Proceedings of the 2011 International Conference on Informatics, Cybernetics, and Computer Engineering (ICCE2011) November 1920, 2011, Melbourne, Australia. Springer, Berlin, Heidelberg, 2011.

[25] Yan, Zhi, Nicolas Jouandeau, and Arab Ali Cherif. "ACS-PRM: Adaptive cross sampling based probabilistic roadmap for multi-robot motion planning." Intelligent Autonomous Systems 12. Springer, Berlin, Heidelberg, 2013. 843-851.

[26] Siegwart, Roland, Illah Reza Nourbakhsh, and Davide Scaramuzza. Introduction to autonomous mobile robots. MIT press, 2011.

[27] Rantanen, Mika T., and Martti Juhola. "A configuration deactivation algorithm for boosting probabilistic roadmap planning of robots." International Journal of Automation and Computing 9.2 (2012): 155-164.

[28] Nazif, Ali Nasri, Alireza Davoodi, and Philippe Pasquier. "Multi-agent area coverage using a single query roadmap: A swarm intelligence approach." Advances in practical multi-agent systems. Springer, Berlin, Heidelberg, 2010. 95-112.

[29] Yang, Yuandong, and Oliver Brock. "Elastic roadmapsmotion generation for autonomous mobile manipulation." Autonomous Robots 28.1 (2010): 113-130.

[30] Beard, Randal W., and Timothy W. McLain. "Motion planning using potential fields." (2003).

[31] Song, Peng, and Vijay Kumar. "A potential field based approach to multi-robot manipulation." Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No. 02CH37292). Vol. 2. IEEE, 2002.

[32] Latombe, Jean-Claude. Robot motion planning. Vol. 124. Springer Science & Business Media, 2012.

[33] Cetin, Omer, Ibrahim Zagli, and Guray Yilmaz. "Establishing obstacle and collision free communication relay for UAVs with artificial potential fields." Journal of Intelligent & Robotic Systems 69.1 (2013): 361-372.

[34] Jaradat, Mohammad Abdel Kareem, Mohammad H. Garibeh, and Eyad A. Feilat. "Autonomous mobile robot dynamic motion planning using hybrid fuzzy potential field." Soft Computing 16.1 (2012): 153-164.

[35] Subramanian, Saravanakumar, Thomas George, and Asokan Thondiyath. "Obstacle avoidance using multi-point potential field approach for an underactuated flat-fish type AUV in dynamic environment." International Conference on Intelligent Robotics, Automation, and Manufacturing. Springer, Berlin, Heidelberg, 2012.

[36] Valbuena, Luis, and Herbert G. Tanner. "Hybrid potential field based control of differential drive mobile robots." Journal of intelligent & robotic systems 68.3 (2012): 307-322.

[37] Song, Peng, and Vijay Kumar. "A potential field based approach to multi-robot manipulation." Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No. 02CH37292). Vol. 2. IEEE, 2002.

[38] Fujii, Teruo, et al. "Multilayered reinforcement learning for complicated collision avoidance problems." Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No. 98CH36146). Vol. 3. IEEE, 1998.

[39] Park, Kui-Hong, Yong-Jae Kim, and Jong-Hwan Kim. "Modular Q-learning based multi-agent cooperation for robot soccer." Robotics and Autonomous systems 35.2 (2001): 109-122.

[40] Yang, Erfu, and Dongbing Gu. Multiagent reinforcement learning for multi-robot systems: A survey. tech. rep, 2004.

[41] Barbehenn, Michael, and Seth Hutchinson. "Toward an exact incremental geometric robot motion planner." Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots. Vol. 3. IEEE, 1995.

[42] Zhu, David, and Jean-Claude Latombe. New heuristic algorithms for efficient hierarchical path planning. STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, 1989.

[43] Conte, Gianpaolo, and Romolo Zulli. "Hierarchical path planning in a multi-robot environment with a simple navigation function." IEEE Transactions on Systems, Man, and Cybernetics 25.4 (1995): 651-654.

[44] Lingelbach, Frank. "Path planning using probabilistic cell decomposition." IEEE International Conference on Robotics and Automation, 2004.

Proceedings. ICRA'04. 2004. Vol. 1. IEEE, 2004.

[45] Rosell, Jan, and Pedro Iniguez. "Path planning using harmonic functions and probabilistic cell decomposition." Proceedings of the 2005 IEEE international conference on robotics and automation. IEEE, 2005.

[46] eda, Milo. "Roadmap methods vs. cell decomposition in robot motion planning." Proceedings of the 6th WSEAS international conference on signal processing, robotics and automation. Athens, Greece: World Scientific and Engineering Academy and Society (WSEAS), 2007.

[47] Holland, John H. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence.

MIT press, 1992.

[48] Poli, Riccardo, James Kennedy, and Tim Blackwell. "Particle swarm optimization." Swarm intelligence 1.1 (2007): 33-57.

[49] Stacey, Andrew, Mirjana Jancic, and Ian Grundy. "Particle swarm optimization with mutation." The 2003 Congress on Evolutionary Computation, 2003. CEC'03.. Vol. 2. IEEE, 2003.

[50] Vesterstrom, Jakob, and Rene Thomsen. "A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems." Proceedings of the 2004 congress on evolutionary computation (IEEE Cat. No. 04TH8753). Vol. 2. IEEE, 2004.

[51] Chang, Bill CH, et al. "Particle swarm optimisation for protein motif discovery." Genetic Programming and Evolvable Machines 5.2 (2004): 203-214. [52] Peer, Edwin S., Frans van den Bergh, and Andries P. Engelbrecht. "Using neighbourhoods with the guaranteed convergence PSO." Proceedings of

the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No. 03EX706). IEEE, 2003.

[53] Peram, Thanmaya, Kalyan Veeramachaneni, and Chilukuri K. Mohan. "Fitness-distance-ratio based particle swarm optimization." Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No. 03EX706). IEEE, 2003.

[54] Yang, Chunming, and Dan Simon. "A new particle swarm optimization technique." 18th International Conference on Systems Engineering (ICSEng'05). IEEE, 2005.

[55] Qin, Yuan-Qing, et al. "Path planning for mobile robot using the particle swarm optimization with mutation operator." Proceedings of 2004 international conference on machine learning and cybernetics (IEEE Cat. No. 04EX826). Vol. 4. IEEE, 2004.

[56] Fourie, P. C., and Albert A. Groenwold. "The particle swarm optimization algorithm in size and shape optimization." Structural and Multidisciplinary Optimization 23.4 (2002): 259-267.

[57] Pugh, Jim, and Alcherio Martinoli. "Multi-robot learning with particle swarm optimization." roceedings of the fifth international joint conference on Autonomous agents and multiagent systems. 2006.

[58] Pugh, Jim, Alcherio Martinoli, and Yizhen Zhang. "Particle swarm optimization for unsupervised robotic learning." Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005.. IEEE, 2005.

[59] Drigo, M. "The Ant System: Optimization by a colony of cooperating agents." IEEE Transactions on Systems, Man, and Cybernetics-Part B 26.1 (1996): 1-13.

[60] Mei, Hao, Yantao Tian, and Linan Zu. "A hybrid ant colony optimization algorithm for path planning of robot in dynamic environment." International Journal of Information Technology 12.3 (2006): 78-88.

[61] Zhang, Qi, Jiachen Ma, and Qiang Liu. "Path planning based quadtree representation for mobile robot using hybrid-simulated annealing and ant colony optimization algorithm." Proceedings of the 10th World Congress on Intelligent Control and Automation. IEEE, 2012.

[62] Shi, Chunxue, Yingyong Bu, and Jianghui Liu. "Mobile robot path planning in three-dimensional environment based on ACO-PSO hybrid algorithm." 2008 IEEE/ASME International Conference on Advanced Intelligent Mechatronics. IEEE, 2008.

[63] Jang, Eun Soo, Seul Jung, and Tien C. Hsia. "Collision avoidance of a mobile robot for moving obstacles based on impedance force control algorithm." 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems. IEEE, 2005.

[64] Takemori, Fumiaki, et al. "Mobility of legged robot by non-contact impedance control." 2008 IEEE/ASME International Conference on Advanced Intelligent Mechatronics. IEEE, 2008.

[65] Tsukamoto, Kenji, et al. "Virtual impedance model for obstacle avoidance in a limb mechanism robot." The 2010 IEEE International Conference on Information and Automation. IEEE, 2010.

[66] Janabi-Sharifi, Farrokh, and Iraj Hassanzadeh. "Experimental analysis of mobile-robot teleoperation via shared impedance control." IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 41.2 (2010): 591-606.

[67] Ko, Jae-Pyung, and Jang-Myung Lee. "Tactile tele-operation of a mobile robot with a collision vector." Robotica 24.1 (2006): 11-21.

[68] Lee, Wei-Po, John Hallam, and Henrik Hautop Lund. "Learning complex robot behaviours by evolutionary computing with task decomposition." European Workshop on Learning Robots. Springer, Berlin, Heidelberg, 1997.

[69] Nagabhushan, P., and MM Manohara Pai. "Cognition of free space for planning the shortest path: A framed free space approach." Pattern recognition letters 22.9 (2001): 971-982.

[70] Saffiotti, Alessandro. "The uses of fuzzy logic in autonomous robot navigation." Soft computing 1.4 (1997): 180-197.

[71] Oriolo, Giuseppe, Giovanni Ulivi, and Marilena Vendittelli. "Real-time map building and navigation for autonomous robots in unknown environments." IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 28.3 (1998): 316-333.

[72] Zhu, Anmin, and Simon X. Yang. "A neural network approach to dynamic task assignment of multirobots." IEEE transactions on neural networks 17.5 (2006): 1278-1287.

[73] Asano, Takao, et al. "Visibility-polygon search and Euclidean shortest paths." 26th annual symposium on foundations of computer science (SFCS 1985). IEEE, 1985.

[74] Rantanen, Mika T. "A connectivity-based method for enhancing sampling in probabilistic roadmap planners." Journal of Intelligent & Robotic Systems 64.2 (2011): 161-178.