mirror of
https://github.com/wpilibsuite/allwpilib
synced 2026-06-27 02:01:42 +00:00
The wpimath library is a new library designed to separate the reusable math functionality from the common utility library (wpiutil) and the hardware-dependent library (wpilibc/j). Package names / include file names were NOT changed to minimize breakage. In a future year it would be good to revamp these for a more uniform user experience and to reduce the risk of accidental naming conflicts. While theoretically all of this functionality could be placed into wpiutil, several pieces of this library (e.g. DARE) are very time-consuming to compile, so it's nice to avoid this expense for users who only want cscore or ntcore. It also allows for easy future separation of build tasks vs number of workers on memory-constrained machines. This moves the following functionality from wpiutil into wpimath: - Eigen - ejml - Drake - DARE - wpiutil.math package (Matrix etc) - units And the following functionality from wpilibc/j into wpimath: - Geometry - Kinematics - Spline - Trajectory - LinearFilter - MedianFilter - Feed-forward controllers
146 lines
5.2 KiB
C++
146 lines
5.2 KiB
C++
/*----------------------------------------------------------------------------*/
|
|
/* Copyright (c) 2019-2020 FIRST. All Rights Reserved. */
|
|
/* Open Source Software - may be modified and shared by FRC teams. The code */
|
|
/* must be accompanied by the FIRST BSD license file in the root directory of */
|
|
/* the project. */
|
|
/*----------------------------------------------------------------------------*/
|
|
|
|
/*
|
|
* MIT License
|
|
*
|
|
* Copyright (c) 2018 Team 254
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
* SOFTWARE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <stack>
|
|
#include <string>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#include <wpi/Twine.h>
|
|
|
|
#include "frc/spline/Spline.h"
|
|
#include "units/angle.h"
|
|
#include "units/curvature.h"
|
|
#include "units/length.h"
|
|
#include "units/math.h"
|
|
|
|
namespace frc {
|
|
|
|
/**
|
|
* Class used to parameterize a spline by its arc length.
|
|
*/
|
|
class SplineParameterizer {
|
|
public:
|
|
using PoseWithCurvature = std::pair<Pose2d, units::curvature_t>;
|
|
|
|
struct MalformedSplineException : public std::runtime_error {
|
|
explicit MalformedSplineException(const char* what_arg)
|
|
: runtime_error(what_arg) {}
|
|
};
|
|
|
|
/**
|
|
* Parameterizes the spline. This method breaks up the spline into various
|
|
* arcs until their dx, dy, and dtheta are within specific tolerances.
|
|
*
|
|
* @param spline The spline to parameterize.
|
|
* @param t0 Starting internal spline parameter. It is recommended to leave
|
|
* this as default.
|
|
* @param t1 Ending internal spline parameter. It is recommended to leave this
|
|
* as default.
|
|
*
|
|
* @return A vector of poses and curvatures that represents various points on
|
|
* the spline.
|
|
*/
|
|
template <int Dim>
|
|
static std::vector<PoseWithCurvature> Parameterize(const Spline<Dim>& spline,
|
|
double t0 = 0.0,
|
|
double t1 = 1.0) {
|
|
std::vector<PoseWithCurvature> splinePoints;
|
|
|
|
// The parameterization does not add the initial point. Let's add that.
|
|
splinePoints.push_back(spline.GetPoint(t0));
|
|
|
|
// We use an "explicit stack" to simulate recursion, instead of a recursive
|
|
// function call This give us greater control, instead of a stack overflow
|
|
std::stack<StackContents> stack;
|
|
stack.emplace(StackContents{t0, t1});
|
|
|
|
StackContents current;
|
|
PoseWithCurvature start;
|
|
PoseWithCurvature end;
|
|
int iterations = 0;
|
|
|
|
while (!stack.empty()) {
|
|
current = stack.top();
|
|
stack.pop();
|
|
start = spline.GetPoint(current.t0);
|
|
end = spline.GetPoint(current.t1);
|
|
|
|
const auto twist = start.first.Log(end.first);
|
|
|
|
if (units::math::abs(twist.dy) > kMaxDy ||
|
|
units::math::abs(twist.dx) > kMaxDx ||
|
|
units::math::abs(twist.dtheta) > kMaxDtheta) {
|
|
stack.emplace(StackContents{(current.t0 + current.t1) / 2, current.t1});
|
|
stack.emplace(StackContents{current.t0, (current.t0 + current.t1) / 2});
|
|
} else {
|
|
splinePoints.push_back(spline.GetPoint(current.t1));
|
|
}
|
|
|
|
if (iterations++ >= kMaxIterations) {
|
|
throw MalformedSplineException(
|
|
"Could not parameterize a malformed spline. "
|
|
"This means that you probably had two or more adjacent "
|
|
"waypoints that were very close together with headings "
|
|
"in opposing directions.");
|
|
}
|
|
}
|
|
|
|
return splinePoints;
|
|
}
|
|
|
|
private:
|
|
// Constraints for spline parameterization.
|
|
static constexpr units::meter_t kMaxDx = 5_in;
|
|
static constexpr units::meter_t kMaxDy = 0.05_in;
|
|
static constexpr units::radian_t kMaxDtheta = 0.0872_rad;
|
|
|
|
struct StackContents {
|
|
double t0;
|
|
double t1;
|
|
};
|
|
|
|
/**
|
|
* A malformed spline does not actually explode the LIFO stack size. Instead,
|
|
* the stack size stays at a relatively small number (e.g. 30) and never
|
|
* decreases. Because of this, we must count iterations. Even long, complex
|
|
* paths don't usually go over 300 iterations, so hitting this maximum should
|
|
* definitely indicate something has gone wrong.
|
|
*/
|
|
static constexpr int kMaxIterations = 5000;
|
|
|
|
friend class CubicHermiteSplineTest;
|
|
friend class QuinticHermiteSplineTest;
|
|
};
|
|
} // namespace frc
|