| Abstract
|
<p>The E* algorithm is a path planni … <p>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 thatchanges 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.</p>fort required for interpolation.</p>
|
| Author
|
Roland Philippsen +
|
| Diva
|
http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:576987
|
| PublicationType
|
Report +
|
| Publisher
|
Autonomous Systems Lab, Ecole Polytechnique Federale de Lausanne +
|
| Title
|
A Light Formulation of the E* Interpolated Path Replanner +
|
| Year
|
2006 +
|
| Has queryThis property is a special property in this wiki.
|
Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
, Publications:A Light Formulation of the E* Interpolated Path Replanner +
|
| Categories |
Publication +
|
| Modification dateThis property is a special property in this wiki.
|
30 September 2016 20:40:42 +
|
