Filters








131 Hits in 4.1 sec

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses [article]

Taisuke Izumi and Samia Souissi and Yoshiaki Katayama and Nobuhiro Inuzuka and Xavier Défago and Koichi Wada and Masafumi Yamashita
2011 arXiv   pre-print
for semi-synchronous robots with dynamic compasses, and \phi < \pi/6 for asynchronous robots with dynamic compasses.  ...  Anonymous mobile robots are often classified into synchronous, semi-synchronous and asynchronous robots when discussing the pattern formation problem.  ...  Asynchronous Robots with Compasses We now address the case of asynchronous mobile robots.  ... 
arXiv:1111.1492v1 fatcat:boisiqaqtralvoye7wlimbosmm

Distributed algorithms for partitioning a swarm of autonomous mobile robots

Asaf Efrima, David Peleg
2009 Theoretical Computer Science  
A number of recent studies address systems of mobile autonomous robots from a distributed computing point of view.  ...  First, deterministic crash-fault-tolerant algorithms are given for the problem in the asynchronous full-compass and semi-synchronous half-compass models, and a randomized algorithm is given for the semi-synchronous  ...  Convergence and gathering with inaccurate sensors and movements are examined in [7] .  ... 
doi:10.1016/j.tcs.2008.04.042 fatcat:sfl33slylfdfxctx4pyneoxopu

Impossibility of gathering by a set of autonomous mobile robots

Giuseppe Prencipe
2007 Theoretical Computer Science  
Given a set of n autonomous mobile robots that can freely move on a two dimensional plane, they are required to gather in a position on the plane not fixed in advance (Gathering Problem).  ...  The studied robots are quite simple: they are anonymous, totally asynchronous, they do not have any memory of past computations, they cannot explicitly communicate between each other.  ...  Acknowledgements I would like to thank Paola Flocchini, Nicola Santoro and Vincenzo Gervasi for the discussions and comments that helped with the writing of this paper.  ... 
doi:10.1016/j.tcs.2007.04.023 fatcat:cpxi64rmf5bmtn7fmsqgepkv4e

A New Approach for Analyzing Convergence Algorithms for Mobile Robots [chapter]

Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot (+3 others)
2011 Lecture Notes in Computer Science  
Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point.  ...  We consider the well-studied family of robotic capabilities where a robot can, upon activation, compute the positions of all other robots using an individual affine coordinate system.  ...  The problem of having inaccurate compasses as a challenge for two robots is discussed in [SDY06] . [IKIW07] investigates even local compasses that vary over time.  ... 
doi:10.1007/978-3-642-22012-8_52 fatcat:reqorceo6zdfnegafewxxoqpcq

Rendezvous of Two Robots with Constant Memory [chapter]

Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2013 Lecture Notes in Computer Science  
Among other things, we prove that, with rigid movements, finite-state robots can rendezvous in semi-synchronous settings, and finitecommunication robots are able to rendezvous even in asynchronous ones  ...  We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane.  ...  For example, the problem has a trivial solution if the robots are endowed with consistent compasses even if the system is fully asynchronous.  ... 
doi:10.1007/978-3-319-03578-9_16 fatcat:plhevy6xl5gqxkjdoxb4mv72ae

Optimal byzantine resilient convergence in oblivious robot networks [article]

Zohir Bouzid , Sébastien Tixeuil
2009 arXiv   pre-print
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown beforehand  ...  In more details, we prove necessary and sufficient conditions for the convergence of mobile robots despite a subset of them being Byzantine (i.e. they can exhibit arbitrary behavior).  ...  [10] proposed a gathering solution for oblivious robots with limited visibility in CORDA model, where robots share the knowledge of a common direction given by a compass.  ... 
arXiv:0905.3967v1 fatcat:h4s7asq65fa3rpn3tpkykopwmq

Rendezvous of Two Robots with Constant Memory [article]

Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2013 arXiv   pre-print
It has been recently shown that rendezvous is possible even if the system is asynchronous (ASynch) if each robot is endowed with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and  ...  We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane.  ...  For example, the problem has a trivial solution if the robots are endowed with consistent compasses even if the system is fully asynchronous.  ... 
arXiv:1306.1956v1 fatcat:nsycq4gcxjebnlimu354rw5lpi

Collisionless Gathering of Robots with an Extent [chapter]

Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot (+3 others)
2011 Lecture Notes in Computer Science  
Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems.  ...  We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible.  ...  Another example is [19] , where two robots gather with inaccurate compasses or [14] , where the compasses even vary over time.  ... 
doi:10.1007/978-3-642-18381-2_15 fatcat:6a4ix3oatfg5nevqh2queejvgi

