방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 빠르게 탐색하는 무작위 트리× | 피드백 선형화× | |
|---|---|---|
| 분야 | 제어이론 | 제어이론 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1998 | 1983 |
| 창시자≠ | Steven M. LaValle | Alberto Isidori |
| 유형 | algorithm | algorithm |
| 원전≠ | LaValle, S. M. (1998). Rapidly-exploring random trees: A new tool for path planning. Technical Report TR 98-11, Iowa State University. link ↗ | Isidori, A. (1995). Nonlinear Control Systems (3rd ed.). Springer-Verlag. DOI ↗ |
| 별칭≠ | RRT, Incremental Sampling-based Algorithm | Exact Linearization, Nonlinear Feedback Control, Input-Output Linearization |
| 관련≠ | 3 | 4 |
| 요약≠ | 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. | Feedback Linearization is a nonlinear control technique that uses a nonlinear state-feedback transformation to convert a nonlinear system into a linear one, enabling the use of standard linear control methods. Developed by Isidori, Sontag, and others in the 1980s, feedback linearization is conceptually elegant and powerful: if the system satisfies certain structural conditions (relative degree, decoupling matrix rank), the nonlinearities can be exactly cancelled through feedback, reducing the problem to linear design. |
| ScholarGate데이터셋 ↗ |
|
|