2020-12-26 14:12:05 -08:00
|
|
|
// Copyright (c) FIRST and other WPILib contributors.
|
|
|
|
|
// Open Source Software; you can modify and/or share it under the terms of
|
|
|
|
|
// the WPILib BSD license file in the root directory of this project.
|
2020-07-24 08:34:30 -07:00
|
|
|
|
2020-08-07 09:38:13 -07:00
|
|
|
package edu.wpi.first.math;
|
2020-07-24 08:34:30 -07:00
|
|
|
|
|
|
|
|
import org.ejml.simple.SimpleMatrix;
|
|
|
|
|
import org.junit.jupiter.api.Test;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
import static org.junit.jupiter.api.Assertions.assertEquals;
|
|
|
|
|
import static org.junit.jupiter.api.Assertions.assertTrue;
|
|
|
|
|
|
|
|
|
|
@SuppressWarnings({"ParameterName", "LocalVariableName"})
|
|
|
|
|
public class DrakeTest {
|
|
|
|
|
public static void assertMatrixEqual(SimpleMatrix A, SimpleMatrix B) {
|
|
|
|
|
for (int i = 0; i < A.numRows(); i++) {
|
|
|
|
|
for (int j = 0; j < A.numCols(); j++) {
|
|
|
|
|
assertEquals(A.get(i, j), B.get(i, j), 1e-4);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
private boolean solveDAREandVerify(SimpleMatrix A, SimpleMatrix B, SimpleMatrix Q,
|
|
|
|
|
SimpleMatrix R) {
|
|
|
|
|
var X = Drake.discreteAlgebraicRiccatiEquation(A, B, Q, R);
|
|
|
|
|
|
|
|
|
|
// expect that x is the same as it's transpose
|
|
|
|
|
assertEquals(X.numRows(), X.numCols());
|
|
|
|
|
assertMatrixEqual(X, X.transpose());
|
|
|
|
|
|
|
|
|
|
// Verify that this is a solution to the DARE.
|
|
|
|
|
SimpleMatrix Y = A.transpose().mult(X).mult(A)
|
|
|
|
|
.minus(X)
|
|
|
|
|
.minus(A.transpose().mult(X).mult(B)
|
|
|
|
|
.mult(((B.transpose().mult(X).mult(B)).plus(R))
|
|
|
|
|
.invert()).mult(B.transpose()).mult(X).mult(A))
|
|
|
|
|
.plus(Q);
|
|
|
|
|
assertMatrixEqual(Y, new SimpleMatrix(Y.numRows(), Y.numCols()));
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
@Test
|
|
|
|
|
public void testDiscreteAlgebraicRicattiEquation() {
|
|
|
|
|
int n1 = 4;
|
|
|
|
|
int m1 = 1;
|
|
|
|
|
|
|
|
|
|
// we know from Scipy that this should be [[0.05048525 0.10097051 0.20194102 0.40388203]]
|
|
|
|
|
SimpleMatrix A1 = new SimpleMatrix(n1, n1, true, new double[]{0.5, 1, 0, 0, 0, 0, 1,
|
|
|
|
|
0, 0, 0, 0, 1, 0, 0, 0, 0}).transpose();
|
|
|
|
|
SimpleMatrix B1 = new SimpleMatrix(n1, m1, true, new double[]{0, 0, 0, 1});
|
|
|
|
|
SimpleMatrix Q1 = new SimpleMatrix(n1, n1, true, new double[]{1, 0,
|
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
|
0, 0, 0, 0, 0, 0});
|
|
|
|
|
SimpleMatrix R1 = new SimpleMatrix(m1, m1, true, new double[]{0.25});
|
|
|
|
|
assertTrue(solveDAREandVerify(A1, B1, Q1, R1));
|
|
|
|
|
|
|
|
|
|
SimpleMatrix A2 = new SimpleMatrix(2, 2, true, new double[]{1, 1, 0, 1});
|
|
|
|
|
SimpleMatrix B2 = new SimpleMatrix(2, 1, true, new double[]{0, 1});
|
|
|
|
|
SimpleMatrix Q2 = new SimpleMatrix(2, 2, true, new double[]{1, 0, 0, 0});
|
|
|
|
|
SimpleMatrix R2 = new SimpleMatrix(1, 1, true, new double[]{0.3});
|
|
|
|
|
assertTrue(solveDAREandVerify(A2, B2, Q2, R2));
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
}
|