A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
We consider a team of k identical, oblivious, semi-synchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path. ...
In this paper, we initiate research on probabilistic bounds and solutions in this context, and focus on the exploration problem of anonymous unoriented rings of any size. ...
In this paper, we consider the semi-synchronous model introduced in [13] . ...
doi:10.1007/978-3-642-11476-2_16
fatcat:xbfxre22hng3zarcpza6fjvwyy
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
2013
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider a team of k identical, oblivious, semi-synchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path. ...
In this paper, we initiate research on probabilistic bounds and solutions in this context, and focus on the exploration problem of anonymous unoriented rings of any size. ...
In this paper, we consider the semi-synchronous model introduced in [13] . ...
doi:10.1016/j.tcs.2013.05.031
fatcat:hcd5xezoenggxhxeykuvrt5yim
Optimal exploration of small rings
2010
Proceedings of the Third International Workshop on Reliability, Availability, and Security - WRAS '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here we close the question of optimal (w.r.t. the cohort size) ring exploration by probabilistic robots. ...
In [4] , the authors look at probabilistic bounds and solutions for the exploration of anonymous unoriented rings of any size by a cohort of robots. ...
In this paper, after formally defining the model we use (Section 2), we close the question of optimal (w.r.t. the cohort size) ring exploration by probabilistic robots. ...
doi:10.1145/1953563.1953571
dblp:conf/podc/Devismes10
fatcat:2impzrv3gzbsdgim5iwpbkmeki
Oblivious Robots on Graphs: Exploration
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This chapter focuses on the problem of exploring a graph by a team of mobile robots endowed with vision. ...
The goal for these robots is to explore the graph in which they are, that is to visit all vertices of the graph. ...
Indeed, in the semi-synchronous model Ssync, a constant number of robots, namely 4 probabilistic robots, are necessary and sufficient to solve the terminating exploration problem in any n-vertex ring with ...
doi:10.1007/978-3-030-11072-7_9
fatcat:kipiyqnzybb2fp75dwm3fsdbxe
Optimal Grid Exploration by Asynchronous Oblivious Robots
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration (exploration for short) of a grid-shaped network by a team of k asynchronous oblivious robots in ...
Then, we propose deterministic algorithms in CORDA to exhibit the optimal number of robots allowing to explore of a given grid. ...
By contrast, four robots are necessary and sufficient to solve the probabilistic exploration of any ring of size at least 4 in ATOM [6, 5] . ...
doi:10.1007/978-3-642-33536-5_7
fatcat:v6asal3phfcabfe2bgdboscvra
Ring Exploration with Oblivious Myopic Robots
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper, we consider deterministic exploration in an anonymous, unoriented ring using asynchronous, oblivious, and myopic robots. ...
The exploration problem in the discrete universe, using identical oblivious asynchronous robots without direct communication, has been well investigated. ...
In the same paper, the authors give a probabilistic algorithm that solves the problem on a ring of size n > 8 that is optimal for the number of robots. ...
arXiv:1205.5003v1
fatcat:bmgotnjqwzeotkq24gvflqxtqq
Optimal Torus Exploration by Oblivious Robots
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose an optimal (w.r.t. the number of robots) solution for the terminating exploration of a torus-shaped network by a team of k such robots. ...
In this paper, we propose an optimal (w.r.t. the number of robots) solution for the terminating exploration of a torus-shaped network by a team of k such robots. ...
Going higher dimension (from a ring to a torus) did not increase the robot number complexity of the exploration problem. The issue of the d-dimensional tori (for d > 2) remains open. ...
doi:10.1007/978-3-319-26850-7_13
fatcat:lmm3zcncivgdfomcoxlvoarslm
Optimal grid exploration by asynchronous oblivious robots
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration of a grid shaped network by a team of k asynchronous oblivious robots in the fully asynchronous ...
Then, we propose deterministic algorithms in CORDA to exhibit the optimal number of robots allowing to explore of a given grid. ...
It is shown in [6] that no (probabilistic or deterministic) exploration using less than four oblivious robots is possible for any ring of size at least four in ATOM. ...
arXiv:1105.2461v3
fatcat:xova6bxenjfhroyhzld3q6gdzq
On the Self-stabilization of Mobile Oblivious Robots in Uniform Rings
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We investigate self-stabilizing algorithms for anonymous and oblivious robots in uniform ring networks, that is, we focus on algorithms that can start from any initial configuration (including those with ...
On the positive side, we give a probabilistic self-stabilizing algorithm for the gathering and orientation problems in the semi-synchronous (SSYNC) model with global-strong multiplicity detection. ...
This work is supported in part by JSPS KAKENHI Grant Numbers 24500039, 24650012, 25104516, 26280022, 26330084. This work is supported in part by LINCS. ...
doi:10.1007/978-3-642-33536-5_6
fatcat:lirkspzgevespagq6qdbg64ng4
Exploration of High-Dimensional Grids by Finite State Machines
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of finding a treasure at an unknown point of an n-dimensional infinite grid, n≥ 3, by initially collocated finite state agents (scouts/robots). ...
We give a different algorithm that uses 4 deterministic semi-synchronous agents for the 3-dimensional grid. This is provably optimal, and surprisingly, matches the result for 2 dimensions. ...
Remembering With-
out Memory: Tree Exploration by Asynchronous Oblivious Robots. ...
arXiv:1902.03693v1
fatcat:x73kfix4ejh5dbqv5ob47u2kzy
Uniform multi-agent deployment on a ring
2011
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Then, for an oriented ring and V ≥ ⌈n/k⌉, we propose an algorithm which achieves the deployment task in optimal time. ...
We consider two variants of the task of spreading a swarm of agents uniformly on a ring graph. Ant-like oblivious agents having limited capabilities are considered. ...
[2] have proposed an algorithm by which the agents perpetually explore an unoriented ring. ...
doi:10.1016/j.tcs.2010.11.023
fatcat:ig4lzvgkmff6ddsr42f25o2rby
Computing by Mobile Robotic Sensors
[chapter]
2010
Monographs in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This means that synchronization, interaction, and communication of information among the robotic sensors can be achieved solely by means of their sensing capability, usually called vision. ...
The research areas of mobile robotic sensors lie in the intersection of two major fields of investigations carried out by quite distinct communities of researchers: autonomous robots and mobile sensor ...
Semi Synchronous Gathering In the Ssync model, the gathering problem has also been tackled by Ando et al [2] . ...
doi:10.1007/978-3-642-14849-1_21
dblp:series/eatcs/FlocchiniPS11
fatcat:moittdti4vh6viqtuzlppiyyk4
On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Then, we automatically generate an optimal distributed algorithm for three robots evolving on a fixed size uniform ring. ...
In the FSYNC model all robots execute the three phases synchronously. ...
The three existing asynchrony models fully synchronous (FSYNC),
semi-synchronous (SSYNC) and asynchronous (ASYNC) in robot networks are called
schedulers. i∈Sched
To handle the semi synchronous ...
doi:10.1007/978-3-319-11764-5_17
fatcat:vaysrscdrve6bnjgcvmqnkvdue
A Survey on Biologically Inspired Algorithms for Computer Networking
2013
IEEE Communications Surveys and Tutorials
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper provides a comprehensive survey of BIAs for the computer networking field, in which different BIAs are organized and explored based on their: (1) biological source; (2) mathematical model; ( ...
The paper concludes by offering a framework for understanding the application of BIAs to problems in the computer networking space. ...
BIAs that are inspired by different biological sources but are applicable to similar networking applications are compared and summarized in tables XII, XIII, and XIV. ...
doi:10.1109/surv.2013.010413.00175
fatcat:kl426uhbl5gahpqqprlxchu3yq
Software Reverse Engineering in the Domain of Complex Embedded Systems
[chapter]
2012
Reverse Engineering - Recent Advances and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Coupled with simulator optimization, significantly more (diverse) scenarios can be explored. ...
The amount of tracing data is restricted by the hardware resources. For instance, for ABB robots around 10 seconds (100,000 events) of history are available, which are kept in a ring buffer . ...
doi:10.5772/33586
fatcat:cutc7knbajcq5mp6kh7yd7wehu
« Previous
Showing results 1 — 15 out of 56 results