Online algorithms for searching and exploration in the plane
SK Ghosh, R Klein - Computer Science Review, 2010 - Elsevier
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 …
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
Algorithmic motion planning
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 …
simplest version is as follows. We are given a robot system B, which may consist of several …
Automatic navigation of mobile robots in unknown environments
O Motlagh, D Nakhaeinia, SH Tang, B Karasfi… - Neural Computing and …, 2014 - Springer
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 …
mobile robotics. This article presents a technique based on utilization of neural networks …
[HTML][HTML] Rendezvous in planar environments with obstacles and unknown initial distance
D Ozsoyeller, A Beveridge, V Isler - Artificial Intelligence, 2019 - Elsevier
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 …
somewhere in the environment as quickly as possible. We study the symmetric rendezvous …
Minimum covering with travel cost
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 …
(MWPDV) asks for a closed path P and a set of scan points S, such that (i) every point of the …
Exploration strategies for a robot with a continously rotating 3d scanner
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 …
exploration task, the robot faces an unknown environment. Of course one could test the …
Exploring the outer boundary of a simple polygon
Q Wei, X Yao, L Liu, Y Zhang - IEICE TRANSACTIONS on …, 2021 - search.ieice.org
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 …
simple polygon P. The robot starts from a specified vertex s and walks an exploration tour …
Exploring and triangulating a region by a swarm of robots
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 …
swarm of robots with limited communication range. The minimum relay triangulation problem …
Infinite object coating in the amoebot model
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 …
properties (shape, density, moduli, conductivity, optical properties, etc.) in a programmable …
Geometric aspects of robot navigation: from individual robots to massive particle swarms
SP Fekete - Distributed Computing by Mobile Entities: Current …, 2019 - Springer
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 …
navigation, advancing from centralized methods for difficult offline problems (such as the Art …