• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.6
• /
• pp.293-297
• /
• 2021

This paper presents how to create a 3D map and solve problems related to generating a global path planning for navigation. Map creation and localization were performed using the RTAB-Map package to create a 3D map of the environment. In addition, when the target point is within the obstacle space, the problem of not generating a global path was solved using the asr_navfn package. The performance of the proposed system is validated through experiments with a wheelchair-type robot.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.2
• /
• pp.115-121
• /
• 2024

Each ADS must have a validation and evaluation scenario for ODD. This requires a large number of scenarios, so a scenario library must be developed. In order to effectively utilize the scenario library, a system that supports testing in the ODD of the user's choice is required. In other words, in order to develop a scenario library, it is necessary to build a database on actual driving road conditions (geometry, etc.). Accordingly, in this study, we establish a domestic driving environment database based on HD-Map for driving safety testing, design a system that can search test target sections in connection with the ODD of the scenario, and present the implementation results. In the future, it is expected that the domestic driving environment database will be able to create scenarios through linking with the scenario library and directly utilize them for scenario-based evaluation of various demand sources.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.6
• /
• pp.1147-1161
• /
• 2012

In this paper, a coincidence theorem for a compact ${\Re}\mathfrak{C}$-map is proved in an abstract convex space. Several more general coincidence theorems for noncompact ${\Re}\mathfrak{C}$-maps are derived in abstract convex spaces. Some examples are given to illustrate our coincidence theorems. As applications, an alternative theorem concerning the existence of maximal elements, an alternative theorem concerning equilibrium problems and a minimax inequality for three functions are proved in abstract convex spaces.

• Journal of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.251-264
• /
• 1995

Applications of the classical Knaster-Kuratowski-Mazurkiewicz (si-mply, KKM) theorem and the fixed point theory of multifunctions defined on convex subsets of topological vector spaces have been greatly improved by adopting the concept of convex spaces due to Lassonde [L1]. In this direction, the first author [P5] found that certain coincidence theorems on a large class of composites of upper semicontinuous multifunctions imply many fundamental results in the KKM theory.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.359-367
• /
• 2006

A map is defined as model of 3D spatial phenomena of the real world. Because most of the maps are represented on the 2D plane, limited information is provided. In consequence, applications are also limited with 2D maps and map users of various fields require 3D form of map. Without doubt, state-of-the-art information technology such as telematics and ubiquitous is location based system, therefore, role of the 3D mapping is getting more significant. It is obvious that 3D maps provide more visual perception than 2D maps. The main object of this stud)r is focused on generation of 3D digital maps in economical and efficient way using photogrammetrically compiled data. Topographic maps are required updating and revision in a certain period and the period is getting shorter Therefore, development of the map editing system is key issue for maintaining quality and updating of the maps to provide reliable geographic information. Special requirements should be taken account into 3D digital map editing. Therefore. design, configuration and functions of the editing system were explored.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1431-1438
• /
• 2004

Reinforcement learning learns policies for accomplishing a task's goal by experience through interaction between agent and environment. Q-learning, basis algorithm of reinforcement learning, has the problem of curse of dimensionality and slow learning speed in the incipient stage of learning. In order to solve the problems of Q-learning, new function approximation methods suitable for reinforcement learning should be studied. In this paper, to improve these problems, we suggest Fuzzy Q-Map algorithm that is based on online fuzzy clustering. Fuzzy Q-Map is a function approximation method suitable to reinforcement learning that can do on-line teaming and express uncertainty of environment. We made an experiment on the mountain car problem with fuzzy Q-Map, and its results show that learning speed is accelerated in the incipient stage of learning.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.183-193
• /
• 2022

Smart cities are expected to provide residents with convenience via various agents such as CCTV, delivery robots, security robots, and unmanned shuttles. Environmental data collected by various agents can be used for various purposes, including advertising and security monitoring. This study suggests a surveillance map data framework for efficient and integrated multimodal data representation from multi-agents. The suggested surveillance map is a multilayered global information grid, which is integrated from the multimodal data of each agent. To confirm this, we collected surveillance map data for 4 months, and the behavior patterns of humans and vehicles, distribution changes of elevation, and temperature were analyzed. Moreover, we represent an anomaly detection algorithm based on a surveillance map for security service. A two-stage anomaly detection algorithm for unusual situations was developed. With this, abnormal situations such as unusual crowds and pedestrians, vehicle movement, unusual objects, and temperature change were detected. Because the surveillance map enables efficient and integrated processing of large multimodal data from a multi-agent, the suggested data framework can be used for various applications in the smart city.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.1-6
• /
• 2023

The purpose of this study is to research and develop so that users who are gradually progressing in the popularization of smartphones and the calculation of agricultural quality can use more active and flexible applications than existing application fields. People use event management applications to remember what they need to do, and maps applications to get to their appointments on time. You will need to build a glue-delivered application that leverages the Maps API to be able to recommend the glove's path for events so that the user can use the application temporarily. By comparing and analyzing currently used calendar, map, and schedule applications, several Open Maps APIs were compared to supplement the weaknesses and develop applications that converge the strengths. The results of application development by applying the optimal algorithm for recommending traffic routes according to time and place for the schedule registered by the user are described.

• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.719-730
• /
• 1997

From a minimax inequality related to admissible multimaps, we deduce generalized versions of lopsided saddle point theorems, fixed point theorems, existence of maximizable linear functionals, the Walras excess demand theorem, and the Gale-Nikaido-Debreu theorem.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.39-49
• /
• 2001

When an appropriate model is fitted to explain a certain categorical data, outlying cell detection plays very important role to reduce the lack of fit. There exist many statistical methods to identify outlying cells in contingency table. In this paper, correspondence analysis is applied to identify one or two outlying cells. When corresponding relationships between categories of the row and columns are explored, we find that outlying cells could be identified via the correspondence analysis map.