Skip to main content
. Author manuscript; available in PMC: 2012 May 9.
Published in final edited form as: IEEE Int Conf Robot Autom. 2011 May 9:667–673. doi: 10.1109/ICRA.2011.5980311

Fig. 8.

Fig. 8

Example 3 – the objective is to identify a single robot with minimal number of segments capable of reaching all six target points. A robot with only three segments was found by the algorithm. The design parameters for this robot are listed in Table I.