IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v15y2025i2d10.1007_s13235-024-00586-3.html
   My bibliography  Save this article

Optimality and Robustness in Path-Planning Under Initial Uncertainty

Author

Listed:
  • Dongping Qi

    (Cornell University)

  • Adam Dhillon

    (University of California)

  • Alexander Vladimirsky

    (Cornell University)

Abstract

Classical deterministic optimal control problems assume full information about the controlled process. The theory of control for general partially-observable processes is powerful, but the methods are computationally expensive and typically address the problems with stochastic dynamics and continuous (directly unobserved) stochastic perturbations. In this paper we focus on path planning problems which are in between—deterministic, but with an initial uncertainty on either the target or the running cost on parts of the domain. That uncertainty is later removed at some time T, and the goal is to choose the optimal trajectory until then. We address this challenge for three different models of information acquisition: with fixed T, discretely distributed and exponentially distributed random T. We develop models and numerical methods suitable for multiple notions of optimality: based on the average-case performance, the worst-case performance, the average constrained by the worst, the average performance with probabilistic constraints on the bad outcomes, risk-sensitivity, and distributional-robustness. We illustrate our approach using examples of pursuing random targets identified at a (possibly random) later time T.

Suggested Citation

  • Dongping Qi & Adam Dhillon & Alexander Vladimirsky, 2025. "Optimality and Robustness in Path-Planning Under Initial Uncertainty," Dynamic Games and Applications, Springer, vol. 15(2), pages 637-663, May.
  • Handle: RePEc:spr:dyngam:v:15:y:2025:i:2:d:10.1007_s13235-024-00586-3
    DOI: 10.1007/s13235-024-00586-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-024-00586-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13235-024-00586-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:dyngam:v:15:y:2025:i:2:d:10.1007_s13235-024-00586-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.