{"title":"狗追兔子:一个不变的嵌入","authors":"岩本 誠一, Seiichi Iwamoto, セイイチ イワモト","doi":"10.15017/7618","DOIUrl":null,"url":null,"abstract":"In this paper we solve a continuous non-optimization dynamic programming problem: Dog Chases Rabbit problem. The problem has been originated by R. Bellman. We give a complete solution through an invariant imbedding approach. Some related results are derived.","PeriodicalId":246568,"journal":{"name":"kenkyu or Journal of political economy","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dog Chases Rabbit : An Invariant Imbedding\",\"authors\":\"岩本 誠一, Seiichi Iwamoto, セイイチ イワモト\",\"doi\":\"10.15017/7618\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we solve a continuous non-optimization dynamic programming problem: Dog Chases Rabbit problem. The problem has been originated by R. Bellman. We give a complete solution through an invariant imbedding approach. Some related results are derived.\",\"PeriodicalId\":246568,\"journal\":{\"name\":\"kenkyu or Journal of political economy\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"kenkyu or Journal of political economy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15017/7618\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"kenkyu or Journal of political economy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15017/7618","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we solve a continuous non-optimization dynamic programming problem: Dog Chases Rabbit problem. The problem has been originated by R. Bellman. We give a complete solution through an invariant imbedding approach. Some related results are derived.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
