Optimal random search, fractional dynamics and fractional calculus
Optimization and Control
2015-01-22 v1
Abstract
What is the most efficient search strategy for the random located target sites subject to the physical and biological constraints? Previous results suggested the L\'evy flight is the best option to characterize this optimal problem, however, which ignores the understanding and learning abilities of the searcher agents. In the paper we propose the Continuous Time Random Walk (CTRW) optimal search framework and find the optimum for both of search length's and waiting time's distributions. Based on fractional calculus technique, we further derive its master equation to show the mechanism of such complex fractional dynamics. Numerous simulations are provided to illustrate the non-destructive and destructive cases.
Keywords
Cite
@article{arxiv.1310.7687,
title = {Optimal random search, fractional dynamics and fractional calculus},
author = {Caibin Zeng and YangQuan Chen},
journal= {arXiv preprint arXiv:1310.7687},
year = {2015}
}
Comments
12 pages, 7 figures