Difficult random walk modeling

  • #1
Hi guys,

I'm doing some thinking about random walk.

Imagine there is a bounded 2D plane and a single spawn point. The spawn produces units which must bring in minerals scattered around the spawn. The locations of minerals are not known, so the units diffuse randomly away from the spawn until they find a mineral. Once the mineral is picked up, it is brought back to the spawn point (i.e. once the unit found mineral, it goes to the origin in a straight line). The unit then returns (in a straight line) to the location of the last mineral pickup point and then diffuses randomly from that point until it finds a new mineral.

Could somebody please provide some papers, urls - any kind of material - to show how to mathematically model such a scenario? I'm not afraid of calculus, differential equations, etc.

Thanks,

Monte
 

Answers and Replies

  • #2
This is not a homework, but more towards research and just thought-experiment. Any help - just a name of canonical problems related to this one - would be helpful.
 
  • #3
807
23
Not precisely what you're talking about, but are you familiar with the "bees algorithm"? It's a recently developed optimization algorithm that is similar on a general level to what you've suggested. You should be able to turn up a few papers by doing a search for "bees algorithm" or "honeybee algorithm".
 

Related Threads on Difficult random walk modeling

  • Last Post
Replies
6
Views
991
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
1
Views
4K
Replies
7
Views
986
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
2
Views
5K
  • Last Post
Replies
3
Views
2K
Replies
4
Views
5K
Replies
2
Views
1K
  • Last Post
Replies
6
Views
3K
Top