<?xml version="1.0" encoding="ISO-8859-1" ?><rss version="2.0">
<channel>
    <title>RoboRealm Forum</title>
    <link>http://www.RoboRealm.com/</link>
    <description>The newest forum threads.</description>
    <lastBuildDate>Tue, 30 Nov 1999 00:11:00 EST</lastBuildDate>
    <language>en-us</language>
    <copyright>Copyright: (C) RoboRealm, http://www.RoboRealm.com/</copyright>
    <docs>http://www.RoboRealm.com/</docs>

    <item>
        <title>No Title</title>
        <description>
        Edgar,&lt;br&gt;&lt;br&gt;Do you have a more specific question as that is quite a wide field. We used both a cellular technique when restricted to a particular path and a typical TSP (Traveling Salesman Problem) type algorithm when not restricted to a particular path. Either is chosen depending on the problem at hand.&lt;br&gt;&lt;br&gt;STeven.        </description>
        <link>http://www.roborealm.com/forum/index.php?thread_id=2754</link>
        <guid>http://www.roborealm.com/forum/index.php?thread_id=2754</guid>
        <pubDate>Tue, 30 Nov 1999 00:11:00 EST</pubDate>
    </item>
    <item>
        <title>ACRI</title>
        <description>
        I was investigating about ACRI, and I arrive to Automatas Cellular Stuffs.&lt;br&gt;&lt;br&gt;I would like to know how you were able to implement this algorithms in your path planning module.&lt;br&gt;&lt;br&gt;&lt;br&gt;This subject seems to me very interesting!&lt;br&gt;&lt;br&gt;Thanks in advance.&lt;br&gt;&lt;br&gt;        </description>
        <link>http://www.roborealm.com/forum/index.php?thread_id=2754</link>
        <guid>http://www.roborealm.com/forum/index.php?thread_id=2754</guid>
        <pubDate>Tue, 30 Nov 1999 00:11:00 EST</pubDate>
    </item>
</channel>
</rss>
