• 제목/요약/키워드: Obstacles control

검색결과 578건 처리시간 0.032초

Efficient algorithm for planning collision free path among polyhedral obstacles

  • Habib, Maki-K.;Asama, Hajime
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.1004-1008
    • /
    • 1990
  • This research focuses on developing a new and computationally efficient algorithm for free space structuring and planning collision free paths for an autonomous mobile robot working in an environment populated with polygonal obstacles. The algorithm constructs the available free space between obstacles in terms of free convex area. A collision free path can be efficiently generated based on a graph constructed using the midpoints of common free links between free convex area as passing points. These points correspond to nodes in a graph and the connection between them within each convex area as arcs in this graph. The complexity of the search for collision free path is greatly reduced by minimizing the size of the graph to be searched concerning the number of nodes and the number of arcs connecting them. The analysis of the proposed algorithm shows its efficiency in terms of computation ability, safety and optimality.

  • PDF

Hierarchical Fuzzy Motion Planning for Humanoid Robots Using Locomotion Primitives and a Global Navigation Path

  • Kim, Yong-Tae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제10권3호
    • /
    • pp.203-209
    • /
    • 2010
  • This paper presents a hierarchical fuzzy motion planner for humanoid robots in 3D uneven environments. First, we define both motion primitives and locomotion primitives of humanoid robots. A high-level planner finds a global path from a global navigation map that is generated based on a combination of 2.5 dimensional maps of the workspace. We use a passage map, an obstacle map and a gradient map of obstacles to distinguish obstacles. A mid-level planner creates subgoals that help the robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. We use a local obstacle map to find the subgoals along the global path. A low-level planner searches for an optimal sequence of locomotion primitives between subgoals by using fuzzy motion planning. We verify our approach on a virtual humanoid robot in a simulated environment. Simulation results show a reduction in planning time and the feasibility of the proposed method.

핫셀 적용을 위한 벽면주행 청소로봇에 관한 연구 (A study on autonomous Cleaning Robot for Hot-cell Application)

  • 한상현;김기호;박장진;장원석;이응혁
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.415-415
    • /
    • 2000
  • The functions of a mobile robot such as obstacle knowledge and collision avoidance for in-door cleaning are necessary features, as has been much studied in the field of industrial automatic guided vehicle or general mobile robot. A mobile robot, in order to avoid collision with obstacles, has to gather data with environment knowledge sensors and recognize environment and the shape of obstacles from the data. In the study, a wall-following algorithm was suggested as a autonomous moving algorithm in which a mobile robot can recognize obstacles in indoor like environment and do cleaning work in effect. The system suggested in the study is for cleaning of nuclear material dusts generated in the process of nuclear fuel manufacturing and decontamination of devices in disorder which is performed in M6 radioactive ray shield hot-cell in IMEF(Irradiated Material Examination Facility) in the Korea Atomic Energy Research Institute.

  • PDF

Evaluation of Wheel-based Mobile Robot Performance for Simple Environmental Obstacles

  • Hong, Ju-Pyo;Ko, Deo-Hyeon;Rhim, Sung-Soo;Lee, Soon-Geul;Kim, Kyu-Ro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.1491-1495
    • /
    • 2004
  • For the evaluation of the mobile robot performance in complex environments, the experimental approach in an actual physical environment has been commonly taken. In the physical experimental approach, however, it is quite difficult to define the proper environment for the evaluation due to the lack of commonly agreed characteristics of the test environment. Particularly the number of combinations of types and physical parameters of the obstacles that the mobile robot is expected to deal with is practically unlimited. In an effort to simplify and improve the effectiveness of the evaluation process, we propose an evaluation method using decomposed environmental elements, where we evaluated the performance of the robot for a small group of simple and decomposed obstacle components, for examples projection and slope, instead of a large group of complicated random obstacles. The paper describes a set of simple obstacle models and performance parameters that we have chosen for the effective evaluation process. As an alternative to the physical experimental evaluation approach, in this paper, we used a virtual evaluation environment where the robot and the physical test environment has been modeled using a commercial multi-body dynamics analysis packaged called RecurDyn.

  • PDF

An Obstacle Detection and Avoidance Method for Mobile Robot Using a Stereo Camera Combined with a Laser Slit

  • Kim, Chul-Ho;Lee, Tai-Gun;Park, Sung-Kee;Kim, Jai-Hie
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.871-875
    • /
    • 2003
  • To detect and avoid obstacles is one of the important tasks of mobile navigation. In a real environment, when a mobile robot encounters dynamic obstacles, it is required to simultaneously detect and avoid obstacles for its body safely. In previous vision system, mobile robot has used it as either a passive sensor or an active sensor. This paper proposes a new obstacle detection algorithm that uses a stereo camera as both a passive sensor and an active sensor. Our system estimates the distances from obstacles by both passive-correspondence and active-correspondence using laser slit. The system operates in three steps. First, a far-off obstacle is detected by the disparity from stereo correspondence. Next, a close obstacle is acquired from laser slit beam projected in the same stereo image. Finally, we implement obstacle avoidance algorithm, adopting the modified Dynamic Window Approach (DWA), by using the acquired the obstacle's distance.

  • PDF

