• Title/Summary/Keyword: Route Search

Search Result 235, Processing Time 0.024 seconds

Search for Ground Moving Targets Using Dynamic Probability Maps (동적 확률지도를 이용한 지상 이동표적 탐색)

  • Kim, Eun-Kyu;Choi, Bong-Wan;Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.11-21
    • /
    • 2015
  • In order to achieve success in ground operations, searching for moving targets is one of critical factors. Usually, the system of searching for adversary ground moving targets has complex properties which includes target's moving characteristics, camouflage level, terrain, weather, available search time window, distance between target and searcher, moving speed, target's tactics, etc. The purpose of this paper is to present a practical quantitative method for effectively searching for infiltrated moving targets considering aforementioned complex properties. Based upon search theories, this paper consists of two parts. One is infiltration route analysis, through terrain and mobility analysis. The other is building dynamic probability maps through Monte Carlo simulation to determine the prioritized searching area for moving targets. This study primarily considers ground moving targets' moving pattern. These move by foot and because terrain has a great effect on the target's movement, they generally travel along a constrained path. With the ideas based on the terrain's effect, this study deliberately performed terrain and mobility analysis and built a constrained path. In addition, dynamic probability maps taking terrain condition and a target's moving speed into consideration is proposed. This analysis is considerably distinct from other existing studies using supposed transition probability for searching moving targets. A case study is performed to validate the effectiveness and usefulness of our methodology. Also, this study suggests that the proposed approach can be used for searching for infiltrated ground moving target within critical time window. The proposed method could be used not only to assist a searcher's mission planning, but also to support the tactical commander's timely decision making ability and ensure the operations' success.

Energy Efficient Route Search Using Marine Data (해양 데이터를 활용한 에너지 효율적인 최적 항로 탐색)

  • Kim, Seong-Ho;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.1
    • /
    • pp.44-49
    • /
    • 2020
  • Recently, one of the major issues of shipbuilding and marine is the reduction of air and marine pollution emission to ships. In response, the International Maritime Organization (IMO) has concluded an international convention (MARPOL) to prevent pollution from ships. A Annex Six of The Convention restricts and regulates air and marine pollution of ship from exhausting gases. To this end, it is required to apply EEDI (Energy Efficiency Design Indicators) to the construction of new ships, and to minimize the emission of environmental pollutants by recommending the application of EEOI (Energy Efficiency Operation Indicators) to operational ships. Therefore, in this study, we propose to calculate the grade of operating efficiency (EG) of ships based on actual operational data for transport ships and to provide energy-efficient optimal path search information through analysis of marine environment data.

A Study on the Evacuation Characteristics Junction Indication Method of Disaster Information Map (재해정보지도의 교차경로 표시방법에 따른 피난특성에 관한 연구)

  • Sun, Ji-Eun;Hong, Won-Hwa
    • Fire Science and Engineering
    • /
    • v.32 no.5
    • /
    • pp.46-51
    • /
    • 2018
  • The purpose of this study was to assess the evacuation route in a disaster information map to evacuate people to a shelter quickly and precisely during a disaster situation. For this purpose, this study examined the current status of domestic and international disaster information maps and related laws and conducted experiments to derive effective types of intersecting routes. The problems of the disaster information map were obtained through the first preliminary experiment and a survey. Based on these problems, experiments for each type were conducted to provide effective indication information for a disaster information map. To investigate the gait characteristics according to the number of crossing paths, the reduction rate in the crossing path was derived for each type by comparing the previous speed and passing speed. This will enable suggestions to judge the route quickly and accurately when determining the intersecting route in the search for an evacuation route. In conclusion, the experiment of this paper aims to make rapid and accurate evacuations using the disaster information map in response to disasters, and provide guidelines to citizens to contribute to a reduction of casualties.

Development of Optimal-Path Finding System(X-PATH) Using Search Space Reduction Technique Based on Expert System (전문가시스템을 이용한 최적경로 탐색시스템(X-PATH)의 개발)

  • 남궁성;노정현
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.1
    • /
    • pp.51-67
    • /
    • 1996
  • The optimal path-finding problem becomes complicated when multiple variables are simultaneously considered such as physical route length, degree of congestion, traffic capacity of intersections, number of intersections and lanes, and existence of free ways. Therefore, many researchers in various fields (management science, computer science, applied mathematics, production planning, satellite launching) attempted to solve the problem by ignoring many variables for problem simplification, by developing intelligent algorithms, or by developing high-speed hardware. In this research, an integration of expert system technique and case-based reasoning in high level with a conventional algorithms in lower level was attempted to develop an optimal path-finding system. Early application of experienced driver's knowledge and case data accumulated in case base drastically reduces number of possible combinations of optimal paths by generating promising alternatives and by eliminating non-profitable alternatives. Then, employment of a conventional optimization algorithm provides faster search mechanisms than other methods such as bidirectional algorithm and $A^*$ algorithm. The conclusion obtained from repeated laboratory experiments with real traffic data in Seoul metropolitan area shows that the integrated approach to finding optimal paths with consideration of various real world constraints provides reasonable solution in a faster way than others.

  • PDF

