• Title/Summary/Keyword: Optimizing path finding

Search Result 5, Processing Time 0.019 seconds

Optimizing Path Finding based on Dijkstra's Algorithm for a Quadruped Walking Robot TITAN-VIII (4족보행 로봇 TITAN-VIII의 Dijkstra's Algorithm을 이용한 최적경로 탐색)

  • Nguyen, Van Tien;Ahn, Byong-Won;Bae, Cherl-O
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.5
    • /
    • pp.574-584
    • /
    • 2017
  • In this paper, the optimizing path finding control method is studied for a Legged-robot. It's named TITAN-VIII. It has a lot of advantages over the wheeled robot in the ability to walk freely on an irregular ground. However, the moving speed on the ground of the Legged-robot is slower than the Wheeled-robot's. Consequently, the purpose of the method is presented in this paper to minimize its time when it walks to a goal. It find the path, our approach is based on an algorithm which is called Dijkstra's algorithm. In the rest of paper, the various posture of the robot is discussed to keep the robot always in the statically stable. Based on above works, the math formulas are presented to determine the joint angles of the robot. After that an algorithm is designed to find and keep robot on the desired trajectory. Experimental results of the proposed method are demonstrated in the last of paper.

Development of a Method for Partial Searching Technique for Optimal Path Finding in the Long Journey Condition (장거리 최적경로탐색을 위한 부분탐색기법 연구)

  • Bae, Sanghoon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.3D
    • /
    • pp.361-366
    • /
    • 2006
  • It is widely known that the dynamic optimal path algorithm, adopting real-time path finding, can be supporting an optimal route with which users are satisfied economically and accurately. However, this system has to search optimal routes frequently for updating them. The proposed concept of optimizing search area lets it reach heuristic optimal path rapidly and efficiently. Since optimal path should be increased in proportion to an distance between origin and destination, tremendous calculating time and highly efficient computers are required for searching long distance journey. In this paper, as a result of which the concepts of partial solution and representative path are suggested. It was possible to find an optimal route by decreasing a half area in comparison with the previous method. Furthermore, as the size of the searching area is uniform, comparatively low efficient computer is required for long distance trip.

An Efficient Technique for Evaluating Queries with Multiple Regular Path Expressions (다중 정규 경로 질의 처리를 위한 효율적 기법)

  • Chung, Tae-Sun;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.449-457
    • /
    • 2001
  • As XML has become an emerging standard for information exchange on the World Wide Web, it has gained attention in database communities to extract information from XML seen as a database model. XML queries are based on regular path queries, which find objects reachable by given regular expressions. To answer many kinds of user queries, it is necessary to evaluate queries that have multiple regular path expressions. However, previous work such as query rewriting and query optimization in the frame work of semistructured data has dealt with a single regular expression. For queries that have multiple regular expressions we suggest a two phase optimizing technique: 1. query rewriting using views by finding the mappings from the view's body to the query's body and 2. for rewritten queries, evaluating each query conjunct and combining them. We show that our rewriting algorithm is sound and our query evaluation technique is more efficient than the previous work on optimizing semistructured queries.

  • PDF

High-frequency Reverberation Simulation of High-speed Moving Source in Range-independent Ocean Environment (거리독립 해양환경에서 고속이동 음원의 고주파 잔향음 신호모의)

  • Kim, Sunhyo;Lee, Wonbyoung;You, Seung-Ki;Choi, Jee Woong;Kim, Wooshik;Park, Joung Soo;Park, Kyoung Ju
    • The Journal of the Acoustical Society of Korea
    • /
    • v.32 no.2
    • /
    • pp.104-115
    • /
    • 2013
  • In a shallow water waveguide, reverberation signals and their Doppler effects form the primary limitation on sonar system performance. Therefore, in the reverberation-limited environment, it is necessary to estimate the reverberation level to be encountered under the conditions in which the sonar system is operated. In this paper, high-frequency reverberation model capable of simulating the reverberation signals received by a high-speed moving source in a range independent waveguide is suggested. In this model, eigenray information from the source to each boundary is calculated using the ray-based approach and the optimizing method for the launch angles. And the source receiving position changed by the moving source is found by a scattering path-finding algorithm, which considers the speed and direction of source and sound speed to find the path of source movement. The scattering effects from sea surface and bottom boundaries are considered by APL-UW scattering models. The model suggested in this paper is verified by a comparison to the measurements made in August 2010. Lastly, this model reflects well statistical properties of the reverberation signals.

On Optimizing Dissimilarity-Based Classifications Using a DTW and Fusion Strategies (DTW와 퓨전기법을 이용한 비유사도 기반 분류법의 최적화)

  • Kim, Sang-Woon;Kim, Seung-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.2
    • /
    • pp.21-28
    • /
    • 2010
  • This paper reports an experimental result on optimizing dissimilarity-based classification(DBC) by simultaneously using a dynamic time warping(DTW) and a multiple fusion strategy(MFS). DBC is a way of defining classifiers among classes; they are not based on the feature measurements of individual samples, but rather on a suitable dissimilarity measure among the samples. In DTW, the dissimilarity is measured in two steps: first, we adjust the object samples by finding the best warping path with a correlation coefficient-based DTW technique. We then compute the dissimilarity distance between the adjusted objects with conventional measures. In MFS, fusion strategies are repeatedly used in generating dissimilarity matrices as well as in designing classifiers: we first combine the dissimilarity matrices obtained with the DTW technique to a new matrix. After training some base classifiers in the new matrix, we again combine the results of the base classifiers. Our experimental results for well-known benchmark databases demonstrate that the proposed mechanism achieves further improved results in terms of classification accuracy compared with the previous approaches. From this consideration, the method could also be applied to other high-dimensional tasks, such as multimedia information retrieval.