중증외상환자에 대한 119구급대원의 척추고정 실태 및 장애요인 (A study on the current status and the obstacles to prehospital spinal motion restriction performed by 119 paramedics to major trauma patients)

  • 박정승;조근자
    • 한국응급구조학회지
    • /
    • 제24권3호
    • /
    • pp.89-106
    • /
    • 2020
  • Purpose: This study attempts to improve the status of emergency care for major trauma patients transferred by 119 paramedics by analyzing the status of emergency care and the obstacles to the spinal motion restriction (SMR) for major trauma patients. Methods: A total of 600 rescue logs were collected from major trauma patients transported by 119 paramedics in the C fire department from Jan. 1, 2015, to Dec. 31, 2017. And then, 280 questionnaires were collected from the 119 paramedics in C fire department from May 3 to Jun. 3, 2019. Data were analyzed using SPSS 24.0 version. Results: Among 499 spinal motion restriction adaptive patients, the spinal motion restriction rate was 51.1% (255 individuals). Lack of human resources and quality control problems were among the obstacles to spinal motion restriction. Conclusion: The 119 paramedics should improve their activeness and skills in performing emergency care, and since training and experience are of crucial importance, they should expand various education systematized according to demand.

햅틱 제어에 의한 원격작업의 안전성 향상 (Safety Enhancement of Teleoperation using Haptic Control)

  • 김윤배;최기상;최기흥
    • 한국안전학회지
    • /
    • 제28권4호
    • /
    • pp.19-25
    • /
    • 2013
  • For safe remote control, information on remote environment has to be delivered to operator realistically, and there have been numerous research efforts on this respect. Among them, haptic technology can significantly enhance safety and overall effectiveness of remote operation by delivering various kinds of information on virtual or real environment to operator. In this study, remote control based on haptic feedback is applied to control of mobile robot moving according to the command from operator avoiding collision with environmental obstacles and maintaining safe distance from them using ultrasonic sensors. Specifically, a remote feedback control structure for mobile robot is proposed. The controller is based on the inner feedback loop that directly utilizes information on distance to obstacles, and the outer feedback loop that the operator directly commands using the haptic device on which the computed reaction force based on the distance information is acting. Effectiveness of the proposed remote control scheme using double feedback loops is verified through a series of experiments on mobile robot.

Development of Potential Function Based Path Planning Algorithm for Mobile Robot

  • Lee, Sang-Il;Kim, Myun-Hee;Oh, Kwang-Seuk;Lee, Sang-Ryong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.2325-2330
    • /
    • 2005
  • A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

  • PDF

햅틱 디바이스를 이용한 촉감형 네비게이션 시스템 (Tactile Navigation System using a Haptic Device)

  • 이동혁;노경욱;강선균;김현우;이장명
    • 제어로봇시스템학회논문지
    • /
    • 제20권8호
    • /
    • pp.807-814
    • /
    • 2014
  • In this paper, we proposed a haptic navigation system which used the tactile data for the user guides of the mobile robot to the reference point via tele-operation in unknown blind environment. This navigation system can enable a mobile robot to avoid obstacles and move to the reference point, according to the direction provided by the device guides through a haptic device consisting of a vibration motor in a blind environment. There are a great deal of obstacles in real environments, and so mobile robots can avoid obstacles by recognizing the exact position of each obstacle through the superposition of an ultrasonic sensor. The navigation system determines the direction of obstacle avoidance through an avoidance algorithm that uses virtual impedance, and lets users know the position of obstacles and the direction of the avoidance through the haptic device consisting of 5 vibration motors. By letting users know intuitionally, it lets the mobile robot precisely reach the reference point in unknown blind environment. This haptic device can implement a haptic navigation system through the tactile sensor data.

복잡한 공간에서 그룹화 기반의 실용적 지능형 청소 로봇 알고리즘 (Practical Intelligent Cleaning Robot Algorithm Based on Grouping in Complex Layout Space)

  • 조재욱;노삼혁;전흥석
    • 제어로봇시스템학회논문지
    • /
    • 제12권5호
    • /
    • pp.489-496
    • /
    • 2006
  • The random-based cleaning algorithm is a simple algorithm widely used in commercial vacuum cleaning robots. This algorithm has two limitations, that is, cleaning takes a long time and there is no guarantee that the cleaning will cover the whole cleaning area. This has lead to customer dissatisfaction. Thus, in recent years, many intelligent cleaning algorithms that takes into consideration information gathered from the cleaning area environment have been proposed. The plowing-based algorithm, which is the most efficient algorithm known to date when there are no obstacles in the cleaning area, has a deficiency that when obstacle prevail, its performance is not guaranteed. In this paper, we propose the Group-k algorithm that is efficient for that situation, that is, when obstacle prevail. The goal is not to complete the cleaning as soon as possible, but to clean the majority of the cleaning area as fast as possible. The motivation behind this is that areas close to obstacles are usually difficult for robots to handle, and hence, many require human assistance anyway In our approach, obstacles are grouped by the complexity of the obstacles, which we refer to as 'complex rank', and then decide the cleaning route based on this complex rank. Results from our simulation-based experiments show that although the cleaning completion time takes longer than the plowing-based algorithm, the Group-k algorithm cleans the majority of the cleaning area faster than the plowing algorithm.