Coder Social home page Coder Social logo

smooth's People

Contributors

pettni avatar tgurriet avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

smooth's Issues

Sort out static size vs dynamic size

  • Remove dynamic size Lie groups?
  • Add size argument in Default
  • Include tests for dynamically sized types
  • Define dynamically sized LieGroup interface for std::variant<LieGroup ...>

Reparameterization: Fixed complexity

Split into a fixed number N of points that partition [0, S]

It holds that v(t + \delta) = \sqrt(v(t)^2 + 2 \delta a), where a is constant acceleration on [s(t), s(t+\delta)].

Reverse pass: calculate maximal v(t) for each point

Forward pass: use maximal a subject to constraints from reverse pass, also calculate t's

Can work in v^2 to avoid square roots.

Stretch: higher orders and use interval reachability in reverse pass?

Redo internals with free functions

Implement Lie group operators with free functions

Types keep their "native" API

Concept checks that free functions are available

This would be a breaking change, i.e. g.log() becomes log(g) and G::exp(v) becomes exp<G>(v)

Higher-degree curves

1. Fit PiecewiseBezier that minimizes integral over k:th derivative

Given knot points (t_i, x_i), i = 0, ..., n-1, solve

min ∫ \| x^{(k)} (t) \|^2 dt
s.t     x(t) k times continuously differentiable (continuity at knots)
         x(t_i) = x_i, i = 0, ..., n-1

Each interval is defined by a PiecewiseBezier.

  • Decision variables are the (k+1) difference vectors of the Bezier components for each interval
  • Continuity at knots can be linearly approximated from formulas for Bernstein polynomial derivatives
  • Objective function can be linearly approximated to be quadratic in decision variables, can find coefficients from Bernsteil polynomial derivatives and integrals

https://en.wikipedia.org/wiki/Bernstein_polynomial

2. Template curve class on polynomial degree

3. Make order arbitrary in reparameterization

Manifold is too restrictive

Some types (e.g. AnyManifold) are difficult/impossible to adapt to the Manifold concept due to these requirements:

  • Castable
  • Default-constructible

Todo: List where those two requirements are necessary.

Solution: Break up into multiple concepts, where the "base" type does not have those requirements.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.