• Title/Summary/Keyword: Traveling system

Search Result 441, Processing Time 0.028 seconds

Efficient Localization of a Mobile Robot Using Spatial and Temporal Information from Passive RFID Environment (수동 RFID 환경에서의 공간/시간 정보를 이용한 이동로봇의 효율적 위치 추정 기법)

  • Kim, Sung-Bok;Lee, Sang-Hyup
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.2
    • /
    • pp.164-172
    • /
    • 2008
  • This paper presents the efficient localization of a mobile robot traveling on the floor with tags installed, using the spatial and temporal information acquired from passive RFID environment. Compared to previous research, the proposed localization method can reduce the position estimation error and also cut down the initial cost tag installation cost. Basically, it is assumed that a mobile robot is traveling over a series of straight line segments, each at a certain constant velocity, and that the number of tags sensed by a mobile robot at each sampling instant is at most one. First, the velocity and position estimation of a mobile robot starting from a known position, which is valid for all segments except the first one. Second, for the first segment in which the starting position is unknown, the velocity and position estimation is made possible by enforcing a mobile robot to traverse at least two tags at a constant velocity with the steering angle unchanged. Third, through experiments using our passive RFID localization system, the validity and performance of the mobile robot localization proposed in this paper is demonstrated.

  • PDF

Optimal Routes Analysis of Vehicles for Auxiliary Operations in Open-pit Mines using a Heuristic Algorithm for the Traveling Salesman Problem (휴리스틱 외판원 문제 알고리즘을 이용한 노천광산 보조 작업 차량의 최적 이동경로 분석)

  • Park, Boyoung;Choi, Yosoon;Park, Han-Su
    • Tunnel and Underground Space
    • /
    • v.24 no.1
    • /
    • pp.11-20
    • /
    • 2014
  • This study analyzed the optimal routes of auxiliary vehicles in an open-pit mine that need to traverse the entire mine through many working points. Unlike previous studies which usually used the Dijkstra's algorithm, this study utilized a heuristic algorithm for the Traveling Salesman Problem(TSP). Thus, the optimal routes of auxiliary vehicles could be determined by considering the visiting order of multiple working points. A case study at the Pasir open-pit coal mine, Indonesia was conducted to analyze the travel route of an auxiliary vehicle that monitors the working condition by traversing the entire mine without stopping. As a result, we could know that the heuristic TSP algorithm is more efficient than intuitive judgment in determining the optimal travel route; 20 minutes can be shortened when the auxiliary vehicle traverses the entire mine through 25 working points according to the route determined by the heuristic TSP algorithm. It is expected that the results of this study can be utilized as a basis to set the direction of future research for the system optimization of auxiliary vehicles in open-pit mines.

A Study on the Travel Fashion Bag Design Using the Op-Art Textile Patterns -Applying the Artwork of Victor Vasarely- (옵아트(Op-Art) 패턴의 여행용 패션가방 디자인 연구 -빅토르 바자렐리(Victor Vasarely)의 작품 응용을 중심으로-)

  • Kim, Min-Hye;Park, Hye-Won
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.35 no.3
    • /
    • pp.371-384
    • /
    • 2011
  • This study with 'trip' as a theme, aims to develop textile designs and fashion bags for travel which is widely applicable fitting traveler's T P O, applying Victor Vasarely's artwork. During the planning process of design, 'Whenever & Wherever's concept was set by analyzing fashion trend information in 2010-11 F/W proposed by Interfashion Planning and FCK; in addition, 'Bobos' were selected as research targets. It organized 4 images of 'Modern', 'Romantic', 'Classic' and 'Fantastic'. The motives are proposed textile design with '$Cross^2$', 'Falling Z', 'Cir-Classicism' and 'Skinny-holic' per each theme. The designs developed were printed out and into polyester canvas with a Polaris V6 DTP from dgen, Corp. Textile designs developed were applied for 'two-way' formed fashion bags for traveling with high practicality. Fashion bags for traveling consisted of big bags, tote bags, and hip sacks; a total of 12 works (4 sets per theme) were produced. This study sought practical plans for artworks by producing fashion goods through a DTP system. The results of this study can be used as guidelines for further studies and as a significant contribution to the creation of high values for exciting fashion products.

