I have people moving forward and I need the simple code to let these people when they intersect with each other ( if the number of people in the patch exceed certain number ---> lead to danger?
the second behavior: people need to walk then stop for some time to do some task then complete their walking.. how can I code this ? is there any idea for that?
the message from the below code tell that : Nothing named >=2 has been defined?
to go
ask pilgrims
[fd 1]
if any? other turtles-here >=2 [ set in-danger? true]
Related
When running two exact same procedures for specific patches, one of the two is stating an error because "it cannot be run in observer context, it is a patches/turtles context only".
to start
ask patches with [seed = 1 AND age = retirement-age] [retirement]
ask patches with [seed = 1 AND age = death] [successor]
end
The retirement-age is an input from the interface.
The death is a patch property, I tried the startprocedure as well with an input from the interface.
The retirement and death procedure are just a copy-paste of each other, using lists created in other procedures. Only the result is different, see below :
to retirement
;;; other calculations same as successor procedure
ifelse (successor-result = 1) [set age 35 ] [set over-retirement 1]
end
to successor
;;; other calculations same as retirement procedure
ifelse (successor-result = 1) [set age 18] [dispatch-parcels]
end
Running the retirement procedure do not create error, but the successor procedure does create an error.
I did not copy-paste everything because I don't think it is useful as the two procedure are exactly the same. The other calculations use global variables and lists created in other procedures in the observer context.
Here-below is the dispatch-parcels procedure that regards to concerned patches from the beginning.
to dispatch-parcels
;; this regards the patches with seed = 1 that has been processed in the successor procedure. But doesn't work as for updating the age and death of the agent
set seed 0
set age 0
set death 0
;; if there is no successor, the parcels of the farm are distributed along the closest parcels : one farm can distribute its own parcels to multiple different farms
ask patches with [ ID-farm = [ID-farm] of myself]
;; for each parcel, finds the closest parcel and use the ID-farm as the new ID-farm, same for the region in case it changes.
[
set ID-farm ([ID-farm] of (min-one-of patches with [(ID-farm != 0) AND (ID-farm != [ID-farm] of myself)] [distance myself] ))
set region ([region] of (min-one-of patches with [(region != 0) AND (region != [region] of myself)] [distance myself] ))
]
end
I also tried to the successor procedure with the same final command line as from the retirement procedure but I get the same error message. So there should be something "hidden" somewhere about this successor procedure.
Any insight about the likely source of error, what I should more attention to ?
Thanks for your time.
I finally figured out what was wrong. It was so obvious that it became invisible and I'm a bit embarrased.
I'd like to share my answer anyway because it might opened the eyes of tired beginners like me.
In order to test this part of my code, I created a button to only test the successor procedure, which was in observer context, which was not possible with the commands I wrote. That's just it.
This is my code to switch breeds. How can I tell if the agents are changing breeds. I have a monitor that counts but the number is not changing. It is supposed to count passives vs. actives which should be changing.
to switch-A
ask managers-A
with [Rhat-A < mean-Rhat-P] [set breed managers-P]
end
That code looks fine. What does the code box in the monitor have? I assume you are counting As in one monitor and Ps in another.
If nothing's happening, it's likely that you either never call the switch-A procedure, or that there aren't any A's that meet the condition. Try this:
to switch-A
type "As with low value:" print count managers-A with [Rhat-A < mean-Rhat-P]
ask managers-A with [Rhat-A < mean-Rhat-P]
[ set breed managers-P
]
end
If you don't get output then it's not being called. If the count is 0 then you know to find out the values that are being tested etc.
I have a grid of 10x10 nodes where all adjacent nodes are linked to create a graph of 180 links - i.e:
What I hope to do is create a procedure which will break x% of these links, but importantly do so without creating any isolated subgraphs - that is, so that any 1 of the 100 nodes remain accessible from all other 99 nodes - i.e.
I initially (and naively) thought I could do something like the following:
ask n-of 45 nodes with [count my-links > 1]
[
ask one-of my-links [die]
]
However, this does not prevent sub-graphs from being orphaned from the main graph - i.e.
Another option might be to repeatedly ask single links to die and then check the total number of graphs does not exceed 1 - if it does, recreate the link and choose another to break. However, (1) this does not seem particularly elegant; and (2) I have been unable to find a way to count the number of distinct graphs using the inbuilt link or nw procedures.
I do think that part of my problem is not knowing the correct terminology for these subgraphs/isolates/cliques etc...
If anyone has any ideas on how this might be done (or can correct my woefully inadequate comprehension of graph theory terminology) it would be much appreciated.
Many thanks for the heads-up re nw:weak-component-clusters - I wasn't aware of that.
I have now implemented the following simple recursive procedure which will kill a link and if that link splits the graph recreate it and recall the procedure. This works well for what I wanted to do. Do note however that if you run this enough times you will end up stuck in a recursive loop as there will be no further links to break without splitting the graph and the procedure will keep calling itself.
to breakLink
let breakCandidate one-of links
let end1Candidate [end1] of breakCandidate
let end2Candidate [end2] of breakCandidate
ask breakCandidate [die]
if (length nw:weak-component-clusters > 1)
[
ask end1Candidate
[
create-link-with end2Candidate
breakLink
]
]
end
Cheers
For the solution you thought of, you can use the nw extension to check if there's still a path between the nodes you just disconnected by checking if nw:distance-to returns false or a number.
Alternatively, you can count the number of connected components.
I think removing the link and testing connectedness is a perfectly reasonable way to go. Any algorithm you implement will have to awkwardly pretend the link doesn't exist anyway, so will likely be more complicated than just removing the thing.
Edit: Adding code for the distance version to clarify:
to break-link
let break-candidate one-of links
let end-one [end1] of break-candidate
let end-two [end2] of break-candidate
ask break-candidate [die]
if [nw:distance-to end-two] of end-one = false [
ask end-one [ create-link-with end-two ]
break-link
]
end
Not sure if this or the nw:weak-component-cluster version will be faster. That will likely depend on the size of the network.
I have a model of male and female animals interacting, with males competing with each other for access to females. When a dispersing male challenges a resident male (i.e., male-to-challenge) and loses, I’d like to have the dispersing male ‘remember’ who he lost to. I accomplish this with set dominant-males (turtle-set dominant-males male-to-challenge) at the end of the procedure. Then at the beginning of the procedure in the next time step, the dispersing male won't challenge the same dominant-male again. I thought that would be easy enough with:
; identify those males owning nearby females:
let owner-males-of-nearby-fem turtle-set [males-in-my-territory] of breeding-females with [member? self (owned-nearby-females)]
; identify those males who have not been challenged before:
let unchallenged-males owner-males-of-nearby-fem with [not member? self dominant-males]
; select one of the unchallenged males to challenge:
let male-to-challenge one-of unchallenged-males
However, I often find that the unchallenged-males are the same ones that had been challenged before and won (i.e., dominant-males), even though those males should not have been selected in the first place. I use print statements to verify this and included a simple error message using the following:
if [self] of unchallenged-males = [self] of dominant-males
[
user-message "this is wrong!"
]
I thought this would be easy but I've been stumped most of the day on this. Any help would be really appreciated.
You are testing against dominant-males of owner-males-of-nearby-fem instead of the challenger. Try changing dominant-males to [dominant-males] of myself.
I have a code in which juveniles (juvis juvi) become adults (adults adult). The current way I have it is that juvis change breed to adults at a set age (determined by a turtles own, j-age). However I have a turtles own for adults (a-age) which I want to be Zero when the juvis change breed to adults. Does this happen automatically, or do I have to add code along the lines of "set a-age 0". I have tried putting that in in various guises and places but always get errors. Current code is as follows:
to emergence
ask juvis
[if j-age = (juvenile-period * 24) [set breed adults]]
end
any advice is appreciated. thank you.
When you change breed, any variables owned by the current breed that were not owned by the previous breed are set to 0.
You can test this yourself--just add a SHOW command to show the variable you are curious about!