Step cost
= Step cost
{title2=$c(s,a,s')$}
A <step cost> is the cost of one action or transition in a <search problem>. The accumulated <path cost> is the <sum> of the <step costs> along its action history. A uniform positive lower bound on <step costs> makes every bounded-cost action history have bounded <search depth>; positivity of each individual term alone does not establish such a bound.