13.07.2015 Views

Robotic Motion Planning: Bug Algorithms

Robotic Motion Planning: Bug Algorithms

Robotic Motion Planning: Bug Algorithms

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Transition from <strong>Motion</strong>-to-GoalChoose the pt O ithat minimizesd(x,O i) + d(O i,q goal)M is the point on the “sensed”obstacle which has the shorteddistance to the goalProblem: what if this distancestarts to go up?Ans: start to act like a BUG andfollow boundaryFollowed obstacle: the obstaclethat we are currently sensingBlocking obstacle: the obstaclethat intersects the segmentThey start as the sameFor any O i such that d(O i ,q goal ) < d(x,q goal ),choose the pt O i that minimizes d(x,O i ) + d(O i ,q goal )16-735, Howie Choset with slides from G.D. Hager and Z. Dodds

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!