Performance bounds for planning in unknown terrain
DOI10.1016/S0004-3702(03)00062-6zbMath1082.68805MaRDI QIDQ814477
Sven Koenig, Craig A. Tovey, Yuri Smirnov
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Heuristics; Heuristic search; Analysis of algorithms; Graph algorithms; Mobile robotics; Worst-case analysis; Planning in nondeterministic domains; Agent-centered search; Assumption-based planning; Dynamic A\(^*\) (D\(^*\)); Greedy mapping; On-line graph search; Planning with incomplete information; Robot navigation
68T37: Reasoning under uncertainty in the context of artificial intelligence
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68T40: Artificial intelligence for robotics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the combinatorial structure of the visibility graph in simple polygons
- Shortest watchman routes in simple polygons
- Shortest paths without a map
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Algorithmic and complexity issues of robot motion in an uncertain environment
- Watchman routes under limited visibility
- Remote Agent: to boldly go where no AI system has gone before
- Piecemeal graph exploration by a mobile robot.
- How to learn an unknown environment. I
- The Riemann–Hilbert problem for nonsymmetric systems
- Navigating in Unfamiliar Geometric Terrain
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Computing a shortest watchman path in a simple polygon in polynomial-time
- 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
