English
Related papers

Related papers: Exploring Grid Polygons Online

200 papers

For a given set of transmitters such as cellular base stations or WiFi access points, is it possible to analytically characterize the set of locations that are "covered" in the sense that users at these locations experience a certain…

Networking and Internet Architecture · Computer Science 2025-05-05 Martin Haenggi

We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, $n$ robots are placed in an $n$ node graph arbitrarily and must coordinate with each other to reach a final configuration such that…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-18 John Augustine , William K. Moses

People with visual impairments (PwVI) often have difficulties navigating through unfamiliar indoor environments. However, current wayfinding tools are fairly limited. In this short paper, we present our in-progress work on a wayfinding…

If we give a robot the task of moving an object from its current position to another location in an unknown environment, the robot must explore the map, identify all types of obstacles, and then determine the best route to complete the…

Robotics · Computer Science 2022-08-22 Saeid Alirezazadeh , Luís A. Alexandre

This paper deals with the theory and application of 2-Dimensional, nine-neighborhood, null- boundary, uniform as well as hybrid Cellular Automata (2D CA) linear rules in image processing. These rules are classified into nine groups…

Discrete Mathematics · Computer Science 2008-04-16 Pabitra Pal Choudhury , Birendra Kumar Nayak , Sudhakar Sahoo , Sunil Pankaj Rath

We consider the diffusion-advection problem in two simple cellular flow models (often invoked as examples for subdiffusive tracer's motion) and concentrate on the intermediate time range, in which the tracer's motion indeed may show…

Fluid Dynamics · Physics 2016-09-28 Patrick Pöschke , Igor M. Sokolov , Alexander A. Nepomnyashchy , Michael A. Zaks

Swarm robotics utilises decentralised self-organising systems to form complex collective behaviours built from the bottom-up using individuals that have limited capabilities. Previous work has shown that simple occlusion-based strategies…

Robotics · Computer Science 2026-05-14 Breno Cunha Queiroz , Daniel MacRae

We consider a perimeter defense problem in a rooted full tree graph environment in which a single defending vehicle seeks to defend a set of specified vertices, termed as the perimeter from mobile intruders that enter the environment…

Systems and Control · Electrical Eng. & Systems 2025-02-11 Richard L. Frost , Shaunak D. Bopardikar

This paper addresses the movement and placement of mobile agents to establish a communication network in initially unknown environments. We cast the problem in a computational-geometric framework by relating the coverage problem and…

Robotics · Computer Science 2025-12-11 Edwin Meriaux , Shuo Wen , Louis-Roy Langevin , Doina Precup , Antonio Loría , Gregory Dudek

We design and evaluate algorithms for efficient user-mobility driven macro-cell planning in cellular networks. As cellular networks embrace heterogeneous technologies (including long range 3G/4G and short range WiFi, Femto-cells, etc.),…

Networking and Internet Architecture · Computer Science 2015-01-15 Shubhadip Mitra , Sayan Ranu , Vinay Kolar , Aditya Telang , Arnab Bhattacharya , Ravi Kokku , Sriram Raghavan

A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…

Cellular Automata and Lattice Gases · Physics 2025-05-30 Rolf Hoffmann , Mariusz Białecki

We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…

Cellular Automata and Lattice Gases · Physics 2010-09-02 David Eppstein

This paper deals with a path planning and intelligent control of an autonomous robot which should move safely in partially structured environment. This environment may involve any number of obstacles of arbitrary shape and size; some of…

Robotics · Computer Science 2007-05-23 Danica Janglova

The dynamic problem of enclosing an expanding fire can be modelled by a discrete variant in a grid graph. While the fire expands to all neighbouring cells in any time step, the fire fighter is allowed to block $c$ cells in the average…

Neural and Evolutionary Computing · Computer Science 2017-05-05 Martin Kretschmer , Elmar Langetepe

We describe a robotic learning system for autonomous exploration and navigation in diverse, open-world environments. At the core of our method is a learned latent variable model of distances and actions, along with a non-parametric…

Robotics · Computer Science 2023-10-12 Dhruv Shah , Benjamin Eysenbach , Gregory Kahn , Nicholas Rhinehart , Sergey Levine

We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R. The primary objective is to minimize the makespan, that is, the time to fill the entire region. An environment is composed of pixels…

We study planning problems faced by robots operating in uncertain environments with incomplete knowledge of state, and actions that are noisy and/or imprecise. This paper identifies a new problem sub-class that models settings in which…

Robotics · Computer Science 2022-08-09 Federico Rossi , Dylan Shell

Indoor exploration is an important task in disaster relief, emergency response scenarios, and Search And Rescue (SAR) missions. Unmanned Aerial Vehicle (UAV) systems can aid first responders by maneuvering autonomously in areas inside…

Robotics · Computer Science 2022-05-30 Adil Farooq , Christos Laoudias , Panayiotis S. Kolios , Theocharis Theocharides

Occupancy grids are the most common framework when it comes to creating a map of the environment using a robot. This paper studies occupancy grids from the motion planning perspective and proposes a mapping method that provides richer data…

Robotics · Computer Science 2016-09-20 Ali-akbar Agha-mohammadi

In this work, we initiate the research about the Gathering problem for robots with limited viewing range in the three-dimensional Euclidean space. In the Gathering problem, a set of initially scattered robots is required to gather at the…

Computational Geometry · Computer Science 2020-05-18 Michael Braun , Jannik Castenow , Friedhelm Meyer auf der Heide