• Title/Summary/Keyword: Path navigation

Search Result 683, Processing Time 0.024 seconds

An Advanced Path Planning of Clustered Multiple Robots Based on Flexible Formation (유동적인 군집대형을 기반으로 하는 군집로봇의 경로 계획)

  • Wee, Sung Gil;Saitov, Dilshat;Choi, Kyung Sik;Lee, Suk Gyu
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.29 no.12
    • /
    • pp.1321-1330
    • /
    • 2012
  • This paper describes an advanced formation algorithm of clustered multiple robots for their navigation using flexible formation method for collision avoidance under static environment like narrow corridors. A group of clustered multiple robots finds the lowest path cost for navigation by changing its formation. The suggested flexible method of formation transforms the basic group of mobile robots into specific form when it is confronted by particular geographic feature. In addition, the proposed method suggests to choose a leader robot of the group for the obstacle avoidance and path planning. Firstly, the group of robots forms basic shapes such as triangle, square, pentagon and etc. depending on number of robots. Secondly, the closest to the target location robot is chosen as a leader robot. The chosen leader robot uses $A^*$ for reaching the goal location. The proposed approach improves autonomous formation characteristics and performance of all system.

An Optimal Path Planning for Survival Rate Maximization of Submarine (잠수함 생존율 극대화를 위한 최적 이동경로 계획)

  • Kim, Ki-Tae;Park, Se-Hoon;Cho, Sung-Jin;Jeon, Geon-Wook
    • Journal of the military operations research society of Korea
    • /
    • v.36 no.3
    • /
    • pp.135-145
    • /
    • 2010
  • The submarine is very threatening and secretive weapon system that achieves missions under the sea. However, the submarine is faced with danger that can be attacked from the enemy when is detected by sensor or rose to the surface. This study will be planned optimal path to maximize the survival rate that considers submarine navigation capability in underwater and search activity of hostile warships. A mathematical programming model and a heuristic algorithm will be suggested in this study. The mathematical programming model is verified by using ILOG CPLEX. The submarine path, unit time(distance) of navigation, survival rate, and computation time is computed by using a heuristic algorithm.

Guidance Law of Missiles for Control Impact-Time-and-Angle by Flight Path Angle in Three Dimensional Space (3차원 공간에서의 비행 경로각을 이용한 비행시간 및 충돌각 제어 유도법칙)

  • Jin, Sheng-Hao;Lee, Chun-Gi;Yang, Bin;Hwan, Chung-Won;Park, Seung-Yub
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.1
    • /
    • pp.8-15
    • /
    • 2012
  • This paper on the assumption that the target is stationary and the velocity of missile is fixed value. In three dimensional space. Using flight path angle to simultaneous control impact-time-and-angle base on a homing guidance law. The independent variable in the nonlinear engagement model is the flight path angle of the missile. The propose homing guidance law can see the controllability of impact-time-and-angle. And also can see the processing of the missile arrive at the target. It is applied to several salvo attack scenarios. The performance of the proposed guidance law is verified by simulations.

A Via Point Generation Method for Road Navigation of Unmanned Vehicles (무인 차량의 도로주행을 위한 경유점 생성 방법)

  • Choi, Hyuk-Doo;Park, Nam-Hun;Kim, Jong-Hui;Park, Yong-Woon;Kim, Eun-Tai
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.2
    • /
    • pp.161-167
    • /
    • 2012
  • This research deals with generating via points for autonomous navigation on a roadway for unmanned vehicles. When a vehicle plans a path from a starting point to a goal point, it should be able to map out which lane on which road it passes by. For this purpose, we should organize positional information of roads and save it as a database. This paper presents methods to save the database and to plan a shortest path to the goal by generating via points in consideration of the moving direction and the lane directions. Then we prove that the proposed algorithm can find the optimal path on the road through simulations.

