Online algorithms for searching and exploration in the plane - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

Motion planning is a fundamental problem in robotics. It comes in a variety of forms, but the
simplest version is as follows. We are given a robot system B, which may consist of several …

Online navigation with known target and unknown obstacles is an interesting problem in
mobile robotics. This article presents a technique based on utilization of neural networks …

In the rendezvous search problem, two or more robots at unknown locations should meet
somewhere in the environment as quickly as possible. We study the symmetric rendezvous …

Given a polygon and a visibility range, the Myopic Watchman Problem with Discrete Vision
(MWPDV) asks for a closed path P and a set of scan points S, such that (i) every point of the …

To benchmark the efficiency of exploration strategies one has to use robot simulators. In an
exploration task, the robot faces an unknown environment. Of course one could test the …

We investigate an online problem of a robot exploring the outer boundary of an unknown
simple polygon P. The robot starts from a specified vertex s and walks an exploration tour …

We consider online and offline problems related to exploring and surveying a region by a
swarm of robots with limited communication range. The minimum relay triangulation problem …

The term programmable matter refers to matter which has the ability to change its physical
properties (shape, density, moduli, conductivity, optical properties, etc.) in a programmable …

We describe a spectrum of challenges and results related to geometric aspects of robot
navigation, advancing from centralized methods for difficult offline problems (such as the Art …