Biped robots have gained much attention for decades. A variety of researches has been conducted to make them able to assist or even substitute for humans in performing special tasks. In addition, studying biped robots is important in order to understand the human locomotion and to develop and improve control strategies for prosthetic and orthotic limbs. Some challenges encountered in the design of biped robots are: (1) biped robots have unstable structures due to the passive joint located at the unilateral foot-ground contact. (2) They have different configuration when switching from walking phase to another. During the singlesupport phase, the robot is under-actuated, while turning into an over-actuated system during the double-support phase. (3) Biped robots have many degrees of freedom (DOFs). (4) Biped robots interact with different unknown environments. Therefore, this work attempts to investigate and resolve different issues encountered in dynamics, walking pattern generators and control of biped robots; the details as follows: • Dynamics Two walking patterns have been modeled using two well-known formulations: Lagrangian and the modified recursive Newton-Euler (N-E) formulations. The first walking pattern moves with 6 DOFs during the single support phase (SSP) changing its configuration with 7 DOFs during the double support phase (DSP) (the stance foot will move directly during the DSP). Whereas the other walking pattern has 6 DOFs during all walking phases (the SSP and the two sub-phases of the DSP); the stance foot will be fixed during the first sub-phase of the DSP. These two walking pattern are different in configuration and number of phases during the DSP. To resolve the problem of over-actuation, a linear transition function is proposed to ensure smooth transition for the biped from the SSP to the DSP and vice versa. If we assume ideal dynamic response, this strategy can resolve the discontinuity in input control torque and ground reaction forces. • Walking pattern generators Two methods have been used to generate walking patterns of biped mechanism which are (1) optimal control theory and (2) center of gravity (COG)-based model. Computational optimal control has been performed to investigate the effects of some imposed constraints on biped locomotion, such as enforcing swing foot to move level to the ground, hip motion with constant height etc. finite difference approach has been used to transcribe infinite dimensional optimal control problem into finite dimensional suboptimal control problem. Then parameter optimization has been used to get suboptimal trajectory of the biped with the imposing different constraints. In general, any artificially imposed constraint to biped locomotion can lead to increase in value of input control torques. On the other hand, suboptimal trajectory of biped robot during complete gait cycle had been accomplished with different cases such that continuous dynamic response occurs. Enforcing the biped locomotion to move with linear transition of zero-moment point (ZMP) during the DSP can lead to more energy consumption. Using the simple COG-based model, a comparative study has been conducted to generate continuous motion for COG of the biped; all these methods depend on linear pendulum model. It has been shown all these methods are equivalent. On the other hand, the effect of foot configuration has been investigated. Foot rotation can improve biped configuration at heel strike by controlling foot angle. In addition, foot motion with impact can give some freedom and uniform biped configuration compared with motion without impact. To compensate for the deviation of ZMP trajectory due to approximate model of the COG, a novel strategy has been proposed to satisfy kinematic and dynamic constraints, as well as singularity condition. A stable motion has been obtained for the target walking patterns. • Low-level control Two control schemes have been proposed based on dynamics formulations which are conventional adaptive control based on local approximation technique and Lagrangian formulation, and virtual decomposition control (VDC) based on local approximation technique and recursive N-E formulation. In the first approach (conventional control), a new representation of dynamic matrices has been coined which is computationally efficient than other representation (sparse-base representation, Kronecker product etc.). Controller structures for the SSP and the DSP have been designed in details. Since adaptive control assumes no prior knowledge of estimated weighting matrices; therefore, zero input control torques could be result in at the beginning of each phase. Consequently, discontinuous dynamic response could result. The VDC is an efficient tool for complex robotic system such as biped robot. Therefore each subsystem (link, joint) has been controlled using adaptive approximation–based VDC. A novel optimization technique has been used to deal with continuous dynamic response; however, using zero initial weighting matrices for estimation dynamic matrices and vectors could result in zero input control at beginning of each walking phases.
(5)
(3)
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 b
... Show More
(8)
planning 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 More
(6)
(4)
There is various human biometrics used nowadays, one of the most important of these biometrics is the face. Many techniques have been suggested for face recognition, but they still face a variety of challenges for recognizing faces in images captured in the uncontrolled environment, and for real-life applications. Some of these challenges are pose variation, occlusion, facial expression, illumination, bad lighting, and image quality. New techniques are updating continuously. In this paper, the singular value decomposition is used to extract the features matrix for face recognition and classification. The input color image is converted into a grayscale image and then transformed into a local ternary pattern before splitting the image into
... Show More
(6)
(1)
Integrating Renewable Energy (RE) into Distribution Power Networks (DPNs) is a choice for efficient and sustainable electricity. Controlling the power factor of these sources is one of the techniques employed to manage the power loss of the grid. Capacitor banks have been employed to control phantom power, improving voltage and reducing power losses for several decades. The voltage sag and the significant power losses in the Iraqi DPN make it good evidence to be a case study proving the efficiency enhancement by adjusting the RE power factor. Therefore, this paper studies a part of the Iraqi network in a windy and sunny region, the Badra-Zurbatya-11 kV feeder, in the Wasit governorate. A substation of hybrid RE sources is connected to this
... Show More
(5)
(1)
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More
<span>One of the main difficulties facing the certified documents documentary archiving system is checking the stamps system, but, that stamps may be contains complex background and surrounded by unwanted data. Therefore, the main objective of this paper is to isolate background and to remove noise that may be surrounded stamp. Our proposed method comprises of four phases, firstly, we apply k-means algorithm for clustering stamp image into a number of clusters and merged them using ISODATA algorithm. Secondly, we compute mean and standard deviation for each remaining cluster to isolate background cluster from stamp cluster. Thirdly, a region growing algorithm is applied to segment the image and then choosing the connected regi
... Show More
(15)
(6)
This paper studies the adaptive coded modulation for coded OFDM system using punctured convolutional code, channel estimation, equalization and SNR estimation. The channel estimation based on block type pilot arrangement is performed by sending pilots at every sub carrier and using this estimation for a specific number of following symbols. Signal to noise ratio is estimated at receiver and then transmitted to the transmitter through feedback channel ,the transmitter according to the estimated SNR select appropriate modulation scheme and coding rate which maintain constant bit error rate
lower than the requested BER. Simulation results show that better performance is confirmed for target bit error rate (BER) of (10-3) as compared to c