Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A macroscopic model for self-organized aggregation in swarm robotic systems
Date
2006-10-01
Author
Soysal, Onur
Şahin, Erol
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
176
views
0
downloads
Cite This
We study the self-organized aggregation of a swarm of robots in a closed arena. We assume that the perceptual range of the robots are smaller than the size of the arena and the robots do not have information on the size of the swarm or the arena. Using a probabilistic aggregation behavior model inspired from studies of social insects, we propose a macroscopic model for predicting the final distribution of aggregates in terms of the parameters of the aggregation behavior, the arena size and the sensing characteristics of the robots. Specifically, we use the partition concept, developed in number theory, and its related results to build a discrete-time, non-spatial model of aggregation in swarm robotic systems under a number of simplifying assumptions. We provide simplistic simulations of self-organized aggregation using the aggregation behavior with different parameters and arena sizes. The results show that, despite the fact that the simulations did not explicitly enforce to satisfy the assumptions put forward by the macroscopic model, the final aggregate distributions predicted by the macroscopic model and obtained from simulations match.
Subject Keywords
Dynamics
URI
https://hdl.handle.net/11511/53470
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
A Probabilistic geometric model of self-organized aggregation in swarm robotic systems
Bayındır, Levent; Şahin, Erol; Department of Computer Engineering (2012)
Self-organized aggregation is the global level gathering of randomly placed robots using local sensing. Developing high performance and scalable aggregation behaviors for a swarm of mobile robots is non-trivial and still in need, when robots control themselves, perceive only a small part of the arena, and do not have access to information such as their position, the size of the arena or the number of robots. In this thesis, we developed a non-spatial probabilistic geometric model for self-organized aggregat...
Design of a low-costs warm robotic system for flocking
Demir, Çağrı Ata; Turgut, Ali Emre; Department of Mechanical Engineering (2019)
Swarm robotics is an approach to the coordination of large numbers of robots. The main motivation of this thesis is to study a robotic system designed to do flocking both indoors and outdoors. A walking robot is designed parallel to this purpose. In the first part of thesis, a leg is designed to minimize the displacement of center of mass of robot in vertical axis to eliminate mechanical noise. Mechanism analysis and Matlab optimization tools are utilized in this process. Then, electronic components of robo...
A self-organized collective foraging method using a robot swarm
Karagüzel, Tugay Alperen; Turgut, Ali Emre; Department of Mechanical Engineering (2020)
In this thesis, a collective foraging method for a swarm of aerial robots is investigated. The method is constructed by using algorithms that are designed to work in a distributed manner, by using only local information. No member in the swarm has access to global information about positions, states or environment. The environment, that robots are planned to operate in, contains a virtual scalar field which consists of grids containing constant values. The grid values indicate desired regions of the environ...
DEVELOPMENT OF A SOCIAL REINFORCEMENT LEARNING BASED AGGREGATION METHOD WITH A MOBILE ROBOT SWARM
Gür, Emre; Turgut, Ali Emre; Şahin, Erol; Department of Mechanical Engineering (2022-9-09)
In this thesis, the development of a social, reinforcement learning-based aggregation method is covered together with the development of a mobile robot swarm of Kobot- Tracked (Kobot-T) robots. The proposed method is developed to improve efficiency in low robot density swarm environments especially when the aggregated area is difficult to find. The method is called Social Reinforcement Learning, and Landmark-Based Aggregation (SRLA) and it is based on Q learning. In this method, robots share their Q tables ...
A programming technique for multifunctional use of industrial robots
Balkan, T (1996-08-16)
In this study, a software is developed in order to use an industrial robot, specifically an are welding robot, as a palletizing robot by using programming codes of a FANUC ARC Mate Sr. on a FANUC R-G2 controller environment. The software performs all standard palletizing options of a material handling robot in the same category without requirement of any optional built-in software. In addition, multiplication and division can be performed without any optional software for these functions, by using standard ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Soysal and E. Şahin, “A macroscopic model for self-organized aggregation in swarm robotic systems,” 2006, vol. 4433, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53470.