Fuzzy-genetic algorithms and mobile robot navigation among static obstacles

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 1, Issue , 1999, Pages 327-334

  Kumar Pratihar, D ^a   Deb, Kalyanmoy ^a   Ghosh, Amitabha ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

FUZZY LOGIC; GENETIC ALGORITHMS; MOBILE ROBOTS;

FUZZY - GENETIC ALGORITHMS; FUZZY LOGIC APPROACH; FUZZY LOGIC CONTROLLERS; GENETIC ALGORITHM (GAS); INITIAL POPULATION; MOBILE ROBOT NAVIGATION; NEAR-OPTIMAL SOLUTIONS; SEARCH ALGORITHMS;

ALGORITHMS;

EID: 0742276609     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.781943     Document Type: Conference Paper

References (28)

1. Zadeh, L. A. (1965). Fuzzy Sets. Information and Control, 8, 338-353.
2. Mamdani E. H. and Assilian S. (1975). An Experiment in Linguistic Synthesis with a Fuzzy Logic Controller. International Journal of Man-Machine Studies, 7, 1-13.
3. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Michigan: University of Michigan Press.
4. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA: Addison-Wesley.
5. Deb, K. (1995). Optimization for Engineering Design. New Delhi: Prentice-Hall.
6. Karr, C. L. (1991). Design of an Adaptive Fuzzy Logic Controller Using a Genetic Algorithm. Proceedings of the 4th International Conference on GAs, 450-457.
7. Herrera, R, Lozano, M. and Verdegay, J. L. (1995). The use of fuzzy connectives to design real-coded genetic algorithms. Mathware and Soft Computing, 1, (3), 239-251.
8. Lee. M. A. and Takagi, H. (1993). Dynamic control of genetic algorithms using fuzzy logic techniques. Proceedings of the Fifth International Conference on Genetic Algorithms, 76-83.
9. Latombe, J. C. (1991). Robot Motion Planning Norwell, MA: Kluwer Academic Publishing.
10. Lozano-Perez, T. and Wesley, M. A, (1969). An algorithm for planning collision-free paths among polyhedral obstacles. ACM, 22, (10), 560-570.
11. Leven, D. and Sharir, M. (1987). Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams. Discrete Comput. Geometry, 2, 9-31.
12. Lozano-Perez, T. (1983). Spatial Planning: A configuration space Approach. IEEE Transactions on Computers, C-32, (2), 108-120.
13. O'Dunlaing, C. and Yap, C. (1982). A Retraction Method for Planning the Motion of a Disc. Journal of Algorithms, 6, 104-111.
14. Brooks, R. A, (1983). Solving the Find-path Problem by Good Representation of Free space. IEEE Transactions on Systems, Man and Cybernetics, SMC-13, (3), 190-197.
15. Warren, C. H. (1989). Global Path Planning Using Artificial Potential Fields. Proceedings of IEEE International Conference on Robotics and Automation 316-321.
16. Schwartz, J. T. and Sharir, M. (1983). On the Piano Movers' Problem: I. The case if a Two-Dimensional Rigid Polygonal Body Moving Amidst Polygonal Barriers. Communications on Pure and Applied Mathematics, 36, 345-398.
17. Schwartz, J. T. and Sharir, M. (1983). On the Piano Movers' Problem: II. General Techniques for Computing Topological Properties of Real Algebraic Manifolds. Advances in Applied Mathematics, 4, 298-351.
18. Schwartz, J. T. and Sharir, M. (1983). On the Piano Movers' Problem: III, Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers. The International Journal of Robotics Research, 2, (3), 46-75.
19. Schwartz, J. T. and Sharir, M. (1983). On the Piano Movers' Problem: V. The Case of a Rod Moving in Three-Dimensional Space Amidst Polyhedral Obstacles. Communications on Pure and Applied Mathematics, 37, 815-848.
20. Sharir, M. and Ariel-Sheffi, E. (1983). On the Piano Movers' Problem: IV. Various Decomposable Two-Dimensional Planning Problems. Communications on Pure and Applied Mathematics, 37, 479-493.
21. Kim, B. and Shin, K. G. (1984). An efficient minimum-time robot path planning under realistic constraints. Proceedings American Control Conference. 296-303.
22. Reister, D. B. and Lenhart, S. M. (1995). Time-Optimal Paths for High-Speed Maneuvering. The International Journal of Robotics Research, 14, (2), 184-194.
23. Liu, Y. H. and Arimoto, S. (1991). Proposal of tangent graph and extended tangent graph for path planning of mobile robots. Proceedings of IEEE International Conference on Robotics and Automation. 312-317.
24. Reif, J. H. (1979). Complexity of the Movers' Problem and Generalizations. Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science (FOCS), 421-427.
25. Beaufrere, B. and Zeghloul, S. (1995). A mobile robot navigation method using a fuzzy logic approach. Robotica, 13, 437-M8.
26. Deb, K. and Agrawal, R. B. (1995). Simulated Binary Crossover for Continuous Search Space. Complex Systems 9, 115-148.
27. Deb, K. and Kumar, A. (1995). Real-coded genetic algorithms with simulated binary crossover: Studies on multimodal and multiobjective problems. Complex Systems 9(6), 431-454.
28. Deb, K. and Goyal, M. (1998). A robust optimization procedure for mechanical component design based on genetic adaptive search. Transactions of the ASME: Journal of Mechanical Design 120(2), 162-164.