• Title/Summary/Keyword: Optimal path planning

Search Result 237, Processing Time 0.029 seconds

Path Planning for an Intelligent Robot Using Flow Networks (플로우 네트워크를 이용한 지능형 로봇의 경로계획)

  • Kim, Gook-Hwan;Kim, Hyung;Kim, Byoung-Soo;Lee, Soon-Geul
    • The Journal of Korea Robotics Society
    • /
    • v.6 no.3
    • /
    • pp.255-262
    • /
    • 2011
  • Many intelligent robots have to be given environmental information to perform tasks. In this paper an intelligent robot, that is, a cleaning robot used a sensor fusing method of two sensors: LRF and StarGazer, and then was able to obtain the information. Throughout wall following using laser displacement sensor, LRF, the working area is built during the robot turn one cycle around the area. After the process of wall following, a path planning which is able to execute the work effectively is established using flow network algorithm. This paper describes an algorithm for minimal turning complete coverage path planning for intelligent robots. This algorithm divides the whole working area by cellular decomposition, and then provides the path planning among the cells employing flow networks. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The proposed algorithm is applied to two different working areas, and verified that it is an optimal path planning method.

Optimal Path Planning Using Critical Points

  • Lee, Jin-Sun;Choi, Chang-Hyuk;Song, Jae-Bok;Chung, Woo-Jin;Kim, Mun-Sang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.131.4-131
    • /
    • 2001
  • A lot of path planning algorithms have been developed to find the collision-free path with minimum cost. But most of them require complicated computations. In this paper, a thinning method, which is one of the image processing schemes, was adopted to simplify the path planning procedure. In addition, critical points are used to find the shortest-distance path among all possible paths from the start to the goal point. Since the critical points contain the information on the neighboring paths, a new path can be quickly obtained on the map even when the start and goal points change. To investigate the validity of the proposed algorithm, various simulations have been performed for the environment where the obstacles with arbitrary shapes exist. It is shown that the optimal paths can be found with relative easiness.

  • PDF

Optimal time control of multiple robot using hopfield neural network (홉필드 신경회로망을 이용한 다중 로보트의 최적 시간 제어)

  • 최영길;이홍기;전홍태
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.147-151
    • /
    • 1991
  • In this paper a time-optimal path planning scheme for the multiple robot manipulators will be proposed by using hopfield neural network. The time-optimal path planning, which can allow multiple robot system to perform the demanded tasks with a minimum execution time and collision avoidance, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computational burden and thus limits the on-line application. One way to avoid such a difficulty is to rearrange the problem as MTSP(Multiple Travelling Salesmen Problem) and then apply the Hopfield network technique, which can allow the parallel computation, to the minimum time problem. This paper proposes an approach for solving the time-optimal path planning of the multiple robots by using Hopfield neural network. The effectiveness of the proposed method is demonstrated by computer simulation.

  • PDF

Planning a minimum time path for robot manipulator using genetic algorithm (유전알고리즘을 이용한 로보트 매니퓰레이터의 최적 시간 경로 계획)

  • Kim, Yong-Hoo;Kang, Hoon;Jeon, Hong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10a
    • /
    • pp.698-702
    • /
    • 1992
  • In this paper, Micro-Genetic algorithms(.mu.-GAs) is proposed on a minimum-time path planning for robot manipulator, which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can't often find the optimal values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimal values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

  • PDF

Optimal Trajectory Planning for Cooperative Control of Dual-arm Robot (양팔 로봇의 협조제어를 위한 최적 경로 설계)

  • Park, Chi-Sung;Ha, Hyun-Uk;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.9
    • /
    • pp.891-897
    • /
    • 2010
  • This paper proposes a cooperative control algorithm for a dual-arms robot which is carrying an object to the desired location. When the dual-arms robot is carrying an object from the start to the goal point, the optimal path in terms of safety, energy, and time needs to be selected among the numerous possible paths. In order to quantify the carrying efficiency of dual-arms, DAMM (Dual Arm Manipulability Measure) has been defined and applied for the decision of the optimal path. The DAMM is defined as the intersection of the manipulability ellipsoids of the dual-arms, while the manipulability measure indicates a relationship between the joint velocity and the Cartesian velocity for each arm. The cost function for achieving the optimal path is defined as the summation of the distance to the goal and inverse of this DAMM, which aims to generate the efficient motion to the goal. It is confirmed that the optimal path planning keeps higher manipulability through the short distance path by using computer simulation. To show the effectiveness of this cooperative control algorithm experimentally, a 5-DOF dual-arm robot with distributed controllers for synchronization control has been developed and used for the experiments.

