Dynamic programming formulation -- 2

$30-250 USD

Abgesagt

Veröffentlicht

vor etwa 7 Jahren

$30-250 USD

Bezahlt bei Lieferung

I am trying to formulate the following dynamic programming model: Along the shortest route, I have gas stations and hotels. The tank capacity is U and I can drive for a maximum of 8 hours or (R). I am averaging a speed of 70 mph. Gas and hotel prices are different at each node. What is the minimum cost to travel from point a to b, considering the number of stops to be S. Where should I stop for gas and how much should I fill, also where should I stop for hotels? It has to be using dynamic programming backward or forward. I need objective function, recursion, argument, policy function, and boundary condition.

Projekt-ID: 13838566

Über das Projekt

4 Vorschläge

Remote Projekt

Aktiv vor 7 Jahren

Möchten Sie etwas Geld verdienen?

E-Mail-Adresse

Vorteile einer Ausschreibung auf Freelancer

Legen Sie Ihr Budget und Ihren Zeitrahmen fest

Für Ihre Arbeit bezahlt werden

Skizzieren Sie Ihren Vorschlag

Sie können sich kostenlos anmelden und auf Aufträge bieten

4 Freelancer bieten im Durchschnitt $172 USD für diesen Auftrag

@wiseguy4reel

I am a PhD in Mechanical Engineering with extensive Matlab simulation skills for solving Richard Bellman's dynamic programming optimal control problems. In addition to your intended deliverable, I will provide you the following: 1. A mathematical expression to represent your dynamic programming problem. 2. A mathematical expression to represent the step by step solution, starting from the final step towards the first step as in the case of the backward dynamic programming solution. 3. A plot showing the cost-to-go at each step. 4. The optimal state trajectory and optimal control variable trajectory. I am confident that I can handle this project excellently. I would be most delighted to talk through this project with you at depth. Many thanks for your considerations. Kind Regards, Wisdom Enang.

$222 USD in 3 Tagen