ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Probabilistische Routenetwerk×Modelvoorspellende Regeling×
VakgebiedRegeltechniekRegeltechniek
FamilieMachine learningMachine learning
Jaar van ontstaan19961978
GrondleggerLydia KavrakiJacques Richalet
Typealgorithmalgorithm
Oorspronkelijke bronKavraki, 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 ↗
AliassenPRM, Roadmap MethodMPC, Receding Horizon Control
Verwant25
SamenvattingThe 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.
ScholarGateGegevensset
  1. v1
  2. 3 Bronnen
  3. PUBLISHED
  1. v1
  2. 3 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: Probabilistic Roadmap · Model Predictive Control. Geraadpleegd op 2026-06-15 via https://scholargate.app/nl/compare