• 제목/요약/키워드: Local-Path Planning

검색결과 134건 처리시간 0.019초

무인 차량의 험지 자율주행을 위한 유전자 알고리즘 기반 3D 환경 지역 경로계획 (Genetic Algorithm Based 3D Environment Local Path Planning for Autonomous Driving of Unmanned Vehicles in Rough Terrain)

  • 윤승재;원문철
    • 한국군사과학기술학회지
    • /
    • 제20권6호
    • /
    • pp.803-812
    • /
    • 2017
  • This paper proposes a local path planning method for stable autonomous driving in rough terrain. There are various path planning techniques such as candidate paths, star algorithm, and Rapidly-exploring Random Tree algorithms. However, such existing path planning has limitations to reflecting the stability of unmanned ground vehicles. This paper suggest a path planning algorithm that considering the stability of unmanned ground vehicles. The algorithm is based on the genetic algorithm and assumes to have probability based obstacle map and elevation map. The simulation result show that the proposed algorithm can be used for real-time local path planning in rough terrain.

A New Technique to Escape Local Minimum in Artificial Potential Field Based Path Planning

  • Park, Min-Gyu;Lee, Min-Cheol
    • Journal of Mechanical Science and Technology
    • /
    • 제17권12호
    • /
    • pp.1876-1885
    • /
    • 2003
  • The artificial potential field (APF) methods provide simple and efficient motion planners for practical purposes. However, these methods have a local minimum problem, which can trap an object before reaching its goal. The local minimum problem is sometimes inevitable when an object moves in unknown environments, because the object cannot predict local minima before it detects obstacles forming the local minima. The avoidance of local minima has been an active research topic in the potential field based path planing. In this study, we propose a new concept using a virtual obstacle to escape local minima that occur in local path planning. A virtual obstacle is located around local minima to repel an object from local minima. We also propose the discrete modeling method for the modeling of arbitrary shaped objects used in this approach. This modeling method is adaptable for real-time path planning because it is reliable and provides lower complexity.

자율 주행로봇을 위한 국부 경로계획 알고리즘 (A local path planning algorithm for free-ranging mobil robot)

  • 차영엽;권대갑
    • 한국정밀공학회지
    • /
    • 제11권4호
    • /
    • pp.88-98
    • /
    • 1994
  • A new local path planning algorithm for free-ranging robots is proposed. Considering that a laser range finder has the excellent resolution with respect to angular and distance measurements, a simple local path planning algorithm is achieved by a directional weighting method for obtaining a heading direction of nobile robot. The directional weighting method decides the heading direction of the mobile robot by estimating the attractive resultant force which is obtained by directional weighting function times range data, and testing whether the collision-free path and the copen parthway conditions are satisfied. Also, the effectiveness of the established local path planning algorithm is estimated by computer simulation in complex environment.

  • PDF

조향규칙 학습을 이용한 자율주행로봇의 지역경로계획설계 (Local Path Planning Design of Autonomous Mobile Robot using The Direction Indicator Rules Learning)

  • 박경석;최한수;정헌
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(5)
    • /
    • pp.25-28
    • /
    • 2002
  • The path planning of autonomous mobile robot use two method. One is global path planning and another is local path planning. In this paper, We study the local path planning of autonomous mobile robot move in unknown enviroment. This local path planning is based on neural network using the direction indicator rules learning. also the system is made up of sensor system. The motion control system for real-time execution. The experimental results show that the developed direction indicator system operates properly and strongly at circumstance.

  • PDF

무인자율차량을 위한 경로계획 알고리즘 및 시뮬레이터 개발 (Developments of a Path Planning Algorithm and Simulator for Unmanned Ground Vehicle)

  • 김상겸;김성균;이용우
    • 한국자동차공학회논문집
    • /
    • 제15권3호
    • /
    • pp.1-9
    • /
    • 2007
  • A major concern for Autonomous Military Robot in the rough terrain is the problem of moving robot from an initial configuration to goal configuration. In this paper, We generate a local path to looking for the best route to move an goal configuration while avoiding known obstacle from world model, not violating the mobility constraints of robot. Trough a Simulator for Unmanned Autonomous Vehicle, We can simulate a traversability of unmanned autonomous vehicle based on steering, acceleration, braking command obtained from local path planning.

퍼지로직과 포텐셜 필드를 이용한 자율이동로봇의 최적경로계획법 (Optimal Path Planning of Autonomous Mobile Robot Utilizing Potential Field and Fuzzy Logic)

  • 박종훈;이재광;허욱열
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
    • /
    • pp.11-14
    • /
    • 2003
  • In this paper, we use Fuzzy Logic and Potential field method for optimal path planning of an autonomous mobile robot and apply to navigation for real-time mobile robot in 2D dynamic environment. For safe navigation of the robot, we use both Global and Local path planning. Global path planning is computed off-line using sell-decomposition and Dijkstra algorithm and Local path planning is computed on-line with sensor information using potential field method and Fuzzy Logic. We can get gravitation between two feature points and repulsive force between obstacle and robot through potential field. It is described as a summation of the result of repulsive force between obstacle and robot which is considered as an input through Fuzzy Logic and gravitation to a feature point. With this force, the robot fan get to desired target point safely and fast avoiding obstacles. We Implemented the proposed algorithm with Pioneer-DXE robot in this paper.

  • PDF

