Presentation is loading. Please wait.

Presentation is loading. Please wait.

Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan.

Similar presentations


Presentation on theme: "Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan."— Presentation transcript:

1 Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan

2 Content n 1 st section (3/4) – Pre-compute a global roadmap – Graph search (ini  goal) in real-time – Display motion n 2 nd section (1/4) – User-steered exploration

3 Basic Idea Preprocessing phase Runtime algorithm

4 Precomputation: Sampling Gravity Shooting rays Random Rays

5 Precomputation: Sampling Gravity Shooting rays өө Walkable surface Construct roadmap -Max # of samples -Min dist between samples

6 Connectors - Rc > Rg Rc Guards & Connectors (C-space) Reachability (vs. visibility) RgRg Guards - guards can’t see each other

7 - yes  reject c, goto while c - no! c becomes a Guard, connect to connectors (if any), goto while Algorithm (build_roadmap) While (map_coverage < P_cover), do// map_coverage = guards_reachable/entire_space Return roadmap Connector Guard Connector Guard Connector Guard 2. Can c be a Connector? See any Guards in Rc? - Yes  then connect, goto while (else goto 3) 1. Pick a random config. c c 3. Can c be a Guard? See any Guards in Rg? c Be a ConnectorBe a GuardBe rejected

8 Search for a path: init  goal n Initial position (Rc radius) ini goal n Goal position n Graph search…

9 Display Motion: Smooth Path n Walk along the path ini goal n Smoothing path (cutting redundant corners while walking)

10 User-steered exploration (local walk) n User has control – A directional vector n Robot always stays on a walkable surface – In free space – Surface within a tolerance angle – Steps ok, cliffs NO!! n Robot do not penetrate objects

11 Local Walk Algorithm n Follow the directional vector, if - Goal is reached, stop - Collision, project along obstacle edge - New surface, step up/down (not a cliff!) - Edge, step up/down or project along the edge

12 Discussion n Can deal with complex environment – Because it pre-computes a global roadmap. n Still… – Pre-computation could be time consuming. – Walking along line segments does not look natural. n Overall assessment: Pretty good


Download ppt "Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan."

Similar presentations


Ads by Google