The Sliding Mode Control (SMC) has been among powerful control techniques increasingly. Much attention is paid to both theoretical and practical aspects of disciplines due to their distinctive characteristics such as insensitivity to bounded matched uncertainties, reduction of the order of sliding equations of motion, decoupling mechanical systems design. In the current study, two-link robot performance in the Classical SMC is enhanced via Adaptive Sliding Mode Controller (ASMC) despite uncertainty, external disturbance, and coulomb friction. The key idea is abstracted as follows: switching gains are depressed to the low allowable values, resulting in decreased chattering motion and control's efforts of the two-link robot system. Un-known uncertainty bounded and reducing switching gains can be considered major advantages of ASMC leading to outperform ASMC upon CSMC. Simulink MATLAB 2019a was used to obtain the simulation outcomes. The outcomes have shown that both methodologies had good tracking performance to the desired position and made the system asymptotically stable through the steady-state errors investigate approaching zero. ASMC is better than CSMC illustrated by minimizing gains values, control efforts, and chattering for each link.
2- amino -5- thiol-1,3,4- thiadiazole (S1) was prepared by cyclic locking of thiosemicarbazide in the presence of anhydrous sodium carbonate and CS2. diazotization of (S1) compound gave diazonium salt (S2) that reacts with different activated aromatic compounds to get the following azo compounds ,2 [(4- aminophenyl) diazenyl ] 1,3,4- thiazdiazole-5- thiol (S3) ,2-[4-amino- 1-naphthyl diazenyl] -1,3,4 – thiazdiazole-5-thiol (S4) , 3-amino-4-[(5- mercapto -1,3,4- thiadiazole -2-yl) diazenyl ] phenol(S5) ,1-[(5-mercapto-1,3,4-thiadiazole-2-yl) diazenyl] -2-naphthol (S6) , 5-{[4-(dimethylamino) phenyl] diazenyl}-1,3,4-thiadiazole-2- thiol(S7) ,5-{[4-(diethylamino) phenyl] diazenyl}-1,3,4- thiadiazole-2- thiol(S8) ,2- amino-5-[(5-mercapto-1,3
... Show Moreplanning is among the most significant in the field of robotics research. As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the
... Show MoreA 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 b
... Show MoreThis paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori
... Show More