scholarly journals Identifying Hazardous Shapes in the Plane

2020 ◽  
Vol 2 (2) ◽  
Author(s):  
Doron Nussbaum

This paper explores the problem of identifying the shapes of invisible hazardous entities in R2 by a set S = {s1, s2, . . . , sk} of mobile sensors (autonomous robots). A hazardous entity, H, is a region that affects the operation of robots that either penetrate the area or come in contact with it. In this paper, we propose algorithms for searching a rectangular region for a stationary hazardous entity, where some a priori geometrical knowledge is given (e.g., edge size range), and if such an entity exists, then determine the area that it occupies. We explore entities that are convex in nature such as line segment, circles (discs), and simple convex shapes. The objectives are to minimize the distance travelled by the robots during the search phase, and to minimize the number of robots that are required to identify the region covered by the hazardous entity. The number of robots required to locate H is three or four robots when H is a line segment, two or three robots when H is a circle, and seven robots are sufficient when H is a triangle. Our results extend to n-vertex convex shapes and we show that 2n + 1 robots are sufficient to determine the coverage of H.

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 56
Author(s):  
Gokarna Sharma ◽  
Ramachandran Vaidyanathan ◽  
Jerry L. Trahan

We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and use colored lights (the robots with lights model). We assume obstructed visibility where a robot cannot see another robot if a third robot is positioned between them on the straight line segment connecting them. In this paper, we consider the problem of positioning N autonomous robots on a plane so that every robot is visible to all others (this is called the Complete Visibility problem). This problem is fundamental, as it provides a basis to solve many other problems under obstructed visibility. In this paper, we provide the first, asymptotically optimal, O(1) time, O(1) color algorithm for Complete Visibility in the asynchronous setting. This significantly improves on an O(N)-time translation of the existing O(1) time, O(1) color semi-synchronous algorithm to the asynchronous setting. The proposed algorithm is collision-free, i.e., robots do not share positions, and their paths do not cross. We also introduce a new technique for moving robots in an asynchronous setting that may be of independent interest, called Beacon-Directed Curve Positioning.


2018 ◽  
Vol 226 ◽  
pp. 04045 ◽  
Author(s):  
Dmitriy A. Bezuglov ◽  
Viacheslav V. Voronin ◽  
Vladimir A. Krutov

Analytical equations of a new spline approximation method for filtering impulse noise in images are obtained. The proposed method differs from the known ones: when filtering images, one-dimensional sequential spline functions are used for direct and inverse transformations, and the processing is performed in rows and columns. In this work, experimental studies based on computer simulation using special test images on the background of impulse noise were conducted. Experimental studies have shown the operability and high efficiency of the developed method, which allow to improve the quality of image filtering by up to 10 dB. In this case, the properties of spline functions make it possible to abandon the use of various masks, that is, to abandon inefficient linear methods of image filtering. The method can be used to create digital image processing systems in the industry, to create autonomous robots, under observation conditions that complicate the registration process, and in the absence of a priori information about the form of background noise.


2012 ◽  
Vol 24 (3) ◽  
pp. 577-606 ◽  
Author(s):  
Norikazu Sugimoto ◽  
Masahiko Haruno ◽  
Kenji Doya ◽  
Mitsuo Kawato

