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.
Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol
... Show More<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T
... Show MoreIn this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.
Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over
... Show MoreThe study using Nonparametric methods for roubust to estimate a location and scatter it is depending minimum covariance determinant of multivariate regression model , due to the presence of outliear values and increase the sample size and presence of more than after the model regression multivariate therefore be difficult to find a median location .
It has been the use of genetic algorithm Fast – MCD – Nested Extension and compared with neural Network Back Propagation of multilayer in terms of accuracy of the results and speed in finding median location ,while the best sample to be determined by relying on less distance (Mahalanobis distance)has the stu
... Show MoreThis research began by explaining its variables and dimensions especially the digital gap, which the authors explained it elaborately beginning with the concept, the reasons blind its emergence of its measurement, and how to treat it. The authors supposed the potentiality of relying on enforcing knowledge in general and the groups suffer from this gap in particular, especially the targeted knowledge to treat its subject.
As enforcing knowledge usually depends on some strategies or choices of organizational orientation among them is learning and training from one side, and communication, as an indicating factor for organizational effectiveness as the authors refer from the other side.
Electrochemical Grinding (ECG) process is a mechanically assisted electrochemical process for material processing. The process is able to successfully machine electrically conducting harder materials at faster rate with improved surface finish and dimensional control. This research studies the effect of applied current, electrolyte concentration, spindle speed and the gap between workpiece and tool on hardness and material removal rate during electrochemical grinding for stainless steel 316. The characteristic features of the electrochemical grinding process are explored through Taguchi-design-based experimental studies. The better hardness can be obtained at 10 A of the current, 150 g/l of the electrolyte concentration, 0.3 mm of gap an
... Show MoreThe main role of infill drilling is either adding incremental reserves to the already existing one by intersecting newly undrained (virgin) regions or accelerating the production from currently depleted areas. Accelerating reserves from increasing drainage in tight formations can be beneficial considering the time value of money and the cost of additional wells. However, the maximum benefit can be realized when infill wells produce mostly incremental recoveries (recoveries from virgin formations). Therefore, the prediction of incremental and accelerated recovery is crucial in field development planning as it helps in the optimization of infill wells with the assurance of long-term economic sustainabi