• Title/Summary/Keyword: optimal guidance

검색결과 211건 처리시간 0.024초

Using Genetic-Fuzzy Methods To Develop User-preference Optimal Route Search Algorithm

  • Choi, Gyoo-Seok;Park, Jong-jin
    • The Journal of Information Technology and Database
    • /
    • 제7권1호
    • /
    • pp.42-53
    • /
    • 2000
  • The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

  • PDF

Application of GA algorithm and $A^*$ algorithm to optimal path finding problem (최적경로 탐색을 위한 유전자 알고리즘과 $A^*$알고리즘의 적용)

  • Cho, Won-Hyuk;Kong, Chang-Wook;Kim, In-Taek
    • Proceedings of the KIEE Conference
    • /
    • 대한전기학회 1996년도 하계학술대회 논문집 B
    • /
    • pp.1389-1391
    • /
    • 1996
  • In this paper, we applies two methods - Genetic Algorithm(GA) and $A^*$ Algorithm - to find the optimal path in route guidance system. Under the assumption that the traveling costs of each link are given, the task to find the optimal path becomes very complicated problem if the number of nodes or links increase. Two well-known algorithms are modified to resolve the problem and the preliminary demonstration show both optimistic result and needs to improvement.

  • PDF

A Pursuit-Evasion Game Between a Missile and an Aircraft (미사일과 항공기간의 추적.회피 게임)

  • Byun, Ji-Joon;Seo, Jin-H.
    • Proceedings of the KIEE Conference
    • /
    • 대한전기학회 1996년도 하계학술대회 논문집 B
    • /
    • pp.946-948
    • /
    • 1996
  • In this paper, we consider a 2-dimensional pursuit-evasion game between a maneuvering target and a coasting missile using qualitative game theory. The optimal evasion algorithm of the target and the optimal guidance algorithm of the missile are determined and the barrier trajectories of this game are obtained through computer simulation. The optimal strategy of the missile and target is to turn toward the final line of sight direction using maximum input and maintain its direction. The capture set of the missile can be obtained by backward integration from the BUP.

  • PDF

A Study on the Driver's Preferences of Prividing Direction Information in Road Signs (방향표지 정보제공 방법에 대한 운전자 선호도 연구)

  • Chong, Kyusoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제14권6호
    • /
    • pp.69-76
    • /
    • 2015
  • Although traffic information has been actively analyzed using big data, it has not been used as much with the consideration of driver characteristics. Among the various types of information, road signs can directly affect the driver. Road signs must provide the optimal information that enables drivers to reach their destinations with ease as well as information suitable for navigation systems. However, present road sign rules provide standardized information, regardless of the road type or size. This study suggests a method for providing road information that will help drivers determine their behavior. First, the minimum character size that can be used on a road sign for each design speed was obtained with respect to the visibility and decipherability of a road sign. Instead of conventional diagram-based direction guidance, a scenario using split-based direction guidance was created. To verify the effectiveness of the provided information, a three-dimensional simulated road environment was constructed, and a driving simulator was used for the test. At a simple plane intersection, the driver was not greatly influenced by directional guidance, but at a complex, three-dimensional intersection, the driver preferred summary-based directional guidance, which is instinctive guidance, over diagram-based guidance. On the basis of the test results, a secondary verification test that applied split-based guidance at a three-dimensional intersection confirmed that the driver had no problems in making decisions.

Design and Implementation of a Real-time Automatic Disaster and Information Broadcasting System (시뮬레이션 프로그램 기반 실시간 자동재난 및 안내방송시스템의 설계)

  • Lee, Byung-Mun;Park, Jung-In;Kang, Un-Gu
    • Journal of Digital Convergence
    • /
    • 제10권7호
    • /
    • pp.141-152
    • /
    • 2012
  • The typical evacuation guidance system based on fire detectors, which is being widely used in theaters and large buildings, is often operated in an analog manner. In case of fire, it often causes the system to lose a wired line or wireless fire detection sensor, resulting in the difficulty of transmitting signals from a wired or wireless fire detection sensor to the main fire monitoring device. Accordingly, this paper has proposed the broadcasting system for disaster management, having an efficient evacuation guidance plan when a disaster occurs. The system reacts to an emergency situation along with fire alarm sirens in real time. We have implemented the above system by means of a simulation program that prints the evacuation guidance information (e.g., location and time of fire, and evacuation path) on an LCD located in a building through the fire sensor network in case of an emergency (e.g., actual fire). We have developed the simulation system by using mathematical algorithms, such as the optimal path search and the fire smoke diffusion algorithm. This simulation program considers the structure of a building and the location where the fire has initially occurred, applying it to the simulator.

