• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.727-730
• /
• 2017

복잡한 알고리즘과 고가의 센서 없이도 동적 환경에서 목표를 탐색하는 이동 로봇 시스템을 제안하였다. 탐색환경의 지도를 제작하지 않고 단순한 목표를 가진 하부 모듈의 결합만을 사용하는 포섭구조를 활용하였다. 제안한 시스템의 유용성 검증을 위해 실험을 하였고, 그 결과 목표를 찾아 감을 확인할 수 있었다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.235-238
• /
• 2002

본 논문에서는 자율 이동 로봇의 학습을 위해 신경망과 진화 알고리즘을 이용한 방법을 제안하고 또한 행동기반 제어 방법인 포섭구조를 이용해 로봇의 행동을 제어하는 방법을 제안한다. 포섭 구조는 기존의 Al방법과는 달리 행동 규칙을 병렬적으로 모듈화 하여 낮은 레벨에서는 기본적인 행동을 담당하고, 높은 레벨에서는 좀 더 복잡한 행동을 담당하는 구조로 되어있다. 따라서 각 행동 레벨이 협조를 함으로써 복잡한 임무를 수행할 수 있다 포섭 구조에서 각 레벨의 제어기는 신경망으로 구성하며 각 행동 레벨이 서로 영향을 주고받으며 진화함으로써 주어진 임무를 달성하도록 한다 제안된 방법은 자율 이동 로봇인 Khepera 로봇의 시뮬레이션을 통해 결과의 효율성을 입증한다.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2399-2401
• /
• 2003

시각 장애인의 경우 어떤 물체를 집어 들기 위해서는 처음에 물체를 더듬으면서 전체 형상을 파악하게 된다. 손의 촉각을 이용하여 충분히 물체의 특징을 파악하게 되면, 무게 중심이 될 만한 지점에 접촉하여 물체를 한 번쯤 들어보게 된다. 시각 등 다른 감각의 제한을 받는 조건에서 촉각만으로 물체 파지(object-graping)을 수행하고자 할 때, 일련의 행위들을 반복하게 된다. 본 논문은 촉각을 이용한 로봇 손의 행위 기반 제어 연구에 관한 것으로 R.Brooks가 제안한 subsumption architecture(SA)을 진화시켜 본 연구실에서 개발한 4DOF hand에 적용하였다.

• Journal of KIISE:Software and Applications
• /
• v.36 no.2
• /
• pp.153-160
• /
• 2009

As size of ontology has been increased more and more, the descriptions in the ontologies become more complicated, Therefore finding and modifying unsatisfiable concepts is hard work in ontology construction process, Minerva is an ontology reasoner which detects unsatisfiable concepts automatically and infers subsumption relation between concepts in ontology, Most description logic based ontology reasoners (including Minerva) work using tableaux algorithm, Because tableaux algorithm is very costly, ontology reasoners need various optimization methods, In this paper, we propose optimizing methods to reduce execution time of tableaux algorithm based ontology reasoner. Proposed methods were applied to Minerva which was developed as preceding study result. In consequence the new version Minerva shows high performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.52-55
• /
• 2008

The paper aims at showing the subsumption relations of the Wordnet can be captured automatically from a dynamic encyclopedia such as Wikipedia with a meaningful precision. The idea behind the proposal is that a knowledge base in the form of Wordnet can be dynamically obtained and maintained accordingly to the online dictionaries so that the scalability of knowledge base construction may be achieved to some degree. To show the plausibility of dynamic ISA construction, we have tested how well the ISA relations among the 100 technology terms selected from the Wordnet can be saved from the ISA construction by the wiki definitions of the selected terms. As a result the wiki definition led to the ISA relations of the Wordnet with the precision of 80%.

• Journal of KIISE:Software and Applications
• /
• v.35 no.6
• /
• pp.366-373
• /
• 2008

