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.
المستودع الرقمي العراقي. مركز المعلومات الرقمية التابع لمكتبة العتبة العباسية المقدسة
Bioavailability 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 Moreabstract
the research discussed a stage of strategic management. The strategic of the evaluation of the proposed strategy through feedback is to ensure that it is implemented with the least possible variation. The research aims at evaluation a proposed strategy for the Ministry of Planning for the years 2018-2022 in line with the orientations of the state, taking into account the surrounding environmental conditions. It relies on scientific bases and steps to formulate the strategy The extent of the strategy suitability was tested through a set of statistical means and its objectivity was verified through a survey of a number of specialized experts who were selected in accordance with the principle
... Show MoreDeveloping smart city planning requires integrating various techniques, including geospatial techniques, building information models (BIM), information and communication technology (ICT), and artificial intelligence, for instance, three-dimensional (3D) building models, in enabling smart city applications. This study aims to comprehensively analyze the role and significance of geospatial techniques in smart city planning and implementation. The literature review encompasses (74) studies from diverse databases, examining relevant solutions and prototypes related to smart city planning. The focus highlights the requirements and preparation of geospatial techniques to support the transition to a smart city. The paper explores various aspects,
... Show MoreBroyden update is one of the one-rank updates which solves the unconstrained optimization problem but this update does not guarantee the positive definite and the symmetric property of Hessian matrix.
In this paper the guarantee of positive definite and symmetric property for the Hessian matrix will be established by updating the vector which represents the difference between the next gradient and the current gradient of the objective function assumed to be twice continuous and differentiable .Numerical results are reported to compare the proposed method with the Broyden method under standard problems.
In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.
There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that
... Show More