• Title/Summary/Keyword: time-distance function

Search Result 503, Processing Time 0.023 seconds

Robot motion planning for time-varying obstacle avoidance using distance function (거리 함수를 이용한 로보트의 시변 장애물 회피 동작계획)

  • 전흥주;고낙용;남윤석;이범희;고명삼
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.1034-1039
    • /
    • 1991
  • A robot motion planning algorithm for time-varying obstacle avoidance is proposed. The robot motion planning problem is replaced with the optimization problem by using the distance function with the divided configuration space. To divide the configuration space, the polar coordinate system is used. For each divided configuration space, the admissible region where the robot can reach without collisions is obtained using the distance function. For an object moving in a plane, the admissible region is described by linear constraints on the polar coordinate system. A numerical algorithm that solves the optimization problem is shown and the computer simulation is carried out.

  • PDF

Moving obstacle avoidance of a robot using avoidability measure (충돌 회피 가능도를 이용한 로봇의 이동 장애물 회피)

  • Ko, Nak-Yong;Lee, Beom-Hee
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.2
    • /
    • pp.169-178
    • /
    • 1997
  • This paper presents a new solution approach to moving obstacle avoidance problem of a robot. A new concept, avoidability measure(AVM) is defined to describe the state of a pair of a robot and an obstacle regarding the collision between them. As an AVM, virtual distance function(VDF) is derived as a function of three state variables: the distance from the obstacle to the robot, outward speed of the obstacle relative to the robot, and outward speed of the robot relative to the obstacle. By keeping the virtual distance above some positive limit value, the robot avoids the obstacle. In terms of the VDF, an artificial potential is constructed to repel the robot away from the obstacle and to attract the robot toward a goal location. At every sampling time, the artificial potential field is updated and the force driving the robot is derived from the gradient of the artificial potential field. The suggested algorithm drives the robot to avoid a moving obstacle in real time. Since the algorithm considers the mobility of the obstacle and robot as well as the distance, it is effective for moving obstacle avoidance. Some simulation studies show the effectiveness of the proposed approach.

  • PDF

Real-time Error Detection Based on Time Series Prediction for Embedded Sensors (임베디드 센서를 위한 시계열 예측 기반 실시간 오류 검출 기법)

  • Kim, Hyung-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.12
    • /
    • pp.11-21
    • /
    • 2011
  • An embedded sensor is significantly influenced by its spatial environment, such as barriers or distance, through low power and signal strength. Due to these causes, noise data frequently occur in an embedded sensor. Because the information acquired from the embedded sensor exists in a time series, it is hard to detect an error which continuously takes place in the time series information on a realtime basis. In this paper, we proposes an error detection method based on time-series prediction that detects error signals of embedded sensors in real time in consideration of the physical characteristics of embedded devices. The error detection method based on time-series prediction proposed in this paper determines errors in generated embedded device signals using a stable distance function. When detecting errors by monitoring signals from an embedded device, the stable distance function can detect error signals effectively by applying error weight to the latest signals. When detecting errors by monitoring signals from an embedded device, the stable distance function can detect error signals effectively by applying error weight to the latest signals.

A New Method for Local Obstacle Avoidance of a Mobile Robot (이동 로봇의 지역 장애물 회피를 위한 새로운 방법)

  • 김성철
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1998.03a
    • /
    • pp.88-93
    • /
    • 1998
  • This paper presents a new solution approach to moving obstacle avoidance problem for a mobile robot. A new concept avoidability measure(AVM) is defined to describe the state of a pair of a robot and an obstacle regarding the collision between them. As an AVM, virtual distance function(VDF) is derived as a function of the distance from the obstacle to the robot and outward speed of the obstacle relative to the robot. By keeping the virtual distance above some positive limit value, the robot avoids the obstacle. In terns of the VDF, an artificial potential field is constructed to repel the robot away from the obstacle and to attract the robot toward a goal location. At every sampling time, the artificial potential field is updated and the force driving the robot is derived form the gradient of the artificial potential field. The suggested algorithm drives the robot to avoid moving obstacles in real time. Since the algorithm considers the mobility of the obstacle as well as the distance, it is effective for moving obstacle avoidance. Some simulation studies show the effectiveness of the proposed approach.

  • PDF

Developed empirical model for simulation of time-varying frequency in earthquake ground motion

  • Yu, Ruifang;Yuan, Meiqiao;Yu, Yanxiang
    • Earthquakes and Structures
    • /
    • v.8 no.6
    • /
    • pp.1463-1480
    • /
    • 2015
  • This research aims to develop an empirical model for simulation of time-varying frequency in earthquake ground motion so as to be used easily in engineering applications. Briefly, 10545 recordings of the Next Generation Attenuation (NGA) global database of accelerograms from shallow crustal earthquakes are selected and binned by magnitude, distance and site condition. Then the wavelet spectrum of each acceleration record is calculated by using one-dimensional continuous wavelet transform, and the frequencies corresponding to the maximum values of the wavelet spectrum at a series of sampling time, named predominant frequencies, are extracted to analyze the variation of frequency content of seismic ground motions in time. And the time-variation of the predominant frequencies of 178 magnitude-distance-site bins for different directions are obtained by calculating the mean square root of predominant frequencies within a bin. The exponential trigonometric function is then use to fit the data, which describes the predominant frequency of ground-motion as a function of time with model parameters given in tables for different magnitude, distance, site conditions and direction. Finally, a practical frequency-dependent amplitude envelope function is developed based on the time-varying frequency derived in this paper, which has clear statistical parameters and can emphasize the effect of low-frequency components on later seismic action. The results illustrate that the time-varying predominant frequency can preferably reflect the non-stationarity of the frequency content in earthquake ground motions and that empirical models given in this paper facilitates the simulation of ground motions.

