NI Home
Cart Cart | Help
Hello Events Academic NI Developer Zone Support Solutions Products & Services Contact NI MyNI
You are here: 
NI Home > NI Developer Zone > NI Discussion Forums


Reply
Member
Vincento
Posts: 1
0 Kudos

NXT shortest track calculation

Hello,

I have a urgent question. 
One of our teachers has given us the challenge to build an nxt robot that can collect and sort collored balls that are lying on a "playing ground" as shown in picture. (yellow dots are ball locations)
We get the "location" of the collored balls 5 minutes before start of challenge. (We now the places but we dont know which collor will be at what place) so we thought about inserting that by higlighting buttons for one collor of balls and leaving them blank for the other collor balls.
Now, we made VI 's for: turning left/right, stop/riding over a crosspoint (where 2 black lines cross) we can use the ultrasone and light sensors etc... We did lot's of tests with them

But now the problems starts:
We have to write a labview program that can calculate the shortest way to a specified ball (Our goal is to collect 3 balls of same collor at a time before returning to base) following the black lines.
Then transmitting the calculated short track to the nxt true bluetooth. (Shortest way means as less turns obviously).
But we dont have any clue how to program such thing... we only have verry verry basic knowledge of labview and time is really running out...

If anybody has an idea how to make such program or if anybody can give us detailed information on how to program that or if want to be our hero and you can make that program for us...
Please let us know, we are desperate. :smileywink:

Many thanks,
Vincent

(sorry for English mistakes... I'am used to speak dutch :catvery-happy:)
 

Active Participant
ThiCop
Posts: 1,651
0 Kudos

Re: NXT shortest track calculation

Hello Vincent,

 

I do not seem to be able to open your attachment.

 

Is there an error that you're running into?

What algorithm are you trying to implement to solve this problem?

 

Do you need to write a program that calculates the shortest path or the shortest amount of time needed?

Shortest path doesn't necessarily mean for me the least amount of turns.

 

Did you already have a look at this page (http://nxtmastery.com/) to get started with the program?

 

Have you already defined your algorithm in pseudo-code?

This will help you with implementing your algorithm.

Kind Regards,

Thierry C - Platinum Applications Engineer - NI Belgium
CLD

If someone helped you, let them know. Mark as solved and/or give a kudo. :smileywink:
By using this web site, you accept the Terms of Use for this web site. Please read these Terms of Use carefully before using any part of this site. Please go here for information on ni.com's copyright infringement policy.
My Profile | Privacy | Legal | Contact NI © 2011 National Instruments Corporation. All rights reserved.    |    E-Mail this Page E-Mail this Page