ScholarGate
Avustaja

Vertaile menetelmiä

Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.

Malliohjattu säätö×Nopeasti laajeneva satunnaishakupuu×
TieteenalaSäätöteoriaSäätöteoria
MenetelmäperheMachine learningMachine learning
Syntyvuosi19781998
KehittäjäJacques RichaletSteven M. LaValle
Tyyppialgorithmalgorithm
AlkuperäislähdeRichalet, 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 ↗
RinnakkaisnimetMPC, Receding Horizon ControlRRT, Incremental Sampling-based Algorithm
Liittyvät53
Tiivistelmä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.
ScholarGateAineisto
  1. v1
  2. 3 Lähteet
  3. PUBLISHED
  1. v1
  2. 3 Lähteet
  3. PUBLISHED

Siirry hakuun Lataa diat

ScholarGateVertaile menetelmiä: Model Predictive Control · Rapidly-Exploring Random Tree. Haettu 2026-06-17 osoitteesta https://scholargate.app/fi/compare