Estimation of Willingness to pay for Realtime Route Guidance Information by Contingent Valuation Method (조건부가치측정법(CVM)을 이용한 실시간 경로안내시스템의 지불의사액 산정)

  • Do, Myung-Sik;Kim, Yoon-Sik
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제11권5호
    • /
    • pp.46-55
    • /
    • 2012
  • This study proposes an estimate method of willingness to pay(WTP) for real-time route guidance systems using contingent valuation method(CVM) under double bounded dichotomous choice question(DBDCQ) and analysis for impact factors of WTP estimation. This study assumed that provided real-time traffic information service is optimal route concepts dealing with traffic conditions on origin-destination. Analysis targets were classified into two groups as short distance path and middle distance path for estimating WTP for realtime route guidance system in a year using the survival analysis method and the regression model with personal information, actual condition and satisfaction of information usage and users' awareness and usage of facilities. As a result, mean WTP of realtime route guidance system is 4,034won/year in short distance path, and 4,884won/year in middle distance path. Therefore real-time route guidance system for longer distance path is recognized as more valuable than shorter distance path. Moreover, the necessity of information was required on a higher income group and higher WTP was estimated on owners of vehicle group and lower awareness of a route group.

Optimal Perilune Altitude of Lunar Landing Trajectory

  • Cho, Dong-Hyun;Jeong, Bo-Young;Lee, Dong-Hun;Bang, Hyo-Choong
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제10권1호
    • /
    • pp.67-74
    • /
    • 2009
  • In general, the lunar landing stage can be divided into two distinct phases: de-orbit and descent, and the descent phase usually comprises two sub-phases: braking and approach. And many optimization problems of minimal energy are usually focused on descent phases. In these approaches, the energy of de-orbit burning is not considered. Therefore, a possible low perilune altitude can be chosen to save fuel for the descent phase. Perilune altitude is typically specified between 10 and 15km because of the mountainous lunar terrain and possible guidance errors. However, it requires more de-orbit burning energy for the lower perilune altitude. Therefore, in this paper, the perilune altitude of the intermediate orbit is also considered with optimal thrust programming for minimal energy. Furthermore, the perilune altitude and optimal thrust programming can be expressed by a function of the radius of a parking orbit by using continuation method and co-state estimator.

Order-picking Algorithm for Optimizing Operation Path of Orchard Speed Sprayer (과수원 스피드스프레이어의 작업 경로 최적화를 위한 오더 피킹 알고리즘)

  • Park, Tu-San;Hwang, Kyu-Young;Cho, Seong-In
    • Journal of Biosystems Engineering
    • /
    • 제33권1호
    • /
    • pp.51-57
    • /
    • 2008
  • The purpose of this study was to develop an optimal path planning program for autonomous speed sprayer in orchard. A digital map which contained coordinate information and entity information including height, width, radius of main stem, and disease of a trees was developed to build an optimal path. The digital map, dynamic programming and order-picking algorithm were used for planning an optimal path for autonomous speed sprayers. When this algorithm applied to rectangular-shaped orchards to travel whole trees, the developed program planned the same working path and same traveling distance as those of created by conventional method. But for irregular-shaped orchards, developed program planned differently and 5.06% shorter path than conventional method. When applied to create path for multi-selected trees, irregular-shaped orchards showed 13.9% shorter path and also rectangular-shaped orchards showed 9.1% shorter path. The developed program always planned shorter path than the path created by conventional method despite of variation of shape of orchards.

The Optimal Pyloric Procedure: A Collective Review

  • Kim, Dohun
    • Journal of Chest Surgery
    • /
    • 제53권4호
    • /
    • pp.233-241
    • /
    • 2020
  • Vagal damage and subsequent pyloric denervation inevitably occur during esophagectomy, potentially leading to delayed gastric emptying (DGE). The choice of an optimal pyloric procedure to overcome DGE is important, as such procedures can lead to prolonged surgery, shortening of the conduit, disruption of the blood supply, and gastric dumping/bile reflux. This study investigated various pyloric methods and analyzed comparative studies in order to determine the optimal pyloric procedure. Surgical procedures for the pylorus include pyloromyotomy, pyloroplasty, or digital fracture. Botulinum toxin injection, endoscopic balloon dilatation, and erythromycin are non-surgical procedures. The scope, technique, and effects of these procedures are changing due to advances in minimally invasive surgery and postoperative interventions. Some comparative studies have shown that pyloric procedures are helpful for DGE, while others have argued that it is difficult to reach an objective conclusion because of the variety of definitions of DGE and evaluation methods. In conclusion, recent advances in interventional technology and minimally invasive surgery have led to questions regarding the practice of pyloric procedures. However, many clinicians still perform them and they are at least somewhat effective. To provide guidance on the optimal pyloric procedure, DGE should first be defined clearly, and a large-scale study with an objective evaluation method will then be required.

A study on locomotion of a mobile robot by a pattern recognition (패턴 인식에 의한 이동 로보트의 주행에 관한 연구)

  • 신중섭;정동명;장원석;홍승홍
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
    • /
    • pp.79-82
    • /
    • 1987
  • This paper describes the mobile robot system to recognize the guidance tape, and presents the locomotion algorithm. It is composed of image processing unit, A/ID converter and camera. This system converts video image to binary image by setting an optimal threshold and obtains the parameters to move the robot. The mobile robot moves according to the programmed route in memory. But after recognized the obstacle on the locomotion route, this system constructs the new route and the robot moves following the new route.

  • PDF