This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algorithm and other two state-of-the-art algorithms. This study showed that the proposed method is effective and produces trajectories with satisfactory results.
Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima
... Show MoreThis research is based on interaction of two most important variables to the business organizations in the current era , these two variables are (marketing orientation and quality of service), this research is trying to urge the service organizations to reconsider the mechanisms adopted in the formulation of its plans, It was the application of research in Korek Telecom and Asia Cell Telecom as a sector of service active and important in the business sector in Iraq, the information was obtained through the design of the Likert questionnaire , it was distributed (92) questionnaire , (50) for the company Korek Telecom and (42) of the Asia-Cell and represent research population sample
... Show MoreBioavailability is the objective for an optimum formulation. The target of the analysis is to maximize both the fluidity and disintegration profile of class II weakly compounds that are water-soluble. Anti-dyslipidemia drug rosuvastatin calcium (RC) (bioavailability 20%) through formulating as nanofibers (NFs) using electrospinning (ES) technology. Twenty formulas were prepared, and different polymers and polymer combinations with various concentrations were used such as polyethylene oxide (PEO) polyvinyl pyrrolidine (PVPK-30), and hydroxypropyl methylcellulose (HPMC). Three distinct groups of maximum parameters, including polymeric solution, electrospinning method, and ambient parameter, are capable of influencing the creation alon
... Show MoreThe advertising has emerged as an effective force and an effective instrument upon with all organizations and companies depend on achieving their goals. In additional to the need to use promote sales, The nature and objective of advertising go beyond the scope of specific personal communication to a broader and more effective range for consumers from multiple groups and combination play need to use as well as the need to use means of communication than com convey the message more professional, The coincides with the rapid and remarkable development of all different media technologies and as much as possible social networking sites including mobile phone companies. The advertising has emerged as an effective force and an effective instrum
... Show MoreKrawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the
... Show More