方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 概率路线图× | 模型预测控制× | 快速探索随机树× | |
|---|---|---|---|
| 领域 | 控制理论 | 控制理论 | 控制理论 |
| 方法族 | Machine learning | Machine learning | Machine learning |
| 起源年份≠ | 1996 | 1978 | 1998 |
| 提出者≠ | Lydia Kavraki | Jacques Richalet | Steven M. LaValle |
| 类型 | algorithm | 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. DOI ↗ | Richalet, J., Rault, A., Testud, J., & Papon, J. (1978). Model predictive heuristic control. Automatica, 14(5), 413-428. DOI ↗ | LaValle, S. M. (1998). Rapidly-exploring random trees: A new tool for path planning. Technical Report TR 98-11, Iowa State University. link ↗ |
| 别名 | PRM, Roadmap Method | MPC, Receding Horizon Control | RRT, Incremental Sampling-based Algorithm |
| 相关≠ | 2 | 5 | 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. | Model Predictive Control (MPC) is an advanced control strategy that uses an explicit process model to predict future system behavior over a finite horizon and solves an optimization problem at each control step. First formalized by Richalet et al. in 1978, MPC has become the dominant approach in process control industries, from chemical plants to autonomous vehicles, because it naturally handles constraints and can optimize multiple objectives simultaneously. | 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. |
| ScholarGate数据集 ↗ |
|
|
|