Performance bounds for planning in unknown terrain
DOI10.1016/S0004-3702(03)00062-6zbMATH Open1082.68805MaRDI QIDQ814477FDOQ814477
Authors: Sven Koenig, Craig A. Tovey, Yuri Smirnov 
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
HeuristicsAnalysis of algorithmsGraph algorithmsMobile roboticsWorst-case analysisAgent-centered searchAssumption-based planningDynamic A\(^*\) (D\(^*\))Greedy mappingHeuristic searchOn-line graph searchPlanning in nondeterministic domainsPlanning with incomplete informationRobot navigation
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Artificial intelligence for robotics (68T40)
Cites Work
- Title not available (Why is that?)
- Piecemeal graph exploration by a mobile robot.
- Navigating in Unfamiliar Geometric Terrain
- How to learn an unknown environment. I
- Shortest paths without a map
- Title not available (Why is that?)
- Shortest watchman routes in simple polygons
- Exploring Unknown Environments
- Watchman routes under limited visibility
- Remote Agent: to boldly go where no AI system has gone before
- Computing a shortest watchman path in a simple polygon in polynomial-time
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- A note on the combinatorial structure of the visibility graph in simple polygons
- Exploring Unknown Undirected Graphs
- Algorithmic and complexity issues of robot motion in an uncertain environment
- The Riemann–Hilbert problem for nonsymmetric systems
- Title not available (Why is that?)
- On a simple depth-first search strategy for exploring unknown graphs
- Analysis and Design of Wide-Scan Angle Wide-Band Phased Arrays of Substrate-Integrated Cavity-Backed Patches
Cited In (10)
- Title not available (Why is that?)
- Probabilistic planning with clear preferences on missing information
- Incorporating weights into real-time heuristic search
- Proximity-based non-uniform abstractions for approximate planning
- Towards a theory of random walk planning: regress factors, fair homogeneous graphs and extensions
- Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic
- Title not available (Why is that?)
- UAV path planning techniques: a survey
- Optimal Exploration of Terrains with Obstacles
- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
This page was built for publication: Performance bounds for planning in unknown terrain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814477)