A Lane-Departure Identification Based on Linear Regression and Symmetry of Lane-Related Parameters (차선관련 파라미터의 대칭성과 선형회귀에 기반한 차선이탈 인식)

  • Yi Un-Kun;Lee Joon-Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.5
    • /
    • pp.435-444
    • /
    • 2005
  • This paper presents a lane-departure identification (LDI) algorithm for a traveling vehicle on a structured road. The algorithm makes up for the weak points of the former method based on EDF[1] by introducing a Lane Boundary Pixel Extractor (LBPE), the well known Hough transform, and liner regression. As a filter to extract pixels expected to be on lane boundaries, the LBPE plays an important role in enhancing the robustness of LDI. Utilizing the pixels from the LBPE the Hough transform provides the lane-related parameters composed of orientation and distance, which are used in the LDI. The proposed LDI is based on the fact the lane-related parameters of left and right lane boundaries are symmetrical as for as the optical axis of a camera mounted on a vehicle is coincident with the center of lane; as the axis deviates from the center of lane, the symmetrical property is correspondingly lessened. In addition, the LDI exploits a linear regression of the lane-related parameters of a series of successive images. It plays the key role of determining the trend of a vehicle's traveling direction and minimizing the noise effect. Except for the two lane-related parameters, the proposed algorithm does not use other information such as lane width, a curvature, time to lane crossing, and of feet between the center of a lane and the optical axis of a camera. The system performed successfully under various degrees of illumination and on various road types.

The Costume of Korean Envoys and Trading Goods in 1811 through Dong-sa-lok - Focused on Jeongsa, Busa - (「동사록」을 통해 본 1811년의 조선통신사 복식과 교환물품 - 정사 부사를 중심으로 -)

  • Lee, Ja-Yeon
    • Fashion & Textile Research Journal
    • /
    • v.8 no.3
    • /
    • pp.269-274
    • /
    • 2006
  • The purpose of this study is to examine the costumes and trading goods of the Korean envoys in 1811. The findings of the study are as follows: The Korean envoys, as shown in literature, were dressed up three different types of costumes: Pyongbok, Gongbok, Jobok. They put on different kinds of clothes depending on the purpose of the events such as for ceremonial purpose or for traveling purpose. For traveling purpose, the envoys wore Pyongbok like Waryonggwan and Hakchangeui, which were commonly used as Pyeonbok in those times of Chosun era. For ceremonial purpose, they chose to wear Danryeong, Gongbok, Geumgwanjobok in this order following the order of the importance of the ceremony. The design of Jobok and Gongbok of Jeongsa and Busa were different from that of the early Chosun era. This difference in the Jobok and Gongbok demonstrates that Gwanbok has been transformed with the change in the general Po system in the late Chosun era. When the costumes of Korean envoys in 1811 were compared to those in 1711, there were similarities in terms of the design of Jobok and Gongbok, which indicated that little had changed for the period of 100 years. The most popular exchanged Byeolpok of Chosun was articles of clothing such as Daeyuja, Daedanja, Baekjeopo, Sangjeopo, and Baekmyeonju, while that of Japan was mostly objects of craftwork and a small amount of Po. The fact that cloth was one of the main items from the early Chosun era to the early 19C shows the highly developed clothing culture of Chosun era.

An Application of k-Means Clustering to Vehicle Routing Problems (K-Means Clustering의 차량경로문제 적용연구)

  • Ha, Je-Min;Moon, Geeju
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.1-7
    • /
    • 2015
  • This research is to develop a possible process to apply k-means clustering to an efficient vehicle routing process under time varying vehicle moving speeds. Time varying vehicle moving speeds are easy to find in metropolitan area. There is a big difference between the moving time requirements of two specific delivery points. Less delivery times are necessary if a delivery vehicle moves after or before rush hours. Various vehicle moving speeds make the efficient vehicle route search process extremely difficult to find even for near optimum routes due to the changes of required time between delivery points. Delivery area division is designed to simplify this complicated VRPs due to time various vehicle speeds. Certain divided area can be grouped into few adjacent divisions to assume that no vehicle speed change in each division. The vehicle speeds moving between two delivery points within this adjacent division can be assumed to be same. This indicates that it is possible to search optimum routes based upon the distance between two points as regular traveling salesman problems. This makes the complicated search process simple to attack since few local optimum routes can be found and then connects them to make a complete route. A possible method to divide area using k-means clustering is suggested and detailed examples are given with explanations in this paper. It is clear that the results obtained using the suggested process are more reasonable than other methods. The suggested area division process can be used to generate better area division promising improved vehicle route generations.

