TERRAIN COVERAGE ANT ALGORITHMS: THE RANDOM KICK EFFECT
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 10
Abstract
In this work the effect of random repositioning of ant robots/agents on the performance of terrain coverage algorithms is investigated. A number of well-known terrain coverage algorithms are implemented and studied in a simulated environment. We prove that agent repositioning imposes small variations on the performance of the algorithms when random or controlled jumps occurred and evaporation and failures are allowed.
Authors and Affiliations
M. Dervisi, O. Efremides, D. Iracleous
Keywords
Related Articles
- EP ID EP120645
- DOI 10.14569/IJACSA.2013.041025
- Views 92
- Downloads 0
Design of Frequency Reconfigurable Multiband Meander Antenna Using Varactor Diode for Wireless Communication
A compact multiband frequency reconfigurable meander antenna proposed for wireless communication systems is designed and described in this paper. A folded structure has been chosen due its good tradeoff between size, ban...
A Carrier Signal Approach for Intermittent Fault Detection and Health Monitoring for Electronics Interconnections System
Intermittent faults are completely missed out by traditional monitoring and detection techniques due to non-stationary nature of signals. These are the incipient events of a precursor of permanent faults to come. Intermi...
Comparative Analysis of Raw Images and Meta Feature based Urdu OCR using CNN and LSTM
Urdu language uses cursive script which results in connected characters constituting ligatures. For identifying characters within ligatures of different scales (font sizes), Convolution Neural Network (CNN) and Long Shor...
The Examination of Using Business Intelligence Systems by Enterprises in Hungary
Data are one of the key elements in corporate decision-making, without them, the decision-making process cannot be imagined. As a consequence, different analytical tools are needed that allow the efficient use of data, i...
Dynamic Programming Inspired Genetic Programming to Solve Regression Problems
The candidate solution in traditional Genetic Pro-graming is evolved through prescribed number of generations using fitness measure. It has been observed that, improvement of GP on different problems is insignificant at...