• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.298-303
• /
• 2008

User adaptive services have been important features in many applications. To provide such services, various techniques with various kinds of data are being used. In this paper, we propose a method to analyze user's past moving paths for predicting the goal position and the path to the goal by observing the user's current moving path. We develop a spatio-temporal similarity measure between paths. We choose a past path which is the most similar to the current path using the similarity. Based on the chosen path, user's spatio-temporal position is estimated. Through experiments we confirm this method is useful and effective.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.568-574
• /
• 2006

User adaptive services have been important features in many applications. To provide such services, various techniques with various kinds of data are being used. In this paper, we propose a method to analyze user's past moving paths and predict the goal position and the path to the goal by observing the user's current moving path. We develop a spatiotemporal similarity measure between paths. We choose a past path which is the most similar to the current path using the similarity. Based on the chosen path, user's spatiotemporal position is estimated. Through experiments we confirm this method is useful and effective.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.2
• /
• pp.41-54
• /
• 2013

In this paper, We collected location based services of the user's past moving paths through the GPS. Using the collected by location-based services through the analysis of the similarity between the user's of service level agreement recommended of mobile contact area(SLA) proposed that can be. S-RCA method based on Service Level Agreement of the users in order to provide the service user's path distance, time, and to predict the direction of the movement paths and collect. The data collected by the interests and requirements of users through classification with the same interests and the needs of users to move between the analysis of the similarity between the path is used to analyze the results of analysis of the path-specific tolerance range (distance, time, and space) is determined according to the difference in the contact area. From a small area of the error range for users first to recommended and through their smartphones recommended contact area (S-RCA) to meet with the other party to make a choice of recommended methods. We verify through experiments that proposed method(S-RCA) a valid and reliable mobile contact area were recommended.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.13-20
• /
• 2009

The most of navigation services these days, are designed in order to just provide a shortest path from current position to destination for a user. Several navigation services provides not only the path but some fragmentary information about its point, but, the data tends to be highly restricted because it's quality and quantity totally depends on service provider's providing policy. In this paper, we describe the folksonomy POI(Point of interest) recommender system using mashup in order to provide the information that is more useful to the user. The POI recommender system mashes-up the user's folksonomy data that stacked by user with using external folksonomy service(like Flickr) with others' in order to provide more useful information for the user. POI recommender system recommends others' tag data that is evaluated with the user folksonomy similarity. Using folksonomy mahup makes the services can provide more information that is applied the users' karma. By this, we show how to deal with the data's restrictions of quality and quantity.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.55-61
• /
• 2020

In this paper, we present a novel approach to efficiently control the location of NPC(Non-playable characters) in the interactive virtual world such as game, virtual reality. To control the NPC's movement path, we first calculate the main trajectory based on the user's path, and then move the NPC based on the weight map. Our method constructs automatically a navigation mesh that provides new paths for NPC by referencing the user trajectories. Our method enables adaptive changes to the virtual world over time and provides user-preferred path weights for smartagent path planning. We have tested the usefulness of our algorithm with several example scenarios from interactive worlds such as video games, virtual reality. In practice, our framework can be applied easily to any type of navigation in an interactive world.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.49-54
• /
• 2017

Pathfinding for pedestrians provided by various navigation programs is based on a shortest path search algorithm. There is no big difference in their guide results, which makes the path quality more important. Multiple criteria should be included in the search cost to calculate the path quality, which is called a multi-criteria pathfinding. In this paper we propose a user adaptive pathfinding algorithm in which the cost function for a multi-criteria pathfinding is defined as a weighted sum of multiple criteria and the weights are learned automatically by Perceptron learning. Weight learning is implemented in two ways: short-term weight learning that reflects weight changes in real time as the user moves and long-term weight learning that updates the weights by the average value of the entire path after completing the movement. We use the weight update method with momentum for long-term weight learning, so that learning speed is improved and the learned weight can be stabilized. The proposed method is implemented as an app and is applied to various movement situations. The results show that customized pathfinding based on user preference can be obtained.

• Proceedings of the Korea Contents Association Conference
• /
• 2017.05a
• /
• pp.453-454
• /
• 2017

The travellers using social media leave their location history in the form of trajectories. These trajectories can be bridged for acquiring information, required for future recommendation for the future travelers, who are new to that location, providing all sort of information. In this paper, we propose a personalized travel path recommendation scheme based on social life log. By taking advantage of two kinds of social media such as travelogue and community contributed photos, the proposed scheme can not only be personalized to user's travel interest but also be able to recommend a travel path rather than individual Points of Interest (POIs). It also maps both user's and routes' textual descriptions to the topical package space to get user topical package model and route topical package model (i.e., topical interest, cost, time and season).

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.12
• /
• pp.135-144
• /
• 2020

In graph theory, the least-cost path is discovered by searching the shortest path between a start node and destination node. The least cost is calculated as a one-dimensional value that represents the difference in distance or price between two nodes, and the nodes and edges that comprise the lowest sum of costs between the linked nodes is the shortest path. However, it is difficult to determine the shortest path if each node has multiple attributes because the number of cost types that can appear is equal to the number of attributes. In this paper, a shortest path search scheme is proposed that considers multiple attributes using the Euclidean distance to satisfy various user requirements. In simulation, we discovered that the shortest path calculated using one-dimensional values differs from that calculated using the Euclidean distance for two-dimensional attributes. The user's preferences are reflected in multi attributes and it was different from one-dimensional attribute. Consequently, user requirements could be satisfied simultaneously by considering multiple attributes.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.43-58
• /
• 2008

In this paper, we have presented a dynamic, predictive location update scheme that takes into account each user's mobility patterns. A user's past movement history is used to create two-dimensional transition probability matrix which makes use of two directional consecutive location areas. A mobile terminal utilizes the transition probability to develop a predictive path which consists of several predictive nodes and then the location update is saved as long as a mobile user follows the predictive path. Using continuous-time Markov chain, cost functions of location update and paging are derived and it is shown that the number of predictive nodes can be determined optimally. To evaluate the proposed scheme, simulations are designed and the numerical analysis is carried out. The numerical analysis features user's mobility patterns and regularity, call arrival rates, and cost ratio of location update to paging. Results show that the proposed scheme gives lower total location management cost, compared to the other location update schemes.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.32 no.3
• /
• pp.321-328
• /
• 1996

This paper presents a robot simulator which can automatically generate a smooth collision free path. This simulator has the characterstisc of the object - oriented programming which is coded in Borland C+ +. Using General Inverse Algorithm, the inverse kinematics solutions of any kind of robots can be found generally. This simulator also uses Bezier Functions for the description of a smooth collision - free path. In addition, GUI(Graphic User Interface)technique is employed for user's convenience.