Search algorithm for a group of mobile robots build with strongly limited a-priori information about surroundings

2016 ◽  
Vol 3 (3) ◽  
pp. 3-8
Author(s):  
Jeffrey L. Newcomer

Abstract This paper presents an algorithm for generating Smooth Collision Avoidance Trajectories (SCAT). SCAT generation is a method that allows a mobile robot that is moving along a pre-planned path to alter a section of its path, so that it may smoothly exit the original path, avoid a predicted collision, and return to the original path smoothly and on schedule. The SCAT generation algorithm is an improvement over off-line methods, as it requires minimal a priori information, and is more robust than pre-planned methods by its very nature. The SCAT algorithm is also an improvement over on-line schemes that only alter velocity along a pre-planned path, as it is able to avoid collisions in cases that those methods cannot. Details of the SCAT generation algorithm are developed herein, followed by examples of the algorithm in action. Simulation results show that the SCAT algorithm is very dependable, given that it can be provided with reasonably accurate in-formation about the location of dynamic obstacles in its vicinity.


2000 ◽  
Vol 54 (5) ◽  
pp. 721-730 ◽  
Author(s):  
S. S. Kharintsev ◽  
D. I. Kamalova ◽  
M. Kh. Salakhov

The problem of improving the resolution of composite spectra with statistically self-similar (fractal) noise is considered within the framework of derivative spectrometry. An algorithm of the numerical differentiation of an arbitrary (including fractional) order of spectra is produced by the statistical regularization method taking into account a priori information on statistical properties of the fractal noise. Fractal noise is analyzed in terms of the statistical Hurst method. The efficiency and expedience of this algorithm are exemplified by treating simulated and experimental IR spectra.


Sign in / Sign up

Export Citation Format

Share Document