Ali Nodehi

Learn More
Mobile robot global path planning in a static environment is an important problem. This paper proposes a method of global path planning based on genetic algorithm to reach an optimum path for mobile robot with obstacle avoidance. In this method for decreasing the complexity, the two-dimensional coding for the path via-points was converted to one-dimensional(More)
Wireless sensor networks (WSNs) have been widely used in different applications. One of the most significant issues in WSNs is developing an efficient algorithm to monitor all the targets and, at the same time, extend the network lifetime. As sensors are often densely deployed, employing scheduling algorithms can be considered a promising approach that is(More)
This article reviews a method of histograms based on descriptors of SIFT and SURF and their application in Recognition of three-dimensional object recognition from various view. This method will be provided for Recognition of objects in a set of three-dimensional objects and images of ETH80 databases to assess the effectiveness of methods used in(More)
Quantum Evolutionary Algorithm (QEA) is a novel optimization algorithm which uses a probabilistic representation for solution and is highly suitable for combinatorial problems like Knapsack problem. Fractal image compression is a well-known problem which is in the class of NP-Hard problems. Genetic algorithms are widely used for fractal image compression(More)
Fractal Image Compression is a well-known problem which is in the class of NP-Hard problems. Quantum Evolutionary Algorithm is a novel optimization algorithm which uses a probabilistic representation for solutions and is highly suitable for combinatorial problems like Knapsack problem. Genetic algorithms are widely used for fractal image compression(More)
Fractal Image Compression is a well-known problem which is in the class of NP-Hard problems. Quantum Evolutionary Algorithm is a novel optimization algorithm which uses a probabilistic representation for solutions and is highly suitable for combinatorial problems like Knapsack problem. Genetic algorithms are widely used for fractal image compression(More)