美国数学建模竞赛特等奖论文——1997 A O Lunch on the Run【数学建模】.pdfVIP

Lunch on the Run 255 Lunch on the Run Gordon Bower Orion Lawler James Long University of Alaska Fairbanks Fairbanks, AK 99775 Advisor: John P. Lambert Introduction We devised two different models for this pursuit: a purely mathematical model, and a computer model. Both models use the following assumptions: All animals are represented as points at their respective centers of mass. The simulations and chase both begin when the predator, slowly sneaking up on the prey, is spotted by the prey. The chase lasts 15 s or until the prey is killed, whichever occurs first. No animal may travel at more than its specified maximum speed. Each time that the distance from the prey to the predator is at a local mini- mum, the prey takes a chance of being killed. Table 1 summarizes notation used in the paper. Introduction to the Mathematical Model The mathematical model also assumes that it takes negligible time to start and stop moving but that the turning radius imposes a maximum angular velocity. This assumption makes the analysis possible without a computer but neglects the finite acceleration capability of real animals. This model can analyze only the one predator/one prey situation; it works quickly and well. We analyze two predator strategies and one prey strategy. The prey strategy is to run directly away from the predator until the predator gets closer than c The UMAP Journal 18 (3) (1997) 255–276. Copyright 1997 by COMAP, Inc. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice. Abstracting with credit is permitted, but copyrights for components of this wor