• Title/Summary/Keyword: Route Search

검색결과 235건 처리시간 0.029초

Rule based CAD/CAM integration for turning (Rule base방법에 의한 선반가공의 CAD/CAM integration)

  • 임종혁;박지형;이교일
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
    • /
    • pp.290-295
    • /
    • 1989
  • This paper proposes a Expert CAPP System for integrating CAD/CAM of rotational work-part by rule based approach. The CAD/CAPP integration is performed by the recognition of machined features from the 2-D CAD data (IGES) file. Selecting functions of the process planning are performed in modularized rule base by forward chaining inference, and operation sequences are determined by means of heuristic search algorithm. For CAPP/CAM integration, post-processor generates NC code from route sheet file. This system coded in OPS5 and C language on PC/AT, and EMCO CNC lathe interfaced with PC through DNC and RS-232C.

  • PDF

A Study on the Optimal Trajectory Planning for a Ship Using Genetic algorithm (유전 알고리즘을 이용한 선박의 최적 항로 결정에 관한 연구)

  • 이병결;김종화;김대영;김태훈
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.255-255
    • /
    • 2000
  • Technical advance of electrical chart and cruising equipment make it possible to sail without a man. It is important to decide the cruising route in view of effectiveness and stability of a ship. So we need to study on the optimal trajectory planning. Genetic algorithm is a strong optimization algorithm with adaptational random search. It is a good choice to apply genetic algorithm to the trajectory planning of a ship. We modify a genetic algorithm to solve this problem. The effectiveness of the revised genetic algorithm is assured through computer simulations.

  • PDF

유전 알고리즘을 이용한 최적경로 탐색

  • Kim, Gyeong-Nam;Jo, Min-Seok;Lee, Hyeon-Gyeong
    • CDE review
    • /
    • 제21권2호
    • /
    • pp.34-38
    • /
    • 2015
  • In case of the big city, choosing the adequate root of which we can reach the destination can affect the driver's condition and driving time. so it is quite important to find the optimal routes for arriving the destination as considering the factors, such as driving conditions or travel time and so on. In this paper, we develop route choice model with considering driving conditions and travel time, and it can search the optimal path which make drivers reduce their fatigues using genetic algorithm.

  • PDF

A new synthesis route to nucleoside: Two-directional synthesis of carbocyclic nucleoside using double [3,3] -sigmatropic rearrangement and double RCM

  • Kim, Ji-Hee;Zhe Fang;Kim, Kwan-Woo;Hong, Joon-Hee
    • Proceedings of the PSK Conference
    • /
    • 대한약학회 2003년도 Proceedings of the Convention of the Pharmaceutical Society of Korea Vol.1
    • /
    • pp.243.1-243.1
    • /
    • 2003
  • Extensive efforts in the search of therapeutically useful carbocyclic nucleosides have resulted in a wealth of their synthetic methodologies in racemic and optically active forms. The classical one-directional methods such as linear synthesis and convergent synthesis are the approaches most frequently seen in the literature for the preparation of carbocyclic nucleosides, and their advantages and limitations are well known. (omitted)

  • PDF

A System of Guiding Path for Parking Lots based on RFID to Consider Real-time Constraints (실시간 제약을 고려한 RFID 기반 주차 경로 안내 시스템)

  • Kang, Ku-An;Kim, Jin-Deog
    • Spatial Information Research
    • /
    • 제16권1호
    • /
    • pp.65-77
    • /
    • 2008
  • There have been many studies and technologies that define a current location of a moving vehicle with GPS(Global Positioning System). However, the navigation system with GPS has troubles to search an optimized route considering data such as realtime parking status and road conditions. Moreover, the GPS systems show malfunction in the downtown with very tall buildings, underground parking lot and the inside of buildings. On the contrary, the RFID systems are able to reflect real-time status of parking lots and roads in the downtown. This paper proposes a system of guiding path for parking lots to consider real-time constraints based on RFID. The results obtained from the implemented system show smooth guiding of a new route after immediately sensoring the change of the information of parking lots and roads: if a parking lot that a vehicle is heading to is fully occupied, the system re-searches a new route for a neighbor parking lot and immediately transfers it to customer's mobile, and if the designated route is under construction, the system guides a detour path. The proposed method will be useful for advanced integrated parking control system.

  • PDF

