FUZZY-GENETIC ALGORITHMS AND TIME-OPTIMAL OBSTACLE-FREE PATH GENERATION FOR MOBILE ROBOTS

This paper, describes a new yet efficient technique based on fuzzy logic and genetic algorithms (Gas) to solve the find-path problems of a mobile robot, which is formulated as a nonlinear programming problem. In the proposed algorithm, a fuzzy logic controller is used to find obstracle-free directions locally and GAs are used as optimizer to find optimal/near-optimal locations along the obstracle-free directions. This algorithm is found to be more efficient than a steepest gradient descent method. Although the fuzzy-GA method is shown to find slightly inferior or similar solutions to those found using the best-known tangent-graph and A* algorithms, it is computationally faster than them. Moreover, the fuzzy-GA approach is practically more viable than the tangent-graph method, because of former's lesser sensitivity to the number and type of obstacles. The efficiency of the proposed method demonstrated in this paper suggests that it can be extended to solve motion planning problems having moving obstacles.

[1]  Bart Kosko,et al.  Neural networks and fuzzy systems , 1998 .

[2]  Yunhui Liu,et al.  Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph , 1995, IEEE Trans. Robotics Autom..

[3]  Saïd Zeghloul,et al.  A mobile robot navigation method using a fuzzy logic approach , 1995, Robotica.

[4]  David B. Reister,et al.  Time-Optimal Paths for High-Speed Maneuvering , 1995, Int. J. Robotics Res..

[5]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[6]  José L. Verdegay,et al.  The use of fuzzy connectives to design real-coded genetic algorithms , 1994 .

[7]  Hideyuki Takagi,et al.  Dynamic Control of Genetic Algorithms Using Fuzzy Logic Techniques , 1993, ICGA.

[8]  S. Arimoto,et al.  Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles , 1992 .

[9]  Kalyanmoy Deb,et al.  Ordering Genetic Algorithms and Deception , 1992, PPSN.

[10]  Steven Dubowsky,et al.  On computing the global time-optimal motions of robotic manipulators in the presence of obstacles , 1991, IEEE Trans. Robotics Autom..

[11]  Sukhan Lee,et al.  Cellular robotic collision-free path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[12]  Yunhui Liu,et al.  Proposal of tangent graph and extended tangent graph for path planning of mobile robots , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[13]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[14]  C. L. Karr Design of an Adaptive Fuzzy Logic Controller Using a Genetic Algorithm , 1991, ICGA.

[15]  Charles W. Warren,et al.  Global path planning using artificial potential fields , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[16]  Joseph S. B. Mitchell,et al.  An Algorithmic Approach to Some Problems in Terrain Navigation , 1988, Artif. Intell..

[17]  Jean-Jacques E. Slotine,et al.  Improving the Efficiency of Time-Optimal Path-Following Algorithms , 1988, 1988 American Control Conference.

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[19]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

[20]  Tomas Lozano-Perez A simple motion-planning algorithm for general robot manipulators , 1986, IEEE J. Robotics Autom..

[21]  N. McKay,et al.  A dynamic programming approach to trajectory planning of robotic manipulators , 1986 .

[22]  Kang G. Shin,et al.  Minimum-time control of robotic manipulators with geometric path constraints , 1985 .

[23]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[24]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[25]  Kang G. Shin,et al.  Minimum-time path planning for robot arms and their dynamics , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[26]  J. Schwartz,et al.  On the Piano Movers''Problem V: The Case of a Rod Moving in Three-Dimensional Space amidst Polyhedra , 1984 .

[27]  J. Schwartz,et al.  On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

[28]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[29]  S. Dubowsky,et al.  On the Optimal Control of Robotic Manipulators with Actuator Constraints , 1983, 1983 American Control Conference.

[30]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[31]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[32]  Rodney A. Brooks,et al.  Solving the find-path problem by good representation of free space , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

[33]  C. Lin,et al.  Optimum Path Planning for Mechanical Manipulators , 1981 .

[34]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[35]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[36]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[37]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.