• Title/Summary/Keyword: Pick-Up Sequence

Search Result 9, Processing Time 0.026 seconds

Integrating GIS, GPS, and Optimization Technologies for Pick-up/Delivery Service (소포 집배송 서비스를 위한 GIS, GPS 및 최적화 기술의 통합)

  • Jung Hoon;Lim Seung-Kil
    • Korean Management Science Review
    • /
    • v.21 no.3
    • /
    • pp.115-127
    • /
    • 2004
  • In this paper, we describe an intelligent monitoring and control system for pick-up/delivery service. This system applies geographical information system(GIS), global positioning system(GPS) and wireless communication technologies for managing pick-up/delivery operations more effectively. It consists of three subsystems, pick-up/delivery sequence planning system, pick-up/delivery monitoring system, and PDA execution system. Pick-up/delivery sequence planning system generates routes and schedules for pick-up/delivery using GIS and optimization techniques. Pick-up/delivery monitoring system monitors current positions of vehicles and actual pick-up/delivery results as compared with planned routes and visit times, while PDA execution system transmits information for vehicles positions and actual pick-up/delivery results using GPS and wireless communication technologies. The intelligent monitoring and control system is currently being used for the pick-up parcel service in a local post office of Korea Post.

Bin-Picking Method Using Laser (레이저를 이용한 Bin-Picking 방법)

  • Joo, Kisee;Han, Min-Hong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.9
    • /
    • pp.156-166
    • /
    • 1995
  • This paper presents a bin picking method using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. Once those unoccluded objects are removed, newly developed unoccluded objects underneath are recognized and the same process is continued until the bin gets empty. To recognize unoccluded objects, a new algotithm to link edges on slices which are generated by the orthogonally mounted laser on the xy table is proposed. The edges on slices are partitioned and classified using convex and concave function with a distance parameter. The edge types on the neighborhood slices are compared, then the hamming distances among identical kinds of edges are extracted as the features of fuzzy membership function. The sugeno fuzzy integration about features is used to determine linked edges. Finally, the pick-up sequence based on MaxMin theory is determined to cause minimal disturbance to the pile. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as in punch press operation or part assembly.

  • PDF

Regrasp Planner Using Look-up Table (참조표를 이용한 재파지 계획기)

  • Jo, Gyeong-Rae;Lee, Jong-Won;Kim, Mun-Sang;Song, Jae-Bok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.4 s.175
    • /
    • pp.848-857
    • /
    • 2000
  • A pick-and-place operation in 3-dimensional environment is basic operation for human and multi-purpose manipulators. However, there may be a difficult problem for such manipulators. Especially, if the object cannot be moved with a single grasp, regrasping, which can be a time-consuming process, should be carried out. Regrasping, given initial and final pose of the target object, is a construction of sequential transition of object poses that are compatible with two poses in the point of grasp configuration. This paper presents a novel approach for solving regrasp problem. The approach consists of a preprocessing and a planning stage. Preprocessing, which is done only once for a given robot, generates a look-up table which has information of kinematically feasible task space of end-effector through all the workspace. Then, using the table planning automatically determines possible intermediate location, pose and regrasp sequence leading from the pick-up to put-down grasp. Experiments show that the presented is complete in the total workspace. The regrasp planner was combined with existing path.

A HEURISTIC ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH BACKHAULS

  • NAE-HEON KIM;SUK-CHUL RIM;BYUNG-DO MIN
    • Management Science and Financial Engineering
    • /
    • v.3 no.1
    • /
    • pp.1-14
    • /
    • 1997
  • We address the problem of determining the sequence of a vehicle with fixed capacity to visit n nodes at which a predetermined amount is picked up and/or delivered. The objective is to minimize the total travel distance of the vehicle, while satisfying the pick-up/delivery requirements and feasibility at all nodes. Existing methods for the problem allows the vehicle to visit a node twice, which is impractical in many real situations. We propose a heuristic algorithm, in which every node is visited exactly once. Computational results using random problems indicate that the proposed heuristic outperforms existing methods for practical range of the number of nodes in reasonable computation time.

  • PDF

Bin-picking method using laser

  • Joo, Kisee;Han, Min-Hong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.306-315
    • /
    • 1995
  • This paper presents a bin picking method using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. Once those unoccluded objects are removed, newly developed unoccluded objects underneath are recognized and the same process is continued until the bin gets empty. To recognize unoccluded objects, a new algorithm to link edges on slices which are generated by the orthogonally mounted laser on the xy table is proposed. The edges on slices are partitioned and classified using convex and concave function with a distance parameter. The edge types on the neighborhood slices are compared, then the hamming distances among identical kinds of edges are extracted as the features of fuzzy membership function. The sugeno fuzzy integration about features is used to determine linked edges. Finally, the pick-up sequence based on MaxMin theory is determined to cause minimal disturbance to the pile. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as in punch press operation or part assembly.

  • PDF

