IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v101y2025i2d10.1007_s00186-025-00890-7.html

The bearing only localization problem via partially observed Markov decision process

Author

Listed:
  • François Dufour

    (Univ. Bordeaux, CNRS, INRIA, Bordeaux INP, IMB, UMR 5251)

  • Alexandre Génadot

    (Univ. Bordeaux, CNRS, INRIA, Bordeaux INP, IMB, UMR 5251)

  • Romain Namyst

    (Univ. Bordeaux, CNRS, INRIA, Bordeaux INP, IMB, UMR 5251)

Abstract

We consider the classical problem of localization of a target from an observer from bearing measurements. We reformulate this problem within the framework of the theory of partially observed Markov decision processes and propose a method for numerically solving this problem. Theoretical convergence of this numerical solution scheme is obtained and numerical investigations are also carried out, enabling us to recover optimal curves already suggested in the literature via other techniques.

Suggested Citation

  • François Dufour & Alexandre Génadot & Romain Namyst, 2025. "The bearing only localization problem via partially observed Markov decision process," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 101(2), pages 219-257, April.
    • Handle: RePEc:spr:mathme:v:101:y:2025:i:2:d:10.1007_s00186-025-00890-7
    DOI: 10.1007/s00186-025-00890-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-025-00890-7
    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/s00186-025-00890-7?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Naci Saldi & Serdar Yüksel & Tamás Linder, 2017. "On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 945-978, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Naci Saldi, 2026. "Linear Mean-Field Games with Discounted Cost," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 358-397, January.
    2. Ali Devran Kara & Serdar Yüksel, 2023. "Convergence of Finite Memory Q Learning for POMDPs and Near Optimality of Learned Policies Under Filter Stability," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2066-2093, November.
    3. Insoon Yang, 2020. "A Convex Optimization Approach to Dynamic Programming in Continuous State and Action Spaces," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 133-157, October.
    4. Yi Xiong & Ningyuan Chen & Xuefeng Gao & Xiang Zhou, 2022. "Sublinear regret for learning POMDPs," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3491-3504, September.
    5. Uğur Aydin & Naci Saldi, 2026. "Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 185-217, January.
    6. Somnath Pradhan & Serdar Yüksel, 2024. "Robustness of Stochastic Optimal Control to Approximate Diffusion Models Under Several Cost Evaluation Criteria," Mathematics of Operations Research, INFORMS, vol. 49(4), pages 2049-2077, November.
    7. Harun Avci & Kagan Gokbayrak & Emre Nadar, 2020. "Structural Results for Average‐Cost Inventory Models with Markov‐Modulated Demand and Partial Information," Production and Operations Management, Production and Operations Management Society, vol. 29(1), pages 156-173, January.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:mathme:v:101:y:2025:i:2:d:10.1007_s00186-025-00890-7. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.