• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1333-1341
• /
• 2009

Tactical path-finding in computer games is path-finding where a path is selected by considering not only basic elements such as the shortest distance or the minimum time spend but also tactical information of surroundings when deciding character's moving trajectory. One way to include tactical information in path-finding is to represent a heuristic function as a sum of tactical quality multiplied by a weighting factor which is.. determined based on the degree of its importance. The choice of weighting factors for tactics is very important because it controls search performance and the characteristic of paths found. In this paper. we propose a method for improving a heuristic function by adjusting weights based on the difference between paths on examples given by a level designer and paths found during the search process based on the CUITent weighting factors. The proposed method includes the search algorithm modified to detect search errors and learn heuristics and the perceptron-like weight updating formular. Through simulations it is demonstrated how different paths found by tactical path-finding are from those by traditional path-finding. We analyze the factors that affect the performance of learning and show the example applied to the real game environments.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.26 no.3
• /
• pp.85-96
• /
• 2023

This study developed and evaluated a safe route guidance service for electric personal assistive mobility device used mainly by the mobility impaired people to improve their mobility. Thirteen underlying factors affecting the mobility of electric personal assistive mobility device have been derived through a survey with the mobility impaired people and employees in related organizations in Busan Metropolitan City. After assigning safety scores to individual factors and identifying the relevant factors along routes of interest with an object detection AI model, the safe route for electric personal assistive mobility device was provided through an optimal path-finding algorithm. As a result of comparing the general route of T-map and the recommended route of this study for the identical routes, the latter had relatively fewer obstacles and the gentler slope than the former, implicating that the recommended route is safer than the general one. As future works, it is necessary to enhance the function of a route guidance service based on the real-time location of users and to conduct spot investigations to evaluate and verify its social acceptability.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.10a
• /
• pp.335-336
• /
• 2008

최근 ITS(Intelligent Transportation Systems)의 보급으로 개인의 기-종점 간 통행시간에 많은 비용절감을 가져왔다. 지금까지의 주요 최단경로알고리즘은 네트워크의 기-종점(Origin-Destination) 거리 간 최단 통행시간을 고려하여 연구되어 왔다. 하지만, 최근 대두되는 고유가 시대의 진입과 더불어 환경에 대한 인식이 높아짐에 따라 기-종점 간 통행시간만을 고려하던 기존의 방법들에서 벗어나 추가적인 요인들의 고려 필요성이 증대되고 있다. 따라서 본 연구에서는 지리정보시스템을 이용한 환경오염을 최소화하는 친환경 최단경로 탐색방법 개발을 제안하고자 한다. 이를 위하여 3D 좌표정보 도로를 활용하여, 도로구배 조건에 따른 배출가스의 증감율을 환경오염편익으로 구분하고, 이를 사회적비용으로 환산하여, 경로탐색의 추가적인 요소로 반영하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.59-60
• /
• 2019

WCS에서 AGV의 스케줄링과 동적, 정적 장애물 인식 및 충돌 회피문제는 오래전부터 다뤄져 온 중요한 문제이다. 본 논문에서는 위의 문제를 해결하기 위해 Lidar 센서를 중심으로 다양한 데이터를 기반으로 한 강화학습 시스템을 제안한다. 제안하는 시스템은 기본의 명시적인 알고리즘에 비해 다양하고 유동적인 환경에서 경로 계획과 동적 정적 장애물을 인식하고 안정적으로 회피하는 것을 확인하였으며 산업 현장에 도입 가능성을 확인하였다. 또한 강화학습의 적용 범위, 적용 방안과 한계에 대해서 시사한다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.347-348
• /
• 2022

자율운항선박 도입에 관한 논의가 국제해사기구에서 본격적으로 시작됨에 따라 자율운항선박 관련 기술개발이 세계적으로 활발하게 진행되고 있다. 그러나, 통신, 보안, 고장진단, 유지보수 등의 기술개발이 아직 미흡하여, 자율운항선박의 상용화까지는 많은 시간이 소요될 것으로 예상된다. 이러한 기술들은 문제가 발생할 경우 선박에 막대한 피해를 발생시킬 수 있으며, 특히, 연안을 항해하는 선박보다는 대양을 항해하는 선박에 더 치명적이기 때문이다. 본 연구에서는 대양항해 시 자율운항선박에 발생할 수 있는 문제들을 극복하기 위한 방안으로 여러 척의 선박을 하나의 그룹으로 묶어 항해하는 그룹항법시스템을 제안한다. 하나의 그룹은 한 척의 유인선박인 리더선박과 여러 척의 무인선박인 추종선박으로 구성되어 있으며, 항해하는 동안 일직선 형태를 유지한다. 리더선박은 출발지에서 목적지까지 미리 설정된 변침점을 따라 항해하며, 추종선박은 리더선박의 경로를 추종하여 항해한다. 선박의 침로를 제어하기 위한 타각 제어기는 선박에서 주로 사용되는 PD 제어기를 구현하여 사용하였다. 그룹항법시스템을 검증하기 위해 선박해양플랜트연구소에서 공개한 KVLCC2의 축소 모형인 L-7 모델을 사용하여 시뮬레이션을 진행하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1037-1053
• /
• 1991

Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.286-296
• /
• 2009

A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.91-98
• /
• 2003

Visitors who browse the web from wireless PDAs, cell phones are frequently frustrated by interfaces. Simply replacing graphics with text and reformatting tables does not solve this problem, because deep link structures can still require more time. To solve this problem, in the paper we propose an algorithm, Minimal Path Algorithm that automatically improves wireless web navigation by suggesting useful shortcut links in real time. In the result of this paper, Minimal Path algorithm offer the shortcut and the number of shortest links to web users.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.425-430
• /
• 2005

Many problems can be formulated in terms nf graphs and thus solved by graph-theoretic algorithms. This paper is concerned with finding paths between nodes over the distributed and overlapped graphs. The proposed method allows multiple agents to cooperate to find paths without merging the distributed graphs. For each graph there is a designated agent which is charged of providing path-finding service for hot graph and initiating the path-finding tasks of which path starts from the graph. The proposed method earlier on constructs an abstract graph so-called viewgraph for the distributed overlapped graphs and thus enables to extract the information about how to guide the path finding over the graphs. The viewgraph is shared by all agents which determine how to coordinate other agents for the purpose of finding paths. Each agent maintains the shortest path information among the nodes which are placed in different overlapped subgraphs of her graph. Once an agent is asked to get a path from a node on her graph to another node on another's graph, she directs other agents to provide the necessary information for finding paths.

• Review of KIISC
• /
• v.29 no.6
• /
• pp.39-48
• /
• 2019

랜섬웨어(Ransomware)는 몸값(Ransom)과 소프트웨어(Software)의 합성어로 사용자 시스템을 장악하여 중요 문서 및 파일을 암호화하고 암호화된 파일의 복호화를 대가로 가상 화폐를 요구한다. 랜섬웨어로 인한 피해는 매년 증가하고 있으며 새로운 랜섬웨어의 등장과 변종의 출현이 빈번하다. 이에 본 논문은 2019년에 등장하거나 영향을 주고 있는 랜섬웨어에 대한 유포방법, 유포 대상, 알고리즘 사용 현황을 밝히고 국내 외 피해 사례를 소개한다. 그리고 분기 별로 감염율 상위 5개의 랜섬웨어를 살펴보고 평균 요구 금액에 대해 기술한다. 마지막으로 주요 및 신규 랜섬웨어 대해 유포 경로, 특징, 암호화 알고리즘, 복호화 요소 및 복호화 도구에 대해서는 표로 요약하며 자세히 서술한다.