Terminating Ring Exploration with Myopic Oblivious Robots - PowerPoint PPT Presentation

Jan 02, 2024 •248 likes •336 views

Terminating Ring Exploration with Myopic Oblivious Robots GRASTA-MAC Open Problem Session Terminating Exploration Starting from an arbitrary configuration where no pair of robots are located on the same node Exploration Each node must be

Terminating Ring Exploration with Myopic Oblivious Robots GRASTA-MAC Open Problem Session
Terminating Exploration Starting from an arbitrary configuration where no pair of robots are located on the same node ü Exploration Each node must be visited by at least one robot ü Termination Eventually, every robot stays idle
Challenges What are the minimal conditions to solve the exploration problem deterministically (probabilistically)? What is the minimal number of robots?
Related Work [ Flocchini et al. , OPODIS 2007] [ Devismes et al. , SIROCCO 2009] [ Lamani et al. , SIROCCO 2010][ Flocchini et al. , SIROCCO 2008] [ Flocchini et al. , IPL 2011][ Devismes et al. , SSS 2012] [ Devismes et al. , NETYS 2015] Unlimited visibility What is the solvability of terminating exploration assuming limited visibility?
Myopia Visibility limited to a certain fixed distance φ What is the solvability of terminating exploration assuming visibility limited to φ ?
Results & Open Problems φ = 1 [ Datta, Lamani, Larmore, and Petit, ICDCS 2013] ‣ Deterministic terminating exploration possible with synchronous robots only. φ = 2 ‣ Deterministic terminating exploration enabled with 7 asynchronous robots that start from a strongly connected configuration. [ Datta, Lamani, Larmore, and Petit, APDCM 2015] ‣ Does there exist another algorithm? ‣ Does there exist an algorithm that starts from a weak connected configuration? ‣ Optimality in terms of number of robots?
Results & Open Problems φ = 3 ‣ Deterministic terminating exploration enabled with an optimal number of asynchronous robots (5) that start from a strongly connected configuration. ‣ Deterministic terminating exploration 7 asynchronous robots that start from a weak connected configuration. [ Datta, Lamani, Larmore, and Petit, APDCM 2015] ‣ Does there exist a deterministic algorithm that start from a weak connected configuration with less robots? ‣ Is φ = 3 as powerful as φ = ∞ (with the extra requirement of initial weak connection)? ‣ Does there exist a generic algorithm with 5 ≤ k ≤ n-1 ?
Results & Open Problems 3 < φ ≤ n/2 (equiv. ∞ ) ‣ Generic algorithm from some φ≥ 3? ‣ Relationship between φ different knowledges, namely n and k? ‣ Relationship between φ different knowledges, namely n, k and multiplicity? ‣ Extension to other topologies?

Recommend

