Path cost
= Path cost
{title2=$g(n)=\sum_{e\in\operatorname{path}(n)}c(e)$}
The sum of step costs along the action history represented by a <search node>. Positive costs give lower bounds on <search depth>, and the same physical state can have different <path costs> when reached along different histories. <Uniform-cost search> orders by accumulated cost; <A-star search> adds an estimate of remaining cost.