Rendezvous with constant memory

P. Flocchini, N. Santoro, G. Viglietta, M. Yamashita
2016 Theoretical Computer Science  
We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane.  ...  It has been recently shown that rendezvous is possible even if the system is asynchronous (ASynch) if each robot is endowed with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and  ...  For example, the problem has a trivial solution if the robots are endowed with consistent compasses even if the system is fully asynchronous.  ... 
doi:10.1016/j.tcs.2016.01.025 fatcat:3f4ojsm7zrhlpoitn6xxvfnfaa

Conceptual Bases of Robot Navigation Modeling, Control and Applications [chapter]

Silas F. R. Alves, Joao M., Humberto Ferasoli, Liz K. A. Rincon, Rosana A. T. Yamasaki
2011 Advances in Robot Navigation  
Robotics and Autonomous Systems, n6, pp.105-122, 1990.  ...  Nevertheless, magnetic compasses are influenced by metallic structures and power lines, becoming highly inaccurate near them. Other group of sensors for navigation are the active beacons.  ...  The mobile robots can be divided according to their mobility.  ... 
doi:10.5772/20955 fatcat:mjzslk55brhmri2wmh6ejzz3gu

Distributed Computing by Mobile Robots: Gathering

Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2012 SIAM journal on computing (Print)  
(e.g., inaccurate compass) [34, 36, 49] , to the absence of any relationship among the local coordinate systems of different robots [6, 27, 52], i.e., when the robots are disoriented.  ...  Gathering a set of autonomous mobile robots dispersed in the plane constitutes a basic control and coordination task.  ...  We would like to thank the many researchers who have shared with us their ideas, comments, suggestions, and (conflicting) conjectures on this problem over the years.  ... 
doi:10.1137/100796534 fatcat:4tzt5vqhu5birouqn62lkytm7y

Distributed Swarm Formation Using Mobile Agents [chapter]

Yasushi Kambayashi, Ryotaro Oikawa, Munehiro Takimoto
2018 Multi-Agent Systems - Control Spectrum [Working Title]  
The partial information consists of relative locations with neighbor robots that are cooperatively composing the formation.  ...  Once the pheromone agent reaches the robot with an ant agent, the ant agent migrates to the robot closest to the location pointed by the pheromone agent and then drives the robot to the location.  ...  Our multirobot system is designed to use robot resources efficiently, that is, utilizing idle robots, cooperating with inaccurate devices that may have sensor errors and movement errors, composing arbitrary  ... 
doi:10.5772/intechopen.81028 fatcat:vgifzmuudjb5le5hik6uslrhfi

Optimal Byzantine-resilient convergence in uni-dimensional robot networks

Zohir Bouzid, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
2010 Theoretical Computer Science  
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown beforehand  ...  In more detail, we prove necessary and sufficient conditions for the convergence of mobile robots despite a subset of them being Byzantine (i.e. they can exhibit arbitrary behavior).  ...  [10] proposed a gathering solution for oblivious robots with limited visibility in CORDA model, where robots share the knowledge of a common direction given by a compass.  ... 
doi:10.1016/j.tcs.2010.05.006 fatcat:th7fjr7ba5devotqia3kwi3p6i

Future Research on Cyber-Physical Emergency Management Systems

Erol Gelenbe, Fang-Jing Wu
2013 Future Internet  
A search may also be conducted with the help of robotic devices, despite their limited autonomy [11].  ...  Evacuees with mobile devices can follow personalised navigation paths with distributed decisions that mitigate congestion. Those without mobile devices may follow audio or visible LED directions.  ...  As search and rescue systems involve diverse mobile entities (e.g., robots and smartphones), cross-system integration control, intelligence learning for mobile entities in an OppSense environment, and  ... 
doi:10.3390/fi5030336 fatcat:fhprtq467fdfhamh4pmikxbtzu

Robot Mapping and Navigation by Fusing Sensory Information [chapter]

Maki K.
2007 Mobile Robots: Perception & Navigation  
for autonomous mobile robots.  ...  truly autonomous mobile robots.  ...  Mobile Robots: Perception & Navigation Today robots navigate autonomously in office environments as well as outdoors.  ... 
doi:10.5772/4790 fatcat:itabqk6e2neqjlz3cr5ijzco3e
« Previous Showing results 1 — 15 out of 131 results