Re: [Sserver-three-d] About Simulation

[<pf...@cs...>]

>>
>> If you didn't mean to overload T, then if this happens
>> time T1: agent receives sensations
>> time T1 + N1: (N1 is the thinking time) agent sends request time notify
>> for time T2 (where T2 > T1 + N1)
>> time T2: agent receives time notify, spends N2 time thinking and sends
>> action A
>> time T2 + N2 + L: (L is the server's action latency) action A is
>> actualized
>>
>
> If N2>N1, then it is possible that T1+N1+L == T2+N2+L. How does the
> server realize the actions in this case?

You can get this condition, but not how you say. The correct condition in
my original mail is
T2 >= T1 + N1. If T@ = T1+N1 and N2 = 0, then T1+N1+L=T2+N2+L. In this
case, SPADES provides no guaruntees about about ordering, but maybe the
soccer simulation does.

Maybe you want to file a feature request for SPADES to provide an ordering
guaruntee here?

--
Pat Riley