A Study on the Visitor's Visual Behavior and Isovist Area in Museum Exhibition Space - Focus on the Busan Museum, Gimhae National Museum - (박물관 전시공간에서의 관람자 시각행동과 가시영역에 관한 조사 연구 - 부산박물관, 국립김해박물관을 중심으로 -)

  • Yoo, Jae-Yub;Choi, Jun-Huck;Lim, Che-Zinn
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.6
    • /
    • pp.197-205
    • /
    • 2010
  • For the spatial experience of spectators visiting a museum, the route search of trying to follow the spatial structure or production of exhibition and the information search of trying to see are accomplished at the same time. In such process, the spectator's reaction of visual perception produces the result of emotional reaction and action exchanged between human and space by going through the recognition and perception on the target of environment factor. For the spatial experience of a spectator, the reaction of visual perception which interacts according to the exhibit and exhibition environment within space according to viewing purpose, interest and concern of spectator comes out as visual activity which is an activity to understand the spatial information shown as various activities according to spatial structure and unfolding characteristics of the display. The purpose of this study is to identify The Correlation of Spectator Movement Created According to Structural Form of Exhibition Area Based on Interaction between Exhibition Area Structure and Spectator to utilize as basic material while designing museum exhibition using isovist field which is a quantitative analysis tool of spectator's visual behavior and spatial structure at each exhibition area.

Composing Recommended Route through Machine Learning of Navigational Data (항적 데이터 학습을 통한 추천 항로 구성에 관한 연구)

  • Kim, Joo-Sung;Jeong, Jung Sik;Lee, Seong-Yong;Lee, Eun-seok
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2016.05a
    • /
    • pp.285-286
    • /
    • 2016
  • We aim to propose the prediction modeling method of ship's position with extracting ship's trajectory model through pattern recognition based on the data that are being collected in VTS centers at real time. Support Vector Machine algorithm was used for data modeling. The optimal parameters are calculated with k-fold cross validation and grid search. We expect that the proposed modeling method could support VTS operators' decision making in case of complex encountering traffic situations.

  • PDF

Efficient alternative route path-search techniques to the damaged path using genetic algorithm processing (유전알고리즘의 연산처리를 통한 손상된 경로의 효율적인 대체경로 탐색기법)

  • Ji, Hong-il;Moon, Seok-hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.729-731
    • /
    • 2016
  • The efficiency of genetic algorithm may be improved, as genetic generation increases. However, a number of algorithms are needed until desired results are obtained. In addition, if Hoc unit increases when linked to a network, there may be a need to compare with all the cases, which would result in many algorithms at a time, and if a single process deals with such algorithms, the efficiency will decrease. Therefore, efficiency of overall network will be decreased in the end. Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm.

  • PDF

Solving the Travelling Salesman Problem Using an Ant Colony System Algorithm

  • Zakir Hussain Ahmed;Majid Yousefikhoshbakht;Abdul Khader Jilani Saudagar;Shakir Khan
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.2
    • /
    • pp.55-64
    • /
    • 2023
  • The travelling salesman problem (TSP) is an important combinatorial optimization problem that is used in several engineering science branches and has drawn interest to several researchers and scientists. In this problem, a salesman from an arbitrary node, called the warehouse, starts moving and returns to the warehouse after visiting n clients, given that each client is visited only once. The objective in this problem is to find the route with the least cost to the salesman. In this study, a meta-based ant colony system algorithm (ACSA) is suggested to find solution to the TSP that does not use local pheromone update. This algorithm uses the global pheromone update and new heuristic information. Further, pheromone evaporation coefficients are used in search space of the problem as diversification. This modification allows the algorithm to escape local optimization points as much as possible. In addition, 3-opt local search is used as an intensification mechanism for more quality. The effectiveness of the suggested algorithm is assessed on a several standard problem instances. The results show the power of the suggested algorithm which could find quality solutions with a small gap, between obtained solution and optimal solution, of 1%. Additionally, the results in contrast with other algorithms show the appropriate quality of competitiveness of our proposed ACSA.

Occlusion Processing in Simulation using Improved Object Contour Extraction Algorithm by Neighboring edge Search and MER (이웃 에지 탐색에 의한 개선된 객체 윤곽선 추출 알고리즘과 MER을 이용한 모의훈련에서의 폐색처리)

  • Cha, Jeong-Hee;Kim, Gye-Young;Choi, Hyung-Il
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.206-211
    • /
    • 2008
  • Trainee can enhance his perception of and interaction with the real world by displayed virtual objects in simulation using image processing technology. Therefore, it is essential for realistic simulation to determine the occlusion areas of the virtual object produces after registering real image and virtual object exactly. In this paper, we proposed the new method to solve occlusions which happens during virtual target moves according to the simulated route on real image using improved object contour extraction by neighboring edge search and picking algorithm. After we acquire the detailed contour of complex objects by proposed contour extraction algorithm, we extract the three dimensional information of the position happening occlusion by using MER for performance improvement. In the experiment, we compared proposed method with existed method and preyed the effectiveness in the environment which a partial occlusions happens.

Driver Route Choice Models for Developing Real-Time VMS Operation Strategies (VMS 실시간 운영전략 구축을 위한 운전자 경로선택모형)

  • Kim, SukHee;Choi, Keechoo;Yu, JeongWhon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.3D
    • /
    • pp.409-416
    • /
    • 2006
  • Real-time traveler information disseminated through Variable Message Signs (VMS) is known to have effects on driver route choice decisions. In the past, many studies have attempted to optimize the system performance using VMS message content as the primary control variable of driver route choice. This research proposes a VMS information provision optimization model which searches the best combination of VMS message contents and display sequence to minimize the total travel time on a highway network considered. The driver route choice models under VMS information provision are developed using a stated preference (SP) survey data in order to realistically capture driver response behavior. The genetic algorithm (GA) is used to find the optimal VMS information provision strategies which consists of the VMS message contents and the sequence of message display. In the process of the GA module, the system performance is measured using micro traffic simulation. The experiment results highlight the capability of the proposed model to search the optimal solution in an efficient way. The results show that the traveler information conveyed via VMS can reduce the total travel time on a highway network. They also suggest that as the frequency of VMS message update gets shorter, a smaller number of VMS message contents performs better to reduce the total travel time, all other things being equal.