Skip to main content
. 2021 Jul 15;21(14):4828. doi: 10.3390/s21144828
Algorithm 1 BuildTree*(q0,x0,goal)
TW.INIT(q0,goal);
TX.INIT(x0,goal);
while tlimit do
  qrand RandomSample();
  [Qnew,Qnear,type] ExtWorkSpace(TW,qrand);
  Qnearlist NearNodeList(Qnew,Br)
  [Xp,Xmin] FindParentState*(Qnearlist,qnew,type);
  if Xp=nil then
   continue;
  end if
  TW.Add(Qnear,Qnew);
  TX.Add(Xp,Xmin);
  ReConnectTrees(Qnew,Xmin);
end while
return;