• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.814-819
• /
• 2007

Palletizing task is well-known time consuming and laborious process in factory, hence automation is seriously required. To do this, artificial robot is generally used. These systems however, mostly user teaches the robot point to point and to avoid time-variable obstacle, robot is required to attach the vision camera. These system structures bring about inefficiency and additional cost. In this paper we propose task-oriented trajectory generation algorithm for palletizing. This algorithm based on $A^{*}$ algorithm and slice plane theory, and modify the object dealing method. As a result, we show the elapsed simulation time and compare with old method. This simulation algorithm can be used directly to the off-line palletizing simulator and raise the performance of robot palletizing simulator not using excessive motion area of robot to avoid adjacent components or vision system. Most of all, this algorithm can be used to low-level PC or portable teach pendent

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.10
• /
• pp.151-157
• /
• 2006

As people's living standard is being improved, human works are being replaced by robots. However, because most robots are used in process industry, fixed on the ground, we need to develop human robots that have wide applications. Currently many researches are being conducted on human robots with the object of replacing human works, but because of lack of relevant hardware, such robots are being applied limitedly to very simple tasks. To overcome the limitation, the present study developed a kinematical mechanism and a controller. Based on human kinematics, the shoulders and the arms were composed of master arms with 3 degree of freedom, and we reproduced motions similar to human ones through the characteristics of joint variables and experiment on the trajectory of the end effector.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.59-75
• /
• 2006

One of the most challenging and encouraging applications of state-of-the-art technology is the field of traffic control systems. It combines techniques from the areas of telecommunications and computer science to establish traffic information and various assistance services. The support of the system requires a moving objects database system (MODB) that stores moving objects efficiently and performs spatial or temporal queries with time conditions. In this paper, we propose schemes to distribute an index nodes of trajectory based on spatio-temporal proximity and the characteristics of moving objects. The scheme predicts the extendible MBB of nodes of index through the prediction of moving object, and creates a parallel trajectory index. The experimental evaluation shows that the proposed schemes give us the performance improvement by 15%. This result makes an improvement of performance by 50% per one disk.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.101-110
• /
• 2004

The robots that will be needed in the near future are human-friendly robots that are able to coexist with humans and support humans effectively. To realize this, humans and robots need to be in close proximity to each other as much as possible. Moreover, it is necessary for their interactions to occur naturally. It is desirable for a robot to carry out human following, as one of the human-affinitive movements. The human-following robot requires several techniques: the recognition of the moving objects, the feature extraction and visual tracking, and the trajectory generation for following a human stably. In this research, a predictable intelligent space is used in order to achieve these goals. An intelligent space is a 3-D environment in which many sensors and intelligent devices are distributed. Mobile robots exist in this space as physical agents providing humans with services. A mobile robot is controlled to follow a walking human using distributed intelligent sensors as stably and precisely as possible. The moving objects is assumed to be a point-object and projected onto an image plane to form a geometrical constraint equation that provides position data of the object based on the kinematics of the intelligent space. Uncertainties in the position estimation caused by the point-object assumption are compensated using the Kalman filter. To generate the shortest time trajectory to follow the walking human, the linear and angular velocities are estimated and utilized. The computer simulation and experimental results of estimating and following of the walking human with the mobile robot are presented.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.101-110
• /
• 2006

ADevelopment of various geographic observations, GPS, and Wireless Communication technologies make it easy to control many moving objects and to build an intelligent transport system and transport vehicle management system. However it is difficult to make a suitable system in the real world with a variety of tests to evaluate the performance fairly because real vehicle data are not enough as evaluating and testing the transport plan in the system. Therefore some moving object data generator would be used in most researches. However they can not generate vehicle trajectory according to a user scenario defined to be applied to transport plan, because the existing data generators consider only a gauss distribution, road network. In this paper we design and implement a vehicle data generator for creating vehicle trajectory data based on the user-defined scenario. The designed data generator could make the vehicle location depending on user's transport plan. Besides we store the scenario as patterns and reutilize the used scenario.

