• Title/Summary/Keyword: Obstacle problem

Search Result 359, Processing Time 0.026 seconds

A Study on Stable Motion Control of Biped Robot with 18 Joints (18관절 2족보행 로봇의 안정한 모션제어에 관한연구)

  • Park, Youl-Moon;Thu, Le Xuan;Won, Jong-Beom;Park, Sung-Jun;Kim, Yong-Gil
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.17 no.2
    • /
    • pp.35-41
    • /
    • 2014
  • This paper describes the obstacle avoidance architecture to walk safely around in factory and home environment, and presents methods for path planning and obstacle avoidance for the humanoid robot. Solving the problem of obstacle avoidance for a humanoid robot in an unstructured environment is a big challenge, because the robot can easily lose its stability or fall down if it hits or steps on an obstacle. We briefly overview the general software architecture composed of perception, short and long term memory, behavior control, and motion control, and emphasize on our methods for obstacle detection by plane extraction, occupancy grid mapping, and path planning. A main technological target is to autonomously explore and wander around in home environments as well as to communicate with humans.

Obstacle Classification Method Based on Single 2D LIDAR Database (2D 라이다 데이터베이스 기반 장애물 분류 기법)

  • Lee, Moohyun;Hur, Soojung;Park, Yongwan
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.3
    • /
    • pp.179-188
    • /
    • 2015
  • We propose obstacle classification method based on 2D LIDAR(Light Detecting and Ranging) database. The existing obstacle classification method based on 2D LIDAR, has an advantage in terms of accuracy and shorter calculation time. However, it was difficult to classifier the type of obstacle and therefore accurate path planning was not possible. In order to overcome this problem, a method of classifying obstacle type based on width data of obstacle was proposed. However, width data was not sufficient to improve accuracy. In this paper, database was established by width, intensity, variance of range, variance of intensity data. The first classification was processed by the width data, and the second classification was processed by the intensity data, and the third classification was processed by the variance of range, intensity data. The classification was processed by comparing to database, and the result of obstacle classification was determined by finding the one with highest similarity values. An experiment using an actual autonomous vehicle under real environment shows that calculation time declined in comparison to 3D LIDAR and it was possible to classify obstacle using single 2D LIDAR.

Obstacle Classification Method using Multi Feature Comparison Based on Single 2D LiDAR (단일 2차원 라이다 기반의 다중 특징 비교를 이용한 장애물 분류 기법)

  • Lee, Moohyun;Hur, Soojung;Park, Yongwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.4
    • /
    • pp.253-265
    • /
    • 2016
  • We propose an obstacle classification method using multi-decision factors and decision sections based on Single 2D LiDAR. The existing obstacle classification method based on single 2D LiDAR has two specific advantages: accuracy and decreased calculation time. However, it was difficult to classify obstacle type, and therefore accurate path planning was not possible. To overcome this problem, a method of classifying obstacle type based on width data was proposed. However, width data was not sufficient to enable accurate obstacle classification. The proposed algorithm of this paper involves the comparison between decision factor and decision section to classify obstacle type. Decision factor and decision section was determined using width, standard deviation of distance, average normalized intensity, and standard deviation of normalized intensity data. Experiments using a real autonomous vehicle in a real environment showed that calculation time decreased in comparison with 2D LiDAR-based method, thus demonstrating the possibility of obstacle type classification using single 2D LiDAR.

Hybrid Genetic Algorithm or Obstacle Location-Allocation Problem

  • Jynichi Taniguchi;Mitsuo Gen;Wang, Xiao-Dong;Takao Yokota
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.191-194
    • /
    • 2003
  • Location-allocation problem is known as one of the important problem faced in Industrial Engineering and Operations Research fielde. There are many variations on this problem for different applications, however, most of them consider no obstacle existing. Since the location-allocation problem with obstacles is very complex and with many infeasible solutions, no direct method is effective to solve it. In this paper we propose a hybrid Genetic Algorithm (hGA) method for solving this problem. The proposed hGA is based on Lagrangian relaxation method and Dijkstra's shortest path algorithm. To enhance the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.

  • PDF

Obstacle Avoidance Algorithm for Vehicle using Fuzzy Inferences

  • Kawaji, Shigeyasu;Matsunaga, Nobutomo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1246-1249
    • /
    • 1993
  • In this paper, we propose an algorithm of obstacle avoidance using fuzzy inferences. After the basic idea of the path generation algorithm using piecewise polynomials is described, the obstacle avoidance problem using fuzzy inferences is considered. Main concept of the avoidance algorithm is to modify intermittent point data using fuzzy inferences and to generate the collision free path based on the modified data. Finally, simulation result demonstrate the effectiveness of the proposed algorithm.

  • PDF

