Optimal search path problem
OPTIMAL SOLUTION FOR SHORTEST PATH PROBLEM USING HEURISTIC SEARCH TECHNIQUE
... The optimality of MLL, the method presented in section 4, is heavily bounded by the optimality of A* itself. We have made use of the heuristic cost function f=g+h. Many efforts have been already done in this regard ...
10
Optimal Path Finding Method Study Based on Stochastic Travel Time
... shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree ...best-first search and ...
6
Base Station Localization and Optimized Placement using Cuckoo Search (CSA) Algorithm
... The problem considered in the research is to decide the best localities of BTSs to meet traffic ...demands. Optimal coverage of BTSs is essentially a resource allocation/optimization ...The path ...
6
Optimal Path Forecasting of an Autonomous Mobile Robot Agent Using Breadth First Search Algorithm
... multi-robot path planning problem is defined as follows: given a set of n AMRA in k-dimensional work space, each with an initial starting configuration and a desired target configuration, determine the ...
5
BahaBa: A Route Generator System for Mobile Devices
... a search problem where, from the initial node, or the start location, the search algorithm finds the fastest and lowest cost path to the goal node, or the target ...A* search algorithm ...
6
Solving shortest path problem using gravitational search algorithm and neural networks
... important problem by combining two algorithms: Gravitational Search Algorithm and Artificial Neural ...the optimal solution and many cannot get the answer in a reasonable amount of ...
19
A Comparison between Bat Algorithm and Cuckoo Search for Path Planning
... particular problem heuristic techniques were ...any optimal solution so they were categorized into problem dependent ...its problem independent ...
8
Comparing algorithms for the cow path problem with a non optimal seeker
... science, search problems are extensively studied problems. A well-known search problem is the cow-path problem, which was first known as the linear search ...cow-path ...
22
Vol 15, No 6 (2015)
... be optimal, it can also search for the shortest ...current problem belongs to the static simple pathfinding ...* search algorithm can be used to achieve the same speed as greedy best-first ...
13
Tool Path Optimization for Drilling Process by CNC Milling Machine Using Ant Colony Optimization (ACO)
... Tabu search approach proves that the total production cost can be reduced significantly in a reasonable search (Kolahan, ...the problem of the optimal route for drilling through TSP ...tool ...
5
Optimization of Wireless Sensor Networks Based on Differential Evolution Algorithm
... optimization problem of wireless sensor network (WSN) based on differential evolution, the single objective differential evolution algorithm is applied and combined with the advantages and disadvantages crossover ...
13
1. Shortest-path: dynamic and extensible indicator for geographical search on road networks
... an optimal path between two locations is a familiar problem in transportation ...system. Optimal path algorithms are prone to extensive research, in resulting a multiple approach for ...
7
The Optimal Path of the Chinese Renminbi
... model search path fol- lowed. Also, the cost of the search can be very high as the number of potential final models increases with the number of variables in the initial set, n variables implying 2 n ...
32
T-Forward Method: A Closed-Form Solution and Polynomial Time Approach for Convex Nonlinear Programming
... are path oriented and matrix oriented [1, 2]. Path oriented algorithm tries to search the optimal solution in the set of Basic Feasible Solution (BFS), which is the set of all feasible region ...
25
Simultaneous Optimal placement and sizing of distributed generation resources and shunt capacitors in radial distribution systems using Crow Search Algorithm
... the search in a local area in which a proper solution has been ...the search probability in the cur- rent proper solutions region decreases and CSA tends to check the search space on a global scale ...
14
Open pit limit optimization using dijkstra’s algorithm
... In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program ...
5
Optimal path planning for nonholonomic robotics systems via parametric optimisation
... the path planning problem for robotic systems this paper considers nonholonomic path planning on the Euclidean group of motions SE(n) which describes a rigid bodies path in n-dimensional ...
13
A New charged system Search for Solving Optimal Reactive Power Dispatch Problem
... first problem is the balance between exploration and exploitation in the beginning, during, and at the end of the search, and the second is how to deal with an agent violating the limits of the ...first ...
19
A Mazer with Genetic Algorithm
... find path from inside the maze to the goal position outside the maze Dead End filling algorithm works well in the case when the maze have multiple dead ends but fails to get the optimum path when there ...
7
Okapi-based XML indexing
... structured search in XML have been ...using path indexing ...time, path search run time and space costs using the INEX and Reuters RVC1 ...linear. Path search results show ...
27