Foraging theory for autonomous vehicle speed choice

摘要

We consider the optimal control design of an abstract autonomous vehicle (AAV). The AAV searches an area for tasks that are detected with a probability that depends on vehicle speed, and each detected task can be processed or ignored. Both searching and processing are costly, but processing also returns rewards that quantify designer preferences. We generalize results from the analysis of animal foraging behavior to model the AAV. Then, using a performance metric common in behavioral ecology, we explicitly find the optimal speed and task processing choice policy for a version of the AAV problem. Finally, in simulation, we show how parameter estimation can be used to determine the optimal controller online when density of task types is unknown.