Open Problems GRASTA-MAC 2015 1 Exploration with Stop in Ring with limited visibility (Franck

Open Problems GRASTA-MAC 2015 1 Exploration with Stop in Ring with limited visibility (Franck Petit) Consider autonomous, identical, oblivious robots, in the Look-Compute-Move model. They have only local visibility, that is the snapshot allows

454 views • 4 slides

Square Formation by Asynchronous Oblivious Robots CCCG 2016 Marcello Mamino, Giovanni Viglietta

Square Formation by Asynchronous Oblivious Robots CCCG 2016 Marcello Mamino, Giovanni Viglietta Vancouver August 3, 2016 Square Formation by Asynchronous Oblivious Robots Anonymous robots sensing and moving in the plane We consider a

2.1k views • 162 slides

Self-Reconfigurable Robots for Space Exploration Effect of compliance in modular robots

Self-Reconfigurable Robots for Space Exploration Effect of compliance in modular robots structures on the locomotion Adi Vardi Prof. Auke Jan Ijspeert Stphane Bonardi, Simon Hauser, Mehmet Mutlu, Massimo Vespignani 1 Motivation

416 views • 27 slides

I ntroduction to Mobile Robotics Multi-Robot Exploration Wolfram Burgard Exploration The

I ntroduction to Mobile Robotics Multi-Robot Exploration Wolfram Burgard Exploration The approaches seen so far are purely passive Given an unknown environment, how can we control multiple robots to efficiently learn a map? By

289 views • 27 slides

J RAPID: Ground and Aerial Robots for Rapid Response; Remote Autonomous Exploration and Mapping

J RAPID: Ground and Aerial Robots for Rapid Response; Remote Autonomous Exploration and Mapping Kazuya Yoshida, Keiji Nagatani, Satoshi Tadokoro and Kazunori Ohno Tohoku University, Sendai Japan Vijay Kumar and Nathan Michael, University of

196 views • 18 slides

FUNCTIONALLY OBLIVIOUS (AND SUCCINCT) Edward Kmett BUILDING BETTER TOOLS Cache-Oblivious

FUNCTIONALLY OBLIVIOUS (AND SUCCINCT) Edward Kmett BUILDING BETTER TOOLS Cache-Oblivious Algorithms Succinct Data Structures RAM MODEL Almost everything you do in Haskell assumes this model Good for ADTs, but not a realistic

673 views • 49 slides

The Imitation Game: The New Frontline of Security Fighting Robots Weve been warned for a

The Imitation Game: The New Frontline of Security Fighting Robots Weve been warned for a long time Many robots are good Some robots are creepy but still good Some robots replicate rapidly Robots can overwhelm our best defenses Robots can

723 views • 56 slides

Perfectly S Secure O Oblivious A s Algorithms s in t the M Multi-Server S Setting T-H.

Perfectly S Secure O Oblivious A s Algorithms s in t the M Multi-Server S Setting T-H. Hubert Chan, Jonathan Katz, Ka Kartik Nay ayak, Antigoni Polychroniadou, Elaine Shi Defini De ning ng an n Obl Oblivious us RAM Example request

812 views • 33 slides

Oblivious Routing on Geometric Networks Costas Busch, Malik Magdon-Ismail and Jing Xi {

Oblivious Routing on Geometric Networks Costas Busch, Malik Magdon-Ismail and Jing Xi { buschc,magdon,xij2 } @cs.rpi.edu July 20, 2005. Outline Oblivious Routing: Background and Our Contribution The Algorithm: Oblivious Routing with Single

709 views • 50 slides

Lower Bound! Kasper Green Larsen Jesper Buus Nielsen Oblivious RAM Introduced by Goldreich

Yes, There is an Oblivious RAM Lower Bound! Kasper Green Larsen Jesper Buus Nielsen Oblivious RAM Introduced by Goldreich and Ostrovsky in 1996 Encrypts the memory access pattern of a random-access algorithm Oblivious RAM, Model

505 views • 32 slides

Interactive Exploration Robots Human-robotic collaboration and interactions Terry Fong

Interactive Exploration Robots Human-robotic collaboration and interactions Terry Fong Intelligent Robotics Group NASA Ames Research Center terry.fong@nasa.gov irg.arc.nasa.gov Human-robotic collaboration and interactions for space

509 views • 40 slides

Cache-Oblivious Algorithms 1 Cache-Oblivious Model 2 The Unknown Machine Algorithm Algorithm

Cache-Oblivious Algorithms 1 Cache-Oblivious Model 2 The Unknown Machine Algorithm Algorithm C program Java program gcc javac Object code Java bytecode linux java Execution Interpretation Can be executed on

963 views • 54 slides

Coping with the Memory Hierarchy the Cache-Oblivious Way Rolf Fagerberg University of Aarhus

Coping with the Memory Hierarchy the Cache-Oblivious Way Rolf Fagerberg University of Aarhus Imada, SDU, February 18, 2004 Overview The memory hierachy The I/O-model The cache-oblivious model Examples of cache-oblivious

1.23k views • 72 slides

Myopic Posterior Sampling for Adaptive Goal Oriented Design of Experiments Kirthevasan Kandasamy ,

Myopic Posterior Sampling for Adaptive Goal Oriented Design of Experiments Kirthevasan Kandasamy , Willie Neiswanger, Reed Zhang, Akshay Krishnamurthy, Jeff Schneider, Barnab as P oczos ICML 2019 Example 1: Active Learning in Parametric

426 views • 15 slides

P ENSION SECURITY : REPLACING A MYOPIC TRADITION WITH FAR SIGHTED REFORM A N ADDRESS BY J IM L EECH

P ENSION SECURITY : REPLACING A MYOPIC TRADITION WITH FAR SIGHTED REFORM A N ADDRESS BY J IM L EECH , P RESIDENT AND CEO, O NTARIO T EACHERS P ENSION P LAN T O THE J OINT FEI/A SSOCIATION FOR C ORPORATE G ROWTH W EDNESDAY , M AY 20, 2009 Q UEEN

481 views • 16 slides

Terminating a Trust: Issues which may arise Raj Arumugam, 5 Stone Buildings Adam Cole, Walkers 26

Terminating a Trust: Issues which may arise Raj Arumugam, 5 Stone Buildings Adam Cole, Walkers 26 June 2020 www.5sblaw.com Terminating a trust: issues which may arise How does a trust come to an end? No assets Terms of the trust

793 views • 24 slides

A nomogram for correction of myopic astigmatism with SMILE Authors: 1 Qvision, Vithas Virgen del

A nomogram for correction of myopic astigmatism with SMILE Authors: 1 Qvision, Vithas Virgen del Mar Hospital, Almera, Spain 2 Ricardo Prez-Izquierdo, MD 1 Manuel Rodrguez-Vallejo, OD, PhD 2 IOA Madrid. Innova Ocular, Madrid, 2 Alicia

524 views • 17 slides

PanORAMa: Oblivious RAM with Logarithmic Overhead Sarvar Patel, Giuseppe Persiano, Mariana

PanORAMa: Oblivious RAM with Logarithmic Overhead Sarvar Patel, Giuseppe Persiano, Mariana Raykova, Kevin Yeo Most frequently used file Bob knows what files I am accessing Bandwidth is expensive Retrieve the whole database Oblivious RAM

1.13k views • 85 slides

The myopic UKTM model (my-UKTM): lessons learned for reaching UKs climate targets 28 th April

The myopic UKTM model (my-UKTM): lessons learned for reaching UKs climate targets 28 th April 2016 Francesco Fuso Nerini UCL Energy Institute f.fusonerini@ucl.ac.uk UKs decarbonization goals Climate Change Act: 80% GHG reduction by

267 views • 12 slides

A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan

A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan 2 Brent Waters 1 1 SRI International 2 MIT CRYPTO 2008 1 / 10 Oblivious Transfer [R81,EGL85,BCR86,C87,K88,CK88,C89,CS91,CGT95,DCP95,FMR96,BC97,. .

1.02k views • 50 slides

Blind/Myopic Deconvolution Julian Christou UCSC CfAO PSF Reconstruction Workshop May 2004

Blind/Myopic Deconvolution Julian Christou UCSC CfAO PSF Reconstruction Workshop May 2004 Adaptive Optics Imaging Quality of compensation depends upon: Wavefront sensor Signal strength & signal stability Speckle noise

886 views • 50 slides

A Cache-Oblivious Heap Introduced by Arge et al. [1]. Based on distribution of elements

A Cache-Oblivious Heap Introduced by Arge et al. [1]. Based on distribution of elements References [1] L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro, Cache-oblivious priority queue and graph algorithm

520 views • 15 slides

ROBOTS AND HEALTHCARE PAST, PRESENT, AND FUTURE COMPILED BY HOWIE BAUM What do you think of when

ROBOTS AND HEALTHCARE PAST, PRESENT, AND FUTURE COMPILED BY HOWIE BAUM What do you think of when you hear the word robot? 2 Why Robotics? Areas that robots are used: Industrial robots Military, government and space robots

1.36k views • 89 slides

MEAP and ENB Exploration Exploration in MEAP Genesis of Exploration New Business

MEAP and ENB Exploration Exploration in MEAP Genesis of Exploration New Business opportunities Rift and Frontal fold belt knowledge transfer Play based approach in chosen themes Focus on North and East Africa Preserving

1.01k views • 59 slides