Prolog – Mindstorms (I)

The last friday, I received my Lego Mindstorms NXT 2.0 – THANKS! Unfortunately, I lack the necessary power supply in form of 6AA batteries. Clearly, I went to my favorite retailer – Amazon – and ordered a couple of rechargeable ones (including the recharger).

Since my mind is somehow attached to Prolog, I asked myself would it be possible to do the mind-storming in Prolog … so I fired up the information retrieval engine of the day … and hit:

  1. [English] New Mexico State University: Building and Programming Robots
    http://www.cs.nmsu.edu/~tson/classes/fall03-579/schedule.htm
  2. [German] University of Potsdam: Programmieren in Prolog
    http://www.cs.uni-potsdam.de/wv/03SS/aktuell.html#SECTION00051000000000000000
  3. [German] Toni Gläser: LEGOLOG - Lego Mindstorms und ein Golog-Planer Eine Einführung und ein Überblick über das Konzept und die
    Programmierung sowie die Implementation von Aufgaben für
    den Roboter
    http://www.kbs.uni-hannover.de/~brase/Paper/studienarbeit_Prolog.pdf
  4. [English] Fermé and Gaspar: RCX+PROLOG
    A platform to use Lego Mindstorms™ Robots in
    Artificial Intelligence courses
    http://dme.uma.pt/ferme/Papers/Ferme-Gaspar07.pdf
  5. [English] University of Toronto: Cognitive Robotics
    http://www.cs.toronto.edu/cogrobo/main/systems/index.html
  6. [English] Nalepa: Prototype Prolog API for Mindstorms NXT
    http://www.springerlink.com/content/9r47108w18835742/

Clearly, I will inspect some of these resources soon to see what’s in the Lego Prolog toolbox. Until then happy robot-building.

Comments

Nils Ritter said…
This comment has been removed by the author.
7:24 PM
Nils Ritter said…
Mind Storms? Coole Sache, wie kommsten da drauf?
7:26 PM
Post a Comment

Popular posts from this blog

Adventures In Prolog - ProjectEuler20

Continuing with the Euler Quest, a simple and straight-forward solution to Project Euler's problem 20 is presented. The problem statement reads: Find the sum of the digits in the number 100! Where ! denotes the faculty operator. One (simple) way to solve the problem goes as follows: Firstly, calculate the value of 100!. Secondly, convert the value into a list of digits. Thirdly, sum each digit. Lastly, output the cumulative result. A translation of this solution may read like: euler_20_1(F, Out) :- fac(F, Fac), string_to_list(Fac, CList), euler_20_1_t(CList, 0, Out), !. euler_20_1_t([], Current, Current). euler_20_1_t([X|Y], Current, Out) :- number_chars(N, [X]), NewCurrent is Current + N, euler_20_1_t(Y, NewCurrent, Out). The fac predicate computes the faculty of some positive integer number. string_to_list is a built-in predicate converting a string into its character list representation and number chars converts between ascii character code and number. Building only...
Read more

Adventures In Prolog - Duplicate List Members

Today's post is about problem 14 from the list of 99 Prolog problems (see here ): (*) Duplicate the elements of a list. Example: ?- dupli([a,b,c,c,d],X). X = [a,a,b,b,c,c,c,c,d,d] Since the problem is marked with one star, a solution should be within reach. Now, to duplicate each element of the list, we do the following: We traverse the list element by element until we reach the last element, i.e. the empty list. For each element (excluding the empty list), the element is added twice to a newly built output list. Given the above solution statement, a possible translation to Prolog code might look like this: dupli([], []). dupli(L, O) :- dupli_t(L, [], O). dupli_t([], Current, Current). dupli_t([H|T], CList, OutList) :- append(CList, [H, H], IntermediateList), dupli_t(T, IntermediateList, OutList).
Read more
Well not much happened today. I was able to implement a triangle filling routine and read a bit on .NET remoting. I thought about how to implement a Z-Buffer for my small system and thought about homogenous clipping as well. The problems I have right now are: I want to implement basic triangle 2D screen-space clipping. Which itself is not a big deal but I do not want to implement a polygon filling scan-line algorithm. A polygon may be the outcome of a triangle clipped against a rectangular clip window. So what is there to do ? Either clip a triangle which produces a polygon and implement a "simple" scanline algorithm to fill that polygon. The other option is of course to split the triangle into a series of triangles. Either way has its intricacies. As mentioned in yesterday's I want to implement homogenous clipping for triangles. Which makes things even more complicated then a simple 2D clipper. The reason is that not only a triangle can be split into a series of triangle...
Read more