• Title/Summary/Keyword: Navigation Algorithm

Search Result 1,755, Processing Time 0.032 seconds

The Camera Calibration Parameters Estimation using The Projection Variations of Line Widths (선폭들의 투영변화율을 이용한 카메라 교정 파라메터 추정)

  • Jeong, Jun-Ik;Moon, Sung-Young;Rho, Do-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2372-2374
    • /
    • 2003
  • With 3-D vision measuring, camera calibration is necessary to calculate parameters accurately. Camera calibration was developed widely in two categories. The first establishes reference points in space, and the second uses a grid type frame and statistical method. But, the former has difficulty to setup reference points and the latter has low accuracy. In this paper we present an algorithm for camera calibration using perspective ratio of the grid type frame with different line widths. It can easily estimate camera calibration parameters such as focal length, scale factor, pose, orientations, and distance. But, radial lens distortion is not modeled. The advantage of this algorithm is that it can estimate the distance of the object. Also, the proposed camera calibration method is possible estimate distance in dynamic environment such as autonomous navigation. To validate proposed method, we set up the experiments with a frame on rotator at a distance of 1,2,3,4[m] from camera and rotate the frame from -60 to 60 degrees. Both computer simulation and real data have been used to test the proposed method and very good results have been obtained. We have investigated the distance error affected by scale factor or different line widths and experimentally found an average scale factor that includes the least distance error with each image. It advances camera calibration one more step from static environments to real world such as autonomous land vehicle use.

  • PDF

From Airborne Via Drones to Space-Borne Polarimetric- Interferometric SAR Environmental Stress- Change Monitoring ? Comparative Assessment of Applications

  • Boerner, Wolfgang-Martin;Sato, Motoyuki;Yamaguchi, Yoshio;Yamada, Hiroyoshi;Moon, Woo-Il;Ferro-Famil, Laurent;Pottier, Eric;Reigber, Andreas;Cloude, Shane R.;Moreira, Alberto;Lukowski, Tom;Touzi, Ridha
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1433-1435
    • /
    • 2003
  • Very decisive progress was made in advancing fundamental POL-IN-SAR theory and algorithm development during the past decade. This was accomplished with the aid of airborne & shuttle platforms supporting single -to-multi-band multi-modal POL-SAR and also some POL-IN-SAR sensor systems, which will be compared and assessed with the aim of establishing the hitherto not completed but required missions such as tomographic and holographic imaging. Because the operation of airborne test-beds is extremely expensive, aircraft platforms are not suited for routine monitoring missions which is better accomplished with the use drones or UAVs. Such unmanned aerial vehicles were developed for defense applications, however lacking the sophistic ation of implementing advanced forefront POL-IN-SAR technology. This shortcoming will be thoroughly scrutinized resulting in the finding that we do now need to develop most rapidly POL-IN-SAR drone-platform technology especially for environmental stress-change monitoring with a great variance of applications beginning with flood, bush/forest-fire to tectonic-stress (earth-quake to volcanic eruptions) for real-short-time hazard mitigation. However, for routine global monitoring purposes of the terrestrial covers neither airborne sensor implementation - aircraft and/or drones - are sufficient; and there -fore multi-modal and multi-band space-borne POL-IN-SAR space-shuttle and satellite sensor technology needs to be further advanced at a much more rapid phase. The existing ENVISAT with the forthcoming ALOSPALSAR, RADARSAT-2, and the TERRASAT will be compared, demonstrating that at this phase of development the fully polarimetric and polarimetric-interferometric modes of operation must be viewed and treated as preliminary algorithm verification support modes and at this phase of development are still not to be viewed as routine modes.

  • PDF

Design and Implementation of Indoor Positioning & Shortest Path Navigation System Using GPS and Beacons in Narrow Buildings

  • Sang-Hyeon, Park;Huhnkuk, Lim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.3
    • /
    • pp.11-16
    • /
    • 2023
  • As techniques for indoor positioning, fingerprinting, indoor positioning method using trilateration, and utilizing information obtained from equipments by Wi-Fi/Bluetooth, etc are common and representative methods to specify the user's indoor position. However, in these methods, an indoor space should be provided with enough space to install a large number of equipment (AP, Beacon). In this paper, we propose a technique that can express the user's location within a building by simultaneously using the GPS signal and the signal transmitted from the beacon in a building structure where the conventional method cannot be applied, such as a narrow building. A shortest path search system was designed and implemented by applying the Dijkstra Algorithm, one of the most representative and efficient shortest path search algorithms for shortest path search. The proposed technique can be considered as one of the methods for measuring the user's indoor location considering the structural characteristics of a building in the future.

