Robot Path Planning Using Cellular Automata and Genetic Algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Sedreh Zeynab; SADEGHZADEH MEHDI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY Year:2019 | Volume:5 | Issue:1 (serial 17) Page(s): 19-26

Download Full-Text

View:

215

Download:

123

Cites:

Information Journal Paper

Title

Robot Path Planning Using Cellular Automata and Genetic Algorithm

Author(s)

Sedreh Zeynab | SADEGHZADEH MEHDI | Issue Writer Certificate

Keywords

Robot Path Planning

Optimization Algorithms

Cellular Automata

Genetic Algorithm

Optimal Routing

Abstract

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most of the routing methods, the environment is known, although, in reality, environments are unpredictable; But with the help of simple methods and simple changes in the overall program, one can see a good view of the route and obstacles ahead. In this research, a method for solving robot routing problem using Cellular Automata and Genetic Algorithm is presented. In this method, the working space model and the objective function calculation are defined by Cellular Automata, and the generation of initial responses and acceptable responses is done using the Genetic Algorithm. During the experiments and the comparison we made, we found that the proposed algorithm yielded a path of 28. 48 if the lengths of the paths obtained in an environment similar to the other algorithm of 15 / 32, 29. 5 and 29. 49, which is more than the proposed method.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Sedreh, Zeynab, & SADEGHZADEH, MEHDI. (2019). Robot Path Planning Using Cellular Automata and Genetic Algorithm. JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY, 5(1 (serial 17)), 19-26. SID. https://sid.ir/paper/346330/en

Vancouver: Copy

Sedreh Zeynab, SADEGHZADEH MEHDI. Robot Path Planning Using Cellular Automata and Genetic Algorithm. JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY[Internet]. 2019;5(1 (serial 17)):19-26. Available from: https://sid.ir/paper/346330/en

IEEE: Copy

Zeynab Sedreh, and MEHDI SADEGHZADEH, “Robot Path Planning Using Cellular Automata and Genetic Algorithm,” JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY, vol. 5, no. 1 (serial 17), pp. 19–26, 2019, [Online]. Available: https://sid.ir/paper/346330/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops