Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.
 

Türkaslan, Umut

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12416/9010
Name Variants
Türkarslan, Umut
Job Title
Arş. Gör.
Email Address
Main Affiliation
Bilgisayar Mühendisliği
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

1

Articles

0

Views / Downloads

822/9

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

0

WoS h-index

0

Scopus h-index

0

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

0.00

Open Access Source

0

Supervised Theses

1

Google Analytics Visitor Traffic

Journals data is not available

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Filters

20051
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Master Thesis
    Solution of maze path finding problem using genetic algorithm
    (2005) Türkarslan, Umut
    The purpose of this study is to solve maze path finding problem by using genetic algorithm. An artificial agent supposed to be an autonomous mobile robot randomly tries to find a valid path between two specified locations by walking through a maze which is a two-dimensional static planar environment having barriers, free spaces and maze borders. Despite graphic simplicity of a maze, the underlying search problem is quite complex, since the robot lacks any remote sensing capabilities. Genetic Algorithms (GAs) are stochastic search algorithms based on the mechanics of Darwin's natural selection and genetics. In this study a genetic search method is developed to solve the robot navigation problem. The GA m continuously searches for valid and short paths between the specified locations in the maze by using string representations of paths as chromosomes. The main features of the implementation include a two-dimensional array as maze, robot class, robot objects, random walk exploration, and dedicated genetic operators. This study intends to be a contribution to nowadays' path finding systems