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 >

License

GNU General Public License version 2.0 (GPLv2)

Follow E* Interpolated Graph Replanner

E* Interpolated Graph Replanner Web Site

You Might Also Like
Tigerpaw One | Business Automation Software for SMBs Icon
Tigerpaw One | Business Automation Software for SMBs

Fed up with not having the time, money and resources to grow your business?

The only software you need to increase cash flow, optimize resource utilization, and take control of your assets and inventory.
Rate This Project
Login To Rate This Project

User Ratings

★★★★★
★★★★
★★★
★★
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

There are no 3 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