Transparent Obstacle Detection Method based on Laser Range Finder (레이저 거리 측정기 기반 투명 장애물 인식 방법)

  • Park, Jung-Soo;Jung, Jin-Woo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.2
    • /
    • pp.111-116
    • /
    • 2014
  • Using only laser range finder to detect the obstacles in an environment that contains transparent obstacles can not guarantee autonomous mobile robot from collision problem. To solve this problem, a mobile robot using laser range finder must be used additional sensor device such as sonar sensor that can detect the transparent obstacle. In this paper, a method is addressed to deal with the problem to detect the transparent obstacles within environment only by using laser range finder for mobile robot. In case the recognized transparent obstacle, the proposed algorithm is to localize the transparent obstacle to extract and process the reflected noise. This algorithm ensures autonomous of mobile robot only using laser range finder. The effectiveness of the proposed algorithm is evaluated by the real mobile robot and real laser range finder experiments with three case studies.

A NON-ITERATIVE RECONSTRUCTION METHOD FOR AN INVERSE PROBLEM MODELED BY A STOKES-BRINKMANN EQUATIONS

  • Hassine, Maatoug;Hrizi, Mourad;Malek, Rakia
    • Journal of the Korean Mathematical Society
    • /
    • v.57 no.5
    • /
    • pp.1079-1101
    • /
    • 2020
  • This work is concerned with a geometric inverse problem in fluid mechanics. The aim is to reconstruct an unknown obstacle immersed in a Newtonian and incompressible fluid flow from internal data. We assume that the fluid motion is governed by the Stokes-Brinkmann equations in the two dimensional case. We propose a simple and efficient reconstruction method based on the topological sensitivity concept. The geometric inverse problem is reformulated as a topology optimization one minimizing a least-square functional. The existence and stability of the optimization problem solution are discussed. A topological sensitivity analysis is derived with the help of a straightforward approach based on a penalization technique without using the classical truncation method. The theoretical results are exploited for building a non-iterative reconstruction algorithm. The unknown obstacle is reconstructed using a levelset curve of the topological gradient. The accuracy and the robustness of the proposed method are justified by some numerical examples.

Local A Posteriori Error Estimates for Obstacle Contact Problems (장애물 접촉문제에서의 지역 A Posteriori 오차계산)

  • 이춘열
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.5
    • /
    • pp.120-127
    • /
    • 1998
  • Differential inequalities occurring in problems of obstacle contact problems are recast into variational inequalities and analyzed by finite element methods. A new a posteriori error estimator, which is essential in adaptive finite element method, is introduced to capture the errors in finite element approximations of these variational inequalities. In order to construct a posteriori error estimates, saddle point problems are introduced using Lagrange parameters and upper bounds are provided. The global upper bound is localized by a special mixed formulation, which leads to upper bounds of the element errors. A numerical experiment is performed on an obstacle contact problem to check the effectivity index both in a local and a global sense.

  • PDF

Markov Model-based Static Obstacle Map Estimation for Perception of Automated Driving (자율주행 인지를 위한 마코브 모델 기반의 정지 장애물 추정 연구)

  • Yoon, Jeongsik;Yi, Kyongsu
    • Journal of Auto-vehicle Safety Association
    • /
    • v.11 no.2
    • /
    • pp.29-34
    • /
    • 2019
  • This paper presents a new method for construction of a static obstacle map. A static obstacle is important since it is utilized to path planning and decision. Several established approaches generate static obstacle map by grid method and counting algorithm. However, these approaches are occasionally ineffective since the density of LiDAR layer is low. Our approach solved this problem by applying probability theory. First, we converted all LiDAR point to Gaussian distribution to considers an uncertainty of LiDAR point. This Gaussian distribution represents likelihood of obstacle. Second, we modeled dynamic transition of a static obstacle map by adopting the Hidden Markov Model. Due to the dynamic characteristics of the vehicle in relation to the conditions of the next stage only, a more accurate map of the obstacles can be obtained using the Hidden Markov Model. Experimental data obtained from test driving demonstrates that our approach is suitable for mapping static obstacles. In addition, this result shows that our algorithm has an advantage in estimating not only static obstacles but also dynamic characteristics of moving target such as driving vehicles.

Visual Servoing of a Wheeled Mobile Robot with the Obstacle Avoidance based on the Nonlinear Optimization using the Modified Cost Function (수정된 비용함수를 이용한 비선형 최적화 방법 기반의 이동로봇의 장애물 회피 비주얼 서보잉)

  • Kim, Gon-Woo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.12
    • /
    • pp.2498-2504
    • /
    • 2009
  • The fundamental research for the mobile robot navigation using the numerical optimization method is presented. We propose an image-based visual servo navigation algorithm for a wheeled mobile robot utilizing a ceiling mounted camera. For the image-based visual servoing, we define the composite image Jacobian which represents the relationship between the speed of wheels of a mobile robot and the robot's overall speed in the image plane. The rotational speed of wheels of a mobile robot can be directly related to the overall speed of a mobile robot in the image plane using the composite image Jacobian. We define the mobile robot navigation problem as an unconstrained optimization problem to minimize the cost function with the image error between the goal position and the position of a mobile robot. In order to avoid the obstacle, the modified cost function is proposed which is composed of the image error between the position of a mobile robot and the goal position and the distance between the position of a mobile robot and the position of the obstacle. The performance was evaluated using the simulation.