Optimal Gap Navigation for a Disc Robot

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Workshop on the Algorithmic Foundations of Robotics

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-642-36279-8_8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sensing and Filtering: A Fresh Perspective Based on Preimages and Information Spaces

  2012cited by this paper
• Computing shortest paths among curved obstacles in the plane

  2011cited by this paper
• Sensing and Filtering : A Tutorial Based on Preimages and Information Spaces

  2011cited by this paper
• Visibility of point clouds and exploratory path planning in unknown environments

  2008cited by this paper
• Using incomplete online metric maps for topological exploration with the Gap Navigation Tree

  2008cited by this paper
• Simultaneous Localization and Mapping

  2008cited by this paper
• Visibility Algorithms in the Plane

  2007cited by this paper
• Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances

  2007influential reference
• Planning algorithms

  2006cited by this paper
• Simultaneous localization and mapping: part I

  2006cited by this paper
• Shortest Paths and Networks

  2004cited by this paper
• Probabilistic robotics

  2002cited by this paper
• Algorithmic and Computational Robotics: New Directions

  2001cited by this paper
• Computational geometry: algorithms and applications, 2nd Edition

  2000cited by this paper
• An Efficient Approximation Algorithm for Weighted Region Shortest Path Problem

  2000cited by this paper
• Handbook of Discrete and Computational Geometry, Second Edition

  1997cited by this paper
• Computational geometry: algorithms and applications, 3rd Edition

  1997cited by this paper
• Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph

  1995cited by this paper
• The weighted region problem: finding shortest paths through a weighted planar subdivision

  1991cited by this paper
• An Output-Sensitive Algorithm for Computing Visibility Graphs

  1991cited by this paper
• The weighted region problem

  1987cited by this paper
• New lower bound techniques for robot motion planning problems

  1987cited by this paper
• Planning the shortest path for a disc in O(n2log n) time

  1985cited by this paper
• AND T

  year unknowncited by this paper

• Smooth Distance Approximation

  2023cites this paper
• Non-Model-Based approach for complete digitization by TLS or mobile scanner

  2021cites this paper
• Integer linear programming formulations of the filter partitioning minimization problem

  2020cites this paper
• Algorithmic Robot Design: Label Maps, Procrustean Graphs, and the Boundary of Non-Destructiveness

  2020cites this paper
• Walking an Unknown Street with Limited Sensing

  2019cites this paper
• A motion strategy for exploration driven by an automaton activating feedback-based controllers

  2019influential citation
• Competitive Strategy for Walking in Streets for an Empowered Simple Robot

  2018cites this paper
• On the Relationship Between Bisimulation and Combinatorial Filter Reduction

  2018cites this paper
• Toward a language-theoretic foundation for planning and filtering

  2018cites this paper
• Concise Planning and Filtering: Hardness and Algorithms

  2017cites this paper
• Inconsequential improprieties: Filter reduction in probabilistic worlds

  2017cites this paper
• Improper Filter Reduction

  2017cites this paper
• Combinatorial filter reduction: Special cases, approximation, and fixed-parameter tractability

  2017cites this paper
• Optimal Navigation for a Differential Drive Disc Robot: A Game Against the Polygonal Environment

  2016cites this paper
• A Competitive Strategy for Walking in Generalized Streets for a Simple Robot

  2016cites this paper
• Set-labelled filters and sensor transformations

  2016cites this paper
• Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada

  2016cites this paper
• Automatic design of discreet discrete filters

  2015cites this paper
• Randomized Strategy for Walking in Streets for a Simple Robot

  2015cites this paper
• Motion strategies for exploration and map building under uncertainty with multiple heterogeneous robots

  2014cites this paper
• Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot

  2014cites this paper
• Exploration of an unknown environment with a differential drive disc robot

  2014cites this paper
• Using cognitive radar to traverse apertures

  2014cites this paper
• Walking in streets with minimal sensing

  2013cites this paper
• Automatic reduction of combinatorial filters

  2013cites this paper