lqr-problem.hpp

Go to the documentation of this file.

#pragma once
 
#include "aligator/context.hpp"
#include "aligator/math.hpp"
#include "aligator/gar/fwd.hpp"
#include "aligator/memory/managed-matrix.hpp"
#include "aligator/tags.hpp"
#include <fmt/format.h>
 
#include <optional>
 
namespace aligator {
namespace gar {

template <typename Scalar> struct LqrKnotTpl {
  ALIGATOR_DYNAMIC_TYPEDEFS(Scalar);
  static constexpr int Alignment = Eigen::AlignedMax;
  using MVec = ManagedMatrix<Scalar, Eigen::Dynamic, 1>;
  using MMat = ManagedMatrix<Scalar, Eigen::Dynamic, Eigen::Dynamic>;
  using allocator_type = polymorphic_allocator;
 
  uint nx;
  uint nu;
  uint nc;
  uint nx2;
  uint nth;
 
  MMat Q, S, R;
  MVec q, r;
  MMat A, B, E;
  MVec f;
  MMat C, D;
  MVec d;
 
  MMat Gth;
  MMat Gx;
  MMat Gu;
  MMat Gv;
  MVec gamma;
 
  template <typename T, bool Cond>
  using add_const_if_t = std::conditional_t<Cond, std::add_const_t<T>, T>;
 
  template <bool IsConst> struct __view_base {
    using mat_t = Eigen::Map<add_const_if_t<MatrixXs, IsConst>, Alignment>;
    using vec_t = Eigen::Map<add_const_if_t<VectorXs, IsConst>, Alignment>;
    uint nx;
    uint nu;
    uint nc;
    uint nx2;
    uint nth;
 
    mat_t Q, S, R;
    vec_t q, r;
    mat_t A, B, E;
    vec_t f;
    mat_t C, D;
    vec_t d;
 
    mat_t Gth, Gx, Gu, Gv;
    vec_t gamma;
  };
 
  using view_t = __view_base<false>;
  using const_view_t = __view_base<true>;

  view_t to_view() {
    return view_t{
        nx,
        nu,
        nc,
        nx2,
        nth,
        //
        Q.to_map(),
        S.to_map(),
        R.to_map(),
        q.to_map(),
        r.to_map(),
        //
        A.to_map(),
        B.to_map(),
        E.to_map(),
        f.to_map(),
        //
        C.to_map(),
        D.to_map(),
        d.to_map(),
        //
        Gth.to_map(),
        Gx.to_map(),
        Gu.to_map(),
        Gv.to_map(),
        gamma.to_map(),
    };
  }

  const_view_t to_const_view() const {
    return const_view_t{
        nx,
        nu,
        nc,
        nx2,
        nth,
        //
        Q.to_const_map(),
        S.to_const_map(),
        R.to_const_map(),
        q.to_const_map(),
        r.to_const_map(),
        //
        A.to_const_map(),
        B.to_const_map(),
        E.to_const_map(),
        f.to_const_map(),
        //
        C.to_const_map(),
        D.to_const_map(),
        d.to_const_map(),
        //
        Gth.to_const_map(),
        Gx.to_const_map(),
        Gu.to_const_map(),
        Gv.to_const_map(),
        gamma.to_const_map(),
    };
  }
 
  const_view_t to_view() const { return to_const_view(); }
 
  operator view_t() { return to_view(); }
  operator const_view_t() const { return to_const_view(); }
 
  LqrKnotTpl(uint nx, uint nu, uint nc, uint nx2, uint nth,
             allocator_type alloc = {});

  LqrKnotTpl(uint nx, uint nu, uint nc, uint nx2, allocator_type alloc = {})
      : LqrKnotTpl(nx, nu, nc, nx2, 0, alloc) {}

  LqrKnotTpl(uint nx, uint nu, uint nc, allocator_type alloc = {})
      : LqrKnotTpl(nx, nu, nc, nx, 0, alloc) {}

  LqrKnotTpl(const LqrKnotTpl &other, allocator_type alloc = {});
  LqrKnotTpl(LqrKnotTpl &&other);
  LqrKnotTpl &operator=(const LqrKnotTpl &other);
  LqrKnotTpl &operator=(LqrKnotTpl &&);
 
  ~LqrKnotTpl();

  void assign(const LqrKnotTpl<Scalar> &other);
 
  // reallocates entire buffer for contigousness
  LqrKnotTpl &addParameterization(uint nth);
 
  bool isApprox(const LqrKnotTpl &other,
                Scalar prec = std::numeric_limits<Scalar>::epsilon()) const;
 
  friend bool operator==(const LqrKnotTpl &lhs, const LqrKnotTpl &rhs) {
    return lhs.isApprox(rhs);
  }
 
  allocator_type get_allocator() const { return m_allocator; }
 
private:
  explicit LqrKnotTpl(no_alloc_t, allocator_type alloc = {});
  allocator_type m_allocator;
};
 
template <typename Scalar> struct LqrProblemTpl {
  ALIGATOR_DYNAMIC_TYPEDEFS(Scalar);
  static constexpr int Alignment = Eigen::AlignedMax;
  using KnotType = LqrKnotTpl<Scalar>;
  using KnotVector = std::pmr::vector<KnotType>;
  using allocator_type = polymorphic_allocator;
  using MVec = ManagedMatrix<Scalar, Eigen::Dynamic, 1>;
  using MMat = ManagedMatrix<Scalar, Eigen::Dynamic, Eigen::Dynamic>;
  MMat G0;
  MVec g0;
  KnotVector stages;
 
  inline int horizon() const noexcept { return (int)stages.size() - 1; }
  inline uint nc0() const noexcept { return (uint)g0.rows(); }
 
  explicit LqrProblemTpl(allocator_type alloc = {})
      : G0(alloc)
      , g0(alloc)
      , stages(alloc) {
    assert(check_allocators());
  }

  LqrProblemTpl(const KnotVector &knots, long nc0, allocator_type alloc = {});
  LqrProblemTpl(KnotVector &&knots, long nc0);

  LqrProblemTpl(const LqrProblemTpl &other, allocator_type alloc = {})
      : LqrProblemTpl(other.stages, other.nc0(), alloc) {
    this->G0 = other.G0;
    this->g0 = other.g0;
  }

  LqrProblemTpl(LqrProblemTpl &&other)
      : LqrProblemTpl(std::move(other.stages), other.nc0()) {
    this->G0 = other.G0;
    this->g0 = other.g0;
  }
 
  LqrProblemTpl &operator=(LqrProblemTpl &&other) {
    this->G0 = std::move(other.G0);
    this->g0 = std::move(other.g0);
    this->stages = std::move(other.stages);
    return *this;
  }
 
  ~LqrProblemTpl();
 
  void addParameterization(uint nth) {
    if (stages.empty())
      return;
    for (uint i = 0; i <= (uint)horizon(); i++) {
      stages[i].addParameterization(nth);
    }
  }
 
  inline bool isParameterized() const {
    return !stages.empty() && (stages[0].nth > 0);
  }
 
  inline bool isInitialized() const { return !stages.empty(); }
 
  inline uint ntheta() const { return stages[0].nth; }
 
  inline bool isApprox(const LqrProblemTpl &other) {
    if (horizon() != other.horizon() || !G0.isApprox(other.G0) ||
        !g0.isApprox(other.g0))
      return false;
    for (uint i = 0; i < uint(horizon()); i++) {
      if (!stages[i].isApprox(other.stages[i]))
        return false;
    }
    return true;
  }

  Scalar evaluate(const VectorOfVectors &xs, const VectorOfVectors &us,
                  const std::optional<ConstVectorRef> &theta_) const;
 
  allocator_type get_allocator() const { return G0.get_allocator(); }
 
private:
  [[nodiscard]] bool check_allocators() const {
    return get_allocator() == g0.get_allocator() &&
           get_allocator() == stages.get_allocator();
  }
};
 
template <typename Scalar>
bool lqrKnotsSameDim(const LqrKnotTpl<Scalar> &lhs,
                     const LqrKnotTpl<Scalar> &rhs) {
  return (lhs.nx == rhs.nx) && (lhs.nu == rhs.nu) && (lhs.nc == rhs.nc) &&
         (lhs.nx2 == rhs.nx2) && (lhs.nth == rhs.nth);
}
 
template <typename Scalar>
std::ostream &operator<<(std::ostream &oss, const LqrKnotTpl<Scalar> &self_) {
  auto self = self_.to_const_view();
  oss << "LqrKnot {";
  oss << fmt::format("\n  nx:  {:d}", self.nx) //
      << fmt::format("\n  nu:  {:d}", self.nu) //
      << fmt::format("\n  nc:  {:d}", self.nc);
  if (self.nth > 0) {
    oss << fmt::format("\n  nth: {:d}", self.nth);
  }
#ifndef NDEBUG
  oss << eigenPrintWithPreamble(self.Q, "\n  Q: ") //
      << eigenPrintWithPreamble(self.S, "\n  S: ") //
      << eigenPrintWithPreamble(self.R, "\n  R: ") //
      << eigenPrintWithPreamble(self.q, "\n  q: ") //
      << eigenPrintWithPreamble(self.r, "\n  r: ");
 
  oss << eigenPrintWithPreamble(self.A, "\n  A: ") //
      << eigenPrintWithPreamble(self.B, "\n  B: ") //
      << eigenPrintWithPreamble(self.E, "\n  E: ") //
      << eigenPrintWithPreamble(self.f, "\n  f: ");
 
  oss << eigenPrintWithPreamble(self.C, "\n  C: ") //
      << eigenPrintWithPreamble(self.D, "\n  D: ") //
      << eigenPrintWithPreamble(self.d, "\n  d: ");
  if (self.nth > 0) {
    oss << eigenPrintWithPreamble(self.Gth, "\n  Gth: ") //
        << eigenPrintWithPreamble(self.Gx, "\n  Gx: ")   //
        << eigenPrintWithPreamble(self.Gu, "\n  Gu: ")   //
        << eigenPrintWithPreamble(self.gamma, "\n  gamma: ");
  }
#endif
  oss << "\n}";
  return oss;
}
 
#ifdef ALIGATOR_ENABLE_TEMPLATE_INSTANTIATION
extern template struct LqrKnotTpl<context::Scalar>;
extern template struct LqrProblemTpl<context::Scalar>;
#endif
 
} // namespace gar
} // namespace aligator