1 / 24

Winning the Game: Strategies for O-Mopsi Orienteering

Learn the winning strategies for O-Mopsi orienteering, a game where you must find all controls in the fastest time possible. Discover the challenges of orienteering and O-Mopsi, and explore the importance of the order of visiting targets. Find out how the starting point impacts your gameplay, and understand the effects of the route network and transportation mode.

gavink
Download Presentation

Winning the Game: Strategies for O-Mopsi Orienteering

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Winning the gamePlaying strategies for O-Mopsi Lahari Sengupta Radu Mariescu-Istodor Pasi Fränti 31.12.2015

  2. What is O-Mopsi?

  3. Classical orienteering Devices: Map and compass Targets brought to nature for the event • Find all controls • In pre-defined order • Fastest wins

  4. Mopsi orienteering (O-Mopsi) Smartphone and GPS Targets real objects Pictures of targets • Find all controls • In free order • Fastest wins

  5. Challenges of playing • Orienteering: • Knowing your location • Optimizing paths to targets • O-Mopsi: • Finding best order • Optimizing paths to targets ?

  6. Winning the game

  7. What matters • Order of visiting targets • Travelling salesman problem (TSP) • Human strategies: nearest neighbor, clustering • Computer strategies: optimal, optimization • Where to start playing • Remove longest edge from TSP? • Blind selection • Comparison of various heuristics • Navigating to targets • Effects of routing

  8. Order of targets

  9. Algorithmic problem • Minimize total distance • With N targets there are N! possible orders • Variant of travelling salesman problem (TSP) 478 m 280 m 250 m 250 m 228 m 30 m

  10. How much it matters? Nearest target strategy 3 2 • More targets, • harder to solve • Nearest neighbor strategy • XX% longer than optimal (average) • Lahari:- Some calculations of distances of SciFest 2014 easy (min,max,median)- Algorithm variations with Helsinki - Overall, with the function of number of targets and complexity 1 5 km Optimal order 3 2 ? 4 km 1

  11. Effect of starting point

  12. Where to start? • Targets not visible before start(if known, can start at one target) • No time for planning route(Time starts when game opens) • Game area (bounding box) shown • Start must be chosen blindly • Need two pics: • Before start • After start Need to implement TSP with user-selected start point!

  13. Start point strategy 1Center of the area x,x km Center ?

  14. Start point strategy 2Corner of the area Corner x,x km ?

  15. Start point strategy 3Somewhere at the shorter edge x,x km ? Short edge

  16. Start point matters • Every side has at least one target • Optimal order likely to go along longer side (rather than random zig zag) • Heuristic: Start from the shorter side Likely direction of optimal route xmax ymax Longer side Start Shorter side xmin ymin

  17. Start point statisticsaccording to target location Optimal start point located: First/last target along the short side: xx % First/last target along the long side: xx % Some other target: xx %

  18. Start point statisticsaccording to grid • Calculate optimal tour • Divide the area into 20%20% grid • Locate the start and end points of the tour in the grid Longer side Shorter side

  19. Road network

  20. Effect of route networkBird distance vs. roads • Buildings and small housing in city area • Real distance xx-yy % longer than bird’s distance • Can also affect the order of the targets Bird distance Routing 417 m 753 m

  21. Effect of route networkStart point changes Bird distance Routing 13.4 km 21.4 km

  22. River has big impact Bird distance Routing 2.1 km 3.8 km crossing river

  23. Effect of transport mode Shorter routing by walk Routing by car

  24. Limitations of routing Limitations in street crossing No shortcuts No routes viaopen plaza

More Related