Randomized query processing in robot path planning

DOI10.1006/jcss.1998.1578zbMath0920.68130OpenAlexW2045851525MaRDI QIDQ1273861

Jean-Claude Latombe, Prabhakar Raghavan, Lydia E. Kavraki

Publication date: 13 September 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1578

zbMATH Keywords

query processingrobot path planning

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A lower bound for metric 1-median selection ⋮ Workspace-Based Connectivity Oracle: An Adaptive Sampling Strategy for PRM Planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• New algorithms for multilink robot arms
• Guarding galleries where no point sees a small area.
• Spatial Planning: A Configuration Space Approach
• Movement Problems for 2-Dimensional Linkages
• Reducing Multiple Object Motion Planning to Graph Searching
• On the Movement of Robot Arms in 2-Dimensional Bounded Regions
• Motion planning in the presence of moving obstacles

This page was built for publication: Randomized query processing in robot path planning