English
Related papers

Related papers: Optimal grid exploration by asynchronous oblivious…

200 papers

Continuous exploration without interruption is important in scenarios such as search and rescue and precision agriculture, where consistent presence is needed to detect events over large areas. Ergodic search already derives continuous…

Robotics · Computer Science 2024-02-22 Adam Seewald , Cameron J. Lerch , Marvin Chancán , Aaron M. Dollar , Ian Abraham

In this report, we propose a decentralised motion control algorithm for the mobile robots to intercept an intruder entering (k-intercepting) or escaping (e-intercepting) a protected region. In continuation, we propose a decentralized…

Systems and Control · Computer Science 2018-09-10 Ali Marzoughi

Mobile robots have become indispensable for exploring hostile environments, such as in space or disaster relief scenarios, but often remain limited to teleoperation by a human operator. This restricts the deployment scale and requires…

To cope with fast-fluctuating distributed energy resources (DERs) and uncontrolled loads, this paper formulates a time-varying optimization problem for distribution grids with DERs and develops a novel non-iterative algorithm to track the…

Systems and Control · Electrical Eng. & Systems 2024-10-28 J. Wu , M. Liu , W. Lu , K. Xie , M. Xie

Recently, centralized receding horizon online multi-robot coverage path planning algorithms have shown remarkable scalability in thoroughly exploring large, complex, unknown workspaces with many robots. In a horizon, the path planning and…

Robotics · Computer Science 2025-07-30 Ratijit Mitra , Indranil Saha

In this work, we explore emergent behaviors by swarms of anonymous, homogeneous, non-communicating, reactive robots that do not know their global position and have limited relative sensing. We introduce a novel method that enables such…

Robotics · Computer Science 2018-04-19 Mario Coppola , Jian Guo , Eberhard K. A. Gill , Guido C. H. E. de Croon

We consider the problem of completely covering an unknown discrete environment with a swarm of asynchronous, frequently-crashing autonomous mobile robots. We represent the environment by a discrete graph, and task the robots with occupying…

Discrete Mathematics · Computer Science 2020-06-05 Michael Amir , Alfred M. Bruckstein

We consider online learning with feedback graphs, a sequential decision-making framework where the learner's feedback is determined by a directed graph over the action set. We present a computationally efficient algorithm for learning in…

Machine Learning · Computer Science 2022-06-02 Chloé Rouyer , Dirk van der Hoeven , Nicolò Cesa-Bianchi , Yevgeny Seldin

This paper develops a methodology for collaborative human-robot exploration that leverages implicit coordination. Most autonomous single- and multi-robot exploration systems require a remote operator to provide explicit guidance to the…

Robotics · Computer Science 2023-04-20 Yves Georgy Daoud , Kshitij Goel , Nathan Michael , Wennie Tabib

Collision-free navigation in cluttered environments with static and dynamic obstacles is essential for many multi-robot tasks. Dynamic obstacles may also be interactive, i.e., their behavior varies based on the behavior of other entities.…

Robotics · Computer Science 2024-05-21 Baskın Şenbaşlar , Gaurav S. Sukhatme

In autonomous robot exploration, the frontier is the border in the world map between the explored space and unexplored space. The frontier plays an important role when deciding where in the environment the robots should go explore next. We…

Robotics · Computer Science 2019-07-16 Juraj Oršulić , Damjan Miklić , Zdenko Kovačić

In this work, we study the problem of dispersion of mobile robots on dynamic rings. The problem of dispersion of $n$ robots on an $n$ node graph, introduced by Augustine and Moses Jr. [1], requires robots to coordinate with each other and…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-17 Ankush Agarwalla , John Augustine , William K. Moses , Madhav Sankar K. , Arvind Krishna Sridhar

Communication is an important capability for multi-robot exploration because (1) inter-robot communication (comms) improves coverage efficiency and (2) robot-to-base comms improves situational awareness. Exploring comms-restricted (e.g.,…

We investigate the problem of optimally assigning a large number of robots (or other types of autonomous agents) to guard the perimeters of closed 2D regions, where the perimeter of each region to be guarded may contain multiple disjoint…

Robotics · Computer Science 2019-05-14 Si Wei Feng , Shuai D. Han , Kai Gao , Jingjin Yu

A robot modeled as a deterministic finite automaton has to build a structure from material available to it. The robot navigates in the infinite oriented grid $\mathbb{Z} \times \mathbb{Z}$. Some cells of the grid are full (contain a brick)…

Data Structures and Algorithms · Computer Science 2024-01-26 Jurek Czyzowicz , Dariusz Dereniowski , Andrzej Pelc

We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined by the periodic movements of carriers.…

Data Structures and Algorithms · Computer Science 2009-09-25 Paola Flocchini , Bernard Mans , Nicola Santoro

Robots are increasingly integrated across industries, particularly in healthcare. However, many valuable applications for quadrupedal robots remain overlooked. This research explores the effectiveness of three reinforcement learning…

Robotics · Computer Science 2025-07-18 Emma M. A. Harrison

Robots often need to solve path planning problems where essential and discrete aspects of the environment are partially observable. This introduces a multi-modality, where the robot must be able to observe and infer the state of its…

Robotics · Computer Science 2022-08-02 Camille Phiquepal , Andreas Orthey , Nicolas Viennot , Marc Toussaint

As robots are increasingly deployed to collaborate on tasks within shared workspaces and resources, the failure of an individual robot can critically affect the group's performance. This issue is particularly challenging when robots lack…

Robotics · Computer Science 2026-03-17 Kehinde O. Aina , Hosain Bagheri , Daniel I. Goldman

In this paper we study the following multi-robot coordination problem: given a graph, where each edge is weighted by the probability of surviving while traversing it, find a set of paths for $K$ robots that maximizes the expected number of…

Robotics · Computer Science 2016-12-13 Stefan Jorgensen , Robert H. Chen , Mark B. Milam , Marco Pavone