• Title/Summary/Keyword: Sub-path

Search Result 500, Processing Time 0.03 seconds

A Local Path Planning Algorithm of Free Ranging Mobile Robot Using a Laser Range Finder (레이저거리계를 이용한 자율 주행로봇의 국부 경로계획 알고리즘)

  • 차영엽;권대갑
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.4
    • /
    • pp.887-895
    • /
    • 1995
  • Considering that the laser range finder has the excellent resolution with respect to angular and distance measurements, a sophisticated local path planning algorithm is achieved by subgoal and sub-subgoal searching methods. The subgoal searching finds the passable ways between obstacles and selects the optimal pathway in order to reduce the moving distanced from start point to given to given goal. On the other hand, the sub-subgoal searching corrects the path given in subgoal searching in the case of which the mobile robot will collide with obstacles. Also, the effectiveness of the established local path planning and local minimum avoiding algorithm are estimated by computer simulation and experimentation in complex environment.

MONOPHONIC PEBBLING NUMBER OF SOME NETWORK-RELATED GRAPHS

  • AROCKIAM LOURDUSAMY;IRUDAYARAJ DHIVVIYANANDAM;SOOSAIMANICKAM KITHER IAMMAL
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.1
    • /
    • pp.77-83
    • /
    • 2024
  • Chung defined a pebbling move on a graph G as the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The monophonic pebbling number guarantees that a pebble can be shifted in the chordless and the longest path possible if there are any hurdles in the process of the supply chain. For a connected graph G a monophonic path between any two vertices x and y contains no chords. The monophonic pebbling number, µ(G), is the least positive integer n such that for any distribution of µ(G) pebbles it is possible to move on G allowing one pebble to be carried to any specified but arbitrary vertex using monophonic a path by a sequence of pebbling operations. The aim of this study is to find out the monophonic pebbling numbers of the sun graphs, (Cn × P2) + K1 graph, the spherical graph, the anti-prism graphs, and an n-crossed prism graph.

Inference of the Probability Distribution of Phase Difference and the Path Duration of Ground Motion from Markov Envelope (Markov Envelope를 이용한 지진동의 위상차 확률분포와 전파지연시간의 추정)

  • Choi, Hang;Yoon, Byung-Ick
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.26 no.5
    • /
    • pp.191-202
    • /
    • 2022
  • Markov envelope as a theoretical solution of the parabolic wave equation with Markov approximation for the von Kármán type random medium is studied and approximated with the convolution of two probability density functions (pdf) of normal and gamma distributions considering the previous studies on the applications of Radiative Transfer Theory (RTT) and the analysis results of earthquake records. Through the approximation with gamma pdf, the constant shape parameter of 2 was determined regardless of the source distance ro. This finding means that the scattering process has the property of an inhomogeneous single-scattering Poisson process, unlike the previous studies, which resulted in a homogeneous multiple-scattering Poisson process. Approximated Markov envelope can be treated as the normalized mean square (MS) envelope for ground acceleration because of the flat source Fourier spectrum. Based on such characteristics, the path duration is estimated from the approximated MS envelope and compared to the empirical formula derived by Boore and Thompson. The results clearly show that the path duration increases proportionately to ro1/2-ro2, and the peak value of the RMS envelope is attenuated by exp (-0.0033ro), excluding the geometrical attenuation. The attenuation slope for ro≤100 km is quite similar to that of effective attenuation for shallow crustal earthquakes, and it may be difficult to distinguish the contribution of intrinsic attenuation from effective attenuation. Slowly varying dispersive delay, also called the medium effect, represented by regular pdf, governs the path duration for the source distance shorter than 100 km. Moreover, the diffraction term, also called the distance effect because of scattering, fully controls the path duration beyond the source distance of 300 km and has a steep gradient compared to the medium effect. Source distance 100-300 km is a transition range of the path duration governing effect from random medium to distance. This means that the scattering may not be the prime cause of peak attenuation and envelope broadening for the source distance of less than 200 km. Furthermore, it is also shown that normal distribution is appropriate for the probability distribution of phase difference, as asserted in the previous studies.

An Algorithm for Generating an Optimal Laser-Torch Path to Cut Multiple Parts with Their Own Set of Sub-Parts Inside (2차부재가 포함된 다수의 1차부재를 가공하기 위한 레이저 토치의 절단경로 최적화 알고리즘)

  • Kwon Ki-Bum;Lee Moon-Kyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.9
    • /
    • pp.802-809
    • /
    • 2005
  • A hybrid genetic algorithm is proposed for the problem of generating laser torch paths to cut a stock plate nested with free-formed parts each having a set of sub-parts. In the problem, the total unproductive travel distance of the torch is minimized. The problem is shown to be formulated as a special case of the standard travelling salesman problem. The hybrid genetic algorithm for solving the problem is hierarchically structured: First, it uses a genetic algorithm to find the cutting path f3r the parts and then, based on the obtained cutting path, sequence of sub-parts and their piercing locations are optimally determined by using a combined genetic and heuristic algorithms. This process is repeated until any progress in the total unproductive travel distance is not achieved. Computational results are provided to illustrate the validity of the proposed algorithm.

