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

Content Provider	IEEE Xplore Digital Library
Author	Rahnama, B. Elci, A. Ozermen, C.
Copyright Year	2013
Description	Author affiliation: Dept. of Electr. & Electron. Eng., Aksaray Univ., Isparta, Turkey (Elci, A.) \|\| Dept. of Comput. Eng., Eur. Univ. of Lefke, Gemikonagi, Turkey (Rahnama, B.; Ozermen, C.)
Abstract	This 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 $ALCK_{EF}$ 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.
Sponsorship	IEEE Reg. 08 - Europe, Middle East, Africa
Starting Page	573
Ending Page	578
File Size	844440
Page Count	6
File Format	PDF
ISBN	9781467356121
e-ISBN	9781467356138
DOI	10.1109/TAEECE.2013.6557338
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-05-09
Publisher Place	Turkey
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Maze Solving Algorithms Flood Fill Cooperative Labyrinth Discovery ALCKEF Robots Modified Flood Fill
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Design and Implementation of a Novel Weighted Shortest Path Algorithm for Maze Solving Robots

Design and Implementation of a Robot for Maze-Solving using Flood-Fill Algorithm

Maze Solving Algorithms for Micro Mouse

An Image Processing Approach to Solve Labyrinth Discovery Robotics Problem

Design and implementation of a robot for maze-solving using flood-fill algorithm.

Study on Flood-fill Algorithm Used in Micromouse Solving Maze

Quantitative Comparison of Flood Fill and Modified Flood Fill Algorithms

A Comprehensive and Comparative Study of Maze-Solving Techniques by Implementing Graph Theory

Fault-tolerant algorithm for a mobile robot solving a maze

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

Similar Documents

Design and Implementation of a Novel Weighted Shortest Path Algorithm for Maze Solving Robots

Design and Implementation of a Robot for Maze-Solving using Flood-Fill Algorithm

Maze Solving Algorithms for Micro Mouse

An Image Processing Approach to Solve Labyrinth Discovery Robotics Problem

Design and implementation of a robot for maze-solving using flood-fill algorithm.

Study on Flood-fill Algorithm Used in Micromouse Solving Maze

Quantitative Comparison of Flood Fill and Modified Flood Fill Algorithms

A Comprehensive and Comparative Study of Maze-Solving Techniques by Implementing Graph Theory

Fault-tolerant algorithm for a mobile robot solving a maze

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