This paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere

Artificial Neural Networks (ANN) is one of the important statistical methods that are widely used in a range of applications in various fields, which simulates the work of the human brain in terms of receiving a signal, processing data in a human cell and sending to the next cell. It is a system consisting of a number of modules (layers) linked together (input, hidden, output). A comparison was made between three types of neural networks (Feed Forward Neural Network (FFNN), Back propagation network (BPL), Recurrent Neural Network (RNN). he study found that the lowest false prediction rate was for the recurrentt network architecture and using the Data on graduate students at the College of Administration and Economics, Univer

This paper deals with constructing mixed probability distribution from mixing exponential

In this research we assumed that the number of emissions by time (𝑡) of radiation particles is distributed poisson distribution with parameter (𝑡), where  < 0 is the intensity of radiation. We conclude that the time of the first emission is distributed exponentially with parameter 𝜃, while the time of the k-th emission (𝑘 = 2,3,4, … . . ) is gamma distributed with parameters (𝑘, 𝜃), we used a real data to show that the Bayes estimator 𝜃 ∗ for 𝜃 is more efficient than 𝜃̂, the maximum likelihood estimator for 𝜃 by using the derived variances of both estimators as a statistical indicator for efficiency

      In this research, the nonparametric technique has been presented to estimate the time-varying coefficients functions for the longitudinal balanced data that characterized by observations obtained through (n) from the independent subjects, each one of them is measured repeatedly by group of  specific time points (m). Although the measurements are independent among the different subjects; they are mostly connected within each subject and the applied techniques is the Local Linear kernel LLPK technique. To avoid the problems of dimensionality, and thick computation, the two-steps method has been used to estimate the coefficients functions by using the two former technique. Since, the two-

This work analyzes the effectiveness of an artificial intelligence (AI) community- building workshop designed for high school teachers and it focuses on contemporary issues related to AI concepts and applications. A group of high school teachers from local education districts attended a one-day AI hands-on workshop at our university. The workshop included several AI-related topics and hands-on examples and exercises aiming to introduce AI concepts and tools relevant to pre-college education. The participating teachers were expected to become a part of a collaborative network created to design, develop, and implement novel AI learning modules for high school students. Initial and a post-training surveys have been used to measure the

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res