{"title":"网络中心战中的博弈论导弹偏转","authors":"M. Maskery, V. Krishnamurthy, C. O'Regan","doi":"10.1109/ICNSC.2005.1461237","DOIUrl":null,"url":null,"abstract":"We construct a model for a distributed network of agents charged with defending a flotilla of ships and investigate how they can achieve their objective in a distributed manner. The dynamics of the model and the objectives are studied in detail, and a decentralized missile deflection algorithm based on solving a stochastic shortest path game is given. The main result is a complete formulation of the missile deflection problem as a stochastic shortest path game, and a distributed algorithm for computing the Nash equilibrium when the game is purely collaborative.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Game-theoretic missile deflection in network centric warfare\",\"authors\":\"M. Maskery, V. Krishnamurthy, C. O'Regan\",\"doi\":\"10.1109/ICNSC.2005.1461237\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct a model for a distributed network of agents charged with defending a flotilla of ships and investigate how they can achieve their objective in a distributed manner. The dynamics of the model and the objectives are studied in detail, and a decentralized missile deflection algorithm based on solving a stochastic shortest path game is given. The main result is a complete formulation of the missile deflection problem as a stochastic shortest path game, and a distributed algorithm for computing the Nash equilibrium when the game is purely collaborative.\",\"PeriodicalId\":313251,\"journal\":{\"name\":\"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNSC.2005.1461237\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC.2005.1461237","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Game-theoretic missile deflection in network centric warfare
We construct a model for a distributed network of agents charged with defending a flotilla of ships and investigate how they can achieve their objective in a distributed manner. The dynamics of the model and the objectives are studied in detail, and a decentralized missile deflection algorithm based on solving a stochastic shortest path game is given. The main result is a complete formulation of the missile deflection problem as a stochastic shortest path game, and a distributed algorithm for computing the Nash equilibrium when the game is purely collaborative.