Reinforcement learning (RL) can provide a basic framework for autonomous robots to learn to control and maximize future cumulative rewards in complex environments. To achieve high performance, RL controllers must consider the complex external dynamics for movements and task (reward function) and optimize control commands. For example, a robot playing tennis and squash needs to cope with the different dynamics of a tennis or squash racket and such dynamic environmental factors as the wind. In addition, this robot has to tailor its tactics simultaneously under the rules of either game. This double complexity of the external dynamics and reward function sometimes becomes more complex when both the multiple dynamics and multiple reward functions switch implicitly, as in the situation of a real (multi-agent) game of tennis where one player cannot observe the intention of her opponents or her partner. The robot must consider its opponent's and its partner's unobservable behavioral goals (reward function). In this article, we address how an RL agent should be designed to handle such double complexity of dynamics and reward. We have previously proposed modular selection and identification for control (MOSAIC) to cope with nonstationary dynamics where appropriate controllers are selected and learned among many candidates based on the error of its paired dynamics predictor: the forward model. Here we extend this framework for RL and propose MOSAIC-MR architecture. It resembles MOSAIC in spirit and selects and learns an appropriate RL controller based on the RL controller's TD error using the errors of the dynamics (the forward model) and the reward predictors. Furthermore, unlike other MOSAIC variants for RL, RL controllers are not a priori paired with the fixed predictors of dynamics and rewards. The simulation results demonstrate that MOSAIC-MR outperforms other counterparts because of this flexible association ability among RL controllers, forward models, and reward predictors.


2004 ◽  
Vol 34 (3) ◽  
pp. 355-373
Author(s):  
Edward Slowik

Among the current topics in Hume scholarship witnessing an upsurge in attention, few can match the inherent complexities associated with his doctrine of space, that of ten neglected and occasionally maligned theory put forth in Book I, Part II, of the Treatise.Yet despite this increase in academie interest, Hume's concept of spatial magnitude — i.e., the spatial size or magnitude of visible and tangible figures — as opposed to his more generai notion of space, has not attracted the same degree of attention. Even if commentators agree that Hume took the idea of space to be an idea derived from ‘the impressions of color'd points, dispos'd in a certain manner’ (T 1.2.3.3), this fact does not teil us what measures the distance between these impressions (perceptions), or what psychological processes and empirical properties are involved in the act of determining size or magnitude. If one bears in mind that the concept of spatial magnitude is also intimately connected with the status of geometry, and the debate on whether Hume endorsed a synthetic or analytic a priori account of geometrical knowledge, the failure to study exhaustively Hume's concept of distance becomes all the more astonishing.


Robotica ◽  
2005 ◽  
Vol 24 (4) ◽  
pp. 455-461 ◽  
Author(s):  
Vicente Matellán Olivera ◽  
José María Cañas Plaza ◽  
Oscar Serrano Serrano

This paper compares two methods to estimate the position of a mobile robot in an indoor environment using only odometric calculus and the WiFi energy received from the wireless communication infrastructure. In both cases we use a well-known probabilistic method based on the Bayes rule to accumulate localization probability as the robot moves on with an experimental WiFi map, and with a theoretically built WiFi map. We will show several experiments made in our university building to compare both methods using a Pioneer robot. The two major contributions of the presented work are that the self-localization error achieved with WiFi energy is bounded, and that no significant degradation is observed when the expected WiFi energy at each point is taken from radio propagation model, instead of an a priori experimental intensity map of the environment.


Author(s):  
Oleksandr Poliarus ◽  
Yevhen Poliakov

Remote detection of landmarks for navigation of mobile autonomous robots in the absence of GPS is carried out by low-power radars, ultrasonic and laser rangefinders, night vision devices, and also by video cameras. The aim of the chapter is to develop the method for landmarks detection using the color parameters of images. For this purpose, the optimal system of stochastic differential equations was synthesized according to the criterion of the generalized variance minimum, which allows to estimate the color intensity (red, green, blue) using a priori information and current measurements. The analysis of classical and nonparametric methods of landmark detection, as well as the method of optimal estimation of color parameters jumps is carried out. It is shown that high efficiency of landmark detection is achieved by nonparametric estimating the first Hilbert-Huang modes of decomposition of the color parameters distribution.


Robotica ◽  
2014 ◽  
Vol 34 (5) ◽  
pp. 1071-1089 ◽  
Author(s):  
Avinesh Prasad ◽  
Bibhya Sharma ◽  
Jito Vanualailai

