]> 2026-04-04T18:16:32+02:00 Publications:An Interpolated Dynamic Navigation Function 500 en <p>The Ez.ast; algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of an underlying smooth goal distance that takes into account a continuous notion of risk that can be controlled in a fine-grained manner. E* results in more appropriate paths during gradient descent. Dynamic replanning means that changes in the environment model can be repaired to avoid the expenses of complete replanning. This helps compensating for the increased computational effort required for interpolation. We present the theoretical basis and a working implementation, as well as measurements of the algorithm's precision, topological correctness, and computational effort. © 2005 IEEE.</p> 2005 IEEE International Conference on Robotics and Automation (ICRA), Barcelona, Spain, 18-22 April, 2005 http://dx.doi.org/10.1109/ROBOT.2005.1570697 http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:576973 3789 Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005. ICRA 2005, Vols 1-4 Conference Paper Robotics and automation ; 2005 3782 An Interpolated Dynamic Navigation Function 2005 2016-09-30T20:40:43Z 2457662.3616088 An Interpolated Dynamic Navigation Function 500 0 plainlist list 1 [[:Publications:An Interpolated Dynamic Navigation Function]] An Interpolated Dynamic Navigation Function# QUERY090f35ab2cbf73b1832440578bf30c8f 500 [2,"smw-datavalue-property-restricted-annotation-use","Publisher"] An Interpolated Dynamic Navigation Function# ERR6c155b5d70b69ddb590b4f2e73389c2a 500 [2,"smw-datavalue-property-restricted-annotation-use","Author"] An Interpolated Dynamic Navigation Function# ERRe24f17e090c98448f3de99d03182b7b6