Filters








1,291 Hits in 3.6 sec

Gathering few fat mobile robots in the plane

Jurek Czyzowicz, Leszek Ga̧sieniec, Andrzej Pelc
2009 Theoretical Computer Science  
This is the first algorithmic result on gathering robots represented by two-dimensional figures rather than points in the plain: we call such robots fat.  ...  Autonomous identical robots represented by unit discs move deterministically in the plane.  ...  The third author's research was partially supported by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.  ... 
doi:10.1016/j.tcs.2008.10.005 fatcat:6ejloolltjghbl4ns5d3ka5uwe

A Survey on Open Problems for Mobile Robots [article]

Alberto Bandettini, Fabio Luporini, Giovanni Viglietta
2011 arXiv   pre-print
Then, the focus shifts on the open problem of gathering fat robots. In this context, "fat" means that the robot is not represented by a point in a bidimensional space, but it has an extent.  ...  For at most 4 robots an algorithm is provided in the literature, but is gathering always possible for n>4 fat robots? Another open problem is considered: Boundary Patrolling by mobile robots.  ...  Gathering fat mobile robots In this Section we will describe the robot model and the main results related to the problem of Gathering mobile robots.  ... 
arXiv:1111.2259v1 fatcat:hpqg3mjkwbbilbskgyov6abgbm

Autonomous Mobile Robots: A Distributed Computing Perspective [chapter]

Giuseppe Prencipe
2013 Lecture Notes in Computer Science  
The distributed coordination and control of a team of autonomous mobile robots is a problem widely studied in a variety of fields, such as engineering, artificial intelligence, artificial life, robotics  ...  In this paper we describe the current investigations on the algorithmic limitations of what autonomous mobile robots can do with respect to different coordination problems, and overview the main research  ...  Acknowledgements The author would like to thank Paola Flocchini and Nicola Santoro for their help and suggestions in the preparation of this paper.  ... 
doi:10.1007/978-3-642-45346-5_2 fatcat:4ngp6gsko5fh5lc4n2hljihvs4

Getting Close without Touching [chapter]

Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
2012 Lecture Notes in Computer Science  
In this paper we study the Near-Gathering problem for a set of asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in Look-Compute-Move (LCM) cycles: In this  ...  Here, we present a collision-free algorithm for the Near-Gathering problem, the first to our knowledge, that allows a set of autonomous mobile robots to nearly gather within finite time.  ...  We would like to thank Paola Flocchini, Nicola Santoro, and Peter Widmayer, who contributed to the writing of this paper by sharing their ideas.  ... 
doi:10.1007/978-3-642-31104-8_27 fatcat:j2pegy4crrcthgjiiqyo5rursm

Gathering Anonymous, Oblivious Robots on a Grid [article]

Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide
2017 arXiv   pre-print
The only gathering algorithm under this robot model, with known runtime bounds, needs O(n^2) rounds and works in the Euclidean plane.  ...  We consider a swarm of n autonomous mobile robots, distributed on a 2-dimensional grid.  ...  The question of gathering on graphs instead of gathering in the plane was considered in [Mar09, DFKP06, KMP08] .  ... 
arXiv:1702.03400v3 fatcat:2oxpzzglrndgxnsyb2hqudtm5i

Getting close without touching: near-gathering for autonomous mobile robots

Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
2015 Distributed computing  
In this paper we study the Near-Gathering problem for a finite set of dimensionless, deterministic, asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in the  ...  Euclidean plane in Look-Compute-Move (LCM) cycles.  ...  We also thank the anonymous reviewers for 23 precious comments that helped us improve the readability of this paper.  ... 
doi:10.1007/s00446-015-0248-5 fatcat:u4vjnnpwqvhd5ao3z2mbq7isjy

Getting Close Without Touching: Near-Gathering for Autonomous Mobile Robots [article]

Linda Pagli, Giuseppe Prencipe, Giovanni Viglietta
2015 arXiv   pre-print
In this paper we study the Near-Gathering problem for a finite set of dimensionless, deterministic, asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in the  ...  Euclidean plane in Look-Compute-Move (LCM) cycles.  ...  We also thank the anonymous reviewers for 23 precious comments that helped us improve the readability of this paper.  ... 
arXiv:1505.07168v1 fatcat:4h5tkahsezfz7gz2flbzd7htoi

Fault-Tolerant Gathering of Mobile Robots with Weak Multiplicity Detection [article]

Debasish Pattanayak, Kaushik Mondal, H. Ramesh, Partha Sarathi Mandal
2016 arXiv   pre-print
., no robot waits for other robot and algorithm instructs each robot to move in every step, unless it is already at the gathering location), that gathers all non-faulty robots in semi-synchronous model  ...  We show that the required capability for gathering robots is minimal in the above model, since relaxing it further makes gathering impossible to solve.  ...  GATHERING (N,N − 1) CRASH FAULT IN SSYNC MODEL Model The robots are modeled as points in a Euclidean plane.  ... 
arXiv:1608.02432v1 fatcat:tmi6572st5htjftqstt3l2unie

