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