Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Software » comp.soft-sys.matlab

Topic: Marathon Supporters Problem
Replies: 2   Last Post: Apr 10, 2013 11:40 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Guest

Watch Watch this User
Marathon Supporters Problem
Posted: Apr 8, 2013 3:30 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hi,

For my thesis I have to solve the 'Marathon Supporters Problem':

A supporter wants to see 'his runners' as many times as possible during the race. The race track is one big ellips, with many supporting points. The supporter can travel between these points with a deterministic speed. The speed of the runner is stochastic. The objective is the maximize the number of times a supporter can see the runner. At every point the runner is only visible during a specific time window (depending of the running speed).

Has anyone an idea how I can solve this problem with Dynamic Programming? Which states do you suggest? And how to split this problem in subproblems?


Thanks!



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.