International Scholarly Research Notices

Research Article

SPAM for a Manipulator by Best Next Move in Unknown Environments

Algorithm 2

BNM path planning.
: initial location for th expansion
,
do while ,
 if (min d(, )
  return (success)  /* A path has been found!
 else
  for   /*  : number of point could in
        
  next
   /*: dominant point in
 end if
 if
   /* jump to a new free conf with min density
           /* distribution
 else
    /* initial location for next expansion
 end if
 call Algorithm 1
  /*update RRT Tree
end do
return (failure)