comrob/cetsp-bezier-gsoa comrob/cetsp-bezier-gsoa

  • Stars
    star
    1
  • Language
    C++
  • Created over 6 years ago
  • Updated over 6 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
comrob/cetsp-bezier-gsoa
github

comrob

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

GSOA based solution of the survelliance planning with Bézier curves formulated as a multi-vehicle variant of the Close Enough Traveling Salesman Problem (CETSP)

More Repositories

1

Dubins3D.jl

Julia package to compute 3D Dubins Paths
Julia
34
star
2

gdip

Optimal solution of the Generalized Dubins Interval Problem (GDIP)
C++
18
star
3

ceop-grasp

GRASP based solver for the Close Enough Orienteering Problem
C++
8
star
4

AcceleratedDubins.jl

Computing multi-radius Dubins path, which allows to increase the vehicle's speed. This can decrease total travel time.
Julia
5
star
5

gsoa

Growing Self-Organizing Array (GSOA)
C++
4
star
6

ceop-hnn-socp

Hopfield Neural Network for the Close Enough Orienteering Problem
C++
4
star
7

OptimalDTSPN

Optimal solver for the Dubins Traveling Salesman Problem with Neighborhoods
HTML
3
star
8

crl

Computational Robotics Library
C++
1
star
9

ctu_cras_norlab_hexapod_controller

CTU-CRAS-NORLAB team DARPA Subterranean Challenge Multi-legged robots locomotion controller
C++
1
star