Abstract. This work presents a detailed design of a three-jointed tendon-driven robot finger with a cam/pulleys transmission and joint Variable Stiffness Actuator (VSA). The finger motion configuration is obtained by deriving the cam/pulleys transmission profile as a mathematical solution that is then implemented to achieve contact force isotropy on the phalanges. A VSA is proposed, in which three VSAs are designed to act as a muscle in joint space to provide firm grasping. As a mechatronic approach, a suitable type and number of force sensors and actuators are designed to sense the touch, actuate the finger, and tune the VSAs. The torque of the VSAs is controlled utilizing a designed Multi Input Multi Output (MIMO) fuzzy controller. The fuzzy controller input is the force sensors' signals that are used to set the appropriate VSA torque. The fuzzy controller parameters are then tuned using a genetic algorithm as an optimization technique. The objective function of the genetic algorithm is to avoid unbalance torque in the individual joints and to reduce the difference between the values of the supplied VSAs torques. Finally, the operation of the aforementioned finger system is organized through a simple control algorithm. The function of this algorithm is to enable the detection of the unknown object and simultaneously automatically activate the optimized fuzzy controller thus eliminating the necessity of any external control unit.
In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show MoreThe paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w
... Show MoreSoftware testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing
... Show MoreEnergy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit
... Show MoreIn networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f
... Show MoreSoftware testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing appli
... Show MoreThe search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.
In this research, a variable stiffness actuator is proposed to enhance the damping of the mechanical vibrating system. The frequency response analysis of the vibrating system is dependant in order to analyze and synthesis this semi-active damping, where the suggested process is using active filter to estimate the present frequency of the vibration system, and this will limit the value of the stiffness of the vibrated system. Two active filter s are needed, low-pass-filter (LPF) to choose the higher stiffness of the actuator at small frequencies as well as more damping and high-pass-filter (HPF) to choose the lower stiffness of the actuator at high frequencies as well as more damping, and so
... Show MoreIn the present work a dynamic analysis technique have been developed to investigate and characterize the quantity of elastic module degradation of cracked cantilever plates due to presence of a defect such as surface of internal crack under free vibration. A new generalized technique represents the first step in developing a health monitoring system, the effects of such defects on the modal frequencies has been the main key quantifying the elasticity modulii due to presence any type of un-visible defect. In this paper the finite element method has been used to determine the free vibration characteristics for cracked cantilever plate (internal flaws), this present work achieved by different position of crack. Stiffness re
... Show More