ZJU-FAST-Lab / SDLP

Related projects: ⓘ

• ZJU-FAST-Lab / SDQP
  Small-Dimensional Quadratic Programming in Linear Time
  ☆61Updated 2 years ago
• OxDuke / Bilevel-Planner
  Trajectory Generator for MAV using Bilevel Optimization
  ☆37Updated 4 years ago
• mayataka / hpipm-cpp
  C++ interface for hpipm, a high-performance interior point MPC solver
  ☆88Updated last year
• ZJU-FAST-Lab / VertexEnumeration3D
  Fast Vertex Enumeration for 3D Polytopes
  ☆52Updated 2 years ago
• mit-acl / minvo
  Simplexes with Minimum Volume Enclosing Polynomial Curves
  ☆70Updated 8 months ago
• RoboticExplorationLab / ALTRO
  C++ implementation of ALTRO (Augmented Lagrangian TRajectory Optimizer)
  ☆48Updated last year
• ytwboxing / Speed-comparison-of-some-QP-solvers
  ☆43Updated this week
• bjack205 / altro
  A Fast Solver for Constrained Trajectory Optimization
  ☆67Updated last year
• mrsd16teamd / iLQR_onboard
  C++ implementation of iLQR
  ☆12Updated 7 years ago
• ZJU-FAST-Lab / std-trees
  STD-Trees: Spatio-temporal Deformable Trees for Multirotors Kinodynamic Planning
  ☆41Updated 2 years ago
• tomcattiger1230 / ACADOS_Example
  ☆32Updated last year
• quimortiz / dynoplan
  ☆44Updated this week
• StarryN / Galaxy
  Generating Large Convex Polytopes Directly on Point Clouds (2D)
  ☆41Updated 2 years ago
• qwerty35 / lsc_dr_planner
  Online deadlock-free multi-agent trajectory planner using linear safe corridor (LSC)
  ☆59Updated last year
• ZhepeiWang / Root-Finder
  Root-Finder is a header-only univariate polynomial solver, which finds/counts all real roots of any polynomial within any interval.
  ☆39Updated last year
• mit-acl / separator
  Linear separability (via planes) of two sets of 3D points
  ☆12Updated 2 years ago
• ntu-caokun / DIRECT
  a solver-free polynomial trajectory generation framework
  ☆50Updated last year
• krishauser / SemiInfiniteOptimization
  Code accompanying the paper "Semi-Infinite Programming for Trajectory Optimization with Nonconvex Obstacles" by K. Hauser
  ☆47Updated 4 years ago
• HKUST-Aerial-Robotics / TimeOptimizer
  Optimal Time Allocation for Quadrotor Trajectory Generation
  ☆83Updated 5 years ago
• optimusride / altro-cpp
  A non-linear trajectory optimization library developed by Optimus Ride, Inc. This library implements a C++ version of the original open-s…
  ☆121Updated last year
• ZJU-FAST-Lab / kino_sampling_with_regional_opti
  ☆73Updated 2 years ago
• sauravag / bsp-ilqg
  Belief Space Motion Planning Using iLQG
  ☆32Updated 6 years ago
• ZJU-FAST-Lab / Root-Finder
  Root-Finder is a header-only univariate polynomial solver, which finds/counts all real roots of any polynomial within any interval.
  ☆35Updated 3 years ago
• ShuoYangRobotics / equality-constraint-LQR-compare
  ☆42Updated 3 years ago
• vvanirudh / iLQR
  Iterative LQR for a differential drive robot C++
  ☆22Updated 5 years ago
• UMich-BipedLab / CLF_reactive_planning_system
  This package provides a CLF-based reactive planning system, described in paper: Efficient Anytime CLF Reactive Planning System for a Bipe…
  ☆54Updated 2 years ago
• enhatem / quadrotor_mpc_acados
  MPC implementation for quadrotors using acados
  ☆25Updated 2 years ago
• nuft / sqp_solver
  [Experimental] A SQP solver implemented with Eigen.
  ☆73Updated 4 years ago
• LaplaceKorea / Speed-comparison-of-some-QP-solvers
  Speed comparison of QP solvers such as qpOASES, OSQP, casadi, hpipm, acados
  ☆12Updated 2 years ago
• Jinqi-J / Numerical-Optimization-in-Robotics-Homework
  The homework solution of 《Numerical Optimization in Robotics》 of Deepbule, only for studying!
  ☆68Updated last year