Nonlinear Walkers
Nonlinear Walkers
Nonlinear Walkers
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Nonlinear</strong><br />
<strong>Walkers</strong><br />
Thanasis<br />
Kehagias,<br />
Faculty of<br />
Engineering,<br />
Aristotle<br />
University of<br />
Thessaloniki<br />
Introduction<br />
If closest neighbor is closer than d 1 , the walker turns away from<br />
him.<br />
{ − (rm ∗ − r<br />
∆u n =<br />
n ) if ‖r n − r m ∗‖ < d 1<br />
0 else.<br />
where m ∗ = arg min ‖r n − r m ‖<br />
m∈{1,...,N}<br />
The<br />
Mathematical<br />
Model<br />
The Trajectory<br />
Generator<br />
The Animator<br />
Experiments<br />
Mathematical<br />
Questions<br />
Thanasis Kehagias,Faculty of Engineering, Aristotle University <strong>Nonlinear</strong> of Thessaloniki <strong>Walkers</strong> January 17, 2013 8 / 21
Change language