In this work, we use the explicit and the implicit finite-difference methods to solve the nonlocal problem that consists of the diffusion equations together with nonlocal conditions. The nonlocal conditions for these partial differential equations are approximated by using the composite trapezoidal rule, the composite Simpson's 1/3 and 3/8 rules. Also, some numerical examples are presented to show the efficiency of these methods.

This paper presents a novel inverse kinematics solution for robotic arm based on artificial neural network (ANN) architecture. The motion of robotic arm is controlled by the kinematics of ANN. A new artificial neural network approach for inverse kinematics is proposed. The novelty of the proposed ANN is the inclusion of the feedback of current joint angles configuration of robotic arm as well as the desired position and orientation in the input pattern of neural network, while the traditional ANN has only the desired position and orientation of the end effector in the input pattern of neural network. In this paper, a six DOF Denso robotic arm with a gripper is controlled by ANN. The comprehensive experimental results proved the appl

This paper presents a newly developed method with new algorithms to find the numerical solution of nth-order state-space equations (SSE) of linear continuous-time control system by using block method. The algorithms have been written in Matlab language. The state-space equation is the modern representation to the analysis of continuous-time system. It was treated numerically to the single-input-single-output (SISO) systems as well as multiple-input-multiple-output (MIMO) systems by using fourth-order-six-steps block method. We show that it is possible to find the output values of the state-space method using block method. Comparison between the numerical and exact results has been given for some numerical examples for solving different type

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

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

In this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.

Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.