IDEAS home Printed from https://ideas.repec.org/a/bpj/jossai/v6y2018i3p269-276n6.html
   My bibliography  Save this article

Headings of UCAV Based on Nash Equilibrium

Author

Listed:
  • Dai Li
  • Xie Zheng

    (Department of Mathematics, National University of Defense Technology, Changsha410073, China)

Abstract

Given n vertices in a plane and UCAV going through each vertex once and only once and then coming back, the objective is to find the direction (heading) of motion in each vertex to minimize the smooth path of bounded curvature. This paper studies the headings of UCAV. First, the optimal headings for two vertices were given. On this basis, an n-player two-strategy game theoretic model was established. In addition, in order to obtain the mixed Nash equilibrium efficiently, n linear equations were set up. The simulation results demonstrated that the headings given in this paper are effective.

Suggested Citation

  • Dai Li & Xie Zheng, 2018. "Headings of UCAV Based on Nash Equilibrium," Journal of Systems Science and Information, De Gruyter, vol. 6(3), pages 269-276, June.
    • Handle: RePEc:bpj:jossai:v:6:y:2018:i:3:p:269-276:n:6
    DOI: 10.21078/JSSI-2018-269-08
    as

    Download full text from publisher

    File URL: https://doi.org/10.21078/JSSI-2018-269-08
    Download Restriction: no
    File URL: https://libkey.io/10.21078/JSSI-2018-269-08?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
    ---><---

    References listed on IDEAS

    as
    1. Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
    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. P. Giovani Palafox-Alcantar & Dexter V. L. Hunt & Chris D. F. Rogers, 2020. "A Hybrid Methodology to Study Stakeholder Cooperation in Circular Economy Waste Management of Cities," Energies, MDPI, vol. 13(7), pages 1-30, April.
    2. Hadi Charkhgard & Martin Savelsbergh & Masoud Talebian, 2018. "Nondominated Nash points: application of biobjective mixed integer programming," 4OR, Springer, vol. 16(2), pages 151-171, June.
    3. Sam Ganzfried & Austin Nowak & Joannier Pinales, 2018. "Successful Nash Equilibrium Agent for a 3-Player Imperfect-Information Game," Papers 1804.04789, arXiv.org.
    4. Godinho, Pedro & Dias, Joana, 2013. "Two-player simultaneous location game: Preferential rights and overbidding," European Journal of Operational Research, Elsevier, vol. 229(3), pages 663-672.
    5. Hanyu Li & Wenhan Huang & Zhijian Duan & David Henry Mguni & Kun Shao & Jun Wang & Xiaotie Deng, 2023. "A survey on algorithms for Nash equilibria in finite normal-form games," Papers 2312.11063, arXiv.org.
    6. Thompson, David R.M. & Leyton-Brown, Kevin, 2017. "Computational analysis of perfect-information position auctions," Games and Economic Behavior, Elsevier, vol. 102(C), pages 583-623.
    7. Sam Ganzfried & Conner Laughlin & Charles Morefield, 2019. "Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning," Papers 1910.00193, arXiv.org, revised Mar 2020.
    8. Sam Ganzfried & Austin Nowak & Joannier Pinales, 2018. "Successful Nash Equilibrium Agent for a Three-Player Imperfect-Information Game," Games, MDPI, vol. 9(2), pages 1-8, June.
    9. Sam Ganzfried, 2018. "Optimization-Based Algorithm for Evolutionarily Stable Strategies against Pure Mutations," Papers 1803.00607, arXiv.org, revised Jan 2019.
    10. Mohtadi, Mohammad Mahdi & Nogondarian, Kazem, 2015. "Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 442-452.
    11. Ruchira Datta, 2010. "Finding all Nash equilibria of a finite game using polynomial algebra," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 55-96, January.
    12. McLennan, Andrew & Tourky, Rabee, 2010. "Imitation games and computation," Games and Economic Behavior, Elsevier, vol. 70(1), pages 4-11, September.
    13. Jiang, Albert Xin & Leyton-Brown, Kevin & Bhat, Navin A.R., 2011. "Action-Graph Games," Games and Economic Behavior, Elsevier, vol. 71(1), pages 141-173, January.
    14. Wang, Shuliang & Sun, Jingya & Zhang, Jianhua & Dong, Qiqi & Gu, Xifeng & Chen, Chen, 2023. "Attack-Defense game analysis of critical infrastructure network based on Cournot model with fixed operating nodes," International Journal of Critical Infrastructure Protection, Elsevier, vol. 40(C).
    15. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
    16. Carvalho, Margarida & Lodi, Andrea & Pedroso, João.P., 2022. "Computing equilibria for integer programming games," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1057-1070.
    17. Nicola Basilico & Stefano Coniglio & Nicola Gatti & Alberto Marchesi, 2020. "Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(1), pages 3-31, March.
    18. Gabriele Dragotto & Rosario Scatamacchia, 2023. "The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1143-1160, September.

    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:bpj:jossai:v:6:y:2018:i:3:p:269-276:n: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.

    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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.