• Title/Summary/Keyword: Graph theory

Search Result 202, Processing Time 0.204 seconds

Application of Graph Theory for Analyzing the Relational Location Features of Cave as Tourists Attraction(I): focused on the structural analysis of network (동굴관광지의 관계적 입지특성 분석을 위한 그래프이론의 적용(I): 네트워크분석 기법의 적용을 중심으로)

  • Hong, Hyun-Cheol
    • Journal of the Speleological Society of Korea
    • /
    • no.86
    • /
    • pp.8-15
    • /
    • 2008
  • This study is about the efficiency of graph theory that can be applied as the research analysis method in order to identify the relational location features of the caves favored as the ecological tourists attraction. Creating network with traffic nodes and surrounding tourists attractions in a certain space including the caves as the tourists attraction and structural analysis on the overall network using various kinds of index will be very useful method to identify the relational location features and benefits from linking the caves as the tourists attractions. In particular, it can be applied to set the spatial scope in the tourism development plan including the caves as the tourists attractions.

Matroid와 Graph에 대하여

  • Kim Yeon Sik
    • The Mathematical Education
    • /
    • v.12 no.2
    • /
    • pp.1-4
    • /
    • 1974
  • Matroid theory, which was first introduced in 1935 by Whitney (2), is a branch of combinational mathematics which has some very much to the fore in the last few years. H. Whitney had just spent several years working in the field of graph theory, and had noticed several similarities between the ideas of independence and rank in graph theory and those of linear independence and dimension in the study of vector spaces. A matroid is essentially a set with some kind of 'independence structure' defined on it. There are several known results concerning how matroids can be induced from given matroid by a digraph. The purpose of this note is to show that, given a matroid M$_{0}$ (N) and a digraph $\Gamma$(N), then a new matroid M(N) is induced, where A⊆N is independent in M(N) if and only if A is the set of initial vertices of a family of pairwise-vertex-disjoint paths with terminal vertices independent in M$_{0}$ (N).(N).

  • PDF

Finite-Time Sliding Mode Controller Design for Formation Control of Multi-Agent Mobile Robots (다중 에이전트 모바일 로봇 대형제어를 위한 유한시간 슬라이딩 모드 제어기 설계)

  • Park, Dong-Ju;Moon, Jeong-Whan;Han, Seong-Ik
    • The Journal of Korea Robotics Society
    • /
    • v.12 no.3
    • /
    • pp.339-349
    • /
    • 2017
  • In this paper, we present a finite-time sliding mode control (FSMC) with an integral finite-time sliding surface for applying the concept of graph theory to a distributed wheeled mobile robot (WMR) system. The kinematic and dynamic property of the WMR system are considered simultaneously to design a finite-time sliding mode controller. Next, consensus and formation control laws for distributed WMR systems are derived by using the graph theory. The kinematic and dynamic controllers are applied simultaneously to compensate the dynamic effect of the WMR system. Compared to the conventional sliding mode control (SMC), fast convergence is assured and the finite-time performance index is derived using extended Lyapunov function with adaptive law to describe the uncertainty. Numerical simulation results of formation control for WMR systems shows the efficacy of the proposed controller.

Tutorial on Frequency and Polarization Assignment Algorithms for Military Communication Networks (군용 통신망에서의 주파수 및 편파 지정 알고리즘 튜토리얼)

  • Koo, Bonhong;Chae, Chan-Byoung;Park, Sung-Ho;Park, Hwi-Sung;Ham, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1608-1618
    • /
    • 2016
  • In this paper we introduce a graph theory approach to solve the frequency assignment problem(FAP) for military communication network. Prior algorithms are implemented adaptively to the problem, and enhanced algorithms are proposed to show that their results approximately approached the optimum performance. We also proposed polarization assignment algorithms to enhance the FAP performances.