Spatial target path following and coordinated control of multiple UUVs

  • Qi, Xue;Xiang, Peng;Cai, Zhi-jun
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.12 no.1
    • /
    • pp.832-842
    • /
    • 2020
  • The coordination control of multiple Underactuated Underwater Vehicles (UUVs) moving in three dimensional space is investigated in this paper. The coordinated path following control task is decomposed into two sub tasks, that is, path following control and coordination control. In the spatial curve path following control task, path following error dynamics is build in the Serret-Frenet coordinate frame. The virtual reference object can be chosen freely on the desired spatial path. Considering the speed of the UUV, the line-of-sight navigation is introduced to help the path following errors quickly converge to zero. In the coordination control sub task, the communication topology of multiple UUVs is described by the graph theory. The speed of each UUV is adjusted to achieve the coordination. The path following system and the coordination control system are viewed as the feedback connection system. Input-to-state stable of the coordinated path following system can be proved by small gain theorem. The simulation experiments can further demonstrate the good performance of the control method.

ON PATHOS BLOCK LINE CUT-VERTEX GRAPH OF A TREE

  • Nagesh, Hadonahalli Mudalagiraiah
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.1-12
    • /
    • 2020
  • A pathos block line cut-vertex graph of a tree T, written P BLc(T), is a graph whose vertices are the blocks, cut-vertices, and paths of a pathos of T, with two vertices of P BLc(T) adjacent whenever the corresponding blocks of T have a vertex in common or the edge lies on the corresponding path of the pathos or one corresponds to a block Bi of T and the other corresponds to a cut-vertex cj of T such that cj is in Bi; two distinct pathos vertices Pm and Pn of P BLc(T) are adjacent whenever the corresponding paths of the pathos Pm(vi, vj) and Pn(vk, vl) have a common vertex. We study the properties of P BLc(T) and present the characterization of graphs whose P BLc(T) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; eulerian; and hamiltonian. We further show that for any tree T, the crossing number of P BLc(T) can never be one.

Analysis of Spin Exchange Interactions in (C2N2H10)[Fe(HPO3)F3] on the Basis of Electronic Structure Calculations

  • Koo, Hyun-Joo
    • Bulletin of the Korean Chemical Society
    • /
    • v.32 no.2
    • /
    • pp.467-471
    • /
    • 2011
  • Spin exchange interactions of $(C_2N_2H_{10})[Fe(HPO_3)F_3]$ were examined by performing a spin dimer analysis based on extended Huckel tight binding method and a mapping analysis based on first principles density functional theory. Spin exchange interactions occur through the super-superexchange paths $J_1$ and $J_2$ in $(C_2N_2H_{10})[Fe(HPO_3)F_3]$. In the super-superexchange path $J_2$ magnetic orbital interactions between eg-block levels are much stronger than those from $t_{2g}$-block levels. Both electronic structure calculations show that the spin exchange interaction through the super-superexchange path $J_2$ is much stronger than that of $J_1$.

Path Algorithm for Maximum Tax-Relief in Maximum Profit Tax Problem of Multinational Corporation (다국적기업 최대이익 세금트리 문제의 최대 세금경감 경로 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.4
    • /
    • pp.157-164
    • /
    • 2023
  • This paper suggests O(n2) polynomial time heuristic algorithm for corporate tax structure optimization problem that has been classified as NP-complete problem. The proposed algorithm constructs tax tree levels that the target holding company is located at root node of Level 1, and the tax code categories(Te) 1,4,3,2 are located in each level 2,3,4,5 sequentially. To find the maximum tax-relief path from source(S) to target(T), firstly we connect the minimum witholding tax rate minrw(u, v) arc of node u point of view for transfer the profit from u to v node. As a result we construct the spanning tree from all of the source nodes to a target node, and find the initial feasible solution. Nextly, we find the alternate path with minimum foreign tax rate minrfi(u, v) of v point of view. Finally we choose the minimum tax-relief path from of this two paths. The proposed heuristic algorithm performs better optimal results than linear programming and Tabu search method that is a kind of metaheuristic method.

Investigation on Thermal and Chemical Effects of CO2 in Oxygen Enriched Flame (산소부화화염내 CO2의 열 및 화학적 효과에 대한 연구)

  • Kum Sung Min;Lee Chang Eon;Han Ji Woong
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.29 no.5 s.236
    • /
    • pp.617-624
    • /
    • 2005
  • An analysis of the effects of $CO_{2}$ on fundamental combustion characteristics was performed in Oxygen enriched condition by comparing the laminar burning velocities, flame structures, fuel oxidation paths. Fictitious $CO_{2}$ was introduced to discriminate the chemical reaction effects of $CO_{2}$ from the thermal effects. PREMIX code was utilized to evaluate the laminar burning velocities. OPPDIF code was utilized to investigate the flame structure and fuel oxidation path variation. The contributions of thermal effects on laminar burning velocities are dominant at lowly oxygen-enriched condition but those of chemical reaction effects become dominant at highly oxygen-enriched condition. Chemical reaction effects caused the additional flame temperature decrease besides thermal effects and oxygen-leakage increase in non-premixed flame. Specific fuel oxidation path and CO production path is enhanced in spite of overall decrement of fuel consumption rate by chemical reaction effects of$CO_{2}$.