CoChat
Sign Up
Cited by 133Air Traffic Management and OptimizationQuantum Computing Algorithms and ArchitectureVehicle Routing Optimization Methods

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management

Open access
Stollenwerk, Tobias, O'Gorman, Bryan, Venturelli, Davide, Mandra, Salvatore, Rodionova, Olga, Ng, Hokkwan, Sridhar, Banavar, Rieffel, Eleanor Gilbert, Biswas, Rupak·2020·IEEE Transactions on Intelligent Transportation Systems
DOI 10.1109/tits.2019.2891235
Open this paper in CoChat — free accountOpen PDF

Abstract

We present the mapping of a class of simplified air traffic management problems (strategic conflict resolution) to quadratic unconstrained Boolean optimization problems. The mapping is performed through an original representation of the conflict-resolution problem in terms of a conflict graph, where the nodes of the graph represent flights and the edges represent a potential conflict between flights. The representation allows a natural decomposition of a real-world instance related to wind-optimal trajectories over the Atlantic Ocean into smaller subproblems that can be discretized and are amenable to be programmed in quantum annealers. In this paper, we tested the new programming techniques, and we benchmark the hardness of the instances using both classical solvers and the D-Wave 2X and D-Wave 2000Q quantum chip. The preliminary results show that for reasonable modeling choices, the most challenging subproblems which are programmable in the current devices are solved to optimality with 99% of probability within a second of annealing time.

Overview

Integrity signals

Registry

Crossref · 10.1109/tits.2019.2891235

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Show all 21 references

Cited by

Sorted by citations

Items 101–133 of 133

Related

See all

Metadata

Authors
Stollenwerk, T., O'Gorman, B., Venturelli, D., Mandra, S., Rodionova, O., Ng, H., Sridhar, B., Rieffel, E. G., & Biswas, R.
Affiliations
  • Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR) (DE)
  • Ames Research Center (US)
ORCID
Venue
IEEE Transactions on Intelligent Transportation Systems
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2020-01
Volume
21
Issue
1
Pages
285-297
ISSN
  • 1524-9050 (ISSN-L)
  • 1558-0016
DOI
10.1109/tits.2019.2891235
OpenAlex
W2769474857
Cited by
129
References
21
Citations by year
2026: 13 · 2025: 15 · 2024: 25 · 2023: 23 · 2022: 12 · 2021: 20 · 2020: 15
FWCI
10.48
Type
journal article
Language
en
Open access
Licence
Locations
  • IEEE Transactions on Intelligent Transportation Systems (publishedVersion)
  • elib (German Aerospace Center) (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • NASA Aviation Systems Division
  • NASA Advanced Exploration Systems Program
  • Ames Research Center
  • NASA Academic Mission Services (NNA16BD14C)
Topics
  • Physical Sciences › Engineering › Aerospace Engineering › Air Traffic Management and Optimization
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
Keywords
quantum annealing, air traffic management, conflict graph, D-Wave quantum annealer, problem decomposition, benchmarking, combinatorial optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review