The web ontology language(OWL) has been used by ontology designers to construct ontology. In order to derive hidden information(concept subsumption, concept satisfiability and realization) of OWL ontology, a number of OWL reasoners have been introduced. But most reasoners simply report these information without process for any arbitrary entailment and unsatisfiable concept derived from a OWL ontologies. In this paper, we propose Minimum Expression Axiom Set(MEXS) detection and storing for debugging unsatisfiable concepts in ontology. In order to detect MEXS, we need to find axiom to cause inconsistency in ontology. Therefore, our work focused on two key aspects: given a inconsistency ontology, identifying the roots of axioms to occur unsatisfiable and derived axioms from among them; and extracting MEXS. Our results can be applicable to all application, which is at the basis of the description logic.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.548-557
• /
• 2010

In this paper, we propose a semi-automatic modeling approach of ontology to annotate VOD to realize the IPTV's intelligent searching. The ontology is made by combining partial tree that extracts hypernym, hyponym, and synonym of keywords related to a service domain from WordNet. Further, we add to the partial tree new keywords that are undefined in WordNet, such as foreign words and words written in Chinese characters. The ontology consists of two parts: generic hierarchy and specific hierarchy. The former is the semantic model of vocabularies such as keywords and contents of keywords. They are defined as classes including property restrictions in the ontology. The latter is generated using the reasoning technique by inferring contents of keywords based on the generic hierarchy. An annotation generates metadata (i.e., contents and genre) of VOD based on the specific hierarchy. The generic hierarchy can be applied to other domains, and the specific hierarchy helps modeling the ontology to fit the service domain. This approach is proved as good to generate metadata independent of any specific domain. As a result, the proposed method produced around 82% precision with 2,400 VOD annotation test data.

• The Journal of Society for e-Business Studies
• /
• v.20 no.4
• /
• pp.61-76
• /
• 2015

In general, we have utilized the hierarchical concept tree as a crucial data structure for indexing huge amount of textual data. This paper proposes a generality rank-based method that can automatically develop hierarchical concept structures with the Wikipedia data. The goal of the method is to regard each of Wikipedia articles as a concept and to generate hierarchical relationships among concepts. In order to estimate the generality of concepts, we have devised a special ranking function that mainly uses the number of hyperlinks among Wikipedia articles. The ranking function is effectively used for computing the probabilistic subsumption among concepts, which allows to generate relatively more stable hierarchical structures. Eventually, a set of concept pairs with hierarchical relationship is visualized as a DAG (directed acyclic graph). Through the empirical analysis using the concept hierarchy of Open Directory Project, we proved that the proposed method outperforms a representative baseline method and it can automatically extract concept hierarchies with high accuracy.

• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.401-410
• /
• 2009

In order to derive hidden information (concept subsumption, concept satisfiability and realization) of OWL ontology, a number of OWL reasoners have been introduced. The most of these ontology reasoners were implemented using the tableau algorithm. However most reasoners simply report this information without providing a justification for any arbitrary entailment and unsatisfiable concept derived from OWL ontologies. The purpose of this paper is to investigate an optimized method for non-deterministic rule of the tableau algorithm and finding axioms to cause inconsistency in ontology. In this paper, therefore, we propose an optimized method for non-deterministic rule and finding axiom to cause inconsistency using NATMS. In the first place, we introduce Dependency Directed Backtracking to deal non-deterministic rule, a tableau-based decision procedure to find unsatisfiable axiom Furthermore we propose an improved method adapting NATMS.

• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.411-419
• /
• 2009

In order to derive hidden Information (concept subsumption, concept satisfiability and realization) of OWL ontologies, a number of OWL reasoners have been introduced. Most of the reasoners were implemented to be based on tableau algorithm. However this approach has certain limitation. This paper presents architecture for Medusa. The Medusa is an extended DL-reasoner for SWRL(Semantic Web Rule Language) reasoning under well-founded semantics with ontologies specified in Description Logic. Description logic based ontology reasoners theoretically explore knowledge representation and its reasoning in concept languages. However these logics are not equipped with rule-based reasoning mechanisms for assertional knowledge base; specifically, rule and facts in logic programming, or interaction of rules and facts with terminology. In order to deal with the enriched reasoning, The Medusa provides combining DL-knowledge base and rule based reasoner. The described prototype uses $Prot{\acute{e}}g{\acute{e}}$ API[1] for controlling communication with the ontology reasoner.