Design and implementation of cooperative labyrinth discovery algorithms in multi-agent environment

Basit Öğe Kaydı
dc.contributor.authorRahnama, Behnam
dc.contributor.authorElçi, Atilla
dc.contributor.authorÖzermen, Cankat
dc.date.accessioned13.07.201910:50:10
dc.date.accessioned2019-07-16T08:22:53Z
dc.date.available13.07.201910:50:10
dc.date.available2019-07-16T08:22:53Z
dc.date.issued2013
dc.departmentRahnama, B., European University of Lefke, Dept. of Computer Engineering, Gemikonagi - KKTC, Turkey -- Elci, A., Aksaray University, Dept. of Electrical and Electronics Eng., Isparta, Turkey -- Ozermen, C., European University of Lefke, Dept. of Computer Engineering, Gemikonagi - KKTC, Turkey
dc.description2013 International Conference on Technological Advances in Electrical, Electronics and Computer Engineering, TAEECE 2013 -- 9 May 2013 through 11 May 2013 -- Konya -- 98483
dc.description.abstractThis research focuses on design and implementation of cooperative labyrinth discovery algorithms, specifically, discovering an unexplored maze with multiple robots working collaboratively. Solving a known maze using a single robot is straightforward. The robot looks around and memorizes the structure of the maze and it generates the solution track as a stack of consequent positions from the starting cell to the destination cell. The labyrinth discovery is known as a method of solving the maze when the wall structure is not known. There are various labyrinth discovery algorithms already implemented for a single agent but their extension to cooperating multiple agents is not straight forward and may not produce optimal solutions either. We designed and implemented single agent algorithms, namely Flood Fill (FF) and Modified Flood Fill (MFF), for multi-agent environment. In addition, a cooperative labyrinth discovery algorithm has been implemented based on the ALCKEF semantic logic. Then we compared their efficiency in theory and practice against the ideal case where agents are aware of the full maze structure. The theoretical comparison is done based on examining the time and space complexity. On the other hand, the experimental comparison examines the total cost for each of those algorithms to solve and discover the maze. © 2013 IEEE.
dc.identifier.doi10.1109/TAEECE.2013.6557338
dc.identifier.endpage578en_US
dc.identifier.isbn9781467356121
dc.identifier.scopusqualityN/A
dc.identifier.startpage573en_US
dc.identifier.urihttps://dx.doi.org/10.1109/TAEECE.2013.6557338
dc.identifier.urihttps://hdl.handle.net/20.500.12451/2665
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.relation.ispartof2013 The International Conference on Technological Advances in Electrical, Electronics and Computer Engineering, TAEECE 2013
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectALCKEF
dc.subjectCooperative Labyrinth Discovery
dc.subjectFlood Fill
dc.subjectMaze Solving Algorithms
dc.subjectModified Flood Fill
dc.titleDesign and implementation of cooperative labyrinth discovery algorithms in multi-agent environment
dc.typeConference Object

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
rahnama-behnam-2013.pdf
Boyut:
826.01 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

Bildiri ve Sunum Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu