| Yazarlar (4) |
Behnam Rahnama
Lefke Avrupa University, Türkiye |
Arş. Gör. Makbule ÖZDEMİR
Lefke Avrupa University, Türkiye |
|
Yunus Kiran
Lefke Avrupa University, Türkiye |
|
Atilla Elci
Aksaray University, Türkiye |
| Özet |
| This research presents design and implementation of the shortest path algorithm for labyrinth discovery application in a multi-agent environment. Robot agents are unaware of the maze at the beginning; they learn as they discover it. Each agent solves a part of the maze and updates the shared memory so that other robots also benefit from each other's' discovery. Finding of the destination cell by an agent helps others to interconnect their discovered paths to the one ending with the destination cell. The proposed shortest path algorithm considers the cost for not only coordinate distance but also number of turns and moves required to traverse the path. The Shortest Path algorithm is compared against various available maze solving algorithms including Flood-Fill, Modified Flood-Fill and ALCK(EF). The presented algorithm can be used also as an additional layer to enhance the available methods at second and subsequent runs. |
| Anahtar Kelimeler |
| Labyrinth | Maze Solving | Cooperative Robotics | Shortest Path |
| Bildiri Türü | Tebliğ/Bildiri |
| Bildiri Alt Türü | Tam Metin Olarak Yayınlanan Tebliğ (Uluslararası Kongre/Sempozyum) |
| Bildiri Niteliği | Web of Science Kapsamındaki Kongre/Sempozyum |
| DOI Numarası | 10.1109/COMPSACW.2013.49 |
| Bildiri Dili | İngilizce |
| Kongre Adı | IEEE 37th Annual Computer Software and Applications Conference (COMPSAC) |
| Kongre Tarihi | 22-07-2013 / 26-07-2013 |
| Basıldığı Ülke | Japonya |
| Basıldığı Şehir | Kyoto |
| Atıf Sayıları | |
| WoS | 1 |
