Prečkanje puščave neznane velikosti : delo diplomskega seminarja

Raišp, Justin (author), Dolžan, David (mentor)

Prečkanje puščave neznane velikosti je optimizacijski problem, kjer je potrebno prečkati puščavo, širšo od našega dometa vozila. Problem vključuje določitev optimalne strategije za postavitev postaj z gorivom in strategijo voženj med njimi. Optimalna strategija se izbere s pomočjo konkurenčnega razmerja v najslabšem primeru. Rezultat problema je iterativna strategija, ki z vsako iteracijo podvoji količino porabljenega goriva

• Language: Slovenian
• Keywords: problem džipa, problem prečkanja puščave, prečkanje puščave neznane velikosti, optimizacija, prečkanje puščave
• Work type: Final seminar paper
• Typology: 2.11 - Undergraduate Thesis
• Organization: FMF - Faculty of Mathematics and Physics
• Year: 2024
• PID: 20.500.12556/RUL-160734-82060d61-92a6-817f-7c2c-138a378fbe67
• UDC: 519.8
• COBISS.SI-ID: 206267139
• Publication date in RUL: 04.09.2024

Secondary language

• Language: English
• Title: Crossing a desert of unknown width

Abstract

Crossing a desert of unknown width is an optimization problem where one needs to cross a desert that is wider than the range of the vehicle. The problem involves determining the optimal strategy for placing fuel stations and the driving strategy between them. The optimal strategy is chosen using a competitive ratio in the worst-case scenario. The result of the problem is an iterative strategy that doubles the fuel consumption with each iteration.

• Keywords: jeep problem, desert crossing problem, crossing a desert of unknown width, optimization, crossing a desert