scholarly journals AN OPTIMAL PATH SEARCH USING THE SPATIAL-KEYWORD QUERY BY USING THE KEYWORD EXPAND CLOSER

2018 ◽  
Vol 5 (1) ◽  
pp. 11-16
Keyword(s):  
Optimal Path ◽  
Keyword Query ◽  
Spatial Keyword Query ◽  
Path Search

scholarly journals Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm

2012 ◽  
Vol 2012 ◽  
pp. 1-6 ◽  
Author(s):  
S. Hemalatha ◽  
P. Valsalal
Keyword(s):  
Power System ◽  
Transmission Line ◽  
Shortest Path ◽  
Voltage Stability ◽  
Optimal Path ◽  
Power Balance ◽  
Line Voltage ◽  
System Components ◽  
Path Search ◽  
Search Guidance

Power system network can undergo outages during which there may be a partial or total blackout in the system. In that condition, transmission of power through the optimal path is an important problem in the process of reconfiguration of power system components. For a given set of generation, load pair, there could be many possible paths to transmit the power. The optimal path needs to consider the shortest path (minimum losses), capacity of the transmission line, voltage stability, priority of loads, and power balance between the generation and demand. In this paper, the Bellman Ford Algorithm (BFA) is applied to find out the optimal path and also the several alternative paths by considering all the constraints. In order to demonstrate the capability of BFA, it has been applied to a practical 230 kV network. This restorative path search guidance tool is quite efficient in finding the optimal and also the alternate paths for transmitting the power from a generating station to demand.

scholarly journals Design and Analysis of Spatial Skyline Queries Indexing

2020 ◽  
Vol 9 (4S2) ◽  
pp. 23-29
Keyword(s):  
Current Practice ◽  
Dimensional Space ◽  
Information Age ◽  
Secondary Memory ◽  
Skyline Query ◽  
Skyline Queries ◽  
Keyword Query ◽  
Spatial Keyword Query ◽  
Nearest Points ◽  
The Ideal

Dwelling in the information age permits nearly everybody needs to recover countless information and choices to gather from to fulfill their necessities. In distinctive cases, the quantity of information accessible and the speed of change may cover the ideal and required explanation. Spatial-textual queries provide the most acclaimed nearest points concerning a conveyed site and a keyword set. Current practice regularly thought on the most capable technique to expertly get the top-k resultset reestablished a spatial-scholarly query. A capable Spatial Range Skyline Query (SRSQ) algorithm is proposed which initially performsa spatial keyword query (SKQ) that relies upon an IRtree that documents the information. Skyline centers picked are not simply established on their partitions to a lot of inquiries and more subject to their significance to a social occasion of query keywords. Additionally, besides proposed range skyline (RS) methods based on R-tree multi-dimensional space including secondary- memory pruning tools for operating field skyline queries is accomplished. The advanced scheme is dynamic and I/O optimum. Ultimately, methodology presents a modern assessment that demonstrates the proficiency.

scholarly journals A Method for Obtaining Optimal Path in Angle and Avoiding Collision for Robotic Belt Grinding

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Tie Zhang ◽  
Xiaohong Liang ◽  
Ye Yu ◽  
Bin Zhang
Keyword(s):  
Coordinate System ◽  
Search Algorithm ◽  
Optimal Path ◽  
Recursive Method ◽  
Coordinate Plane ◽  
Angular Variation ◽  
Belt Grinding ◽  
Robotic Grinding ◽  
Path Search ◽  
Robotic Belt Grinding

The angular variation of the joints may be large, and collision between workpieces and tools may occur in robotic grinding. Therefore, this paper proposes an optimal robotic grinding path search algorithm based on the recursive method. The algorithm is optimized by changing the position of the tool coordinate system on the belt wheel; thus, the pose of the robot during grinding is adjusted. First, the position adjustment formula of the tool coordinate system is proposed, and a coordinate plane is established to describe the grinding path of the robot based on the position adjustment formula. Second, the ordinate value of this coordinate plane is dispersed to obtain the search field of the optimal robotic grinding path search algorithm. Third, an optimal robotic grinding path search algorithm is proposed based on the recursive method and single-step search process. Finally, the algorithm is implemented on the V-REP platform. Robotic grinding paths for V-shaped workpieces and S-shaped workpieces are generated using this algorithm, and a grinding experiment is performed. The experimental results show that the robotic grinding paths generated by this algorithm can smoothly complete grinding operations and feature a smaller angular variation of the joint than other methods and no collision.

The Optimal Path Search Algorithm for Spread of Flame and Smoke in Fire Simulation

2013 ◽  
Author(s):  
Eunju Kim ◽  
◽  
YONGZHE XU ◽  
Kyunjoo Lee ◽  
Jaesug Ki ◽  
...  
Keyword(s):  
Search Algorithm ◽  
Optimal Path ◽  
Fire Simulation ◽  
Path Search ◽  
In Fire

scholarly journals Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
De-Xin Yu ◽  
Zhao-Sheng Yang ◽  
Yao Yu ◽  
Xiu-Rong Jiang
Keyword(s):  
Data Storage ◽  
Road Network ◽  
Large Scale ◽  
Search Algorithm ◽  
Optimal Path ◽  
Search Method ◽  
Urban Road Network ◽  
Urban Road ◽  
Path Search ◽  
Route Search

Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

Sign in / Sign up

Export Citation Format

Share Document