关于一个自由终末杀人司机游戏的数值解

ESAIM Proceedings and Surveys Pub Date : 2021-08-01 DOI:10.1051/proc/202171104

Francesca Calà Campana, A. Marchi, A. Borzì, M. Gerdts

{"title":"关于一个自由终末杀人司机游戏的数值解","authors":"Francesca Calà Campana, A. Marchi, A. Borzì, M. Gerdts","doi":"10.1051/proc/202171104","DOIUrl":null,"url":null,"abstract":"A functional formulation of the classical homicidal chauffeur Nash game is presented and a numerical framework for its solution is discussed. This methodology combines a Hamiltonian based scheme with proximal penalty to determine the time horizon where the game takes place with a Lagrangian optimal control approach and relaxation to solve the Nash game at a fixed end-time.","PeriodicalId":53260,"journal":{"name":"ESAIM Proceedings and Surveys","volume":"45 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the numerical solution of a free end-time homicidal chauffeur game\",\"authors\":\"Francesca Calà Campana, A. Marchi, A. Borzì, M. Gerdts\",\"doi\":\"10.1051/proc/202171104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A functional formulation of the classical homicidal chauffeur Nash game is presented and a numerical framework for its solution is discussed. This methodology combines a Hamiltonian based scheme with proximal penalty to determine the time horizon where the game takes place with a Lagrangian optimal control approach and relaxation to solve the Nash game at a fixed end-time.\",\"PeriodicalId\":53260,\"journal\":{\"name\":\"ESAIM Proceedings and Surveys\",\"volume\":\"45 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ESAIM Proceedings and Surveys\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/proc/202171104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ESAIM Proceedings and Surveys","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/proc/202171104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

给出了经典杀人司机纳什博弈的函数表达式，并讨论了求解的数值框架。该方法结合了基于哈密顿的方案和近端惩罚来确定博弈发生的时间范围，并结合了拉格朗日最优控制方法和松弛方法来解决固定结束时间的纳什博弈。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the numerical solution of a free end-time homicidal chauffeur game

A functional formulation of the classical homicidal chauffeur Nash game is presented and a numerical framework for its solution is discussed. This methodology combines a Hamiltonian based scheme with proximal penalty to determine the time horizon where the game takes place with a Lagrangian optimal control approach and relaxation to solve the Nash game at a fixed end-time.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ESAIM Proceedings and Surveys

自引率

0.00%

发文量