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 …
Path planning with obstacle avoidance based on visibility binary tree algorithm
In this paper, a novel method for robot navigation in dynamic environments, referred to as
visibility binary tree algorithm, is introduced. To plan the path of the robot, the algorithm …
visibility binary tree algorithm, is introduced. To plan the path of the robot, the algorithm …
Sensor-driven area coverage for an autonomous fixed-wing unmanned aerial vehicle
Area coverage with an onboard sensor is an important task for an unmanned aerial vehicle
(UAV) with many applications. Autonomous fixed-wing UAVs are more appropriate for larger …
(UAV) with many applications. Autonomous fixed-wing UAVs are more appropriate for larger …
Autonomous exploration, reconstruction, and surveillance of 3d environments aided by deep learning
We propose a greedy and supervised learning approach for visibility-based exploration,
reconstruction and surveillance. Using a level set representation, we train a convolutional …
reconstruction and surveillance. Using a level set representation, we train a convolutional …
Thorough robot navigation based on SVM local planning
K Charalampous, I Kostavelis, A Gasteratos - Robotics and Autonomous …, 2015 - Elsevier
A prerequisite for autonomous robot navigation is the extraction of a path that is both efficient
and safe in terms of collision. Towards this end, the paper in hand presents a novel local …
and safe in terms of collision. Towards this end, the paper in hand presents a novel local …
A self-localization and path planning technique for mobile robot navigation
JH Zhou, HY Lin - 2011 9th World Congress on Intelligent …, 2011 - ieeexplore.ieee.org
In this paper, we propose a system to cope with the problem of autonomous mobile robot
navigation. It is able to perform path planning and localize the robot in the real world …
navigation. It is able to perform path planning and localize the robot in the real world …
Investigation of a Target Reachability by a Manipulator in an Unknown Environment
P Lopatin - 2016 IEEE International Conference on …, 2016 - ieeexplore.ieee.org
An algorithm for a n-link manipulator movement amidst arbitrary unknown static obstacles is
presented. Given a theorem stating that if the manipulator moves according to the algorithm …
presented. Given a theorem stating that if the manipulator moves according to the algorithm …
[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 …
A geometric approach for multi-robot exploration in orthogonal polygons
We present an algorithm to explore an orthogonal polygon using a team of p robots. Our
algorithm is based on a single-robot polygon exploration algorithm and a tree exploration …
algorithm is based on a single-robot polygon exploration algorithm and a tree exploration …
[PDF][PDF] 一种改进的网格多边形online 探索算法
谢玉莹， 包敏泽， 胡秀婷， 蒋波 - 计算机应用与软件, 2022 - shcas.net
摘要针对网格多边形机器人online 探索问题, 在分析现有成果的基础上, 结合SmartDFS 算法,
并通过扩大机器人视觉范围, 使其范围限定在给定的单位网格内. 通过区分不同类型的网格 …
并通过扩大机器人视觉范围, 使其范围限定在给定的单位网格内. 通过区分不同类型的网格 …