Online Algorithms with Discrete Visibility - Exploring Unknown Polygonal Environments

No abstract is available for this paper.

• Publication year

  2008

• Venue

  IEEE robotics & automation magazine

• Publication date

  2008-06-10

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/MRA.2008.921542
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximation algorithms for art gallery problems in polygons

  2010cited by this paper
• View planning with combined view and travel cost

  2007cited by this paper
• Visibility Algorithms in the Plane

  2007cited by this paper
• PRINCIPLES OF ROBOT MOTION, Theory, Algorithms and Implementations, by Howie Choset et al., MIT Press, 2005. xix + 603 pp., index, ISBN 0-262-03327-5, 433 references (Hb. £38.95)

  2006cited by this paper
• Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse Decompositions

  2002cited by this paper
• Randomized planning for short inspection paths

  2000cited by this paper
• Art Gallery and Illumination Problems

  2000influential reference
• An on-line algorithm for exploring an unknown polygonal environment by a point robot

  1997cited by this paper
• Motivating lazy guards

  1995cited by this paper
• Controlling Guards

  1994cited by this paper
• A unified computational framework for Minkowski operations

  1993cited by this paper
• A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations

  1990cited by this paper
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

  1987cited by this paper

• Optimizing Sensor Network Design for Multiple Coverage

  2024cites this paper
• Efficient and robust Sensor Placement in Complex Environments

  2023cites this paper
• Occlusion-Aware Motion Planning of Autonomous Robots in Cluttered and Unknown Environments

  2022cites this paper
• Autonomous mobile robots

  2021cites this paper
• The VC-Dimension of Limited Visibility Terrains

  2021cites this paper
• Exploring the Outer Boundary of a Simple Polygon

  2021cites this paper
• Combining Geometric and Information-Theoretic Approaches for Multi-Robot Exploration

  2020cites this paper
• Rendezvous in planar environments with obstacles and unknown initial distance

  2019cites this paper
• Strategy Synthesis for Surveillance-Evasion Games with Learning-Enabled Visibility Optimization

  2019cites this paper
• Covering the plane by a sequence of circular disks with a constraint

  2018cites this paper
• Advice complexity of treasure hunt in geometric terrains

  2018cites this paper
• Greedy Algorithms for Sparse Sensor Placement via Deep Learning.

  2018influential citation
• A Problem of Covering the Plane by Circular Discs with a Constraint

  2018cites this paper
• Autonomous Exploration, Reconstruction, and Surveillance of 3D Environments Aided by Deep Learning

  2018influential citation
• Information Complexity of Treasure Hunt in Geometric Terrains

  2018cites this paper
• Hybrid PSO-cubic spline for autonomous robots optimal trajectory planning

  2017cites this paper
• A Geometric Approach for Multi-Robot Exploration in Orthogonal Polygons

  2016cites this paper
• Investigation of a target reachability by a manipulator in an unknown environment

  2016cites this paper
• Thorough robot navigation based on SVM local planning

  2015cites this paper
• Sensor-Driven Area Coverage for an Autonomous Fixed-Wing Unmanned Aerial Vehicle

  2014cites this paper
• Robust online adaptive sensor-driven survey planning for single and multiple autonomous underwater vehicles

  2013cites this paper
• Worst-case optimal exploration of terrains with obstacles

  2013cites this paper
• Path planning with obstacle avoidance based on visibility binary tree algorithm

  2013cites this paper
• A self-localization and path planning technique for mobile robot navigation

  2011cites this paper
• Algorithms for mobile agents with limited capabilities

  2011cites this paper
• Optimal Exploration of Terrains with Obstacles

  2010cites this paper
• Online algorithms for searching and exploration in the plane

  2010cites this paper
• On fast exploration in 2D and 3D terrains with multiple robots

  2009cites this paper
• Optimality and competitiveness of exploring polygons by mobile robots

  2009cites this paper
• Polygon exploration with time-discrete vision

  2008cites this paper
• 19-05 March 2019 Strategy synthesis for surveillance-evasion games with learning-enabled visibility optimization by

  year unknowncites this paper