ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

確率的ロードマップ×モデル予測制御×急成長ランダムツリー×
分野制御理論制御理論制御理論
系統Machine learningMachine learningMachine learning
提唱年199619781998
提唱者Lydia KavrakiJacques RichaletSteven M. LaValle
種類algorithmalgorithmalgorithm
原典Kavraki, L. E., Svestka, P., Latombe, J. C., & Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4), 566-580. DOI ↗Richalet, 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 ↗
別名PRM, Roadmap MethodMPC, Receding Horizon ControlRRT, Incremental Sampling-based Algorithm
関連253
概要The Probabilistic Roadmap (PRM) method is a motion planning algorithm that builds a pre-computed graph (roadmap) of feasible paths through the configuration space by sampling random configurations and connecting them if collision-free. Introduced by Kavraki et al. in 1996, PRM is powerful for multi-query planning scenarios where many path queries are answered, amortizing roadmap construction cost across many queries.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.
ScholarGateデータセット
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 3 出典
  3. PUBLISHED
  1. v1
  2. 3 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Probabilistic Roadmap · Model Predictive Control · Rapidly-Exploring Random Tree. 2026-06-17に以下より取得 https://scholargate.app/ja/compare