Locally Optimal Estimation and Control of Cable Driven Parallel Robots using Time Varying Linear Quadratic Gaussian Control
Gerry Chen, Seth Hutchinson, and Frank Dellaert

TL;DR
This paper introduces a novel time-varying LQG control approach for Cable Driven Parallel Robots that optimizes tracking performance by computing state-dependent gains offline using factor graphs, resulting in improved accuracy.
Contribution
The paper develops a new TV-LQG controller for CDPRs utilizing factor graph optimization for offline gain computation, enhancing tracking accuracy and computational efficiency.
Findings
Achieved 0.8° rotation RMS error in tracking.
Achieved 11.6mm translation RMS error.
Outperformed existing dual-space feed-forward controller.
Abstract
We present a locally optimal tracking controller for Cable Driven Parallel Robot (CDPR) control based on a time-varying Linear Quadratic Gaussian (TV-LQG) controller. In contrast to many methods which use fixed feedback gains, our time-varying controller computes the optimal gains depending on the location in the workspace and the future trajectory. Meanwhile, we rely heavily on offline computation to reduce the burden of online implementation and feasibility checking. Following the growing popularity of probabilistic graphical models for optimal control, we use factor graphs as a tool to formulate our controller for their efficiency, intuitiveness, and modularity. The topology of a factor graph encodes the relevant structural properties of equations in a way that facilitates insight and efficient computation using sparse linear algebra solvers. We first use factor graph optimization to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Mechanisms and Dynamics · Real-Time Systems Scheduling · Robotic Path Planning Algorithms
