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
Special issue on swarm robotics
Date
2008-08-26
Author
Ş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
169
views
0
downloads
Cite This
Subject Keywords
Artificial Intelligence
URI
https://hdl.handle.net/11511/35854
Journal
Swarm Intelligence
DOI
https://doi.org/10.1007/s11721-008-0020-6
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Two approaches for collective learning with language games
Gülçehre, Çağlar; Bozşahin, Hüseyin Cem; Department of Cognitive Sciences (2011)
This thesis presents a defense of the view that externalism cannot be a theoretical basis of a mentalistic causal-explanatory science, even though such a theoretical basis is implicitly or explicitly adopted by many cognitive scientists. Externalism is a theory in philosophy of mind which states that mental properties are relations between the core realizers of an individual’s mental states (such as brain states) and certain things that exist outside those realizers (such as what the content of a mental sta...
Formation preserving path finding in 3-D terrains
Bayrak, Ali Galip; Polat, Faruk (Springer Science and Business Media LLC, 2012-03-01)
Navigation of a group of autonomous agents that are required to maintain a formation is a challenging task which has not been studied much especially in 3-D terrains. This paper presents a novel approach to collision free path finding of multiple agents preserving a predefined formation in 3-D terrains. The proposed method could be used in many areas like navigation of semi-automated forces (SAF) at unit level in military simulations and non-player characters (NPC) in computer games. The proposed path findi...
Area measurement of large closed regions with a mobile robot
Şahin, Erol; Ugur, Emre (Springer Science and Business Media LLC, 2006-11-01)
How can a mobile robot measure the area of a closed region that is beyond its immediate sensing range? This problem, which we name as blind area measurement, is inspired from scout worker ants who assess potential nest cavities. We first review the insect studies that have shown that these scouts, who work in dark, seem to assess arbitrary closed spaces and reliably reject nest sites that are small for the colony. We briefly describe the hypothesis that these scouts use "Buffon's needle method" to measure t...
LinGraph: a graph-based automated planner for concurrent task planning based on linear logic
Kortik, Sitar; Saranlı, Uluç (Springer Science and Business Media LLC, 2017-10-01)
In this paper, we introduce an automated planner for deterministic, concurrent domains, formulated as a graph-based theorem prover for a propositional fragment of intuitionistic linear logic, relying on the previously established connection between intuitionistic linear logic and planning problems. The new graph-based theorem prover we introduce improves planning performance by reducing proof permutations that are irrelevant to planning problems particularly in the presence of large numbers of objects and a...
AN EFFICIENT DATABASE TRANSITIVE CLOSURE ALGORITHM
Toroslu, İsmail Hakkı; HENSCHEN, L (Springer Science and Business Media LLC, 1994-05-01)
The integration of logic rules and relational databases has recently emerged as an important technique for developing knowledge management systems. An important class of logic rules utilized by these systems is the so-called transitive closure rules, the processing of which requires the computation of the transitive closure of database relations referenced by these rules. This article presents a new algorithm suitable for computing the transitive closure of very large database relations. This algorithm proc...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Şahin, “Special issue on swarm robotics,”
Swarm Intelligence
, pp. 69–72, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35854.