To improve efficiency in aided mine disaster rescue,the 3D geological and laneway model was proposed and 3D visualization technique was integrated into *** order to effectively establishing topological relations betwe...
详细信息
To improve efficiency in aided mine disaster rescue,the 3D geological and laneway model was proposed and 3D visualization technique was integrated into *** order to effectively establishing topological relations between 3D laneway net node model and stratum lithology and nodes interrelation,3D complex geological entity model desiring was given emphases *** the 3D geological and laneway model and applying dijkstra algorithm,fast intelligent selection of lash-up rescue routes was *** is demonstrated that this system including 3D geological and laneway model and 3D visualization model is practicable.
Quantified environment model was the basis for quantitative study on path planning of mobile robots. By using free-space method, the two-dimensional weighted network topology was created according to mobile robot envi...
详细信息
Quantified environment model was the basis for quantitative study on path planning of mobile robots. By using free-space method, the two-dimensional weighted network topology was created according to mobile robot environment. The path length of environment was modeled with length matrix and the path width of environment was modeled with width matrix. The quantitative path planning was implemented by comparing the path width with the size of robot body and changing the path width in the dijkstra algorithm. The efficiency of dijkstra algorithm was also improved. The simulation showed that the path planning algorithm was correct and valid.
The dynamics of long timescale evolution of conformational changes in small biological molecules is described by a hybrid molecular dynamics/RRK algorithm. The approach employs classical trajectories for transitions b...
详细信息
The dynamics of long timescale evolution of conformational changes in small biological molecules is described by a hybrid molecular dynamics/RRK algorithm. The approach employs classical trajectories for transitions between adjacent structures separated by a low barrier, and the classical statistical RRK approximation when the barrier involved is high. In determining the long-time dynamics from an initial structure to a final structure of interest, an algorithm is introduced for determining the most efficient pathways (sequence of the intermediate conformers). This method uses the dijkstra algorithm for finding optimal paths on networks. Three applications of the method using an AMBER force field are presented: a detailed study of conformational transitions in a blocked valine dipeptide;a multiple reaction path study of the blocked valine tripeptide;and the evolution in time from the beta hairpin to alpha helix structure of a blocked alanine hexapeptide. Advantages and limitations of the method are discussed in light of the results.
作者：
Wojciech WięlawekDivision of Telecomunications
Institiute of Electronics Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Postal address: Akademicka 16 44-100 Gliwice Poland Phone: (048) 32 23714 95
Abstract There are edge based segmentation approaches among the set of methods utilized to image segmentation. This type of methods analyse image gradient features (like the first, the second derivative or them modifi...
详细信息
Abstract There are edge based segmentation approaches among the set of methods utilized to image segmentation. This type of methods analyse image gradient features (like the first, the second derivative or them modification). Perfect tool to image processing is wavelet transformation which enables edges detection and often gets better results. In this paper wavelet transformation advantages was utilized. This tool was used to cost map definition. Cost map is a matrix which informs how many features of boundary each pixel possess. Then this cost map definition was applied to live-wire method. The method is semi-automatic and requires user interaction rely on points specification.
Bidirectional dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical dijkstra algorithm has not any directional feature during searching the shortest path. The alg...
详细信息
Bidirectional dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.
We show a simple proof of the existence of a path on the "border of water and rocks" based on combinatorial induction procedure and we present an algorithm for computing L, shortest path in "Fjord Scene...
详细信息
We show a simple proof of the existence of a path on the "border of water and rocks" based on combinatorial induction procedure and we present an algorithm for computing L, shortest path in "Fjord Scenery". The proposed algorithm is a version of the dijkstra technique adapted to a rectangle map with a square network. A few pre-processing modifications of the algorithm following from the combinatorial procedure are included. The validity of this approach is shown by numerical calculations for an example. (C) 2003 Elsevier B.V. All rights reserved.
A genetic algorithmic approach to the shortest path (SP) routing problem in large network was presented in order to improve the efficiency of computation. Encoding chromosome with variable length was applied for impro...
详细信息
A genetic algorithmic approach to the shortest path (SP) routing problem in large network was presented in order to improve the efficiency of computation. Encoding chromosome with variable length was applied for improving the efficiency of solving problem. A search capability that can improve quality of solution and enhance rate of convergence for network with lots of nodes is found by making crossover and mutation. Because crossover and mutation may generate infeasible chromosomes, a simple repair function is used to cure all the infeasible chromosomes, which keep the diversity of the population and can be used for computation of genetic algorithm to improve the efficiency of computation. Simulation results for SP in the large network indicate that the using time of GA is less than that of dijkstra algorithm in the same network. So the efficiency of the genetic algorithm is much better than that of the dijkstra algorithm for SP in large network.
This paper defines the adjacent cost matrix and the path matrix based on the directed weighted-graph, and defines a new operator that 'summarization then minimum' replace 'multiplication then summarization...
详细信息
This paper defines the adjacent cost matrix and the path matrix based on the directed weighted-graph, and defines a new operator that 'summarization then minimum' replace 'multiplication then summarization' between two adjacent cost matrixs, named 'minimum of summarization sequence between two multiplication position elements of the two matrixs'. Based on this new matrix operator, this paper proposes a new algorithm to the shortest path problem within a directed graph. This algorithm can get the global shortest path out for any types of graph. dijkstra algorithm is a well-known good solution to the shortest path problem, but it will result out a fake path to some kinds of graph. The algorithm presented by this paper completely overcome this phenomena out of Dijikstra algorithm.
Footpaths in a mountainous area of Wales are modelled as least-cost paths between the start and end points. The cost function is defined on the basis of topography alone, and is defined in such a way that the cost pen...
详细信息
Footpaths in a mountainous area of Wales are modelled as least-cost paths between the start and end points. The cost function is defined on the basis of topography alone, and is defined in such a way that the cost penalty for excessively steep slopes is an adjustable parameter of the model. Least-cost paths are calculated by applying dijkstra's algorithm to a Digital Elevation Model. Comparison of these calculated least-cost paths with existing footpaths suggests that the latter do not usually follow the least-time route, but instead optimise the metabolic cost for human locomotion. The method developed here is proposed as a means of exploring possible routes for new footpaths in mountainous areas. (C) 2004 Elsevier Ltd. All rights reserved.
Optical time-division multiplexing (O-TDM) networks can provide a finer bandwidth granularity than wavelength-division multiplexing networks, and will play an important role in future all-optical networks. Since optic...
详细信息
Optical time-division multiplexing (O-TDM) networks can provide a finer bandwidth granularity than wavelength-division multiplexing networks, and will play an important role in future all-optical networks. Since optical buffers are expensive, a small buffer size will be the characteristic of O-TDM systems. This paper analyzes the problem of routing and time-slot assignment in O-TDM networks. The results lead to the proposal of a dijkstra-like shortest-path routing scheme that intends to maximize the performance of an optical network with a small number of optical buffers. Performance evaluation of the proposed scheme is also presented.
暂无评论