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
Probabilistic aggregation strategies in swarm robotic systems
Date
2005-06-10
Author
Soysal, O
Ş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
219
views
0
downloads
Cite This
In this study, a systematic analysis of probabilistic aggregation strategies in swarm robotic systems is presented. A generic aggregation behavior is proposed as a combination of four basic behaviors: obstacle avoidance, approach, repel, and wait. The latter three basic behaviors are combined using a three-state finite state machine with two probabilistic transitions among them. Two different metrics were used to compare performance of strategies. Through systematic experiments, how the aggregation performance, as measured by these two metrics, change 1) with transition probabilities, 2) with number of simulation steps, and 3) with arena size, is studied.
Subject Keywords
Behaviors
URI
https://hdl.handle.net/11511/56068
Conference Name
IEEE Swarm Intelligence Symposium
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
A systematic study of probabilistic aggregation strategies in swarm robotic systems
Soysal, Onur; Şahin, Erol; Department of Computer Engineering (2005)
In this study, a systematic analysis of probabilistic aggregation strategies in swarm robotic systems is presented. A generic aggregation behavior is proposed as a combination of four basic behaviors: obstacle avoidance, approach, repel, and wait. The latter three basic behaviors are combined using a three-state finite state machine with two probabilistic transitions among them. Two different metrics were used to compare performance of strategies. Through systematic experiments, how the aggregation performa...
The interval Shapley value: an axiomatization
Gok, S. Z. Alparslan; Branzei, R.; Tijs, S. (Springer Science and Business Media LLC, 2010-06-01)
The Shapley value, one of the most widespread concepts in operations Research applications of cooperative game theory, was defined and axiomatically characterized in different game-theoretic models. Recently much research work has been done in order to extend OR models and methods, in particular cooperative game theory, for situations with interval data. This paper focuses on the Shapley value for cooperative games where the set of players is finite and the coalition values are compact intervals of real num...
A survey on OR and mathematical methods applied on gene-environment networks
Weber, Gerhard Wilhelm; Kropat, Erik; Öztürk, Başak; Gorgulu, Zafer-Korcan (Springer Science and Business Media LLC, 2009-09-01)
In this paper, we survey the recent advances and mathematical foundations of gene-environment networks. We explain their interdisciplinary implications with special regard to human and life sciences as well as financial sciences. Special attention is paid to applications in Operational Research and environmental protection. Originally developed in the context of modeling and prediction of gene-expression patterns, gene-environment networks have proved to provide a conceptual framework for the modeling of dy...
A multicriteria sorting approach based on data envelopment analysis for R&D project selection problem
Karasakal, Esra (Elsevier BV, 2017-12-01)
In this paper, multiple criteria sorting methods based on data envelopment analysis (DEA) are developed to evaluate research and development (R&D) projects. The weight intervals of the criteria are obtained from Interval Analytic Hierarchy Process and employed as the assurance region constraints of models. Based on data envelopment analysis, two threshold estimation models, and five assignment models are developed for sorting. In addition to sorting, these models also provide ranking of the projects. The de...
Behavior Categorization Using Correlation Based Adaptive Resonance Theory
YAVAŞ, mustafa; Alpaslan, Ferda Nur (2009-06-26)
This paper presents a new method of categorizing robot behavior, which is based on a variation of Correlation Based Adaptive Resonance Theory (CobART) learning. CobART is a type of ART 2 network and its main contribution is the usage of correlation analysis methods for category matching. This study uses derivation based correspondence and Euclidian distance as correlation analysis methods for behavior categorization. Tests show that the proposed method generates better results than ART 2 categorization even...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Soysal and E. Şahin, “Probabilistic aggregation strategies in swarm robotic systems,” presented at the IEEE Swarm Intelligence Symposium, Pasadena, CA, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56068.