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
Host LLMs in Production With On-Demand GPUs Icon
Host LLMs in Production With On-Demand GPUs

NVIDIA L4 GPUs. 5-second cold starts. Scale to zero when idle.

Deploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
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

  • 5 out of 5 stars
    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