পদ্ধতির তুলনা করুন

	Probabilistic Roadmap	র‍্যাপিডলি-এক্সপ্লোরিং র‍্যান্ডম ট্রি
ক্ষেত্র	নিয়ন্ত্রণ তত্ত্ব	নিয়ন্ত্রণ তত্ত্ব
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1996	1998
প্রবর্তক	Lydia Kavraki	Steven M. LaValle
ধরন	algorithm	algorithm
মৌলিক উৎস	Kavraki, L. E., Svestka, P., Latombe, J. C., & Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4), 566-580.	LaValle, S. M. (1998). Rapidly-exploring random trees: A new tool for path planning. Technical Report TR 98-11, Iowa State University.
অপর নাম	PRM, Roadmap Method	RRT, Incremental Sampling-based Algorithm
সম্পর্কিত	2	3
সারসংক্ষেপ	The Probabilistic Roadmap (PRM) method is a motion planning algorithm that builds a pre-computed graph (roadmap) of feasible paths through the configuration space by sampling random configurations and connecting them if collision-free. Introduced by Kavraki et al. in 1996, PRM is powerful for multi-query planning scenarios where many path queries are answered, amortizing roadmap construction cost across many queries.	The Rapidly-Exploring Random Tree (RRT) is a motion planning algorithm that builds a tree of feasible paths by iteratively sampling random configurations in the workspace and connecting them to the nearest existing node in the tree. Introduced by LaValle in 1998, RRT is a breakthrough for high-dimensional motion planning, enabling robots to find collision-free paths in complex environments with obstacles, joint limits, and kinematic constraints.