Path planning algorithm for mobile robot based on multilayered cellular automata

Küçük Resim Yok

Tarih

2009

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Maltepe Üniversitesi

Erişim Hakkı

CC0 1.0 Universal
info:eu-repo/semantics/openAccess

Araştırma projeleri

Organizasyon Birimleri

Dergi sayısı

Özet

In the present work, it is described Motion Planner for mobile moving on terrains. we describe the architecture base on the paradigm of Cellular Automata. It can be applied to Euclidean workspace. We have studied an algorithm based on a Euclidean distance from goal and the score of each cell. We have Multilayered Cellular automata, these properties impart us having more than one mobile robot and different goals. Also Attraction layer is separated from Obstacle’s layer. These characteristics plus giving score to each cell enable our algorithm to find a way for continuing. In the first practice, the algorithm calculates the cells scores and by learning in each iteration it cause the algorithm comes more efficient in next practices.

Açıklama

Anahtar Kelimeler

Kaynak

International Conference of Mathematical Sciences

WoS Q Değeri

Scopus Q Değeri

Cilt

Sayı

Künye

Behmanesh, S., Javadi, H. S. ve Erfani, H. (2009). Path planning algorithm for mobile robot based on multilayered cellular automata. Maltepe Üniversitesi. s. 345.