Alternatives and similar repositories for SDLP

Users that are interested in SDLP are comparing it to the libraries listed below

• ZJU-FAST-Lab / SDQP
  Small-Dimensional Quadratic Programming in Linear Time
  ☆74Updated 3 years ago
• OxDuke / Bilevel-Planner
  Trajectory Generator for MAV using Bilevel Optimization
  ☆40Updated 5 years ago
• ZJU-FAST-Lab / std-trees
  STD-Trees: Spatio-temporal Deformable Trees for Multirotors Kinodynamic Planning
  ☆44Updated 3 years ago
• ZJU-FAST-Lab / VertexEnumeration3D
  Fast Vertex Enumeration for 3D Polytopes
  ☆67Updated 3 years ago
• mit-acl / minvo
  Simplexes with Minimum Volume Enclosing Polynomial Curves
  ☆81Updated last year
• Jinqi-J / Numerical-Optimization-in-Robotics-Homework
  The homework solution of 《Numerical Optimization in Robotics》 of Deepbule, only for studying!
  ☆80Updated 2 years ago
• HKUST-Aerial-Robotics / TimeOptimizer
  Optimal Time Allocation for Quadrotor Trajectory Generation
  ☆93Updated 7 years ago
• mayataka / hpipm-cpp
  C++ interface for hpipm, a high-performance interior point MPC solver
  ☆103Updated 2 years ago
• quimortiz / dynoplan
  ☆109Updated last month
• ZJU-FAST-Lab / kino_sampling_with_regional_opti
  ☆88Updated 3 years ago
• ZJU-FAST-Lab / TGK-Planner
  ☆113Updated 4 years ago
• tomcattiger1230 / ACADOS_Example
  ☆39Updated 7 months ago
• medalotte / sampling-based-planners
  C++ implementation of RRT, RRT*, and Informed-RRT* using kd-tree for searching NN and NBHD nodes. Supports arbitrary dimensions and compi…
  ☆141Updated 4 years ago
• ZhepeiWang / Root-Finder
  Root-Finder is a header-only univariate polynomial solver, which finds/counts all real roots of any polynomial within any interval.
  ☆43Updated 3 years ago
• qwerty35 / lsc_dr_planner
  Online deadlock-free multi-agent trajectory planner using linear safe corridor (LSC)
  ☆73Updated 3 years ago
• rst-tu-dortmund / control_box_rst
  The control_box_rst package provides C++ libraries for predictive control, direct optimal control, optimization and simulation.
  ☆64Updated last year
• 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.
  ☆37Updated 4 years ago
• RoboticExplorationLab / ALTRO
  C++ implementation of ALTRO (Augmented Lagrangian TRajectory Optimizer)
  ☆79Updated 2 years ago
• StarryN / Galaxy
  Generating Large Convex Polytopes Directly on Point Clouds (2D)
  ☆58Updated 3 years ago
• bewimm / kinodynamic_rrt_star
  ☆58Updated 10 years ago
• bjack205 / altro
  A Fast Solver for Constrained Trajectory Optimization
  ☆86Updated 2 years ago
• rdeits / iris-distro
  Iterative Regional Inflation by SDP
  ☆204Updated 5 years ago
• GPrathap / motion_planning
  ☆105Updated 2 years ago
• ZJU-FAST-Lab / Implicit-SDF-Planner
  [IROS 2023] Continuous Implicit SDF Based Any-shape Robot Trajectory Optimization
  ☆257Updated last year
• sikang / DecompROS
  A ROS wrapper for implementing convex decomposition
  ☆228Updated 7 years ago
• siyuanwu99 / traj_opt
  Trajectory generation and optimization
  ☆30Updated 2 years ago
• LeifKingston / Speed-comparison-of-some-QP-solvers
  Speed comparison of QP solvers such as qpOASES, OSQP, casadi, hpipm, acados
  ☆16Updated 4 years ago
• sikang / DecompUtil
  A header only c++ package for convex decomposition using ellipsoids
  ☆271Updated 7 years ago
• ntu-caokun / DIRECT
  a solver-free polynomial trajectory generation framework
  ☆58Updated 3 years ago
• ZJU-FAST-Lab / forces_resilient_planner
  External Forces Resilient Safe Motion Planning for Quadrotor
  ☆66Updated 4 years ago