Controller Design of Takagi-Sugeno Fuzzy Model-Based Multi-Agent Systems for State Consensus (타카기-수게노 퍼지모델 기반 다개체 시스템의 상태일치를 위한 제어기 설계)

  • Moon, Ji Hyun;Lee, Ho Jae;Kim, Do Wan
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.2
    • /
    • pp.133-138
    • /
    • 2013
  • This paper addresses a state consensus controller design technique of Takagi-Sugeno fuzzy model-based multi-agent systems in a continuous-time domain. We express the interconnection topology among the agents through graph theory. The design condition is represented in terms of linear matrix inequalities. Numerical example is provided to demonstrate the effectiveness of the proposed method.

Workforce Assignment in Multiple Rowsfor Factory Automation (공장 자동화를 위한 다열 배치에서의 작업자 할당)

  • Kim Chae-Bogk
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.27 no.2
    • /
    • pp.68-77
    • /
    • 2004
  • This paper considers the workforce assignment problem to minimize both the deviations of workloads assigned to workers and to maximize the total preference between each worker and each machine. Because of the high expense of technology education and the difficulties of firing employees, there is no part time workers in semiconductor industry. Therefore, multi-skilled workers are trained for performing various operations in several machines. The bicriteria workforce assignment problem in this paper is not easy to obtain the optimal solution considering the aisle structure and it is belong to NP-class. The proposed heuristic algorithms are developed based on the combination of spacefilling curve technique, simulated annealing technique and graph theory focusing on the multiple-row machine layout. Examples are presented for the proposed algorithms how to find a good solution.

Power Allocation of Individual Generators to Loads Using Graph Theory (송전망 이용요금 산정을 위한 발전-부하 배분 계산 방법)

  • Choi, J.;Kim, H.;Rim, Seong-Hwang;Koo, B.M.
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.422-424
    • /
    • 2002
  • Many methods about real power flow tracing have been suggested. Electric power industrials and organizations of the world use the method which is best suitable to themselves in practical aspects. In this paper we calculate the real power transfer between individual generators and loads referencing the method introduced by oversea's paper. It is considered to be significant to the wholesale competition market and transmission open access. Based on ac load flow solution and graph theory, the simulation on IEEE 30-bus system are carried out and the results are compared with that of oversea's paper. Also the simulation on the power system of Korea is carried out and the results are analyzed.

  • PDF

A Study on Constructing the Multiple-Valued Logic Systems over Finite Fields using by the Decision Diagram (결정도(決定圖)에 기초(基礎)한 유한체상(有限體上)의 다치논리(多値論理)시스템구성(構成)에 관한 연구(硏究))

  • Park, Chun-Myoung
    • Journal of IKEEE
    • /
    • v.3 no.2
    • /
    • pp.295-304
    • /
    • 1999
  • This paper presents a method of constructing the Multiple-Valued Logic Systems(MVLS) over Finite Fields(FF) using by Decision Diagram(DD) that is based on Graph Theory. The proposed method is as following. First, we derivate the Ordered Multiple-Valued Logic Decision Diagram(OMVLDD) based on the multiple-valued Shannon's expansion theorem and we execute function decomposition using by sub-graph. Next, we propose the variable selecting algorithm and simplification algorithm after apply the each isomorphism and reodering vertex. Also we propose MVLS design method.

  • PDF

APPLICATIONS OF GRAPH THEORY

  • Pirzada, S.;Dharwadker, Ashay
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.4
    • /
    • pp.19-38
    • /
    • 2007
  • Graph theory is becoming increasingly significant as it is applied of mathematics, science and technology. It is being actively used in fields as varied as biochemistry(genomics), electrical engineering(communication networks and coding theory), computer science(algorithms and computation) and operations research(scheduling). The powerful results in other areas of pure mathematics. Rhis paper, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's Little Theorem and the Nielson-Schreier Theorem. New applications to DNA sequencing (the SNP assembly problem) and computer network security (worm propagation) using minimum vertex covers in graphs are discussed. We also show how to apply edge coloring and matching in graphs for scheduling (the timetabling problem) and vertex coloring in graphs for map coloring and the assignment of frequencies in GSM mobile phone networks. Finally, we revisit the classical problem of finding re-entrant knight's tours on a chessboard using Hamiltonian circuits in graphs.

  • PDF