On Improving the Clearance for Robots in High-Dimensional Configuration Spaces Roland Geraerts and Mark Overmars IROS 2005

Outline Related work Retraction algorithm Algorithmic details Experiments Conclusions

Related Work Preprocessing techniques –Extract path from graph with cycles –Create path along the medial axis Post processing technique –Retract path to the medial axis (MA) d d

Related Work Preprocessing techniques –Extract path from graph with cycles –Create path along the medial axis Post processing technique –Retract path to the medial axis (MA)

Related Work Preprocessing techniques –Extract path from graph with cycles –Create path along the medial axis Post processing technique –Retract path to the medial axis (MA) Initial path Retraction to MA Retraction to ridges

Retraction Algorithm

Algorithmic Details – Metric

Algorithmic Details – Vector

Algorithmic Details – Validate maximum step size

Experimental Setup Pentium 4 (2.66GHz) Comparison of retraction techniques –Workspace (1 run) –Configuration space (100 runs) Environments / paths planar (2 dofs) hole (6 dofs) manipulator (6 dofs)

Experimental Results minavgtime initial workspace C-space initial paths workspace C-space n.a. Clearance minavgtime initial workspace C-space minavgtime initial workspace C-space 0.01 n.a n.a n.a. 60.0

Conclusions Clearance along paths is improved –No complicated data structures are needed –The algorithm can handle robots with an arbitrary amount of DOFs Running times are too high for online usage –Does not matter for high-cost environments –Smarter implementation decreased the running times by an order of magnitude

Current Work Retraction of a roadmap yields online performance Reachability roadmapRetracted roadmap

Current Work Retraction of a roadmap yields online performance Reachability roadmapRetracted roadmap