IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-26899-6_6.html
   My bibliography  Save this book chapter

Constrained Search in Continuous Time and Space

In: Optimal Search for Moving Targets

Author

Listed:
  • Lawrence D. Stone

    (Metron, Inc.)

  • Johannes O. Royset

    (Naval Postgraduate School)

  • Alan R. Washburn

    (Naval Postgraduate School)

Abstract

As we recall from Chap. 4, search applications might require the consideration of constraints on the agility of the searcher. For example, in the development of real-time controllers for autonomous systems it becomes essential to account for their often limited speed, turn radii, and other performance characteristics. When such systems need to be controlled on a very fine time scale, it becomes natural to formulate these problems in continuous time. Consequently, we are faced with the problem of optimal search in continuous time and space subject to constraints. This chapter provides an introduction to the subject through the formulation of several search situations as uncertain optimal control problems. Although there are computational challenges associated with the solution of uncertain optimal control problems, they are not unsurmountable. In fact, we include a section with examples that illustrate today’s capabilities and demonstrate that practically useful solutions can be obtained in tens of minutes by standard optimization solvers. We also provide an introduction to the theory supporting such problems.

Suggested Citation

  • Lawrence D. Stone & Johannes O. Royset & Alan R. Washburn, 2016. "Constrained Search in Continuous Time and Space," International Series in Operations Research & Management Science, in: Optimal Search for Moving Targets, chapter 0, pages 155-188, Springer.
    • Handle: RePEc:spr:isochp:978-3-319-26899-6_6
    DOI: 10.1007/978-3-319-26899-6_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:isochp:978-3-319-26899-6_6. 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.