• 한국디지털정책학회:학술대회논문집
• /
• 2005.06a
• /
• pp.517-530
• /
• 2005

Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However, Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets showed that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also showed that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2007.05a
• /
• pp.374-378
• /
• 2007

As people's living standard is being improved, human works are being replaced by robots. However, because roost robots are used in process industry, fixed on the ground, we need to develop human robots that have wide applications. Currently many researches are being conducted on human robots with the object of replacing human works, but because of lack of relevant hardware, such robots are being applied limitedly to very simple tasks. To overcome the limitation, the present study developed a kinematical mechanism and a controller. Based on human kinematics, the shoulders and the arms were composed of master arms with 3 degree of freedom, and we reproduced motions similar to human ones through the characteristics of joint variables and experiment on the trajectory of the end effector.

• Journal of Digital Convergence
• /
• v.3 no.1
• /
• pp.149-163
• /
• 2005

Researches for NN(nearest neighbor) query which is often used in LBS system, have been worked. However. Conventional NN query processing techniques are usually meaningless in moving object management system for LBS since their results may be invalidated as soon as the query and data objects move. To solve these problems, in this paper we propose a new nearest neighbor query processing technique, called CTNN, which is possible to meet continuous trajectory nearest neighbor query processing. The proposed technique consists of Approximate CTNN technique which has quick response time, and Exact CTNN technique which makes it possible to search accurately nearest neighbor objects. Experimental results using GSTD datasets shows that the Exact CTNN technique has high accuracy, but has a little low performance for response time. They also shows that the Approximate CTNN technique has low accuracy comparing with the Exact CTNN, but has high response time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3197-3218
• /
• 2012

Compared with traditional itinerary planning, intention-oriented itinerary recommendations can provide more flexible activity planning without requiring the user's predetermined destinations and is especially helpful for those in unfamiliar environments. The rank and classification of points of interest (POI) from location-based social networks (LBSN) are used to indicate different user intentions. The mining of vehicles' physical trajectories can provide exact civil traffic information for path planning. This paper proposes a POI category-based itinerary recommendation framework combining physical trajectories with LBSN. Specifically, a Voronoi graph-based GPS trajectory analysis method is utilized to build traffic information networks, and an ant colony algorithm for multi-object optimization is implemented to locate the most appropriate itineraries. We conduct experiments on datasets from the Foursquare and GeoLife projects. A test of users' satisfaction with the recommended items is also performed. Our results show that the satisfaction level reaches an average of 80%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.28-30
• /
• 2002

시간에 따라 연속적으로 위치가 변화하는 객체를 이동체라 한다. 기존의 R-Tree를 사용한 이동체 색인에 관한 연구에서는 현재 위치 질의 시 고비용의 연산이 요구되고, 시간축의 값이 증가하는 방향으로 보고되는 이동체의 위치데이터의 특징을 고려한 노드 분할 정책이 제안되지 않았다. 이 논문에서는 이동체의 현재 위치 및 과거 위치에 대한 색인 방법인 CPTR-Tree(Current Position and Trajectory R-Tree)를 제안한다. 특히, 제안 방법에서 이동체의 현재 위치에 대한 공간차원의 PMBR(Point MBR)을 유지함으로써, 현재 위치 질의 처리시 불필요한 노드 접근 횟수를 줄일 수 있어 성능향상을 할 수 있다. 그리고, 시간축의 값이 증가하는 형태로 보고되는 이동체 위치 데이터의 특징을 고려하여 시간축 분할시 SP(Split Parameter) 분할 방법을 제공함으로써 노드 공간 활용률을 높여 색인의 크기를 줄이고, 공간축 분할시 노드 겹침을 줄이는 동적 클리핑 분할 정책을 제시하여 이동체 과거 위치 검색 효율을 높인다.