Path Planning Method for an Autonomous Underwater Vehicle With Environmental Movement Congestions (환경이동혼잡조건을 고려한 자율무인잠수정의 이동경로생성 방법)

  • You, Sujeong;Kim, Ji Woong;Ji, Sang Hoon;Woo, Jongsik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.2
    • /
    • pp.65-71
    • /
    • 2018
  • In order to make the underwater vehicle carry out the mission in a submarine environment, it is needed to plan a safe and efficient route to a given destination and prevent the autonomous submersible from colliding with obstacles while moving along the planned route. The function of collision avoidance makes the travel distance of the autonomous submersible longer. Moreover, it should move slowly near to obstacles against their moving disturbance. As a result, this invokes the degradation of the navigation efficiency in the process of collision avoidance. The side effect of the collision avoidance is not ignorable in the case of high congested environments such as the coast with many obstacles. In this paper, we suggest a path planning method which provides the route with minimum travel time considering collision avoidance in congested environment. For the purpose, we define environmental congestion map related to geometric information and obstacles. And we propose a method to consider the moving cost in the RRT scheme that provides the existing minimum distance path. We verified that the efficiency of our algorithm with simulation experiments.

Capacity Evaluation of Multi-Carrier CDMA System in Correlated MIMO Fading Channel (상관 MIMO 페이딩 채널에서 Multi-Carrier CDMA 시스템의 용량 평가)

  • Roh, Jae Sung;Cho, Sung Joon;Kim, Choon Gil
    • Journal of Advanced Navigation Technology
    • /
    • v.7 no.1
    • /
    • pp.51-58
    • /
    • 2003
  • Generally, multi-path is viewed as an undesirable feature of wireless communications. Therefore, diversity reception and adaptive array schemes are proposed to mitigate its effects. Recently, to increase the spectrum efficiency and the link reliability, multiple-input multiple-output (MIMO) scheme is devised to exploit multi-path in a scattering wireless channel. In this paper, we have evaluated the channel capacity of MIMO Multi-Carrier CDMA system in path correlation fading channel. And, the channel capacity of MIMO system is compared with single-input single-output (SISO) system. From the results, the MIMO multi-carrier CDMA system with path correlation yields better performance with respect to channel capacity than a SISO system.

  • PDF

Study of Autonomous Navigation for Path Guide System Using RFID (RFID를 이용한 자율주행 안내 시스템 연구)

  • Kim, Taek-Su;Kim, Youn-Gon;Jeong, Hyeon-Woo;Kim, Young-Jun;Park, Yong-Wook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.1
    • /
    • pp.213-218
    • /
    • 2019
  • In this paper, we study autonomous navigation system for path guide system by using RFID that is enable to navigate and load in hotel. In case of a mobile robot used in a general autonomous navigation guidance system, a large amount of sensors are added to the system in order to improve the accuracy, resulting in cost problems. Therefore, to reduce the number of sensors, and to increase the accuracy and recognition rate, an autonomous driving guidance system was implemented using one of the inexpensive small micro controller units (MCU) such as Raspberry Pi3.

Hybrid Path Planning of Multi-Robots for Path Deviation Prevention (군집로봇의 경로이탈 방지를 위한 하이브리드 경로계획 기법)

  • Wee, Sung-Gil;Kim, Yoon-Gu;Choi, Jung-Won;Lee, Suk-Gyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.5
    • /
    • pp.416-422
    • /
    • 2013
  • This paper suggests a hybrid path planning method of multi-robots, where a path deviation prevention for maintaining a specific formation is implemented by using repulsive function, $A^*$ algorithm and UKF (Unscented Kalman Filter). The repulsive function in potential field method is used to avoid collision among robots and obstacles. $A^*$ algorithm helps the robots to find optimal path. In addition, error estimation based on UKF guarantees small path deviation of each robot during navigation. The simulation results show that the swarm robots with designated formation successfully avoid obstacles and return to the assigned formation effectively.

Optimal Path Planning of Mobile Robot for Multiple Moving Obstacles (복수의 동적 장애물에 대한 이동로봇의 최적경로설계)

  • Kim, Dae-Gwang;Kang, Dong-Joong
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.2
    • /
    • pp.183-190
    • /
    • 2007
  • The most important thing for navigation of a mobile robot is to find the most suitable path and avoid the obstacles in the static and dynamic environment. This paper presents a method to search the optimal path in start space extended to time domain with considering a velocity and a direction of moving obstacles. A modified version of $A^*$ algorithm has been applied for path planning in this work and proposed a method of path search to avoid a collision with moving obstacle in space-tim domain with a velocity and an orientation of obstacles. The velocity and the direction for moving obstacle are assumed as linear form. The simulation result shows that a mobile robot navigates safely among moving obstacles of constant linear velocity. This work can be applied for not only a moving robot but also a legged humanoid robot and all fields where the path planning is required.

  • PDF

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