Discussion forum for the BasicX family of microcontroller chips.
|
Hi Iīve read an interesting article about a special way of programming. You can find the article as a ZIP file at : http://www.verinet.com/~dlc/Boe-bot.zip This is about subsuming programming vs linear programming. Itīs a way of saving processing time and get acess to emergent behaviours (behaviours you end up without having programmed them as a result of multiples subprogramms interferings). The codes given in this article are basicStamp codes and as soon i tryed to change them into Basicx codes, i got in troubles. Can someone help me with for example the first code given in the article for servo control? Cheers Xavier |
|
|
|
Finite state machines are a pretty common programming technique. I use such a technique on the BX-24 to interleave a number of behavioral "processes" in a subsumption architecture robot. I use state machines primarily to avoid the stack overhead associated with BX-24 multiple threads. A simplified (older version) of the code can be had at: http://www.swampgas.com/files/subsump.bas On Sun, 17 Sep 2000 18:28:08 -0000, you wrote: >Hi >Iīve read an interesting article about a special way of >programming. >You can find the article as a ZIP file at : >http://www.verinet.com/~dlc/Boe-bot.zip >This is about subsuming programming vs linear programming. Itīs a >way >of saving processing time and get acess to emergent behaviours >(behaviours you end up without having programmed them as a result of >multiples subprogramms interferings). >The codes given in this article are basicStamp codes and as soon i >tryed to change them into Basicx codes, i got in troubles. >Can someone help me with for example the first code given in the >article for servo control? >Cheers > >Xavier ************************************** Do not taunt Happy Fun Ball. |