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

Other Useful Business Software
Train ML Models With SQL You Already Know Icon
Train ML Models With SQL You Already Know

BigQuery automates data prep, analysis, and predictions with built-in AI assistance.

Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
Start Free
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

  • Thanks for so usefull software.
    1 user found this review helpful.
Read more reviews >

Additional Project Details

Operating Systems

BSD, Linux

Intended Audience

Science/Research

User Interface

Command-line, OpenGL

Programming Language

C++

Related Categories

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

Registered

2006-03-07