Assembly Sequence Planning for Rectangular Modular Robots with Accessibility Constraints

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg3"><tr><td colspan="2">1: Remove <i>s</i> from G.Tree[parent(<i>s</i>)]</td></tr><tr><td colspan="2">2: <b>While</b> G.Tree[<i>s</i>] is not empty <b>do</b></td></tr><tr><td colspan="2">3:  Pop the first element <i>w</i> from G.Tree[<i>s</i>]</td></tr><tr><td colspan="2">4:  Mark <i>w</i> as undiscovered</td></tr><tr><td colspan="2">5:  deleteBranch (<i>G</i>, <i>w</i>)</td></tr></table></td></tr></table>

<div> deleteBranch (<i>G</i>, <i>s</i>).</div>

Journal of Robotics

alg3

Algorithm 3

Algorithm 3: Assembly Sequence Planning for Rectangular Modular Robots with Accessibility Constraints 