There are four problems oe arenas to plan. Each arena corner points are (-0.5,-0.5) and (10.5,10.5). Start at (0,0) and reach target (10,10) in each case. Provide the matlab code or C code (that produces the path in an iRobot path file). Code similarity will be checked and will lead to F.

<UL>
<LI> <A HREF=map1.txt> map1.txt</A>
<LI> <A HREF=map2.txt> map2.txt</A>
<LI> <A HREF=map3.txt> map3.txt</A>
<LI> <A HREF=map4.txt> map4.txt</A>
</UL>