Performance improvement of underwater target distance estimation using blind deconvolution and time of arrival method (블라인드 디컨볼루션 및 time of arrival 기법을 이용한 수중 표적 거리 추정 성능 향상 기법)

  • Han, Min Su;Choi, Jea Young;Son, Kweon;Lee, Phil Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.6
    • /
    • pp.378-386
    • /
    • 2017
  • Accurate distance measurement between maneuver target in underwater and measuring devices is required to perform quantitative test evaluation in marine weapons system R&D process. In general, the target distance is measured using a one-way ToA (Time of Arrival) method that calculates the time difference between transmitted and received signals from the two accurately synchronized devices. However, the distance estimation performance is degraded because of the multi-path environments. In this paper, the time-variant transfer function of complex underwater environment is estimated from each received data frame using RBD (Ray-based Blind Deconvolution), and the estimated time-variant transfer function is then used to get rid of the effect about complex underwater environment and to recover the data signal using PTRM (Passive Time Reversal Mirror). The result from the simulation and experimental data show that the suggested method improve the distance estimation performance when comparing with the conventional ToA method.

DYNAMIC TIME WARPING FOR EFFICIENT RANGE QUERY

  • Long Chuyu Li;Jin Sungbo Seo;Ryu Keun Ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.294-297
    • /
    • 2005
  • Time series are comprehensively appeared and developed in many applications, ranging from science and technology to business and entertainrilent. Similarity search under time warping has attracted much interest between the time series in the large sequence databases. DTW (Dynamic Time Warping) is a robust distance measure and is superior to Euclidean distance for time series, allowing similarity matching although one of the sequences can elastic shift along the time axis. Nevertheless, it is more unfortunate that DTW has a quadratic time. Simultaneously the false dismissals are come forth since DTW distance does not satisfy the triangular inequality. In this paper, we propose an efficient range query algorithmbased on a new similarity search method under time warping. When our range query applies for this method, it can remove the significant non-qualify time series as early as possible before computing the accuracy DTW distance. Hence, it speeds up the calculation time and reduces the number of scanning the time series. Guaranteeing no false dismissals, the lower bounding function is advised that consistently underestimate the DTW distance and satisfy the triangular inequality. Through the experimental result, our range query algorithm outperforms the existing others.

  • PDF

Development of Acceleration/Deceleration Method for Real-time Control of Autonomous Mobile Robots (자율 이동 로봇의 실시간 제어를 위한 가.감속 방법의 개발)

  • 이수종
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2000.04a
    • /
    • pp.667-672
    • /
    • 2000
  • This article presents a new acceleration/deceleration method for real-time control of autonomous mobile robots. In this method, a function which produces the table of acceleration/deceleration in real-time is proposed. This function, while satisfying the basic concept of mechanics, can choose both various ranges of velocity and distance ranges for the selected velocities. Moreover it can control motors with real time. This function is convenient to be realized by programming. and it is faster than other functions because it can be made by assembly language.

  • PDF

Real-time obstacle avoidance for redundant manipulator (여유 자유도 로봇의 실시간 충돌 회피)

  • 조웅장;권동수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1140-1143
    • /
    • 1996
  • A new approach based on artificial potential function is proposed for the obstacle avoidance of redundant manipulators. Unlike the so-called "global" path planning method, which requires expensive computation for the path search before the manipulator starts to move, this new approach, "local" path planning, researches the path in real-time using the local distance information. Previous use of artificial potential function has exhibited local minima in some complex environments. This thesis proposes a potential function that has no local minima even for a cluttered environment. This potential function has been implemented for the collision avoidance of a redundant robot in Simulation. The simulation also employ an algorithm that eliminates collisions with obstacles by calculating the repulsive potential exerted on links, based on the shortest distance to object.

  • PDF

Optimal Connection Algorithm of Two Kinds of Parts to Pairs using Hopfield Network (Hopfield Network를 이용한 이종 부품 결합의 최적화 알고리즘)

  • 오제휘;차영엽;고경용
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.2
    • /
    • pp.174-179
    • /
    • 1999
  • In this paper, we propose an optimal algorithm for finding the shortest connection of two kinds of parts to pairs. If total part numbers are of size N, then there are order 2ㆍ(N/2)$^{N}$ possible solutions, of which we want the one that minimizes the energy function. The appropriate dynamic rule and parameters used in network are proposed by a new energy function which is minimized when 3-constraints are satisfied. This dynamic nile has three important parameters, an enhancement variable connected to pairs, a normalized distance term and a time variable. The enhancement variable connected to pairs have to a perfect connection of two kinds of parts to pairs. The normalized distance term get rids of a unstable states caused by the change of total part numbers. And the time variable removes the un-optimal connection in the case of distance constraint and the wrong or not connection of two kinds of parts to pairs. First of all, we review the theoretical basis for Hopfield model and present a new energy function. Then, the connection matrix and the offset bias created by a new energy function and used in dynamic nile are shown. Finally, we show examples through computer simulation with 20, 30 and 40 parts and discuss the stability and feasibility of the resultant solutions for the proposed connection algorithm.m.

  • PDF