{
  "id": "2312.01404",
  "version": "v1",
  "published": "2023-12-03T14:07:39.000Z",
  "updated": "2023-12-03T14:07:39.000Z",
  "title": "Decision Diagrams in Space!",
  "authors": [
    "Isaac Rudich",
    "Quentin Cappart",
    "Manuel López-Ibáñez",
    "Michael Römer",
    "Louis-Martin Rousseau"
  ],
  "comment": "9 pages, 2 figures, submitted to CPAIOR 2024",
  "categories": [
    "math.OC"
  ],
  "abstract": "The Asteroid Routing Problem is like the Traveling Salesman Problem, but in space. The European Space Agency is interested in visiting asteroids to extract minerals, however, the asteroids are moving, and calculating trajectories between asteroids can be computationally expensive. The goal of the Asteroid Routing Problem is to find the optimal path that visits a set of asteroids while taking the movement of the asteroids into account. Existing methods of solving this problem do not yield exact solutions. We provide the first exact solution to the Asteroid Routing Problem by using a method of solving optimization problems with decision diagrams called peel-and-bound. We also discuss how this methodology can be used to generate new heuristic search techniques for global trajectory optimization problems.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-12-03T14:07:39.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "90-08"
    ],
    "keywords": [
      "decision diagrams",
      "asteroid routing problem",
      "global trajectory optimization problems",
      "first exact solution",
      "yield exact solutions"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}