Performance bounds for planning in unknown terrain

DOI10.1016/S0004-3702(03)00062-6MaRDI QIDQ814477zbMATH OpenFDO

Authors Sven Koenig, Craig A. Tovey, Yuri Smirnov

Publication date 7 February 2006

Published in Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

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)

Recommendations

• The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
• Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic
• scientific article; zbMATH DE number 1947498
• Fast planning through planning graph analysis
• An Online Algorithm for Improving Performance in Navigation

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 978792 (Why is no real title available?)
• scientific article; zbMATH DE number 6472590 (Why is no real title available?)
• A note on the combinatorial structure of the visibility graph in simple polygons
• Algorithmic and complexity issues of robot motion in an uncertain environment
• Analysis and Design of Wide-Scan Angle Wide-Band Phased Arrays of Substrate-Integrated Cavity-Backed Patches
• Computing a shortest watchman path in a simple polygon in polynomial-time
• Exploring Unknown Environments
• Exploring Unknown Undirected Graphs
• How to learn an unknown environment. I
• Navigating in Unfamiliar Geometric Terrain
• On a simple depth-first search strategy for exploring unknown graphs
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• Piecemeal graph exploration by a mobile robot.
• Remote Agent: to boldly go where no AI system has gone before
• Shortest paths without a map
• Shortest watchman routes in simple polygons
• The Riemann–Hilbert problem for nonsymmetric systems
• Watchman routes under limited visibility

Cited in

(10)

• Probabilistic planning with clear preferences on missing information
• Incorporating weights into real-time heuristic search
• scientific article; zbMATH DE number 1947498 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 2243364 (Why is no real title available?)
• 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)