• Title/Summary/Keyword: Path Navigation

Search Result 685, Processing Time 0.026 seconds

An Efficient 3-D Path Planning Algorithm for Robot Navigation (능률적인 3차원 경로계획 알고리즘 개발에 관한 연구)

  • Lee, S.C.;Yang, W.Y.;Kim, Y.H.
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1208-1211
    • /
    • 1996
  • In this paper, an efficient and robust robot path planning technique is discussed. Concentric Ripple Edge Evaluation and Progression( CREEP ) algorithm[1] has been elaborated and expanded to carry out 3-D path planning. Like the 2-D case, robot can always find a path, if one exists, in a densely cluttered, unknown and unstructured 3-D obstacle environment. 3-D space in which the robot is expected to navigate is modeled by stacking cubic cells. The generated path is resolution optimal once the terrain is fully explored by the robot or all the information about the terrain is given. Path planning times are significantly reduced by local path update. Accuracy and efficiency of wave propagation in CREEP algorithm are achieved by virtual concentric sphere wave propagation. Simulations in 2-D and 3-D spaces are performed and excellent results are demonstrated.

  • PDF

Path Finding with Maximum Speed Dynamic Heuristic (최고 속력 동적 휴리스틱을 이용한 경로탐색)

  • Kim, Ji-Soo;Lee, Ji-Wan;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1615-1622
    • /
    • 2009
  • Generally, the Terminal Based Navigation System(TBNS) used embedded road data searches a path that has less qualitative than The Center Based Navigation System(CBNS). TBNS has not used real time road data but it is recently able to use it with technique such as TPEG. However, it causes to increase a cost of exploring by using real time road data for improvement quality of a path, because of limited performance. In this paper, we propose a Dynamic Heuristic to improve quality of path in the TBNS. Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server. In this paper, we propose path-lading algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same size. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than A* algorithm.

Aircraft Path Planning Considering Pop-up Threats Using Framed-Quadtree Wavefront Propagation and Navigation Function (Framed-Quadtree 파면전파 기법과 항법함수 기법을 이용한 항공기 위협회피 궤적 설계)

  • Kim, Pil-Jun;Choi, Jong-Uk;Kim, You-Dan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.10
    • /
    • pp.918-926
    • /
    • 2007
  • Military aircrafts usually operate at the area with lots of threats such as radars and surface-to-air missiles. Aircraft also faces with the unexpected or pop-up threats. Under this environment, a safe flight path should be generated to lead a mission successful. In this paper, a new path planning algorithm is proposed to provide less dangerous flight path efficiently. Of many path planning algorithms, a potential method is considered, because it has advantages of computation efficiency and smooth path generation. Trajectory generation under the condition of maximum range is studied so that the aircraft may reach the target area without refueling. The algorithm to cope with an unexpected situation is also proposed by adopting the concept of initial direction vector, additional force, and a new mapping function. The performance of the proposed algorithms is demonstrated for SEAD (Suppression of Enemy Air Defences) mission by numerical simulation.

Implementation of a Hybrid-App of a Path Tracking System Using Geolocation and Maps on Mobile Devices (위치정보와 지도를 이용한 경로추적 시스템의 모바일 기기에서의 하이브리드 앱 구현)

  • Yoo, Moon-Sung
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.6
    • /
    • pp.633-637
    • /
    • 2013
  • By using geolocation and maps, we need to trace the path of ourselves, others, or the objects. Until now, we used a native apps development mehod to develop path tracking systems in mobile devices such as smart phones and tablet computers. A disadvantage of this method is that we have to work again to provide the same service on different platforms. Web Apps and Hybrid Apps are developed to recover this disadvantage. Since Hybrid Apps look like Native Apps apparently, users prefer Hybrid Apps to Web Apps. In this paper, we develop a hybrid app which can trace the path on mobile devices. The recently suggested next generation markup language, HTML5, has geolocation features. By using them, we implemented a hybrid app for a path tracking system. First, we create a web app using HTML5, CSS, and JavaScript, Then, PhoneGap, a mobile development framework, is used to convert it to the hybrid app. By implementing hybrid app, various apps which need path tracking can be developed rapidly and effectively, regardless of the mobile devices.

Avoidance Algorithm and Extended Kalman Filter Design for Autonomous Navigation with GPS & INS Sensor System Fusion (GPS와 INS의 센서융합을 이용한 확장형 칼만필터 설계 및 자율항법용 회피알고리즘 개발)

  • Yu, Hwan-Shin
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.2
    • /
    • pp.146-153
    • /
    • 2007
  • Autonomous unmanned vehicle is able to find the path and the way point by itself. For the more precise navigation performance, Extended kalman filter, which is integrated with inertial navigation system and global positioning system is proposed in this paper. Extended kalman filter's performance is evaluated by the simulation and applied to the unmanned vehicle. The test result shows the effectiveness of extended kalman filter for the navigation.

  • PDF