SUMMARYThis paper formulates a new scalable algorithm for motion planning and control of multiple point-mass robots. These autonomous robots are designated to move safely to their goals ina prioriknown workspace cluttered with fixed and moving obstacles of arbitrary positions and sizes. The control laws proposed for obstacle and collision avoidance and target convergence ensure that the equilibrium point of the given system is asymptotically stable. Computer simulations with the proposed technique and applications to a team of two planar (RP) manipulators working together in a common workspace are presented. Also, the robustness of the system in the presence of noise is verified through simulations.


2011 ◽  
Vol 11 (2) ◽  
pp. 5541-5588 ◽  
Author(s):  
A. Stohl ◽  
A. J. Prata ◽  
S. Eckhardt ◽  
L. Clarisse ◽  
A. Durant ◽  
...  

Abstract. The April–May 2010 volcanic eruptions of Eyjafjallajökull, Iceland caused significant economic and social disruption in Europe whilst state of the art measurements and ash dispersion forecasts were heavily criticized by the aviation industry. Here we demonstrate for the first time that dramatic improvements can be made in quantitative predictions of the fate of volcanic ash emissions, by using an inversion scheme that couples a priori source information and the output of a Lagrangian dispersion model with satellite data to estimate the volcanic ash source strength as a function of altitude and time. From the inversion, we obtain a total fine ash emission of the eruption of 8.3 ± 4.2 Tg for particles in the size range of 2.8–28 μm diameter and extrapolate this to a total ash emission of 11.9 ± 5.9 Tg for the size range of 0.25–250 μm. We evaluate the results of our a posteriori model using independent ground-based, airborne and space-borne measurements both in case studies and statistically. Subsequently, we estimate the area over Europe affected by volcanic ash above certain concentration thresholds relevant for the aviation industry. We find that during three episodes in April and May, volcanic ash concentrations at some altitude in the atmosphere exceeded the limits for the "normal" flying zone in up to 14% (6–16%), 2% (1–3%) and 7% (4–11%), respectively, of the European area. For a limit of 2 mg m−3 only two episodes with fractions of 1.5% (0.2–2.8%) and 0.9% (0.1–1.6%) occurred, while the current "no-fly" zone criterion of 4 mg m−3 was rarely exceeded. Our results have important ramifications for determining air space closures and for real-time quantitative estimations of ash concentrations. Furthermore, the general nature of our method yields better constraints on the distribution and fate of volcanic ash in the Earth system.


Author(s):  
E.J. Jenkins ◽  
D.S. Tucker ◽  
J.J. Hren

The size range of mineral and ceramic particles of one to a few microns is awkward to prepare for examination by TEM. Electrons can be transmitted through smaller particles directly and larger particles can be thinned by crushing and dispersion onto a substrate or by embedding in a film followed by ion milling. Attempts at dispersion onto a thin film substrate often result in particle aggregation by van der Waals attraction. In the present work we studied 1-10 μm diameter Al2O3 spheres which were transformed from the amprphous state to the stable α phase.After the appropriate heat treatment, the spherical powders were embedded in as high a density as practicable in a hard EPON, and then microtomed into thin sections. There are several advantages to this method. Obviously, this is a rapid and convenient means to study the microstructure of serial slices. EDS, ELS, and diffraction studies are also considerably more informative. Furthermore, confidence in sampling reliability is considerably enhanced. The major negative feature is some distortion of the microstructure inherent to the microtoming operation; however, this appears to have been surprisingly small. The details of the method and some typical results follow.


Author(s):  
A. Gómez ◽  
P. Schabes-Retchkiman ◽  
M. José-Yacamán ◽  
T. Ocaña

The splitting effect that is observed in microdiffraction pat-terns of small metallic particles in the size range 50-500 Å can be understood using the dynamical theory of electron diffraction for the case of a crystal containing a finite wedge. For the experimental data we refer to part I of this work in these proceedings.


Sign in / Sign up

Export Citation Format

Share Document