![]() |
Solution to Timing Loops
I have found out how to time. Based of the information from Innovation First, a loop is every 26.2 ms, assuming your code does't lengthen it. Based off of that, there are 38.167938931297709923664122137405 loops per sec. So to do close timing without overloading the stamp, you do:
Time VAR byte RealTime VAR byte Time = Time + delta_t + 1 if Time > 38 then Time = Time - 38 RealTime = RealTime + 1 EndIf This way only uses 2 bytes insted of a byte and a word. I tryed the delta_t * 262 / 10 but it overloaded the stamp and was very inaccurate. Based of of this formula, then the basic stamp will be 0.530431579 seconds fast at end of match. You can check this information on this xls I inclosed. |
Dear god thats great
:D i must applaud you for your idea. I myself, being a rookie programmer on a rookie team, am just getting the hang of the language, but after reading the forum got this idea yesterday, but then flushed it out, on one basis. doesn't delta_t count the total number of packets missed since starting the program? :confused:
-Anthony |
Re: Dear god thats great
Quote:
|
thats good to hear, you always want to check your bases. you know, play it safe.
-Anthony |
Did you get the xls. If you guys didn't, then can I have a email address if you want a copy or to post it in the internet
|
You can attach it to your post as a file. That would probably be best. That way everyone can download it straight from here.
|
Re: Solution to Timing Loops
Quote:
It's really not that hard to just figure out the numbers by guess and check. You can do a timer with 2 bytes too, only difference is that you can only count to 255, and when you reach this number you simply start a new step, as documented in my programming sample in the white papers. |
If you do the research like I did, then you would see that a loop is 26.2 ms a loop. If your code is shorter then you wait at serin until you get the information and start the loop over. If you take too long in your code, then the delta_t comes in. It count the number of loops you missed as long as it is in the serin. If you miss 5 serins then you have the basic run error. So in theory, this should be accurate.
|
all i know is this code works. I played with basic autonomous mode today (this isn't that sad, seeing as i am the only real programmer at my school, this is a rookie team, and i have taught myself almost all of the code) and this works like a charm. Since most people only use timing in auton mode, you will only be off by about .066 seconds, and that is extremely insignificant. (It was so little that i didn't notice at all)
-Anthony |
one question. why the timing loops? why not just a counter?
i made a little program a few days ago, all it does is use a byte and a nibble, and based on the counter and nibble advances through a select case. all you do to control it is adjust the byte to how high to count, and always advance the nibble by one. you can get up to 18 operations in this way, actually more if you don't use the full 255 loops from one byte at a time. if this doesn't make sense, i'll post the code tomorrow afternoon when i find it. it's very simple when you see it, and it works fine. no need to worry about time, because if the loop gets longer, even a timer would get screwed up. |
Yeah, that's pretty much what I did. It seems to me that it does the exact same thing with less complexity and the exact same efficiency if done correctly.
|
First, this thread starter knows what he's talking about. Second, a counter counts loops. The number of loops you get in one second changes. Don't believe me:
copy a simple statement 100 times, or use some calc in your program and see how slow the counter goes. I can forsee that this years coding is that complex when compared to last years (all we needed were a few if statements). The delta_t is the only TRUE thing in your code, so it is imperative that you do the auton mode the way suggested, and do NOT use counters. GUESS AND CHECK IS NOT HELPING US LEARN ANYTHING |
uh, i can control how long it does something based on counting with cycles AND delta_t. it's the same as a timing loop, minus the extra memory and added difficulty. and i've seen no problems so far with my code. sure, it aint pretty, but it's dead reckoning, it's not supposed to be!
|
There is no advantage to converting Stamp loops to "real" time. It is a 1-to-1 conversion, meaning that each "real" time value corresponds to some fixed number of loops and vice-versa. For example, the following code would do exactly the same thing:
Code:
loopCnt VAR byteQuestions about the above stuff? Email or PM me and I'd be more than happy to explain. |
Once again you correct me!!! Oh, I'm lazy anyway but thanks for the free code. Only one question have I:
where'd you get the 8 from in SELECT(loopCntHigh<<8 + loopcnt) i think you and i are on the same page (only i'm on a different plane) , and its great learning from you!!! |
Yes! He explained it better than I did. One thing that I would add is if you are really strained for RAM is that you could keep the counter a byte and if you need numbers bigger than the byte will supply, just add steps until you get the length you need.
|
Quote:
Here's an example: Assume loopCntHigh is 3 (0011 in binary), meaning we've looped through 256 values of loopCnt 3 times. Assume loopCnt is 199 (11000111). Then: loopCntHigh<<8=001100000000 Add loopCnt: 001111000111, which is 967. This makes sense as 256*3+199=967. Does that make any sense? Bit shifting operations are always messy, but sometimes they are the easiest solution to problems like this (a single number spanning multiple variables). |
Rob: Is there a place online that documents the mathematical limits of PBasic?
I ask because I like your bytevariable<<8+nibblevariable trick :) |
Quote:
For me, I've picked most of it up doing a LOT of C/C++ stuff, much of which includes bit-operations such as this. Randall Hyde's assembly language tutorial (http://webster.cs.ucr.edu/Page_asm/A..._ArtofAsm.html) has some really good info on binary math and logic, but it isn't exactly and easy read. Like always, I'm available to answer any questions anybody comes up with, so feel free to drop me a PM or email. --Rob |
I'm trying to use the original timer code from the first thread in a simple dead reckoning pattern. My code has the time calculator directly after the SERIN, has 2 lines of code changing the wheel numbers for the SEROUT, then the SEROUT. It loops this until realtime = whatever time I want. It goes forward, turns right, forward, right, forward, right, then forward. The problem is that after the first forward (Which works perfectly), it just turns right until I turn off the robot. Any ideas why? The variables are the same as the default, delta_t is declared and set to 1 in intilization. The forums aren't being nice and the SERINs are all on one line in the actual code.
Code:
do |
Don't forget to reset realtime to 0 between your sections. Or, you could change the "loop until realtime=1" to "loop until realtime=3". From quickly looking over your code, I'd guess that this is the problem.
--Rob |
Why make it so hard on yourselves
why are all of you making it so hard on yourselves?
just put the time counting loop at the beginning of your autonomous mode, then use if/then statements relating realtime and time. Why repeat it 7 times throughout your code along with serin again and again? plus, why worry about counting for 1 min 45 sec? unless i am extremely mistaken, the auton mode is only 15 seconds long, and i doubt you want to run your robot autonomously after that because no matter how godly of a programmer you are, human senses, adaptability, and recognization will always outdo straight computer logic. -Anthony |
redundance
Mike, what is up with all the identical code, don't you think you could go with the flow of the main loop and just do something like this:
Code:
':::Timer variables |
A problem is your mixing syntaxes. The goto in the beginning is 2.0, but select case is 2.5
|
Quote:
if auton_mode=1 then 'auto code goes here else 'normal here endif but it isn't wrong to do it the other way. |
You don't need to worry abou the timing, just take your "cue" for the fifteen seconds from when auton_mode changes to zero and comp_mode (or something like that) changes to 1.
|
Quote:
|
Ahhhh, now I understand. Thanks for the insight. We are going to follow the line so I didn't think of that.
|
There are many ways to skin the cat, but some ways are better than others :D
|
Quote:
|
prolly a dumb question, but why do you add in delta_t?
[edit] o wait nevermind. but how often does the other processor send packets to the stamp? what about packetnum? what does that do? |
Quote:
|
Quote:
Using delta_t, you can determine if you missed any 26ms intervals between serins, so you would actually know that 52ms has passed in the previous example instead of "one loop" which could be either 26 or 52ms. --Rob |
Ok, that makes sense, but does 26 some milliseconds in drive time really affect the robot as it drives? I ran automated code without this and had almost perfect position accuracy. It seems like an awfully tiny difference to me.
|
Greg, quit screwing up my posts and work on wiring our second drive base, our anti-gravity one. I need the electrical done so I can do the program.
|
Quote:
|
Quote:
|
adding delta_t won't make any difference in your code unless your loop takes more than 26ms.
does anybody know what packet_num does? |
Blah...
I keep seeing posts on timer this, timer that.. why use software timers? So inaccurate if you have lots of code.. I mean, the loop isn't always a set period of time if you mod the code a lot (yeah, we aren't really using anything in the default code except the declarations.. and most of those are gone too.. lol). Using a hardware pulse generator (555 anyone?) allows you to have multiple software timers without worrying too much about loop periods and other useless complex crapola. I mean, you only need a resolution of around 1/4 second at most anyways.. |
Quote:
|
| All times are GMT -5. The time now is 14:50. |
Powered by vBulletin® Version 3.6.4
Copyright ©2000 - 2017, Jelsoft Enterprises Ltd.
Copyright © Chief Delphi