The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.

Project Activity

See All Activity >

Categories

Robotics, Artificial Intelligence

License

GNU General Public License version 2.0 (GPLv2)

Follow E* Interpolated Graph Replanner

E* Interpolated Graph Replanner Web Site

You Might Also Like
Find out just how much your login box can do for your customer | Auth0 Icon
Find out just how much your login box can do for your customer | Auth0

With over 53 social login options, you can fast-track the signup and login experience for users.

From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
Sign up
Rate This Project
Login To Rate This Project

User Ratings

5.0 out of 5 stars
★★★★★
★★★★
★★★
★★
★
1
0
0
0
0
ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

User Reviews

Filter Reviews:
★★★★

There are no 4 star reviews.

Additional Project Details

Operating Systems

Linux, BSD

Intended Audience

Science/Research

User Interface

OpenGL, Command-line

Programming Language

C++

Related Categories

C++ Robotics Software, C++ Artificial Intelligence Software

Registered

2006-03-07
Report inappropriate content