ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

快速探索随机树×模型预测控制×
领域控制理论控制理论
方法族Machine learningMachine learning
起源年份19981978
提出者Steven M. LaValleJacques Richalet
类型algorithmalgorithm
开创性文献LaValle, S. M. (1998). Rapidly-exploring random trees: A new tool for path planning. Technical Report TR 98-11, Iowa State University. link ↗Richalet, J., Rault, A., Testud, J., & Papon, J. (1978). Model predictive heuristic control. Automatica, 14(5), 413-428. DOI ↗
别名RRT, Incremental Sampling-based AlgorithmMPC, Receding Horizon Control
相关35
摘要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.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.
ScholarGate数据集
  1. v1
  2. 3 来源
  3. PUBLISHED
  1. v1
  2. 3 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Rapidly-Exploring Random Tree · Model Predictive Control. 于 2026-06-15 检索自 https://scholargate.app/zh/compare