MAGE: Alleviating Uncertainty in Real-Time Decision-Making as a Function of Problem Complexity
In this paper, we discuss a critical aspect of uncertainty in the operation of complex systems, such as the future air traffic: the ability of agents in the system to arrive at satisfactory decisions and the attendant actions as a function of problem complexity. Intuitively, when the problem complexity is manageable, given an appropriate decision problem formulation and solution tools, an agent (computational or human) has no trouble arriving at a solution that yields good outcomes for the agent and the system. Growing problem complexity results in progressively larger computational problems that may yield suboptimal solutions or even be intractable within required time limits or at all. We propose a measurable representation of complexity in terms of problem tractability and quality of solutions. We also propose a computational scheme, MAGE (Monitor, Anticipate, Guide, Evolve), for detecting approaching transitions from efficient decision-making states to inefficient to unsafe ones, so that operations based on decision-making can be reconfigured to forestall unfavorable transitions, returning to efficient modes when complexity diminishes. Maintaining tractable complexity reduces the uncertainty in the outcomes of decision-making. We describe the general scheme, an outline of MAGE applied to managing airspace complexity, and initial examples of investigating the tractability of problem-solving schemes.