Selection for Wandering Behavior in a Small Robot

1994 ◽  
Vol 2 (1) ◽  
pp. 101-116 ◽  
Author(s):  
Orazio Miglino ◽  
Kourosh Nafasi ◽  
Charles E. Taylor
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Computational Complexity ◽  
Random Noise ◽  
Effective Means ◽  
Selection For ◽  
Artificial Neural ◽  
Small Robot ◽  
Fixed Period

We have evolved artificial neural networks to control the wandering behavior of small robots. The task and environment were very simple—to touch as many squares in a grid as possible during a fixed period of time. A number of the simulated robots were embodied in a small Lego™ robot, controlled by a Motorola™ 6811 processor; and their performance was compared to the simulations. We observed that: (a) evolution was an effective means to program the robot's behavior; (b) progress was characterized by sharply stepped periods of improvement, separated by periods of stasis that corresponded to levels of behavioral/computational complexity; and (c) the simulated and realized robots behaved quite similarly, the realized robots in some cases outperforming the simulated ones. Introducing random noise to the simulations improved the fit somewhat (from r = 0.73 to 0.79). Hybrid simulated/embodied selection regimes for evolutionary robots are discussed.

scholarly journals Experimental Implementation of a Neural Network Optical Channel Equalizer in Restricted Hardware Using Pruning and Quantization

2022 ◽  
Author(s):  
Diego Argüello Ron ◽  
Pedro Jorge Freire De Carvalho Sourza ◽  
Jaroslaw E. Prilepsky ◽  
Morteza Kamalian-Kopae ◽  
Antonio Napoli ◽  
...  
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Computational Complexity ◽  
Communication Systems ◽  
Complexity Reduction ◽  
Edge Computing ◽  
Optical Channel ◽  
Raspberry Pi ◽  
Artificial Neural ◽  
The Impact

Abstract The deployment of artificial neural networks-based optical channel equalizers on edge-computing devices is critically important for the next generation of optical communication systems. However, this is a highly challenging problem, mainly due to the computational complexity of the artificial neural networks (NNs) required for the efficient equalization of nonlinear optical channels with large memory. To implement the NN-based optical channel equalizer in hardware, a substantial complexity reduction is needed, while keeping an acceptable performance level. In this work, we address this problem by applying pruning and quantization techniques to an NN-based optical channel equalizer. We use an exemplary NN architecture, the multi-layer perceptron (MLP), and address its complexity reduction for the 30 GBd 1000 km transmission over a standard single-mode fiber. We demonstrate that it is feasible to reduce the equalizer’s memory by up to 87.12%, and its complexity by up to 91.5%, without noticeable performance degradation. In addition to this, we accurately define the computational complexity of a compressed NN-based equalizer in the digital signal processing (DSP) sense and examine the impact of using different CPU and GPU settings on power consumption and latency for the compressed equalizer. We also verify the developed technique experimentally, using two standard edge-computing hardware units: Raspberry Pi 4 and Nvidia Jetson Nano.

ANALYSIS OF DOCUMENTS RANKING ALGORITHMS BASED ON THE ARTIFICIAL NEURAL NETWORKS

2019 ◽  
Author(s):  
Andrew Lishchytovych ◽  
Volodymyr Pavlenko
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Artificial Neural Networks ◽  
Network Architecture ◽  
Search Algorithm ◽  
Network Algorithms ◽  
Text Document ◽  
Ranking Algorithms ◽  
Selection For ◽  
Artificial Neural

The object of this study is to analyse the effectiveness of document ran­ king algorithms in search engines that use artificial neural networks to match the texts. The purpose of the study was to inspect a neural network model of text document ran­ king that uses clustering, factor analysis, and multi-layered network architecture. The work of neural network algorithms was compared with the standard statistical search algorithm OkapiBM25. The result of the study is to evaluate the effectiveness of the use of particular models and to recommend model selection for specific datasets.

STRING MATCHING ARTIFICIAL NEURAL NETWORKS

2001 ◽  
Vol 11 (05) ◽  
pp. 445-453 ◽  
Author(s):  
TATIANA TAMBOURATZIS
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Computational Complexity ◽  
Building Block ◽  
String Matching ◽  
Matching Problems ◽  
Low Computational Complexity ◽  
Artificial Neural ◽  
Harmony Theory ◽  
Fast Match

Three artificial neural networks (ANNs) are proposed for solving a variety of on- and off-line string matching problems. The ANN structure employed as the building block of these ANNs is derived from the harmony theory (HT) ANN, whereby the resulting string matching ANNs are characterized by fast match-mismatch decisions, low computational complexity, and activation values of the ANN output nodes that can be used as indicators of substitution, insertion (addition) and deletion spelling errors.

Sign in / Sign up

Export Citation Format

Share Document