Design and implementation of a novel weighted Shortest path algorithm for maze solving robots

Basit Öğe Kaydı
dc.contributor.authorRahnama, Behnam
dc.contributor.authorÖzdemir, Makbule Canan
dc.contributor.authorKiran, Yunus
dc.contributor.authorElçi, Atilla
dc.date.accessioned13.07.201910:50:10
dc.date.accessioned2019-07-16T08:40:44Z
dc.date.available13.07.201910:50:10
dc.date.available2019-07-16T08:40:44Z
dc.date.issued2013
dc.department[Rahnama, Behnam -- Ozdemir, Makbule Canan -- Kiran, Yunus] European Univ Lefke, Dept Comp Engn, Gemikonagi, North Cyprus, Turkey -- [Elci, Atilla] Aksaray Univ, Elect & Elect Eng Dept, Aksaray, Turkey
dc.descriptionIEEE 37th Annual Computer Software and Applications Conference (COMPSAC) -- JUL 22-26, 2013 -- Kyoto, JAPAN
dc.descriptionWOS:000331223100056
dc.description.abstractThis 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.
dc.description.sponsorshipIEEE, IEEE Comp Soc, Informat Proc Soc Japan, Korean Inst Informat Scientists & Engineers, CCF, Tateisi Sci & Technol Fdn, Kyoto Univ, Iowa State Univ Sci & Technol
dc.identifier.doi10.1109/COMPSACW.2013.49
dc.identifier.endpage332en_US
dc.identifier.isbn978-0-7695-4987-3
dc.identifier.scopusqualityN/A
dc.identifier.startpage328en_US
dc.identifier.urihttps://doi.org/10.1109/COMPSACW.2013.49
dc.identifier.urihttps://hdl.handle.net/20.500.12451/4052
dc.identifier.wosWOS:000331223100056
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherIEEE
dc.relation.ispartof2013 IEEE 37TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSACW)
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectLabyrinth
dc.subjectMaze Solving
dc.subjectCooperative Robotics
dc.subjectShortest Path
dc.titleDesign and implementation of a novel weighted Shortest path algorithm for maze solving robots
dc.typeConference Object

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
rahnama-behnam-2013.pdf
Boyut:
448.8 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