A demonstration of the inverse kinematics is a very complex problem for redundant robot manipulator. This paper presents the solution of inverse kinematics for one of redundant robots manipulator (three link robot) by combing of two intelligent algorithms GA (Genetic Algorithm) and NN (Neural Network). The inputs are position and orientation of three link robot. These inputs are entering to Back Propagation Neural Network (BPNN). The weights of BPNN are optimized using continuous GA. The (Mean Square Error) MSE is also computed between the estimated and desired outputs of joint angles. In this paper, the fitness function in GA is proposed. The sinwave and circular for three link robot end effecter and desired trajectories are simulated by MATLAB program. Joint angles and end effecter positions of robot results values of circular trajectory are better than joint angles end effecter positions of robot results values of NN work in another paper. Three link redundant robot workspace is also simulated. The outputs results of best three joint angles are evaluated for two trajectories sinwave and circular, with 50 generations the algorithm is fast. This paper presents the simulations results that are obtained based on MATLAB R2010b program.
In this study, the first kind Bessel function was used to solve Kepler equation for an elliptical orbiting satellite. It is a classical method that gives a direct solution for calculation of the eccentric anomaly. It was solved for one period from (M=0-360)° with an eccentricity of (e=0-1) and the number of terms from (N=1-10). Also, the error in the representation of the first kind Bessel function was calculated. The results indicated that for eccentricity of (0.1-0.4) and (N = 1-10), the values of eccentric anomaly gave a good result as compared with the exact solution. Besides, the obtained eccentric anomaly values were unaffected by increasing the number of terms (N = 6-10) for eccentricities (0.8 and 0.9). The Bessel
... Show MoreThe aim of this paper is to present method for solving ordinary differential equations of eighth order with two point boundary conditions. We propose two-point osculatory interpolation to construct polynomial solution.
Cu (In, Ga) Se2 (CIGS) nano ink were synthesized from molecular precursors of CuCl, In Cl3, GaCl3 and Se metal heated to 240 °C for 1 hour in N2-atmosphere to form CIGS nanocrystal ink, Thin films were deposited onto Au/soda-lime glass (SLG) substrates. This work focused on CIGS nanocrystals, including their synthesis and application as the active light absorber layer in photovoltaic devices (PVs). This approach, using spin-coating deposition of the CIGS light absorber layers (75 mg/ml and 150 nm thickness), without high temperature selenization, has enabled up to 1.398 % power conversion efficiency under AM 1.5 solar illumination. X-ray diffraction (XRD) studies show that the structural formation of CIGS chalcopyrite structure. The mo
... Show MoreThe investigation of determining solutions for the Diophantine equation over the Gaussian integer ring for the specific case of is discussed. The discussion includes various preliminary results later used to build the resolvent theory of the Diophantine equation studied. Our findings show the existence of infinitely many solutions. Since the analytical method used here is based on simple algebraic properties, it can be easily generalized to study the behavior and the conditions for the existence of solutions to other Diophantine equations, allowing a deeper understanding, even when no general solution is known.
In this paper, a cognitive system based on a nonlinear neural controller and intelligent algorithm that will guide an autonomous mobile robot during continuous path-tracking and navigate over solid obstacles with avoidance was proposed. The goal of the proposed structure is to plan and track the reference path equation for the autonomous mobile robot in the mining environment to avoid the obstacles and reach to the target position by using intelligent optimization algorithms. Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) Algorithms are used to finding the solutions of the mobile robot navigation problems in the mine by searching the optimal paths and finding the reference path equation of the optimal
... Show MoreRoughness length is one of the key variables in micrometeorological studies and environmental studies in regards to describing development of cities and urban environments. By utilizing the three dimensions ultrasonic anemometer installed at Mustansiriyah university, we determined the rate of the height of the rough elements (trees, buildings and bridges) to the surrounding area of the university for a radius of 1 km. After this, we calculated the zero-plane displacement length of eight sections and calculated the length of surface roughness. The results proved that the ranges of the variables above are ZH (9.2-13.8) m, Zd (4.3-8.1) m and Zo (0.24-0.48) m.
The aim of human lower limb rehabilitation robot is to regain the ability of motion and to strengthen the weak muscles. This paper proposes the design of a force-position control for a four Degree Of Freedom (4-DOF) lower limb wearable rehabilitation robot. This robot consists of a hip, knee and ankle joints to enable the patient for motion and turn in both directions. The joints are actuated by Pneumatic Muscles Actuators (PMAs). The PMAs have very great potential in medical applications because the similarity to biological muscles. Force-Position control incorporating a Takagi-Sugeno-Kang- three- Proportional-Derivative like Fuzzy Logic (TSK-3-PD) Controllers for position control and three-Proportional (3-P) controllers for force contr
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show More