Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 9 November 2010

Optimization of Clustering Time by a Group of Autonomous Robots Making Use of an Exclusive Multi-Marking

Mohamed Rida Abdessemed, Kamel Khoualdi & Azeddine Bilami

Journal of Computer Science, Volume 6, Issue 12, pp. 1465–1473 · doi.org/10.3844/jcssp.2010.1465.1473

6,890 accesses4,517 downloads0 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem statement: For solving complex issues, the current tendency goes towards the swarms behaviors, realized on a basis of collective interactions, which results from a cooperative work favoring exchanges between individuals of a same group at microscopic level and allowing the emergence of complex collective behaviors at macroscopic level. Many models were inspired by these attitudes to find simple rules, guiding mobile, autonomous robots with limited capacities in their environment in order to achieve tasks like those of exploration, self-assembly and gathering. Multi-marking technique as indirect communication inside the same robots group can optimize time of such achievements Approach: A method based on the reversed emergence principle combined to a genetic algorithm is presented here, making evolve a global behavior inside simulated robots group called agent-robots, with an aim to find the micro-rules forming a heap according to two approaches. The first approach accomplishes an ordinary grouping and the second one, which we propose, based on the exclusive multi-marking principle. The control device, guiding these robots-agent to succeed this task, functions on a basis of sensor-motor rules being used to arbitrate between a given number of elementary behaviors with which we equip each one of them initially. Results: Simulation results, implemented according to a reactive agent’s model, making it possible to show the consistency of the detected rules and the efficient of the proposed approach in comparison with the ordinary one, are provided and commented. The time optimization of grouping by robots like these can have a huge economic and strategic impact in sectors as important as industry, agriculture and military domain. Conclusion: Like examples, we can quote the grouping of goods in a warehouse, the grouping of ores from mines, the grouping of vegetables and fruits in gardens and the recovery of weapons, in real time, from a battle field. This work can be generalized, in the future, to the multi-heap formation to perform the classification task according to given criteria.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2010 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Abdessemed, M. R., Khoualdi, K. & Bilami, A. (2010). Optimization of Clustering Time by a Group of Autonomous Robots Making Use of an Exclusive Multi-Marking. Journal of Computer Science, 6(12), 1465–1473. https://doi.org/10.3844/jcssp.2010.1465.1473

Licence
© Science Publications
Issue
Volume 6, Issue 12
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Optimization of Clustering Time by a Group of Autonomous Robots Making Use of an Exclusive Multi-MarkingJournal of Computer Science · Volume 6, Issue 12 · pp. 1465–1473 · © Science PublicationsDownload