English
Related papers

Related papers: Ring Exploration with Oblivious Myopic Robots

200 papers

Obstacle avoidance is a fundamental and challenging problem for autonomous navigation of mobile robots. In this paper, we consider the problem of obstacle avoidance in simple 3D environments where the robot has to solely rely on a single…

Machine Learning · Computer Science 2021-03-09 Patrick Wenzel , Torsten Schön , Laura Leal-Taixé , Daniel Cremers

Consider a set of autonomous computational entities, called \emph{robots}, operating inside a polygonal enclosure (possibly with holes), that have to perform some collaborative tasks. The boundary of the polygon obstructs both visibility…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-05-24 Kaustav Bose , Ranendu Adhikary , Manash Kumar Kundu , Buddhadeb Sau

Path planning for robotic coverage is the task of determining a collision-free robot trajectory that observes all points of interest in an environment. Robots employed for such tasks are often capable of exercising active control over…

Robotics · Computer Science 2020-11-17 Tushar Kusnur , Dhruv Mauria Saxena , Maxim Likhachev

In this paper, we consider the gathering problem of seven autonomous mobile robots on triangular grids. The gathering problem requires that, starting from any connected initial configuration where a subgraph induced by all robot nodes…

Robotics · Computer Science 2021-03-16 Masahiro Shibata , Masaki Ohyabu , Yuichi Sudo , Junya Nakamura , Yonghwan Kim , Yoshiaki Katayama

Anonymous mobile robots are often classified into synchronous, semi-synchronous and asynchronous robots when discussing the pattern formation problem. For semi-synchronous robots, all patterns formable with memory are also formable without…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-11-08 Taisuke Izumi , Samia Souissi , Yoshiaki Katayama , Nobuhiro Inuzuka , Xavier Défago , Koichi Wada , Masafumi Yamashita

Consider a team of $k \leq n$ autonomous mobile robots initially placed at a node of an arbitrary graph $G$ with $n$ nodes. The dispersion problem asks for a distributed algorithm that allows the robots to reach a configuration in which…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-12-07 Archak Das , Kaustav Bose , Buddhadeb Sau

Mobile robots are traditionally developed to be reactive and avoid collisions with surrounding humans, often moving in unnatural ways without following social protocols, forcing people to behave very differently from human-human interaction…

Robotics · Computer Science 2021-09-10 Rahul Peddi , Nicola Bezzo

Fleets of unmanned robots can be beneficial for the long-term monitoring of large areas, e.g., to monitor wild flocks, detect intruders, search and rescue. Monitoring numerous dynamic targets in a collaborative and efficient way is a…

Robotics · Computer Science 2024-03-06 Shuaikang Wang , Yiannis Kantaros , Meng Guo

We consider the task of underwater robot navigation for the purpose of collecting scientifically relevant video data for environmental monitoring. The majority of field robots that currently perform monitoring tasks in unstructured natural…

An underactuated nonholonomic Dubins-vehicle-like robot with a lower-limited turning radius travels with a constant speed in a plane, which hosts unknown complex objects. The robot has to approach and then circumnavigate all objects, with…

Robotics · Computer Science 2023-05-23 Valerii Chernov , Alexey Matveev

In ground-view object change detection, the recently emerging mapless navigation has great potential to navigate a robot to objects distantly detected (e.g., books, cups, clothes) and acquire high-resolution object images, to identify their…

Robotics · Computer Science 2023-10-25 Kouki Terashima , Kanji Tanaka , Ryogo Yamamoto , Jonathan Tay Yu Liang

We consider a swarm of $n$ autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (not predefined) place. A common local model for extremely…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-08-04 Matthias Fischer , Daniel Jung , Friedhelm Meyer auf der Heide

We consider a variant of the crash-fault gathering problem called stand-up indulgent gathering (SUIG). In this problem, a group of mobile robots must eventually gather at a single location, which is not known in advance. If no robots crash,…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-04-13 Quentin Bramas , Sayaka Kamei , Anissa Lamani , Sébastien Tixeuil

Exploration and mapping of unknown environments is a fundamental task in applications for autonomous robots. In this article, we present a complete framework for deploying MAVs in autonomous exploration missions in unknown subterranean…

This paper develops a communication-efficient distributed mapping approach for rapid exploration of a cave by a multi-robot team. Subsurface planetary exploration is an unsolved problem challenged by communication, power, and compute…

Robotics · Computer Science 2024-04-18 Kshitij Goel , Wennie Tabib , Nathan Michael

This paper addresses the problem of planning for a robot with a directional obstacle-detection sensor that must move through a cluttered environment. The planning objective is to remain safe by finding a path for the complete robot,…

Robotics · Computer Science 2019-01-21 Gustavo Goretkin , Leslie Pack Kaelbling , Tomás Lozano-Pérez

This paper presents a comprehensive overview of exploration strategies utilized in both 2D and 3D environments, focusing on autonomous multi-robot systems designed for building exploration and fire detection. We explore the limitations of…

Robotics · Computer Science 2024-11-26 Ankit Shaw

Autonomous robots are commonly tasked with the problem of area exploration and search for certain targets or artifacts of interest to be tracked. Traditionally, the problem formulation considered is that of complete search and thus -…

Robotics · Computer Science 2018-12-13 Christos Papachristos , Kostas Alexis

Navigation in an unknown environment consists of multiple separable subtasks, such as collecting information about the surroundings and navigating to the current goal. In the case of pure visual navigation, all these subtasks need to…

Robotics · Computer Science 2016-02-17 Tuomas Välimäki , Risto Ritala

Autonomous aerial robots are increasingly being deployed in real-world scenarios, where transparent glass obstacles present significant challenges to reliable navigation. Researchers have investigated the use of non-contact sensors and…

Robotics · Computer Science 2025-05-12 Xinyi Chen , Yichen Zhang , Hetai Zou , Junzhe Wang , Shaojie Shen