Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)

Text Clustering consists of grouping objects of similar categories. The initial centroids influence operation of the system with the potential to become trapped in local optima. The second issue pertains to the impact of a huge number of features on the determination of optimal initial centroids. The problem of dimensionality may be reduced by feature selection. Therefore, Wind Driven Optimization (WDO) was employed as Feature Selection to reduce the unimportant words from the text. In addition, the current study has integrated a novel clustering optimization technique called the WDO (Wasp Swarm Optimization) to effectively determine the most suitable initial centroids. The result showed the new meta-heuristic which is WDO was employed as t

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

<span lang="EN-US">Iraqi people have been without energy for nearly two decades, even though their geographic position provides a high intensity of radiation appropriate for the construction of solar plants capable of producing significant quantities of electricity. Also, the annual sunny hours in Iraq are between 3,600 to 4,300 hours which makes it perfect to use the photovoltaics arrays to generate electricity with very high efficiency compared to many countries, especially in Europe. This paper shows the amount of electric energy generated by the meter square of crystalline silicon in the photovoltaic (PV) array that already installed in 18 states in Iraq for each month of the year. The results of the meter-square of PV arr

Functionalized Multi-Walled Carbon Nanotubes (MWCNTs-OH) network with thickness 4μm was made by the vacuum filtration from suspension (FFS) method. The morphology, structure and optical properties of the MWCNTs film were characterized by SEM and UV-Vis. spectra techniques. The SEM images reflected highly ordered network in the form of ropes or bundles with close-packing which looks like spaghetti. The absorbance spectrum revealed that the network has a good absorbance in the UV-Vis. region. The gas sensor system was used to test the MWCNT-OH network to detect NH₃gas at room temperature. The resistance of the sensor was increased when exposed to the NH₃gas. The sensitivities of the network w

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the