A Study on the Operational Scheduling for ROK's Navy Ships Using NSGA-II (NSGA-II를 이용한 한국해군 함정 운용계획에 대한 연구)

  • Jung, Whan-Sik;Lee, Jae-Yeong;Lee, Yong-Dae
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.3
    • /
    • pp.55-62
    • /
    • 2010
  • This paper studies the problem seeking an efficient operational scheduling for battle ships in the Republic of Korea's navy. The ships' availability means that their main systems such as weapons, navigation and propulsion are in full operational readiness. If some of the major systems are not ready, then the ships should not be available for operations. It is required to maintain a high level availability under the limited resources as it determines the strength of ROK's navy. However, it will result in inefficiencies if some ships are operated without proper maintenance only to improve their availability. Thus, this study suggests the operational scheduling for two squadron ships that considers multiple objectives such as availability, overlapping maintenance, and deviation from available ships in a particular week. We applied NSGA-II algorithm to find better solutions for more efficient scheduling. The experiment result reached an efficient solutions after 1,500 generations. Two efficient operational schedules were compared on the basis of three multiple objectives among them.

Optimized Path Finding Algorithm for Walking Convenience of the People with Reduced Mobility (교통약자의 이동편의를 위한 최적경로 탐색 기법)

  • Moon, Mikyeong;Lee, Youngmin;Yu, Kiyun;Kim, Jiyoung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.3
    • /
    • pp.273-282
    • /
    • 2016
  • There has been growing social interest recently in the movement rights of people with reduced mobility. However, it simply eliminates the temporary inconvenience of walking of people with reduced mobility because it focuses only on supply of institutional facilities. Therefore, we look forward to improving movement welfare by proposing an optimized path finding algorithm for people with reduced mobility that takes into consideration physical elements affecting their movement, such as slope, steps etc. We selected Walking barrier factor by analyzing previous studies and calculated the relative importance of Walking barrier factors using an Analytic Hierarchy Process(AHP). Next, through the fuzzy system, the Walking disturbance level of link, which integrates the weights of Walking barrier factors and the attributes of each link, is derived. Then, Walking path cost that takes into consideration the ‘length’ factors is calculated and an optimized path for people with reduced mobility is searched using Dijkstra’s Algorithm. Nineteen different paths were searched and we confirmed that the derived paths are meaningful in terms of improving the mobility of people with reduced mobility by conducting a field test. We look forward to improving movement welfare by providing a navigation service using the path finding algorithm proposed in this study.

Web Document Transcoding Technique for Small Display Devices (소형 화면 단말기를 위한 웹 문서 변환 기법)

  • Shin, Hee-Sook;Mah, Pyeong-Soo;Cho, Soo-Sun;Lee, Dong-Woo
    • The KIPS Transactions:PartD
    • /
    • v.9D no.6
    • /
    • pp.1145-1156
    • /
    • 2002
  • We propose a web document transcoding technique that translates existing web pages designed for desktop computers into an appropriate form for hand-held devices connected to the wireless internet. By defining a content block based on a visual separation and using it as a minimum unit for analyzing and converting processes, we can get web pages converted more exactly. We also apply the reallocation of the content block and the generation of new index in order to provide convenient interface without left-right scrolling in small screen devices. These methods, compared with existing ways such as text level summary or partial extraction method, can provide efficient navigation and a full recognition of web documents. To gain those transcoding benefits, we propose the Layout-Forming Tag Analysis Algorithm that analyzes structural tags, which motivate visual separation and the Component Grouping Algorithm that extracts the content block. We also classify and rearrange the content block and generate the new index to produce an appropriate form of web pages for small display devices. We have designed and implemented our transcoding system in a proxy server and evaluated the methods and the algorithms through an analysis of transcoded results. Our transcoding system showed a good result on most of popular web pages that have complicated structures.

