Binary logarithm

RRT ^X : Asymptotically optimal single-query sampling-based motion planning with quick replanning

Michael Otte, Emilio Frazzoli

Citations: 225 • 2015

Planning Smooth Paths for Mobile Robots

P. Jacobs, John Canny

Citations: 224 • 1993

Tree exploration with little memory

Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc

Citations: 135 • 2004

Trade-offs between mobility and density for coverage in wireless sensor networks

Wei Wang Vikram Srinivasan, Kee-Chaing Chua

Citations: 128 • 2007

$${\mathrm {RRT^{X}}}$$: Real-Time Motion Planning/Replanning for Environments with Unpredictable Obstacles

Michael Otte, Emilio Frazzoli

Citations: 80 • 2015

Digraphs Exploration with Little Memory

Pierre Fraigniaud, David Ilcinkas

Citations: 80 • 2004

Tree exploration with logarithmic memory

Christoph Ambühl, Leszek Gąsieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang

Citations: 57 • 2011

Tree exploration with logarithmic memory

Leszek Gąsieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang

Citations: 46 • 2007

Fast Dispersion of Mobile Robots on Arbitrary Graphs

Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma

Citations: 38 • 2019

Dispersion of Mobile Robots: The Power of Randomness

Anisur Rahaman Molla, William K. Moses

Citations: 28 • 2019

Tree exploration with little memory

Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc

Citations: 24 • 2002

EFFICIENT ALGORITHMS FOR THE EUCLIDEAN DISTANCE TRANSFORM

Sandy Pavel, Selim G. Akl

Citations: 22 • 1995

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots

Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro

Citations: 21 • 2008

Dispersion of mobile robots using global communication

Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma

Citations: 20 • 2021

Path planning for pushing a disk using compliance

Dennis Nieuwenhuisen, A. Frank van der Stappen, M.H. Overmars

Citations: 18 • 2005

Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment

Dan Halperin, Micha Sharir

Citations: 18 • 2002

Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots

Pavan Poudel, Gokarna Sharma

Citations: 15 • 2020

A time- and cost-optimal algorithm for interlocking sets-with applications

Stephan Olariu, Albert Y. Zomaya

Citations: 11 • 1996

Memory Optimal Dispersion by Anonymous Mobile Robots

Archak Das, Kaustav Bose, Buddhadeb Sau

Citations: 11 • 2021

Run for Cover: Dominating Set via Mobile Agents

Prabhat Kumar Chand, Anisur Rahaman Molla, Sumathi Sivasubramaniam

Citations: 11 • 2023