The Ant Algorithm Considering the Worst Path in Traveling Salesman problems (순회 외판원 문제에서 최악 경로를 고려한 개미 알고리즘)

  • Lee, Seung-Gwan;Lee, Dae-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.12
    • /
    • pp.2343-2348
    • /
    • 2008
  • Ant algorithm is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, we propose the improved $AS_{rank}$ algorithms. The original $AS_{rank}$ algorithm accomplishes a pheromone updating about only the paths which will be composed of the optimal path is higher, but, the paths which will be composed the optimal path is lower does not considered. In this paper, The proposed method evaporate the pheromone of the paths which will be composed of the optimal path is lowest(worst tour path), it is reducing the probability of the edges selection during next search cycle. Simulation results of proposed method show lower average search time and average iteration than original ACS.

A Study of Electrospun PVDF on PET Sheet

  • Chanunpanich, Noppavan;Lee, Byung-Soo;Byun, Hong-Sik
    • Macromolecular Research
    • /
    • v.16 no.3
    • /
    • pp.212-217
    • /
    • 2008
  • PVDF ($Kynar^{(R)}$ 761) nanofibers were made by electrospinning with an external voltage of 6-10 kV, a traveling distance of 7-15 cm and a flow rate of 0.4-1 mL/h. Although the mean diameter of the fibers has not changed significantly, the conditions affected the change in diameter distribution. This was attributed to interactions, both attraction and repulsion, between the positive charges on the polymer solutions and the electrically grounded collector. Higher voltages and traveling distance increased the level of attraction between the positive charge on the polymer solution and the electrically grounded collector, resulting in a narrow diameter distribution, In addition, a high flow rate allowed a high population of uniformly charged solutions to travel to the grounded collector, which resulted in a narrow diameter distribution. The optimum conditions for electrospinning of PVDF in DMAc/acetone (3/7 by wt) were a collector voltage of 6 kV, a syringe tip to collector of 7 cm, a flux rate of 0.4 mL/h and 10 kV, 10 cm, 1 mL/h, Since PVDF is widely used as a filtration membrane, it was electrospun on a PET support with a rotating drum as a grounded collector. Surprisingly, some straight nanofibers were separated from the randomly deposited nanofibers. The straight nanofiber area was transparent, while the randomly deposited nanofiber area was opaque. Both straight nanofibers and aligned nanotibers could be obtained by manipulating the PET drum collector. These phenomena were not observed when the support was changed to an Al sheet. This suggests that a pseudo dual collector was generated on the PET sheet. No negative charge was created because the PET sheet was not a conductive material. However, less charge was created when the sheet was not perfectly attached to the metal drum. Hence, the nanotibers jumped from one grounded site to the nearest one, yielding a straight nanofiber.

Design of the Waiting List based O2O Service Platform for the Share House (쉐어하우스를 위한 웨이팅 리스트 기반의 O2O 서비스 플랫폼 구현)

  • Phyo, Gyung-soo;Park, Jin-tae;Kim, Hyun-gook;Moon, Il-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.681-683
    • /
    • 2016
  • Recently, sharing economy is getting the attention of the public. So this phenomenon to share their goods, home, gifts, etc. in various fields has been increased. Typically when traveling away from home to host as "Airbnb", the share house to share their homes are traded most actively. Through a share house host can make money using house empty, customers can take advantage of the hostel while traveling at low prices. The existing share house system must ensure that every time they empty the house Customers, host had the inconvenience of having to wait for the application of the tenant customers. To solve this problem and to implement a service platform based on the waiting list. Through this platform, customers will be able to eliminate the inconvenience of having to find the house every time you want to apply for a tenant waiting to get home, give the order to wait.

  • PDF

Design of a Bridge Transported ServoManipulator System for a Radioactive Environment

  • Park, B.S.;Jin, J.H.;Ahn, S.H.;Song, T.G.;Kim, D.G.;Yoon, J.S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2514-2518
    • /
    • 2003
  • The KAERI Spent Fuel Remote Technology Development (SFRTD) Department is developing the remote maintenance and repair equipment, which is used in a hot cell in an intense radiation field, as part of a project to develop the Advanced spent fuel Conditioning Process (ACP). Although several mechanical master-slave manipulators (MSMs) is mounted on the hot cell wall, their reach will be limited and cannot access areas for all the ACP equipment maintenance. A Bridge Transported ServoManipulator (BTSM) has been designed to overcome the limitation of access areas that is a drawback of MSMs for the ACP equipment maintenance. The BTSM system consists of four components: a transporter with telescoping tubeset, a slave manipulator, a master manipulator, and a remote control system. The BTSM system has been designed by Solid Edge that is a 3D computer-aided design (CAD) software, except for the remote control system. The master manipulator and the slave manipulator are kinematically similar in design, except for the handle and the tong, respectively. The manipulators have 6 degrees of freedom (DOF) plus the jaws motion. The transporter has traveling, traverse, and hoisting motion to position the slave manipulator.

  • PDF