이동 차량의 계층적 통합 경로 계획의 경로 부조화 문제 해결을 위한 임시 경유점 수정법 (Temporal Waypoint Revision Method to Solve Path Mismatch Problem of Hierarchical Integrated Path Planning for Mobile Vehicle)

  • 이준우;석준홍;하정수;이주장;이호주
    • 제어로봇시스템학회논문지
    • /
    • 제18권7호
    • /
    • pp.664-668
    • /
    • 2012
  • Hierarchical IPP (Integrated Path Planning) combining the GPP (Global Path Planner) and the LPP (Local Path Planner) is interesting the researches who study about the mobile vehicle in recent years. However, in this study, there is the path mismatch problem caused by the difference in the map information available to both path planners. If ever a part of the path that was found by the GPP is available to mobile vehicle, the part may be unavailable when the mobile vehicle generates the local path with its built-in sensors while the vehicle moves. This paper proposed the TWR (Temporal Waypoint Reviser) to solve the path mismatch problem of the hierarchical IPP. The results of simulation provide the performance of the IPP with the TWR by comparing with other path planners.

동적인 위협이 존재하는 전장에서의 무인 항공기 지역경로계획 (A Local Path Planning for Unmanned Aerial Vehicle on the Battlefield of Dynamic Threats)

  • 김기태;남용근;조성진
    • 산업경영시스템학회지
    • /
    • 제35권1호
    • /
    • pp.39-46
    • /
    • 2012
  • An unmanned aerial vehicle (UAV) is a powered aerial vehicle that does not carry a human operator, uses aerodynamic forces to provide vehicle lift, can fly autonomously or be piloted remotely, can be expendable or recoverable, and can carry a lethal or non-lethal payload. An UAV is very important weapon system and is currently being employed in many military missions (surveillance, reconnaissance, communication relay, targeting, strike, etc.) in the war. To accomplish UAV's missions, guarantee of survivability should be preceded. The main objective of this study is a local path planning to maximize survivability for UAV on the battlefield of dynamic threats (obstacles, surface-to-air missiles, radar etc.). A local path planning is capable of producing a new path in response to environmental changes. This study suggests a $Smart$ $A^*$ (Smart A-star) algorithm for local path planning. The local path planned by $Smart$ $A^*$ algorithm is compared with the results of existing algorithms ($A^*$ $Replanner$, $D^*$) and evaluated performance of $Smart$ $A^*$ algorithm. The result of suggested algorithm gives the better solutions when compared with existing algorithms.

무인차량의 주행성능을 고려한 장애물 격자지도 기반의 지역경로계획 (A Local Path Planning Algorithm considering the Mobility of UGV based on the Binary Map)

  • 이영일;이호주;고정호
    • 한국군사과학기술학회지
    • /
    • 제13권2호
    • /
    • pp.171-179
    • /
    • 2010
  • A fundamental technology of UGV(Unmanned Ground Vehicle) to perform a given mission with success in various environment is a path planning method which generates a safe and optimal path to the goal. In this paper, we suggest a local path-planning method of UGV based on the binary map using world model data which is gathered from terrain perception sensors. In specially, we present three core algorithms such as shortest path computation algorithm, path optimization algorithm and path smoothing algorithm those are used in the each composition module of LPP component. A simulation is conducted with M&S(Modeling & Simulation) system in order to verify the performance of each core algorithm and the performance of LPP component with scenarios.

확장 칼만 필터와 경로계획을 이용한 쿼드로터 실외 위치 추정 (Outdoor Localization for a Quad-rotor using Extended Kalman Filter and Path Planning)

  • 김기정;이동주;김윤기;이장명
    • 제어로봇시스템학회논문지
    • /
    • 제20권11호
    • /
    • pp.1175-1180
    • /
    • 2014
  • This paper proposes a new technique that produces improved local information using a low-cost GPS/INS system combined with Extended Kalman Filter and Path Planning when a Quad-rotor flies. In the research, a low-cost GPS is combined with INS by Extended Kalman Filter to improve local information. However, this system has disadvantages in that estimation accuracy is getting worsens when the Quad-rotor flies through the air in a curve and precision of location information is influenced by performance of the used GPS. An algorithm based on Path Planning is adopted to deal with these weaknesses. When the Quad-rotor flies outdoors, a short moving path can be predicted because all short moving paths of quad-rotor can be assumed to be straight. Path planning is used to make the short moving path and determine the closest local information of data of the GPS/INS system to location determined by path planning. Through the foregoing process, improved local data is obtained when the quad-rotor flies, and the performance of the proposed system is verified from various outdoor experiments.