Development of the Process Planning Program for a Multi-functional Surface Mounting Device (다기능 표면실장기의 공정계획 프로그램 개발)

  • Sohn, Jin-Hyeon;Yu, Sung-Yeol;Kang, Jang-Ha;Park, Sung-Soo;Oh, Byung-Jun;Seong, Pil-Young
    • IE interfaces
    • /
    • v.10 no.1
    • /
    • pp.155-167
    • /
    • 1997
  • The purpose of this study is to develop the program for efficient operation of a multi-functional surface mounting device(SMD) which mount various components on a printed circuit board(PCB). These components are provided by diverse types of feeders such as cassette, stick and tray feeders. The SMD has one or two heads. In the SMD, the positions of PCB and feeders and fixed, and the head moves to pick up a component from a feeder and to mount it on the PCB. The number of lanes occupied by each feeder and the nozzle used for each component can be different. We develop an off-line program to minimize the cycle-time of the SMD by studying the optimal assignment of feeders and the optimal mounting sequence of components. Graphical User Interface(GUI) is also developed. Additionally, we consider the line balancing problem which appears when two SMDs are used sequentially.

  • PDF

A study on the Algorithm for the Economic Dispatch of Thermal Units Considering Dynamic Characteristics of Load (부하의 동특성을 고려한 화력발전기의 경제부하배분 앨고리즘에 관한 연구)

  • Song, Kil-Yeong;Park, Kyeng-Soo;Choi, Jae-Suck;Park, Hyun-Sin
    • Proceedings of the KIEE Conference
    • /
    • 1988.11a
    • /
    • pp.92-94
    • /
    • 1988
  • One of the recurring problems facing energy control center dispatchers each day is how to operate the system during the periods of high load pick up and fluctuation. This method reduces the problem to a forward - revised by backward - sequence of dispatch problem, with the generator Limits being carefully adjusted between each time interval in the total intervals to be optimized. It is applied to system of 31 units. It is observed that the method presented here achieves that generation fellows the load changes without any mismatch.

  • PDF

A Study on the Efficient Operation of the Intermediate Storage for Mail Delivery (우편물 중간 보관소의 효율적 운영 방안 연구)

  • Choi, Myoungjin;Yang, Jaekyung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.133-141
    • /
    • 2013
  • The revitalization of e-business via Internet brings big changes to the postal business, and leads to a tremendous increase of heavy and large sized postal mails with continuing growth of home delivery business. Thus, even though the number of intermediate storages for mail delivery that mailmen use for picking up mails in the middle of mail delivery has been being increased, it has still many problems such as insufficient number and size of the storages as well as avoidance of mail keeping of trust agents. It is necessary that safety of mail keeping, seamless mail delivery, and individual parcel pick-up process reestablishment should be made through an improved counter plan for the problems described previously. This study presents the efficient and right operational plan for the intermediate storage for mail delivery with providing the number and size of intermediate storages per mail delivery sequence according to four different types of post offices.

Frequent Origin-Destination Sequence Pattern Analysis from Taxi Trajectories (택시 기종점 빈번 순차 패턴 분석)

  • Lee, Tae Young;Jeon, Seung Bae;Jeong, Myeong Hun;Choi, Yun Woong
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.39 no.3
    • /
    • pp.461-467
    • /
    • 2019
  • Advances in location-aware and IoT (Internet of Things) technology increase the rapid generation of massive movement data. Knowledge discovery from massive movement data helps us to understand the urban flow and traffic management. This paper proposes a method to analyze frequent origin-destination sequence patterns from irregular spatiotemporal taxi pick-up locations. The proposed method starts by conducting cluster analysis and then run a frequent sequence pattern analysis based on identified clusters as a base unit. The experimental data is Seoul taxi trajectory data between 7 a.m. and 9 a.m. during one week. The experimental results present that significant frequent sequence patterns occur within Gangnam. The significant frequent sequence patterns of different regions are identified between Gangnam and Seoul City Hall area. Further, this study uses administrative boundaries as a base unit. The results based on administrative boundaries fails to detect the frequent sequence patterns between different regions. The proposed method can be applied to decrease not only taxis' empty-loaded rate, but also improve urban flow management.