Calculating the Inverse Kinematic (IK) equations is a complex problem due to the nonlinearity of these equations. Choosing the end effector orientation affects the reach of the target location. The Forward Kinematics (FK) of Humanoid Robotic Legs (HRL) is determined by using DenavitHartenberg (DH) method. The HRL has two legs with five Degrees of Freedom (DoF) each. The paper proposes using a Particle Swarm Optimization (PSO) algorithm to optimize the best orientation angle of the end effector of HRL. The selected orientation angle is used to solve the IK equations to reach the target location with minimum error. The performance of the proposed method is measured by six scenarios with different simulated positions of the legs. The proposed

The important parameter used for determining the probable application of miscible displacement is the MMP (minimum miscibility pressure). In enhanced oil recovery, the injection of hydrocarbon gases can be a highly efficient method to improve the productivity of the well especially if miscibility developed through the displacement process. There are a lot of experiments for measuring the value of the miscibility pressure, but they are expensive and take a lot of time, so it's better to use the mathematical equations because of it inexpensive and fast. This study focused on calculating MMP required to inject hydrocarbon gases into two reservoirs namely Sadi and Tanomaa/ East Baghdad field. Modified Peng Robenson Equation of State was

This paper presents a meta-heuristic swarm based optimization technique for solving robot path planning. The natural activities of actual ants inspire which named Ant Colony Optimization. (ACO) has been proposed in this work to find the shortest and safest path for a mobile robot in different static environments with different complexities. A nonzero size for the mobile robot has been considered in the project by taking a tolerance around the obstacle to account for the actual size of the mobile robot. A new concept was added to standard Ant Colony Optimization (ACO) for further modifications. Simulations results, which carried out using MATLAB 2015(a) environment, prove that the suggested algorithm outperforms the standard version of AC

Suffer most of the facilities of the high cost of inventory , which affects the high cost of the product and thus affects many administrative decisions , as well as suffer the facilities of the systems developed by the provisions of inventory control , and this problem is exacerbated in the construction sector where the inventory in the form of Construction spin of the Year for another it becomes difficult to control the cost effectively , and is the research problem in question follows: What are the implications of the use of the system in time inventory accounting system for the contracting company does kills Alrkaah to the provisions of the cost of inventory and what is the optimal approach to inventory control ? Find assumed

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).