A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Universal Systems of Oblivious Mobile Robots
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
An oblivious mobile robot is a stateless computational entity located in a spatial universe, capable of moving in that universe. ...
In G operate k oblivious mobile robots (or simply "robots"), that is, * ...
A system of oblivious mobile robots is a triplet Ψ = (G, k, S), where G is a labeled graph, k ≥ 1, and S is a scheduler for k robots in G. ...
doi:10.1007/978-3-319-48314-6_16
fatcat:5h63nyawm5e5tgniaixh7nacbi
Universal Systems of Oblivious Mobile Robots
[article]
2016
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
An oblivious mobile robot is a stateless computational entity located in a spatial universe, capable of moving in that universe. ...
When the universe is a graph, distributed computations by oblivious mobile robots have been intensively studied focusing on the conditions for feasibility of basic problems (e.g., gathering, exploration ...
A system of oblivious mobile robots is a triplet Ψ = (G, k, S), where G is a labeled graph, k ≥ 1, and S is a scheduler for k robots in G. ...
arXiv:1602.04881v4
fatcat:7mmvuztuofffvmjj7nssfdbfjy
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
[chapter]
2010
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.
Other Versions
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the ability to sense their environment ...
An upper bound of 17 robots holds in the deterministic case while 4 probabilistic robots are sufficient. ...
Introduction Recent research focused on systems of autonomous mobile entities (that are hereafter referred to as robots) that have to collaborate in order to accomplish collective tasks. ...
doi:10.1007/978-3-642-13284-1_15
fatcat:mqo77pcm65b65mkirow2uny3ue
Pattern Formation by Oblivious Asynchronous Mobile Robots
2015
SIAM journal on computing (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 2018; you can also visit the original URL.
The file type is application/pdf.
Abstruct This paper considers a system $R$ of anonymous mobile robots, each represented by a point in $2D$ Euclidean space. ...
The problem of forming a given pattem by a set of mobile robots is called the pattern formation problem. ...
Introduction Autonomous mobile robot In autonomous mobile robots model, we consider a system consisting of anonymous mobile robots. ...
doi:10.1137/140958682
fatcat:fdfdxnemgbevzkegjzrprylr6y
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
[article]
2015
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 present a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots, the robots ...
To our knowledge, this is the first certified positive (and constructive) result in the context of oblivious mobile robots. ...
Our contribution Motivated by open problems on the gathering side and on the proof assistant side, we investigate the possibility of universal gathering mobile oblivious robots (that is, starting from ...
arXiv:1506.01603v1
fatcat:6o7mwyuqqzd4ddbvtae6jab67e
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications
2018
International Symposium on Distributed Computing
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 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper we investigate the computational power of a set of mobile robots with limited visibility. ...
Each robot is punctiform and memoryless, it operates in R m , it has a local reference system independent of the other robots' ones, and is activated asynchronously by an adversarial scheduler. ...
Our oracle semi-oblivious real RAM model can be reinterpreted in the realm of mobile robots. ...
doi:10.4230/lipics.disc.2018.19
dblp:conf/wdag/LunaFSV18
fatcat:cp4q6xpgwzcb5mkko3xdigetxu
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications
[article]
2018
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
In this paper we investigate the computational power of a set of mobile robots with limited visibility. ...
Each robot is punctiform and memoryless, it operates in R^m, it has a local reference system independent of the other robots' ones, and is activated asynchronously by an adversarial scheduler. ...
Mobile Robots as Real RAMs Mobile robots Our oracle semi-oblivious real RAM model can be reinterpreted in the realm of mobile robots. ...
arXiv:1709.08800v2
fatcat:x7ltoeuihfeb3efzo3fpmxz36y
Certified Universal Gathering in R^2 for Oblivious Mobile Robots
[article]
2016
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.
In more details, we provide a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any initial configuration that is not bivalent, using any number of robots ...
As a case study, we present the first formally certified protocol for oblivious mobile robots evolving in a two-dimensional Euclidean space. ...
Case study: A Universal Gathering for Mobile Oblivious Robots The gathering problem is one of the benchmarking tasks in mobile robot networks, and has received a considerable amount of attention (see ...
arXiv:1602.08361v1
fatcat:mcxnaes4jjdfljzjjncybl6lem
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.
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 ...
In this Chapter, we review the results of the investigations on the computability and complexity aspects of systems formed by these myopic and silent mobile sensors. ...
Modeling Mobile Robotic Sensors
Capabilities The system is composed of a set S = {s 1 , . . . , s n } of n mobile robotic sensors operating in a spatial universe U ⊆ R 2 . ...
doi:10.1007/978-3-642-14849-1_21
dblp:series/eatcs/FlocchiniPS11
fatcat:moittdti4vh6viqtuzlppiyyk4
A Survey on Decentralized Flocking Schemes for a Set of Autonomous Mobile Robots (Invited Paper)
2010
Journal of Communications
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.
Oblivious Mobile Robots", Japan Advanced Institute Intelligent Autonoma, 2003. ...
The system consists of a set of surroundings, perform computations on the sensed
autonomous mobile robots R = {r1 , L , rn }. ...
doi:10.4304/jcm.5.1.31-38
fatcat:x2z6halqzjctdfczwg22uzppz4
Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility
[chapter]
2017
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.
The question is if an oblivious mobile robot on a line-segment can localize the middle point of the line-segment in finite steps observing the direction (i.e., Left or Right) and distance to the nearest ...
This paper poses a question about a simple localization problem, which is arisen from self-stabilizing location problems by oblivious mobile autonomous robots with limited visibility. ...
Introduction
Background Motivated by real applications such as wireless sensor networks with mobile nodes, or by computability of a distributed system from the theoretical point of view, designing self-stabilizing ...
doi:10.1007/978-3-319-69084-1_12
fatcat:4d4fdhlrnrcxfgvybrnvp56npe
Exploration of Finite 2D Square Grid by a Metamorphic Robotic System
[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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1808.00214v1 fatcat:daqtda6ypbhbrj4abqzwyqjm5a
We consider exploration of finite 2D square grid by a metamorphic robotic system consisting of anonymous oblivious modules. ...
The number of possible shapes of a metamorphic robotic system grows as the number of modules increases. The shape of the system serves as its memory and shows its functionality. ...
Di Luna et al. showed a constant number of oblivious mobile robots can simulate a robot with memory [7] . ...
arXiv:1808.00214v2
fatcat:c22yxb7lsjcp7i6rtn6vtazdi4
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
2012
Algorithmica
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 2011; you can also visit the original URL.
The file type is application/pdf.
Recently a lot of attention has been devoted to the computational and complexity issues arising in systems of autonomous mobile entities located in a spatial universe U. ...
We consider the problem of exploring an anonymous unoriented ring by a team of k identical, oblivious, asynchronous mobile robots that can view the environment but cannot communicate. ...
Instead, in the majority of the studies on a continuous universe, the robots are oblivious: all the information contained in the workspace is cleared at the end of each cycle. ...
doi:10.1007/s00453-011-9611-5
fatcat:k3zj2vsdtjedzddojdyry4g6xa
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits
2012
2012 IEEE 32nd International Conference on Distributed Computing Systems
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.
In this paper we introduce in the ASYNC model, the weakest of the three, the availability of visible external memory: each robot is equipped with a light bulb that is visible to all other robots, and that ...
We prove hat asynchronous robots, when equipped with a constant number of colors, are strictly more powerful than traditional semisynchronous robots. ...
ACKNOWLEDGMENT This work has been partially supported by NSERC Discovery Grant (Canada), by Grant-in-Aid for Science Research, and by MIUR of Italy under project MadWeb. ...
doi:10.1109/icdcs.2012.71
dblp:conf/icdcs/DasFPSY12
fatcat:qpjlcqpsfzfrbjqwqdcsrz2mtm
How many oblivious robots can explore a line
2011
Information Processing Letters
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 2014; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of exploring an anonymous line by a team of k identical, oblivious, asynchronous deterministic mobile robots that can view the environment but cannot communicate. ...
We completely characterize sizes of teams of robots capable of exploring a n-node line. ...
Introduction
Framework This study is a part of an ongoing effort to understand computational and complexity issues arising in systems of autonomous mobile entities located in a universe U. ...
doi:10.1016/j.ipl.2011.07.018
fatcat:had3v6e7bbf37b3e63hhwexi2i
« Previous
Showing results 1 — 15 out of 1,212 results