Optimal Acoustic Search Path Planning Based on Genetic Algorithm in Discrete Path System (이산 경로 시스템에서 유전알고리듬을 이용한 최적음향탐색경로 전략)

  • CHO JUNG-HONG;KIM JUNG-HAE;KIM JEA-SOO;LIM JUN-SEOK;KIM SEONG-IL;KIM YOUNG-SUN
    • Journal of Ocean Engineering and Technology
    • /
    • v.20 no.1 s.68
    • /
    • pp.69-76
    • /
    • 2006
  • The design of efficient search path to maximize the Cumulative Detection Probability(CDP) is mainly dependent on experience and intuition when searcher detect the target using SONAR in the ocean. Recently with the advance of modeling and simulation method, it has been possible to access the optimization problems more systematically. In this paper, a method for the optimal search path calculation is developed based on the combination of the genetic algorithm and the calculation algorithm for detection range. We consider the discrete system for search path, space, and time, and use the movement direction of the SONAR for the gene of the genetic algorithm. The developed algorithm, OASPP(Optimal Acoustic Search Path Planning), is shown to be effective, via a simulation, finding the optimal search path for the case when the intuitive solution exists. Also, OASPP is compared with other algorithms for the measure of efficiency to maximize CDP.

Path Planning based on Ray-casting in Indoor Environments for Safe Navigation of a Mobile Robot (이동로봇의 안전한 주행을 위한 광선투사법 기반의 실내 경로계획)

  • Kim, Jong-Won;Song, Jae-Bok
    • The Journal of Korea Robotics Society
    • /
    • v.5 no.4
    • /
    • pp.302-308
    • /
    • 2010
  • A gradient method can provide a global optimal path in indoor environments. However, the optimal path can be often generated in narrow areas despite a sufficient wide area which lead to safe navigation. This paper presents a novel approach to path planning for safe navigation of a mobile robot. The proposed algorithm extracts empty regions using a ray-casting method and then generates temporary waypoints in wider regions in order to reach the goal fast and safely. The experimental results show that the proposed method can generate paths in the wide regions in most cases and the robot can reach the goal safely at high speeds.

Path Planning for Search and Surveillance of Multiple Unmanned Aerial Vehicles (다중 무인 항공기 이용 감시 및 탐색 경로 계획 생성)

  • Sanha Lee;Wonmo Chung;Myunggun Kim;Sang-Pill Lee;Choong-Hee Lee;Shingu Kim;Hungsun Son
    • The Journal of Korea Robotics Society
    • /
    • v.18 no.1
    • /
    • pp.1-9
    • /
    • 2023
  • This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

Path Planning Using an Information Grid Map for Safe Navigation (안전한 주행을 위한 정보 격자지도 기반의 경로계획)

  • Jung, Min-Kuk;Park, Joong-Tae;Song, Jae-Bok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.6
    • /
    • pp.623-628
    • /
    • 2012
  • Conventional path planning methods have focused on the generation of an optimal shortest path to the goal. However, this optimal path cannot guarantee safe navigation, because it can often lead to a narrow area. Therefore, we propose a Coulomb's law-based safe path planning method that uses an information grid map. The information grid map includes four types of information: occupied, empty, guide, and dangerous areas. A safe path can be generated away from the dangerous area and close to the guide area by repulsive and attractive forces, respectively. Experiments and simulations show that the proposed method can generate paths inside the safe region and is useful for safe navigation.

Path Planning for Mobile Robots using Visibility Graph and Genetic Algorithms (가시도 그래프와 유전 알고리즘에 기초한 이동로봇의 경로계획)

  • 정연부;이민중;전향식;최영규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.418-418
    • /
    • 2000
  • This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.

  • PDF