2,258 research outputs found

    Learned navigation in unknown terrains: A retraction method

    Get PDF
    The problem of learned navigation of a circular robot R, of radius delta (is greater than or equal to 0), through a terrain whose model is not a-priori known is considered. Two-dimensional finite-sized terrains populated by an unknown (but, finite) number of simple polygonal obstacles are also considered. The number and locations of the vertices of each obstacle are unknown to R. R is equipped with a sensor system that detects all vertices and edges that are visible from its present location. In this context two problems are covered. In the visit problem, the robot is required to visit a sequence of destination points, and in the terrain model acquisition problem, the robot is required to acquire the complete model of the terrain. An algorithmic framework is presented for solving these two problems using a retraction of the freespace onto the Voronoi diagram of the terrain. Algorithms are then presented to solve the visit problem and the terrain model acquisition problem

    On autonomous terrain model acquistion by a mobile robot

    Get PDF
    The following problem is considered: A point robot is placed in a terrain populated by an unknown number of polyhedral obstacles of varied sizes and locations in two/three dimensions. The robot is equipped with a sensor capable of detecting all the obstacle vertices and edges that are visible from the present location of the robot. The robot is required to autonomously navigate and build the complete terrain model using the sensor information. It is established that the necessary number of scanning operations needed for complete terrain model acquisition by any algorithm that is based on scan from vertices strategy is given by the summation of i = 1 (sup n) N(O sub i)-n and summation of i = 1 (sup n) N(O sub i)-2n in two- and three-dimensional terrains respectively, where O = (O sub 1, O sub 2,....O sub n) set of the obstacles in the terrain, and N(O sub i) is the number of vertices of the obstacle O sub i

    Coherence resonance in an unijunction transistor relaxation oscillator

    Full text link
    The phenomenon of coherence resonance (CR) is investigated in an unijunction transistor relaxation oscillator (UJT-RO) and quantified by estimating the normal variance (NV). Depending upon the measuring points two types of NV curves have been obtained. We have observed that the degradations in coherency at higher noise amplitudes in our system is probably the result of direct interference of coherent oscillations and the stochastic perturbation. Degradation of coherency may be minimal if this direct interference of noise and coherent oscillations is eliminated.Comment: 4 pages, Coherence resonace, Uni junction relaxation oscillato
    corecore