Pattern Analysis and Intelligent Systems
Zeynab Sedreh; Mehdi Sadeghzadeh
Volume 5, Issue 1 , February 2019, , Pages 19-26
Abstract
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as ...
Read More
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most of the routing methods, the environment is known, although, in reality, environments are unpredictable;But with the help of simple methods and simple changes in the overall program, one can see a good view of the route and obstacles ahead. In this research, a method for solving robot routing problem using cellular automata and genetic algorithm is presented.In this method, the working space model and the objective function calculation are defined by cellular automata, and the generation of initial responses and acceptable responses is done using the genetic algorithm.During the experiments and the comparison we made, we found that the proposed algorithm yielded a path of 28.48 if the lengths of the paths obtained in an environment similar to the other algorithm of 15 / 32, 29.5 and 29.49, which is more than the proposed method.
Software Engineering and Information Systems
mehdi Sadeghzadeh
Volume 3, Issue 1 , February 2017, , Pages 31-38
Abstract
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version ...
Read More
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed system the produced versions are located. By selecting a suitable place for versions, the versions having performance, efficiency and lower access time are used. In this study, an efficient method is presented to select the best place for those versions created in data grid by using the users’ firefly algorithm which is compared with cooling algorithm. Results show that firefly algorithm has better performance than others.This means firefly algorithm is better and more accurate than genetic algorithm and particle swarm optimization in data replication task.