• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.412-414
• /
• 2019

경로 계획은 에이전트가 로봇이 특정 목적지에 도착할 수 있도록 에이전트가 수집한 정보를 바탕으로 경로를 설정하는 작업을 뜻한다. 부분 관측만 가능한 맵인 경우 에이전트 이동마다 새로 수집되는 정보들을 바탕으로 마르코프 의사결정 과정을 사용한 가치 반복 알고리즘이 널리 사용되지만, 제안된 가치 반복 알고리즘 사용 시 매 행동마다 모든 공간의 최적 경로를 계산하기 때문에 시간이 오래 걸리는 문제점이 있다. 이에 본 논문에서는 에이전트가 한 번에 탐색하는 범위가 제한되어 있다는 점에 착안하여 탐색 반경 내에 속하는 공간의 가치 함수 값을 미리 추정하여 효율적으로 최적의 경로를 추정하는 가치 반복 알고리즘을 제안한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.65-68
• /
• 2006

본 논문은 일반적인 경로탐색기법의 사용으로 인한 단점들을 보완하며 공간적, 시간적, 안정성을 만족하는 효율적인 경로탐색기법인 IRCT기법을 소개하고, 이를 가정용 청소로봇에 적용한다. 기존의 경로탐색 기법인 A*알고리즘은 격자이동을 하여야만 하는 한계로 인하여 이동저리에 있어서 비효율적이고, 그에 따른 시간적 손실과 에너지의 손실 등이 따른다. IRCT 기법은 A*알고리즘에서 사용하는 격자이동에 대한 문제점을 장애물과 비장애물을 재 정의하여, 격자이동이 아닌 노드와 노드 사이를 이동함으로써 효율성과 안정성을 동시에 만족시킨다. 청소용 로봇에 IRCT기법을 적용하기 전 실험을 통하여 IRCT기법과 A*알고리즘을 비교함으로써, 두 기법사이의 인동거리와 시간적 효율성을 확인하고, IRCT기법의 안정성을 보인다.

• Journal of Navigation and Port Research
• /
• v.39 no.1
• /
• pp.61-67
• /
• 2015

Inland transport becomes more and more important in connecting ports with inland. Therefore, studying on cargo flow from ports to regions has been active in progress by many researchers. However current statistical data of freight flow from origin locations to destination locations does not reflect the exact characteristics of freight flow. Also, they also do not reflect the characteristics of multimodal transport system in which cargos go through intermediate locations such as logistics center or inland container depot. In growing up the emergent need of rebuilding statistical data for freight flow from origin locations to destination locations, this paper will propose a freight flow model with logistics center and it will be verified by genetic algorithm through the simulation scenarios.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Journal of Distribution Science
• /
• v.8 no.1
• /
• pp.21-33
• /
• 2010

The ICT(information & communication technology) led to a dramatic change of floral distribution service, a phase of competition between wholesales and retail stores, and distribution channels in floral industry. It was expected that a role of the intermediaries in this industry would have reduced due to the improvement of transaction process by ICT. However, the ICT made to overcome a regional limit of the floral retail distribution service leading to an increase in sales and enlargement of the stores. And even it made possible to bring out another type of intermediaries such as private associations. This case study focuses on what kinds of efforts the floral wholesale distributors have made to enable a distribution process more smoothly between the wholesale distributors and retail stores through the information system, and what the failure factors in adopting the information system have been. This paper is also to examine how the wholesale distributors have changed themselves to gain dominant positions in distribution channels. As a result of the study, it was found that the intermediaries mostly failed in successfully achieving the distribution channel innovation through the information system because of several main reasons. FLOMARKET Inc. tried to innovate a distribution channel to obtain high quality goods through consolidating a wholesale distribution market in that segregated both floral joint market from free markets. after implementing the information system with consideration of the failure factors, FLOMARKET Inc. was able to minimize goods in stock and make a major purchase of various goods. In addition, it made a possible pre-ordering process and an exact calculation of purchasing goods so they could provide their products with market price in real time, which helped for the company to gain credits from their customers. Also, FLOMARKET Inc. established the information system which well suited to its business stage in order to deal with a rapidly changing distribution environment. It's so obvious that the transaction processing system of FLOMARKET Inc. definitely helped to share information among traders more seamlessly and smoothly in realtime, standardize goods, and make a transaction process clearer. Besides, the transaction information helped the wholesale distributors and retail stores to make more strategic decisions in their business because through the system they enabled to gather the marketing intelligence information more easily and convenient. If we understand that the floral distribution market is characterized by the low IT- based industry, it's worth to examine a case study proving that the information system actually increases the productivity of the transaction process in the floral industry.

• Journal of Distribution Research
• /
• v.9 no.1
• /
• pp.93-110
• /
• 2004

