(self, start_node, end_node)
return positions_plan
Recovers positions to be reached by agent after the start node to reach the end node
Recovers positions to be reached by agent after the start node to reach the end node
Recovers positions to be reached by agent after the start node to reach the end node
def _get_position_plan_from_graph(self, start_node, end_node):
        """Recovers positions to be reached by agent after the start node to reach the end node"""
        node_path = self.graph_problem.get_node_path(start_node, end_node)
        assert node_path[0] == start_node and node_path[-1] == end_node
        positions_plan = [state_node[0] for state_node in node_path[1:]]
        return positions_plan
def _get_position_plan_from_graph ( self , start_node , end_node ) : node_path = self . graph_problem . get_node_path ( start_node , end_node ) assert node_path [ 0 ] == start_node and node_path [ - 1 ] == end_node positions_plan = [ state_node [ 0 ] for state_node in node_path [ 1 : ] ] return positions_plan