A Location Recognition System of RFID Tag for Parking Control (주차관제를 위한 RFID 태그 객체의 위치 인식 시스템)

  • Kang, Ku-An;Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제12권1호
    • /
    • pp.99-107
    • /
    • 2008
  • Recently route guiding system using GPS is spread widely. In the parking management system of complex mall, RFID is mainly used to control status of parking lots. However, in a case that a vehicle only with RFID tag enters into small market-populated district with service of parking lots, there is no parking route guiding system optimized with information of real tine status of parking lots and the system only with GPS can't provide a function of using real time status of parking lots. This paper proposes a location recognizing method of RFID tag object for parking control system to integrated several parking lots in the business district and database-linked route guiding system optimized for parking. The proposed location recognizing method makes the search of optimized parking route possible by abstracting decoding order of tag and antenna number and recognizing direction of tag linked with database. Ihe implemented system that is composed of RFID tag, reader, middleware, server, parking lot clients and mobile clients shows that the proposed method works well and it will be useful for integrated parking control system.

A Study on Finding the K Shortest Paths for the Multimodal Public Transportation Network in the Seoul Metropolitan (수도권 복합 대중교통망의 복수 대안 경로 탐색 알고리즘 고찰)

  • Park, Jong-Hoon;Sohn, Moo-Sung;Oh, Suk-Mun;Min, Jae-Hong
    • Proceedings of the KSR Conference
    • /
    • 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
    • /
    • pp.607-613
    • /
    • 2011
  • This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

  • PDF

A Two-phase Method for the Vehicle Routing Problems with Time Windows (시간대 제약이 있는 차량경로 결정문제를 위한 2단계 해법의 개발)

  • Hong, Sung-Chul;Park, Yang-Byung
    • IE interfaces
    • /
    • 제17권spc호
    • /
    • pp.103-110
    • /
    • 2004
  • This paper presents a two-phase method for the vehicle routing problems with time windows(VRPTW). In a supply chain management(SCM) environment, timely distribution is very important problem faced by most industries. The VRPTW is associated with SCM for each customer to be constrained the time of service. In the VRPTW, the objective is to design the least total travel time routes for a fleet of identical capacitated vehicles to service geographically scattered customers with pre-specified service time windows. The proposed approach is based on ant colony optimization(ACO) and improvement heuristic. In the first phase, an insertion based ACO is introduced for the route construction and its solutions is improved by an iterative random local search in the second phase. Experimental results show that the proposed two-phase method obtains very good solutions with respect to total travel time minimization.

Ant Colony System for Vehicle Routing Problem with Simultaneous Delivery and Pick-up under Time Windows (시간제약하 배달과 수거를 동시에 수행하는 차량경로문제를 위한 개미군집시스템)

  • Lee, Sang-Heon;Kim, Yong-Dae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • 제35권2호
    • /
    • pp.160-170
    • /
    • 2009
  • This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

3 Dimensional Augmented Reality Flight for Drones

  • Park, JunMan;Kang, KiBeom;Jwa, JeongWoo;Won, JoongHie
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제10권2호
    • /
    • pp.13-18
    • /
    • 2018
  • Drones are controlled by the remote pilot from the ground stations using the radio control or autonomously following the pre-programmed flight plans. In this paper, we develop a method and an optimal path search system for providing 3D augmented reality flight (ARF) images for safe and efficient flight control of drones. The developed system consisted of the drone, the ground station and user terminals, and the optimal path search server. We use the Dijkstra algorithm to find the optimal path considering the drone information, flight information, environmental information, and flight mission. We generate a 3D augmented reality flight (ARF) image overlaid with the path information as well as the drone information and the flight information on the flight image received from the drone. The ARF image for adjusting the drone is generated by overlaying route information, drone information, flight information, and the like on the image captured by the drone.