Open Access Open Access  Restricted Access Subscription or Fee Access

Autonomous Robot Path Planning Using a Genetic Algorithm

J. Jeevamalar

Abstract


This paper discusses using a genetic algorithm, a search strategy based on models of evolution, to solve the problem of robotic path planning. This method provides a solid alternative to conventional methods of path planning. Aside from being efficient and robust, the optimization parameters for the desired path can be changed without changing the overall algorithm. Although this paper discusses the two dimensional mobile robot case the algorithm can easily be extended to three dimensions or a higher dimensional configuration space.

Keywords


Genetic Algorithm, Hybridization, Manipulator, Path Planning.

Full Text:

PDF

References


Choset, H., Lynch, K. M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L. E., et al. (2005). Principles of robot motion: theory, algorithms, and implementations. Boston: MIT Press.

Davidor, Yuval. (1990). Robot programming with a genetic algorithm. Proceedings of the 1990 IEEE International Conference on Computer Systems and Software Engineering, 186-191.

Hocaoğlu, Cem & Sanderson, Arthur C. (1998). Multi-dimensional path planning using evolutionary computation. Proceedings of the IEEE Conference on Evolutionary Computation, 165-170.

Holland, J.H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press.

Reif, J.H. (1979). Complexity of the mover’s problem and generalizations. Proceedings of the IEEE Transactions on Robotics and Automation, 421-427.




DOI: http://dx.doi.org/10.36039/AA082011016

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.