Complementing the Linear-Programming Learning Experience with the Design and Use of Computerized Games: The Formula 1 Championship Game

• URL: http://arxiv.org/abs/2109.10698v1
• Date: Sun, 19 Sep 2021 03:48:00 GMT
• Title: Complementing the Linear-Programming Learning Experience with the Design and Use of Computerized Games: The Formula 1 Championship Game
• Authors: Gerardo L. Febres
• Abstract summary: This document focuses on modeling a complex situations to achieve an advantage within a competitive context. A computerized game to exercise the math-modeling process and optimization problem formulation is introduced.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This document focuses on modeling a complex situations to achieve an advantage within a competitive context. Our goal is to devise the characteristics of games to teach and exercise non-easily quantifiable tasks crucial to the math-modeling process. A computerized game to exercise the math-modeling process and optimization problem formulation is introduced. The game is named The Formula 1 Championship, and models of the game were developed in the computerized simulation platform MoNet. It resembles some situations in which team managers must make crucial decisions to enhance their racing cars up to the feasible, most advantageous conditions. This paper describes the game's rules, limitations, and five Formula 1 circuit simulators used for the championship development. We present several formulations of this situation in the form of optimization problems. Administering the budget to reach the best car adjustment to a set of circuits to win the respective races can be an approach. Focusing on the best distribution of each Grand Prix's budget and then deciding how to use the assigned money to improve the car is also the right approach. In general, there may be a degree of conflict among these approaches because they are different aspects of the same multi-scale optimization problem. Therefore, we evaluate the impact of assigning the highest priority to an element, or another, when formulating the optimization problem. Studying the effectiveness of solving such optimization problems turns out to be an exciting way of evaluating the advantages of focusing on one scale or another. Another thread of this research directs to the meaning of the game in the teaching-learning process. We believe applying the Formula 1 Game is an effective way to discover opportunities in a complex-system situation and formulate them to finally extract and concrete the related benefit to the context described.

Related papers

• RaceLens: A Machine Intelligence-Based Application for Racing Photo Analysis [0.2443208492624608]
  RaceLens is a novel application utilizing advanced deep learning and computer vision models for comprehensive analysis of racing photos. We discuss the process of collecting a robust dataset necessary for training our models, and describe an approach we have designed to augment and improve this dataset continually. A significant part of our study is dedicated to illustrating the practical application of RaceLens, focusing on its successful deployment by NASCAR teams over four seasons.
  arXiv  Detail & Related papers  (2023-10-20T13:58:31Z)
• Efficient Ground Vehicle Path Following in Game AI [77.34726150561087]
  This paper presents an efficient path following solution for ground vehicles tailored to game AI. The proposed path follower is evaluated through a variety of test scenarios in a first-person shooter game. We achieved a 70% decrease in the total number of stuck events compared to an existing path following solution.
  arXiv  Detail & Related papers  (2023-07-07T04:20:07Z)
• Mastering Nordschleife -- A comprehensive race simulation for AI strategy decision-making in motorsports [0.0]
  This paper develops a novel simulation model tailored to GT racing. By integrating the simulation with OpenAI's Gym framework, a reinforcement learning environment is created and an agent is trained. The paper contributes to the broader application of reinforcement learning in race simulations and unlocks the potential for race strategy optimization beyond FIA Formula1.
  arXiv  Detail & Related papers  (2023-06-28T10:39:31Z)
• A Novel Approach for Auto-Formulation of Optimization Problems [66.94228200699997]
  In the Natural Language for Optimization (NL4Opt) NeurIPS 2022 competition, competitors focus on improving the accessibility and usability of optimization solvers. In this paper, we present the solution of our team. Our proposed methods have achieved the F1-score of 0.931 in subtask 1 and the accuracy of 0.867 in subtask 2, which won the fourth and third places respectively in this competition.
  arXiv  Detail & Related papers  (2023-02-09T13:57:06Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights [59.93939636422896]
  The ML4CO aims at improving state-of-the-art optimization solvers by replacing key components. The competition featured three challenging tasks: finding the best feasible solution, producing the tightest optimality certificate, and giving an appropriate routing configuration.
  arXiv  Detail & Related papers  (2022-03-04T17:06:00Z)
• ML4CO: Is GCNN All You Need? Graph Convolutional Neural Networks Produce Strong Baselines For Combinatorial Optimization Problems, If Tuned and Trained Properly, on Appropriate Data [8.09193285529236]
  This paper summarizes the solution and lessons learned by the Huawei EI-OROAS team in the 2021 NeurIPS Machine Learning for Combinatorial Optimization (ML4CO) competition. The submission of our team achieved the second place in the final ranking, with a very close distance to the first spot. We argue that a simple Graph Convolutional Neural Network (GCNNs) can achieve state-of-the-art results if trained and tuned properly.
  arXiv  Detail & Related papers  (2021-12-22T22:40:13Z)
• Adversaries in Online Learning Revisited: with applications in Robust Optimization and Adversarial training [55.30970087795483]
  We revisit the concept of "adversary" in online learning, motivated by solving robust optimization and adversarial training problems. We establish a general approach for a large variety of problem classes using imaginary play.
  arXiv  Detail & Related papers  (2021-01-27T14:23:06Z)
• Analog Circuit Design with Dyna-Style Reinforcement Learning [12.232323973906773]
  We present a learning based approach to analog circuit design, where the goal is to optimize circuit performance subject to certain design constraints. We propose a method with two key properties. First, it learns a reward model, i.e., surrogate model of the performance approximated by neural networks, to reduce the required number of simulation. Second, it uses a policy generator to explore the diverse solution space satisfying constraints. The results show that, compared to the model-free method applied with 20,000 circuit simulations to train the policy, DynaOpt achieves even much better performance by learning from scratch with only 500 simulations.
  arXiv  Detail & Related papers  (2020-11-16T00:19:25Z)
• Towards a Systematic Computational Framework for Modeling Multi-Agent Decision-Making at Micro Level for Smart Vehicles in a Smart World [8.899670429041453]
  We propose a multi-agent based computational framework for modeling decision-making and strategic interaction at micro level for smart vehicles. Our aim is to make the framework conceptually sound and practical for a range of realistic applications, including micro path planning for autonomous vehicles.
  arXiv  Detail & Related papers  (2020-09-25T13:05:28Z)
• Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games [123.76716667704625]
  We focus on the problem of finding an optimal strategy for a team of two players that faces an opponent in an imperfect-information zero-sum extensive-form game. In that setting, it is known that the best the team can do is sample a profile of potentially randomized strategies (one per player) from a joint (a.k.a. correlated) probability distribution at the beginning of the game. We provide an algorithm that computes such an optimal distribution by only using profiles where only one of the team members gets to randomize in each profile.
  arXiv  Detail & Related papers  (2020-09-21T17:51:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.