Obstacle Avoidance of Autonomous Mobile Agent using Circular Navigation Method (곡률 주행 기법을 이용한 무인 이동 개체의 장애물 회피 알고리즘)

  • Lee, Jin-Seob;Chwa, Dong-Kyoung;Hong, Suk-Kyo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.4
    • /
    • pp.824-831
    • /
    • 2009
  • This paper proposes an obstacle avoidance algorithm for an autonomous mobile robot. The proposed method based on the circular navigation with probability distribution finds local-paths to avoid collisions. Futhermore, it makes mobile robots to achieve obstacle avoidance and optimal path planning due to the accurate decision of the final goal. Simulation results are included to show the feasibility of the proposed method.

Development of Localization Tracking System and User Interface of Guiding Robot for the Visually Impaired (시각장애인 유도 로봇의 자기 위치 추적 시스템 및 사용자 인터페이스 개발)

  • Ryu Je-Goon;Shen Dong-Fan;Kwon Oh-Sang;Kim Nack-Hwan;Lee Sang-Moo;Lee Eung-Hyuk;Hong Seung-Hong
    • The KIPS Transactions:PartD
    • /
    • v.12D no.3 s.99
    • /
    • pp.481-492
    • /
    • 2005
  • To guide the guiding robot for the visually impaired carefully, the digital map to be used to search a path must be detailed and has some information about dangerous spots. It also has to search not only safe but also short path through the position data by GPS and INS sensors. In this paper, as the difference of the ability that the visually unpaired can recognize, we have developed the localization tracking system so that it can make a movement path and verify position information, and the global navigation system for the visually impaired using the GPS and INS. This system can be used when the visually impaired move short path relatively. We had also verified that the system was able to correct the position as the assistant navigation system of the GPS on the outside.

Path Planning of Autonomous Mobile Robots Based on a Probability Map (확률지도를 이용한 자율이동로봇의 경로계획)

  • 임종환;조동우
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.16 no.4
    • /
    • pp.675-683
    • /
    • 1992
  • Mapping and navigation system based on certainty grids for an autonomous mobile robt operating in unknown and unstructured environment is described. The system uses sonar range data to build a map of robot's surroundings. The range data from sonar sensor are integrated into a probability map that is composed of two dimensional grids which contain the probabilities of being occupied by the objects in the environment. A Bayesian model is used to estimate the uncertainty of the sensor information and to update the existing probability map with new range data. The resulting two dimensional map is used for path planning and navigation. In this paper, the Bayesian updating model which was successfully simulated in our earlier work is implemented on a mobile robot and is shown to be valid in the real world through experiment. This paper also proposes a technique for reducing for reducing specular reflection problem of sonar system which seriousely deteriorates the map quality, and a new path planning method based on weighted distance, which enables the robot to efficiently navigate in an unknown area.

High-level Autonomous Navigation Technique of AUV using Fuzzy Relational Products (퍼지관계곱을 이용한 수중운동체의 고수준 자율항행기법)

  • Lee, Young-Il;Kim, Yong-Gi
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.91-97
    • /
    • 2002
  • This paper describes a heuristic search technique carrying out collision avoidance for Autonomous Underwater Vehicles(AUVs). Fuzzy relational products are used as the mathematical implement for the analysis and synthesis of relations between obstacles that are met in the navigation environment and available candidate nodes. In this paper, we propose a more effective evaluation function that reflects the heuristic information of domain experts on obstacle clearance, and an advanced heuristic search method performing collision avoidance for AUVs. The search technique adopts fuzzy relational products to conduct path-planning of intelligent navigation system. In order to verify the performance of proposed heuristic search, it is compared with $A^*$ search method through simulation in view of the CPU time, the optimization of path and the amount of memory usage.

Estimating the Behavior Path of Seafarer Involved in Marine Accidents by Hidden Markov Model (은닉 마르코프 모델을 이용한 해양사고에 개입된 선원의 행동경로 추정)

  • Yim, Jeong-Bin
    • Journal of Navigation and Port Research
    • /
    • v.43 no.3
    • /
    • pp.160-165
    • /
    • 2019
  • The conduct of seafarer is major cause of marine accidents. This study models the behavior of the seafarer based on the Hidden Markov Model (HMM). Additionally, through the path analysis of the behavior estimated by the model, the kind of situations, procedures and errors that may have caused the marine accidents were interpreted. To successfully implement the model, the seafarer behaviors were observed by means of the summarized verdict reports issued by the Korean Maritime Safety Tribunal, and the observed results converted into behavior data suitable for HMM learning through the behavior classification framework based on the SRKBB (Skill-, Rule-, and Knowledge-Based Behavior). As a result of modeling the seafarer behaviors by the type of vessels, it was established that there was a difference between the models, and the possibility of identifying the preferred path of the seafarer behaviors. Through these results, it is expected that the model implementation technique proposed in this study can be applied to the prediction of the behavior of the seafarer as well as contribute to the prioritization of the behavior correction among seafarers, which is necessary for the prevention of marine accidents.