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/bg/compare