This study was conducted to develop a software program which computes optimal path for autonomous navigation in orchard, especially for speed sprayer. Possibilities of autonomous navigation in orchard were shown by other researches which have minimized distance error between planned path and performed path. But, research of planning an optimal path for speed sprayer in orchard is hardly founded...

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. GRASP heuristics are multistart procedures which apply local search to a set of starting solutions generated with a randomized greedy algorithm or semi-greedy method. The best local optimum found over the iterations is returned as the heuristic solution. Path-relinking is a search intensific...

We prove the path-by-path well-posedness of stochastic porous media and fast diffusion equations driven by linear, multiplicative noise. As a consequence, we obtain existence random dynamical system. This solves an open problem raised in [Barbu Röckner (2011) [4] ], (2018) [6] [Gess (2014) [11] ]. Nous prouvons le caractère bien posé, trajectoire-par-trajectoire, des équations milieux poreux et...

In this work we have proposed an innovative and accurate solution for non-technical losses identification using the Optimum-Path Forest (OPF) classifier and its learning algorithm. Results in two datasets demonstrated that OPF outperformed the state of the art pattern recognition techniques and OPF with learning achieved better results for automatic nontechnical losses identification than recen...

Various algorithms have been proposed for the determination of the optimum path(s) in line networks. Moving in space under constraints is a far more complex problem, where research has been relatively scarce. An example would be the determination of the shortest sea course between two harbors. This paper presents a graph-based approach to the problem of the optimum path(s) finding in space; and...

This paper proposed a new approach for optimum path planning in 2D environments cluttered with static obstacles. The presented model consists of four steps.In the first step, the skeleton of free obstacles space is extracted. The thin lines are converted into a graph in the second step. the determination of shortest length trajectory is done in the third step. The last step is consacred to cons...

In cable trench construction, one of the tasks for engineers is to select a suitable route to minimize construction cost and obstructions. This paper discusses the development of a Geographic Information Systems (GIS)-based Customized system to automate the process of optimum shortest path finding for routing of underground power supply cable between any two substations. It combines the spatial...

Currently path-finding methods, which are widely used in GIS, rely on finding a path, which the sum of pixels’ weights on the path would be less than the other paths. According to dependency between sum of pixels' weights and length of path, decrementing of sum of pixels' weights can not considered as a proper criterion for optimum path finding. In addition, path length is not regarded as an in...