Gathering Anonymous, Oblivious Robots on a Grid [chapter]

Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide
2017 Lecture Notes in Computer Science  
The only gathering algorithm under this robot model, with known runtime bounds, needs O(n 2 ) rounds and works in the Euclidean plane.  ...  We consider a swarm of n autonomous mobile robots, distributed on a 2-dimensional grid.  ...  In the present paper, we deliver such an algorithm that uses the same strongly restricted model as the Euclidean Go-To-The-Center gathering strategy Our Local Model Our mobile robots need very few and  ... 
doi:10.1007/978-3-319-72751-6_13 fatcat:eeujnv7zqzgv3g7n2f45yvx4qq

Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots [chapter]

Tamás Lukovszki, Friedhelm Meyer auf der Heide
2014 Lecture Notes in Computer Science  
Each robot r knows its position pr ∈ Z 2 . In addition, each robot knows the connected pattern F to be formed.  ...  First we consider a helpful intermediate problem -we call it the Lemmings problem -where collision at one single point g, known to all robots, is allowed and the goal is that all robots gather at g.  ...  [7] considered the gathering problem for few fat robots, where the robots are modeled by unit disks.  ... 
doi:10.1007/978-3-319-14472-6_17 fatcat:npzdtcmvbrbm5gloznjmo7dfua

4-D body posture in sagittal plane for care-receiver patient can be estimated by using only two low-reolution tactile sensors mounted on robot arms

Mohammad Hadi Honarvar, Tatsuya Suzuki, Susumu Sato, Yasuhiro Nakamura
2014 2014 Second RSI/ISM International Conference on Robotics and Mechatronics (ICRoM)  
In order to contribute in a more convenient transfer of the mobility impaired patients for both patients and caregivers, a two-armed nursing-care assistant robot for transferring patients between bed and  ...  time with respect to the robot control cycle (less than 10 milliseconds).  ...  In order to contribute in a more convenient and efficient transfer of mobility week or impaired patients, while reducing the nursing burden and its associated costs, a nursing-care assistant robot with  ... 
doi:10.1109/icrom.2014.6990982 fatcat:dhewlp4buvd4nbts3qvwi6ci3e

Robotic Trachelectomy After Supracervical Hysterectomy for Benign Gynecologic Disease

Ziv Tsafrir, Joelle Aoun, Rabbie Hanna, Eleni Papalekas, Lauren Schiff, Evan Theoharis, David Eisenstein
2016 Journal of the Society of Laparoendoscopic Surgeons  
In 10 of 11 patients, the symptoms leading to robotic trachelectomy were the same as those leading to supracervical hysterectomy.  ...  The objective of this study was to evaluate the efficacy of robotic trachelectomy after a previous supracervical hysterectomy.  ...  Because the bladder was often scarred over the anterior aspect of the cervical stump, we performed retrograde filling of the bladder with irrigation fluid, to ascertain the dissection plane, and mobilized  ... 
doi:10.4293/jsls.2016.00027 pmid:27493470 pmcid:PMC4949354 fatcat:efrdi46crbcvlgc7tfd2nep4wq

Preventing and Monitoring Work-Related Diseases in Firefighters: A Literature Review on Sensor-Based Systems and Future Perspectives in Robotic Devices

Juri Taborri, Simone Pasinetti, Ludovica Cardinali, Fabrizio Perroni, Stefano Rossi
2021 International Journal of Environmental Research and Public Health  
In addition, the advent of robotics can be also exploited in order to reduce work-related disorders.  ...  In recent years, the necessity to prevent work-related diseases has led to the use of sensor-based systems to measure important features during working activities.  ...  Data Availability Statement: All relevant data are within the manuscript. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/ijerph18189723 pmid:34574646 pmcid:PMC8469039 fatcat:v266zbwzujfpppnrne3tsqj7dm

A Position-Adjustable Multi-Point Synchronizing Biopsy Tool for Intratumor Heterogeneity: A Proof-of-Principle Study

Baiquan Su, Hao Yan, Liaoliao Liu, Shi Yu, Yida Hu, Gang Wang, Wei Yao, Jie Tang, Shaolong Kuang
2020 IEEE Access  
Liu for their support on some mechanical parts and the experiments in this study, and gratefully acknowledge the insightful and very constructive comments from the anonymous reviewers.  ...  ACKNOWLEDGMENT The authors would like to thank Associate Professor J. Wang and W.  ...  In the following step, a few spoons are fixed by a set of fixed rotational joint bars at the desired positions.  ... 
doi:10.1109/access.2020.2974699 fatcat:hjb6qfelgbc6fcgjltzaw3joeu

Cognitive assisted living ambient system: a survey

Ruijiao Li, Bowen Lu, Klaus D. McDonald-Maier
2015 Digital Communications and Networks  
The paper provides a review of research background and technologies of AAL.  ...  The demographic change towards an aging population is creating a significant impact and introducing drastic challenges to our society.  ...  The COALAS project has been selected in the context of the INTERREG IVA France (Channel) -England European cross-border co-operation programme, which is co-financed by the ERDF.  ... 
doi:10.1016/j.dcan.2015.10.003 fatcat:lavg35uzpveelg4ddlvii7ftky
« Previous Showing results 1 — 15 out of 1,291 results