• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 추계학술발표논문집 (중)
• /
• pp.639-642
• /
• 2003

본 논문에서는 청소로봇이 전 청소 영역을 CCPP(Complete Coverage Path Planning)를 이용해 경로를 생성한 후 재 경로계획 시 장애물의 미소한 변화로도 기존에 생성한 전 경로패턴을 바꾸지 않고 수정 할 수 있는 CD(Cell Decomposition)와 FN(Flow Network)을 이용한 CCPP 방식을 제안 하였다. 그리고 제안된 경로 계획에 대해 시뮬레이션으로 결과를 제시하였다.

• 대한수학회지
• /
• 제58권2호
• /
• pp.401-418
• /
• 2021

For complete manifolds with α-Bach tensor (which is defined by (1.2)) flat, we provide some rigidity results characterized by some point-wise inequalities involving the Weyl curvature and the traceless Ricci curvature. Moveover, some Einstein metrics have also been characterized by some $L^{\frac{n}{2}}$-integral inequalities. Furthermore, we also give some rigidity characterizations for constant sectional curvature.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권5호
• /
• pp.214-219
• /
• 2006

Oligopoly differs from perfect competition and monopoly in that a firm must consider rival firms' behavior to determine its own best policy. This interrelationship among firms is the issue examined in this paper. In the oligopoly market, the complete information market means that each producer has full information about itself, the market, and its rivals. That is, each producer knows the market demand function, its own cost function and the cost functions of rivals. On the other hand, the incomplete information market means that in general each producer lacks full information about the market or its rivals. Here, we assume that each firm doesn't know the cost functions and the strategic biddings of its rivals. The main purpose of this paper is to analyze firm' strategic behaviors and equilibrium in an electricity market with incomplete information. In the case study, the complete information market and the incomplete market are compared at the Nash Equilibrium from the viewpoints of market price, transaction quantities, consumer benefits, and Social Welfare.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권7_8호
• /
• pp.381-386
• /
• 2003

본 논문에서는 완전이진트리의 3차원 메쉬로의 임베딩 문제를 다룬다. 링크 충돌을 2까지 허용하면서 최적크기의 메쉬에 임베딩하는 방법은 [1]에서 다루고 있으며, [2]에서는 최적크기의 1.27배의 메쉬로 임베딩하는 방법을 보여주고 있다. 본 논문에서 제안하는 임베딩 방법은 순위차원 라우팅을 사용하며 링크 충돌이 없는 방법으로, 약 1.125배의 최적확장을 넘지 않는다. 이 임베딩 방법은 링크의 충돌 혹은, 임베딩의 확장을 최소화한다는 기준에서 볼 때 기존의 임베딩 방법에 비해 향상된 결과이다.

• Journal of the Korean Data and Information Science Society
• /
• 제3권1호
• /
• pp.47-63
• /
• 1992

Bechhofer and Tamhane(1981) proposed Balanced Treatment Incomplete Block (BTIB) desings for comparing p test treatments with a control treatment in blocks of size ${\kappa}$. Notz and Tamhane(1983) solved the problem about determination of the minimal complete class for ${\kappa}=3$. However there are a number of design parameters for which BTIB designs do not exist. We suggest a new class of designs called Group Divisible Treatment Desings(GDTD's) that is a larger class including BTIB designs as a subclass. In this paper we give the minimal complete classes of generator designs for GDTD's with ${\kappa}=2,\;p{\geq}4(except\;prime\;number)\;and\;{\kappa}=3,\;p=4(2)6$.

• 한국컴퓨터정보학회논문지
• /
• 제15권1호
• /
• pp.61-69
• /
• 2010

로봇이 동작하는 환경을 완벽하게 커버리지 하기 위해서는 전체환경 지도를 가지고 있어야 한다. 그러나 대부분의 기존 커버리지 알고리즘은 로봇이 동작하기 전 사전에 생성된 지도가 있어야 동작 한다. 이런 이유로 기존의 커버리지 알고리즘은 미지의 환경에 바로 적용할 수 없는 문제를 가지고 있다. 미지의 환경에서 로봇이 모든 영역을 커버리지 하기위해서는 로봇스스로 환경 지도를 생성할 수 있어야한다. 본 논문에서는 SLAM 알고리즘을 통합하여 미지의 환경에서 로봇이 환경 지도를 생성하며 생성된 지도를 기반으로 커버리지를 수행하는 DmaxCoverage 알고리즘을 제안한다. 시뮬레이션 실험을 통해서 DmaxCoverage 알고리즘이 기존의 커버리지 알고리즘에 비해서 효율적임을 증명하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.129.3-129
• /
• 2001

In this paper, a novel navigation method is presented for the cleaning robot in the unknown workspace. In order to do this, we propose a new map representation method and a complete coverage navigation method. First, we discuss a triangular cell map representation which makes the cleaning robot navigate with shorter path and increased flexibility than a rectangular cell map representation. Then we proposed a complete coverage navigation and map construction method which the cleaning robot can navigate the complete workspace although it has perfectly no information about environment. Finally, we evaluate the performance of our proposed triangular cell map comparing to that of the rectangular cell map via the existing ...

• 전자공학회논문지B
• /
• 제29B권1호
• /
• pp.1-10
• /
• 1992

This study presents a complete octree construction algorithm for 2D depth images obtained from orthogonal face views, which can represent 3D objects exactly. In constructing quadtree, optimal quadtree construction algorithm is applied to depth images for efficient use of memory and reduction of tree construction time. In addition, pseudo-octrees are constructed by using our proposed method, which construct pseudo-octrees according to the resolution value given in each node of constructed quadtree and mapping relation between quadrants and octants. Finally, a complete octree, which represents a 3D object, is constructed by volume intersection with each constructed pseudo-octree. The representation accuracy of a complete octree constructed by our algorithm is investigated by using a 3D display method and a volume ratio method for a complete octree.

• Animal Systematics, Evolution and Diversity
• /
• 제40권2호
• /
• pp.147-149
• /
• 2024

We report the complete mitochondrial genome sequence of endangered yellow-throated marten, Martes flavigula. The complete mitochondrial genome of M. flavigula is 16,555 bp in length. We identified 13 protein coding genes, 22 transfer RNA, two ribosomal RNA, and one control region. The mitogenome is A+T rich, with a composition of 31.3% A, 28.7% C, 13.0% G, and 27.0% T. According to phylogenetic analysis based on mitochondrial complete genomes, Martes flavigula in the subgenus Charronia was clearly distinct from the subgenus Martes. This phylogeny of the genus Martes supports the conventional systematic treatment. The genetic and taxonomic analysis in this study provides necessary information for the future studies of yellow-throated marten and the Mustelidae family.

• ETRI Journal
• /
• 제27권4호
• /
• pp.355-366
• /
• 2005

Automatic discovery of physical topology plays a crucial role in enhancing the manageability of modern metro Ethernet networks. Despite the importance of the problem, earlier research and commercial network management tools have typically concentrated on either discovering logical topology, or proprietary solutions targeting specific product families. Recent works have demonstrated that network topology can be determined using the standard simple network management protocol (SNMP) management information base (MIB), but these algorithms depend on address forwarding table (AFT) entries and can find only spanning tree paths in an Ethernet mesh network. A previous work by Breibart et al. requires that AFT entries be complete; however, that can be a risky assumption in a realistic Ethernet mesh network. In this paper, we have proposed a new physical topology discovery algorithm which works without complete knowledge of AFT entries. Our algorithm can discover a complete physical topology including inactive interfaces eliminated by the spanning tree protocol in metro Ethernet networks. The effectiveness of the algorithm is demonstrated by implementation.