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.
Sign up for the SourceForge newsletter:
You seem to have CSS turned off.
Please don't fill out this field.