How about determinism for AI Planner?

[Kichang-Kim]

Hi. I have some questions about the determinism on AI Planner.

1. Is AI Planner’s result deterministic between various hardware? especially, between x64 linux, Android and iOS.

2. Can I control processing time or internal node count for calculating strictly for preserving constant framerate? (like NavMeshQuery.UpdateFindPath)

Thanks.

[amirebrahimi_unity]

@Kichang-Kim

Hi. I have some questions about the determinism on AI Planner.

1. Is AI Planner’s result deterministic between various hardware? especially, between x64 linux, Android and iOS.

2. Can I control processing time or internal node count for calculating strictly for preserving constant framerate? (like NavMeshQuery.UpdateFindPath)

Thanks.

Re: your questions

1. Currently it is not deterministic in its current form, but that is due to the selection algorithm. This will change in the next version of the planner because we have moved to a bounded heuristic, which no longer uses randomness. We haven’t tested on various hardware, but algorithmically the planner should be deterministic.

2. We’re planning to expose an internal node count to limit the planner’s planning horizon; I think we could introduce a processing time as well, however, the goal for our planner is to run asynchronously on other threads, so that it will not block main thread performance.