aligator  0.14.0
A primal-dual augmented Lagrangian-type solver for nonlinear trajectory optimization.
Loading...
Searching...
No Matches
rollout.hpp
Go to the documentation of this file.
1#pragma once
2
3#include "aligator/utils/forward-dyn.hpp"
4
5namespace aligator {
6
8template <typename Scalar>
9typename math_types<Scalar>::VectorOfVectors rollout(
10 const std::vector<xyz::polymorphic<DynamicsModelTpl<Scalar>>> &dyn_models,
11 const typename math_types<Scalar>::VectorXs &x0,
12 const typename math_types<Scalar>::VectorOfVectors &us,
13 typename math_types<Scalar>::VectorOfVectors &xout) {
14 using Data = DynamicsDataTpl<Scalar>;
15 const std::size_t N = us.size();
16 if (dyn_models.size() != N) {
17 ALIGATOR_RUNTIME_ERROR(
18 "Number of controls should be the same as number of dynamical models!");
19 }
20 xout.resize(N + 1);
21 xout[0] = x0;
22
23 for (std::size_t i = 0; i < N; i++) {
24 shared_ptr<Data> data = dyn_models[i]->createData();
25 const ManifoldAbstractTpl<Scalar> &space = dyn_models[i]->space();
26 xout.push_back(space.neutral());
27 forwardDynamics<Scalar>::run(*dyn_models[i], xout[i], us[i], *data,
28 xout[i + 1]);
29 }
30 return xout;
31}
32
34template <typename Scalar>
35typename math_types<Scalar>::VectorOfVectors
36rollout(const DynamicsModelTpl<Scalar> &dyn_model,
37 const typename math_types<Scalar>::VectorXs &x0,
38 const typename math_types<Scalar>::VectorOfVectors &us) {
39 using VectorXs = typename math_types<Scalar>::VectorXs;
40
41 const std::size_t N = us.size();
42 std::vector<VectorXs> xs{x0};
43 xs.reserve(N + 1);
44 shared_ptr<DynamicsDataTpl<Scalar>> data = dyn_model.createData();
45
46 for (std::size_t i = 0; i < N; i++) {
47 const ManifoldAbstractTpl<Scalar> &space = dyn_model.space();
48 xs.push_back(space.neutral());
49 forwardDynamics<Scalar>::run(dyn_model, xs[i], us[i], *data, xs[i + 1]);
50 }
51 return xs;
52}
53
56template <typename Scalar>
57void rollout(
58 const std::vector<xyz::polymorphic<ExplicitDynamicsModelTpl<Scalar>>>
59 &dyn_models,
60 const typename math_types<Scalar>::VectorXs &x0,
61 const typename math_types<Scalar>::VectorOfVectors &us,
62 typename math_types<Scalar>::VectorOfVectors &xout) {
63 using DataType = ExplicitDynamicsDataTpl<Scalar>;
64 const std::size_t N = us.size();
65 xout.resize(N + 1);
66 xout[0] = x0;
67 if (dyn_models.size() != N) {
68 ALIGATOR_RUNTIME_ERROR("Number of controls ({:d}) should be the same as "
69 "number of dynamical models ({:d})!",
70 N, dyn_models.size());
71 }
72
73 for (std::size_t i = 0; i < N; i++) {
74 shared_ptr<DataType> data =
75 std::static_pointer_cast<DataType>(dyn_models[i]->createData());
76 dyn_models[i]->forward(xout[i], us[i], *data);
77 xout[i + 1] = data->xnext_;
78 }
79}
80
82template <typename Scalar>
83void rollout(const ExplicitDynamicsModelTpl<Scalar> &dyn_model,
84 const typename math_types<Scalar>::VectorXs &x0,
85 const typename math_types<Scalar>::VectorOfVectors &us,
86 typename math_types<Scalar>::VectorOfVectors &xout) {
87 using DataType = ExplicitDynamicsDataTpl<Scalar>;
88 const std::size_t N = us.size();
89 xout.resize(N + 1);
90 xout[0] = x0;
91
92 shared_ptr<DataType> data =
93 std::static_pointer_cast<DataType>(dyn_model.createData());
94 for (std::size_t i = 0; i < N; i++) {
95 dyn_model.forward(xout[i], us[i], *data);
96 xout[i + 1] = data->xnext_;
97 }
98}
99
101template <template <typename> class C, typename Scalar>
102typename math_types<Scalar>::VectorOfVectors
103rollout(const C<Scalar> &dms, const typename math_types<Scalar>::VectorXs &x0,
104 const typename math_types<Scalar>::VectorOfVectors &us) {
105 const std::size_t N = us.size();
106 typename math_types<Scalar>::VectorOfVectors xout;
107 xout.reserve(N + 1);
108 rollout(dms, x0, us, xout);
109 return xout;
110}
111
113template <template <typename> class C, typename Scalar>
114typename math_types<Scalar>::VectorOfVectors
115rollout(const std::vector<xyz::polymorphic<C<Scalar>>> &dms,
116 const typename math_types<Scalar>::VectorXs &x0,
117 const typename math_types<Scalar>::VectorOfVectors &us) {
118 const std::size_t N = us.size();
119 typename math_types<Scalar>::VectorOfVectors xout;
120 xout.reserve(N + 1);
121 rollout(dms, x0, us, xout);
122 return xout;
123}
124
125} // namespace aligator
ALIGATOR_RUNTIME_ERROR
#define ALIGATOR_RUNTIME_ERROR(...)
Definition exceptions.hpp:7
aligator
Main package namespace.
Definition action-model-wrap.hpp:14
aligator::rollout
math_types< Scalar >::VectorOfVectors rollout(const std::vector< xyz::polymorphic< DynamicsModelTpl< Scalar > > > &dyn_models, const typename math_types< Scalar >::VectorXs &x0, const typename math_types< Scalar >::VectorOfVectors &us, typename math_types< Scalar >::VectorOfVectors &xout)
Perform a rollout of the supplied dynamical models.
Definition rollout.hpp:9
aligator::DynamicsModelTpl
Dynamics model: describes system dynamics through an implicit relation .
Definition dynamics.hpp:14
aligator::DynamicsModelTpl::space
const Manifold & space() const
State space for the input.
Definition dynamics.hpp:32
aligator::DynamicsModelTpl::createData
virtual shared_ptr< Data > createData() const
aligator::ExplicitDynamicsDataTpl
Specific data struct for explicit dynamics ExplicitDynamicsModelTpl.
Definition explicit-dynamics.hpp:56
aligator::ExplicitDynamicsModelTpl
Explicit forward dynamics model .
Definition explicit-dynamics.hpp:20
aligator::ExplicitDynamicsModelTpl::createData
virtual shared_ptr< BaseData > createData() const
aligator::ExplicitDynamicsModelTpl::forward
virtual void forward(const ConstVectorRef &x, const ConstVectorRef &u, Data &data) const =0
Evaluate the forward discrete dynamics.
aligator::ManifoldAbstractTpl
Base class for manifolds, to use in cost funcs, solvers...
Definition manifold-base.hpp:11
aligator::ManifoldAbstractTpl::neutral
VectorXs neutral() const
Get the neutral element from the manifold (if this makes sense).
Definition manifold-base.hpp:27
aligator::forwardDynamics::run
static void run(const DynamicsModelTpl< T > &model, const ConstVectorRef &x, const ConstVectorRef &u, DynamicsDataTpl< T > &data, VectorRef xout, const std::optional< ConstVectorRef > &gap=std::nullopt, const uint max_iters=1000, const T EPS=1e-6)
Definition forward-dyn.hpp:25
aligator::math_types
Typedefs for math (Eigen vectors, matrices) depending on scalar type.
Definition math.hpp:100