Skip to content

Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance

Notifications You must be signed in to change notification settings

StanfordASL/Janson.Ichter.Pavone.IJRR15

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Janson.Ichter.Pavone.IJRR15

Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance

This repo contains the code used for results in the paper "Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance" submitted to IJRR in 2015 by Janson, Ichter, and Pavone of Stanford's Autonomous Systems Lab.

All the C code was run through the Open Motion Planning Library (OMPL) at http://ompl.kavrakilab.org/. The MATLAB planning is run through the runFMT.m file. The Julia code is run through the iPython notebook.

Dependences

Disclaimers

This code is fairly rough and most likely useful as a reference only. It is also subject to changes, bugs, etc. (See disclaimer at https://github.com/schmrlng/MotionPlanning.jl and add a little alpha.)

About

Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published