Alternatives and similar repositories for discrete-frechet

Users that are interested in discrete-frechet are comparing it to the libraries listed below

• cjekel / similarity_measures
  Quantify the difference between two arbitrary curves in space
  ☆261Updated last month
• amodeus-science / amodeus
  Autonomous Mobility-on-Demand Extremely Useful Simulation
  ☆50Updated last year
• cyang-kth / maximum-coverage-location
  A Python library for solving maximum coverage location problem
  ☆67Updated 6 years ago
• strongio / torchcast
  Forecasting with PyTorch
  ☆55Updated 2 months ago
• AlexanderFabisch / gmr
  Gaussian Mixture Regression
  ☆196Updated 3 months ago
• airbus / scikit-decide
  AI framework for Reinforcement Learning, Automated Planning and Scheduling
  ☆179Updated last week
• SmartMobilityAlgorithms / book
  This is the site for ECE1724H: Bio-inspired Algorithms for Smart Mobility, https://smartmobilityalgorithms.github.io/book/index.html
  ☆41Updated 2 years ago
• dietmarwo / fast-cma-es
  A Python 3 gradient-free optimization library
  ☆149Updated 3 months ago
• bguillouet / traj-dist
  A python package for computing distance between 2D trajectories.
  ☆337Updated 2 years ago
• boisgera / control-engineering-with-python
  Control Engineering with Python
  ☆75Updated 2 months ago
• DLR-VF / TAPAS
  ☆21Updated 2 months ago
• NoemieJaquier / GaBOtorch
  This repository contains the source code to perform Geometry-aware Bayesian Optimization (GaBO) on Riemannian manifolds.
  ☆53Updated 4 years ago
• srom / cma-es
  Covariance Matrix Adaptation Evolution Strategy (CMA-ES)
  ☆72Updated 3 years ago
• chariff / GPro
  Python package for Preference Learning with Gaussian Processes.
  ☆34Updated 2 months ago
• osqp / osqp-python
  Python interface for OSQP
  ☆124Updated this week
• Mogeng / IOHMM
  Input Output Hidden Markov Model (IOHMM) in Python
  ☆172Updated last year
• Jiaoyang-Li / Flatland
  Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.
  ☆68Updated 4 years ago
• LearningByDoingCompetition / learningbydoing-comp
  LearningByDoing NeurIPS 2021 Competition: Standalone Code and Results
  ☆19Updated 3 years ago
• SebMilardo / TDSP
  Finding the Time-Dependent Shortest Path over Large Graphs in Python
  ☆19Updated 7 years ago
• jvkersch / pyconcorde
  Python wrapper around the Concorde TSP solver
  ☆389Updated 7 months ago
• joaopedroso / scipbook
  ☆67Updated 6 years ago
• befelix / SafeOpt
  Safe Bayesian Optimization
  ☆150Updated 3 years ago
• TaipanRex / pyvisgraph
  Given a list of simple obstacle polygons, build the visibility graph and find the shortest path between two points
  ☆230Updated 4 years ago
• cerebis / LKH3
  Github mirror of Keld Helsgaun's wonderful LKH3 project.
  ☆30Updated 5 years ago
• bstellato / mlopt
  The Machine Learning Optimizer
  ☆106Updated 2 years ago
• thangbui / streaming_sparse_gp
  Streaming sparse Gaussian process approximations
  ☆68Updated 3 years ago
• Yusufma03 / pfrnns
  Particle Filter Recurrent Neural Networks (AAAI 2020)
  ☆78Updated last year
• jayachithra / T-DBSCAN
  Python implementation of T-DBSCAN clustering algorithm for Spatiotemporal Density Clustering. Original paper:
  ☆15Updated 2 years ago
• cvxgrp / auto_ks
  Repository for "Fitting a Kalman Smoother to Data"
  ☆60Updated last year
• AIysl / mapmatching-
  Trajectory Inference
  ☆15Updated 6 years ago