Path Planning for Minimizing the Expected Cost until Success

20 Aug 2018 Muralidharan Arjun Mostofi Yasamin

Consider a general path planning problem of a robot on a graph with edge costs, and where each node has a Boolean value of success or failure (with respect to some task) with a given probability. The objective is to plan a path for the robot on the graph that minimizes the expected cost until success... (read more)

PDF Abstract
No code implementations yet. Submit your code now