One of the most important things in channel of distribution is the management of intrachannel conflict. In this study, 1 tried to find out the major sources of conflict among distribution channel members of gasolin industry and home electronics industry which have two types of distribution channels - sales branch and agency. I also investigated how the level of conflict influences the business performance of the channel member. The results of the study showed that the imbalance of power, nonfulfillment of roles by manufacturers, nonfulfillment of roles by dealer, divergence in perceptions, intrachannel communication problem have positive relation but role clarity has negative relation with conflict. The results also indicate that the more power supplier exerts upon dealer, the less supplier and dealer practice their roles, and the more communications problem there is, there will be more conflict between channel members. I also analyzed the relationship between conflict and business performance and the result came out as expected: the more conflict there is the less business performance. Some difference was found between sales branch and agency on that aspect. Managerial implications and limitations of the study were also discussed.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.64-73
• /
• 2004

세포 내에서 일어나는 신호 전달 과정은 단백질간의 상호작용을 통해 수행되고 조절된다. 단백질 상호작용 데이터를 활용하여 수행된 연구로는 단백질의 기능을 유추하거나 전체 네트워크 중 다른 지역보다 더 조밀한 상호작용을 추출하여 complex 혹은 pathway를 발견하고 진화 과정을 이해하는 바탕이 되고 있다. 본 연구에서는 신호 전달 경로에 대한 사전 정보 없이 yeast 상호작용 정보와 녹색형광단백질(GFP)을 이용하여 밝혀진 4000여 개의 yeast 단백질 위치 분포 data를 이용하여 신호전달경로를 찾는 방법을 시도했다. 기존 연구에 의해 밝혀진 yeast 내의 단백질 위치 분포 결과를 보면 21개의 category에 대해 각 단백질 상호작용 분포가 다양하게 나타나고, 특정 위치에서 상호작용 빈도수가 현저히 크다는 것을 알 수 있다. 특히 두 단백질이 같은 장소에 있을 경우 상호작용 확률이 높으며, 세포 내 소기관 사이에도 상호작용의 정도가 다양함이 알려져 있다. 따라서 이러한 분포상의 특성을 고려하여 상호작용을 기반으로 하여 세포막 단백질을 출발점으로, 핵에 있는 단백질을 도착점으로 잡고, 그 사이에 존재하는 다양한 가능 경로 중에서 단백질의 위치 정보를 가중치로 사용하여 그 중 최대 가능 경로를 찾도록 구현하였다. 이와 같은 pathway 모델링은 기존에 밝혀진 pathway와의 비교를 통해 알려지지 않은 새로운 경로를 발견하고, 이전에 경로에 참여하지 않은 단백질들을 발견할 수 있고, 이미 알려진 단백질들의 새로운 기능들에 대해서도 추론할 수 있을 것이라 기대한다.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.7 no.4
• /
• pp.79-88
• /
• 2004

본 연구는 실내 환경의 경로탐색을 위한 실내녹화 효과의 적용 및 그로 인한 실내녹화의 환경 분석을 위해 수행되었다. 이 환경 분석은 실내공간 이용자들의 공간 인지의 어려움을 개선하고자 하는데 그 기초를 두고 있으며, 이 공간 인지의 불편함을 일으키는 인자인 환경적 설계 특징을 개선하고자 한다. 이러한 환경적 인자의 설정을 통해 실내 환경 개선 및 환경적 설계기준이 마련되어진다. 본 연구에는 4학년 학부생 57명이 선정되었고, Spielberger 상태 특성 불안 검사를 통해 불안정도가 높은 피험자와 불안정도가 낮은 피험자 두 그룹으로 범주화하였다. 실험 참여자들은 건물 실내 환경의 지정된 공간을 찾아가는 두개의 다른 경로탐색 환경을 인지하도록 하였다. 원래의 건물 실내 환경공간과 시뮬레이션 작업에 의한 실내녹화 공간이 설치된 새로운 건물 실내 환경공간의 두개의 경로탐색 환경이 본 실험에 이용되었다. 실험 참여자들은 실내녹화 공간이 설치된 경로탐색이 용이한 공간을 인지함으로써 the STAI, the Hospital Anxiety and Depression Scale, the Positive and Negative Affect Scale이 개선되었고, 불안정도가 낮은 피험자들이 불안정도가 높은 피험자에 비해 실내녹화 공간이 설치된 경로탐색이 용이한 공간을 좀더 적극적으로 인지하는 것으로 나타났다. 본 연구의 의의는 실내녹화 공간의 경로탐색 효과를 규명하고, 실내 환경의 미학적 환경계획을 시행하여 실내공간 이용자들의 미학적 관점 및 공간 인지를 높이는데 기여하였다는 점이다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.6
• /
• pp.687-693
• /
• 2012

In this paper, we propose a optimal deployment method for cooperative exploration of swarm robots. The proposed method consists of two parts such as optimal deployment and path planning. The optimal area deployment is proposed by the K-mean Algorithm and Voronoi tessellation. The path planning is proposed by the potential field method and A* Algorithm. Finally, the numerical experiments demonstrate the effectiveness and feasibility of the proposed method.