000097603 001__ 97603
000097603 005__ 20180127202433.0
000097603 037__ $$aREP_WORK
000097603 245__ $$aA Light Formulation of the E* Interpolated Path Replanner
000097603 269__ $$a2006
000097603 260__ $$c2006
000097603 336__ $$aReports
000097603 500__ $$aTechnical Report
000097603 520__ $$a  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. 
000097603 6531_ $$ainterpolation
000097603 6531_ $$areplanning
000097603 6531_ $$amobile robot
000097603 6531_ $$aObstacle Avoidance
000097603 700__ $$0240970$$aPhilippsen, R.$$g103090
000097603 8564_ $$uhttp://estar.sourceforge.net/$$zProject Web Site
000097603 8564_ $$iINTERNAL$$uhttps://infoscience.epfl.ch/record/97603/files/philippsen--estar-TR06.pdf$$xPUBLIC$$zn/a
000097603 909C0 $$0252186$$pLSA
000097603 909CO $$ooai:infoscience.tind.io:97603$$preport
000097603 937__ $$aLSA-REPORT-2006-001
000097603 970__ $$a720/LSA
000097603 973__ $$aEPFL$$sPUBLISHED
000097603 980__ $$aREPORT