Planning Evacuation Routes with Load Balancing in Indoor Building Environments (실내 빌딩 환경에서 부하 균등을 고려한 대피경로 산출)

  • Jang, Minsoo;Lim, Kyungshik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.7
    • /
    • pp.159-172
    • /
    • 2016
  • This paper presents a novel algorithm for searching evacuation paths in indoor disaster environments. The proposed method significantly improves the time complexity to find the paths to the evacuation exit by introducing a light-weight Disaster Evacuation Graph (DEG) for a building in terms of the size of the graph. With the DEG, the method also considers load balancing and bottleneck capacity of the paths to the evacuation exit simultaneously. The behavior of the algorithm consists of two phases: horizontal tiering (HT) and vertical tiering (VT). The HT phase finds a possible optimal path from anywhere of a specific floor to the evacuation stairs of the floor. Thus, after finishing the HT phases of all floors in parallel the VT phase begins to integrate all results from the previous HT phases to determine a evacuation path from anywhere of a floor to the safety zone of the building that could be the entrance or the roof of the building. It should be noted that the path produced by the algorithm. And, in order to define the range of graph to process, tiering scheme is used. In order to test the performance of the method, computing times and evacuation times are compared to the existing path searching algorithms. The result shows the proposed method is better than the existing algorithms in terms of the computing time and evacuation time. It is useful in a large-scale building to find the evacuation routes for evacuees quickly.

The Effect of Process Models on Short-term Prediction of Moving Objects for Autonomous Driving

  • Madhavan Raj;Schlenoff Craig
    • International Journal of Control, Automation, and Systems
    • /
    • v.3 no.4
    • /
    • pp.509-523
    • /
    • 2005
  • We are developing a novel framework, PRIDE (PRediction In Dynamic Environments), to perform moving object prediction (MOP) for autonomous ground vehicles. The underlying concept is based upon a multi-resolutional, hierarchical approach which incorporates multiple prediction algorithms into a single, unifying framework. The lower levels of the framework utilize estimation-theoretic short-term predictions while the upper levels utilize a probabilistic prediction approach based on situation recognition with an underlying cost model. The estimation-theoretic short-term prediction is via an extended Kalman filter-based algorithm using sensor data to predict the future location of moving objects with an associated confidence measure. The proposed estimation-theoretic approach does not incorporate a priori knowledge such as road networks and traffic signage and assumes uninfluenced constant trajectory and is thus suited for short-term prediction in both on-road and off-road driving. In this article, we analyze the complementary role played by vehicle kinematic models in such short-term prediction of moving objects. In particular, the importance of vehicle process models and their effect on predicting the positions and orientations of moving objects for autonomous ground vehicle navigation are examined. We present results using field data obtained from different autonomous ground vehicles operating in outdoor environments.

An Adaptable Integrated Prediction System for Traffic Service of Telematics

  • Cho, Mi-Gyung;Yu, Young-Jung
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.2
    • /
    • pp.171-176
    • /
    • 2007
  • To give a guarantee a consistently high level of quality and reliability of Telematics traffic service, traffic flow forecasting is very important issue. In this paper, we proposed an adaptable integrated prediction model to predict the traffic flow in the future. Our model combines two methods, short-term prediction model and long-term prediction model with different combining coefficients to reflect current traffic condition. Short-term model uses the Kalman filtering technique to predict the future traffic conditions. And long-term model processes accumulated speed patterns which means the analysis results for all past speeds of each road by classifying the same day and the same time interval. Combining two models makes it possible to predict future traffic flow with higher accuracy over a longer time range. Many experiments showed our algorithm gives a better precise prediction than only an accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

ELA: Real-time Obstacle Avoidance for Autonomous Navigation of Variable Configuration Rescue Robots (ELA: 가변 형상 구조로봇의 자율주행을 위한 실시간 장애물 회피 기법)

  • Jeong, Hae-Kwan;Hyun, Kyung-Hak;Kim, Soo-Hyun;Kwak, Yoon-Keun
    • The Journal of Korea Robotics Society
    • /
    • v.3 no.3
    • /
    • pp.186-193
    • /
    • 2008
  • We propose a novel real-time obstacle avoidance method for rescue robots. This method, named the ELA(Emergency Level Around), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward safe position. In the ELA, we consider two sensor modules, PSD(Position Sensitive Detector) infrared sensors taking charge of obstacle detection in short distance and LMS(Laser Measurement System) in long distance respectively. Hence if a robot recognizes an obstacle ahead by PSD infrared sensors first, and judges impossibility to overcome the obstacle based on driving mode decision process, the order of priority is transferred to LMS which collects data of radial distance centered on the robot to avoid the confronted obstacle. After gathering radial information, the ELA algorithm estimates emergency level around a robot and generates a polar histogram based on the emergency level to judge where the optimal free space is. Finally, steering angle is determined to guarantee rotation to randomly direction as well as robot width for safe avoidance. Simulation results from wandering in closed local area which includes various obstacles and different conditions demonstrate the power of the ELA.

  • PDF