Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
The E* algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions as a sampled continuous crossing-time map that takes into account a risk measure. Replanning means that changes in the environment model can be repaired to avoid the expenses of complete planning. This helps compensating for the increased computational effort required for interpolation.
Alfio Quarteroni, Francesco Regazzoni
Colin Neil Jones, Paul Scharnhorst, Rafael Eduardo Carrillo Rangel, Pierre-Jean Alet, Baptiste Schubnel
Volkan Cevher, Thomas Michaelsen Pethick, Wanyun Xie