{"title":"寻找运动目标:最优路径规划","authors":"D. Grundel","doi":"10.1109/ICNSC.2005.1461306","DOIUrl":null,"url":null,"abstract":"We consider the problem of constrained path planning for one or two agents in search of a single randomly moving target such that we maximize the probability of intercepting the target at some time in its trajectory. We assume the agents operate in a receding-horizon optimization framework with some finite planning horizon. We present and compare several search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Searching for a moving target: optimal path planning\",\"authors\":\"D. Grundel\",\"doi\":\"10.1109/ICNSC.2005.1461306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of constrained path planning for one or two agents in search of a single randomly moving target such that we maximize the probability of intercepting the target at some time in its trajectory. We assume the agents operate in a receding-horizon optimization framework with some finite planning horizon. We present and compare several search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets.\",\"PeriodicalId\":313251,\"journal\":{\"name\":\"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"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.1461306\",\"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.1461306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Searching for a moving target: optimal path planning
We consider the problem of constrained path planning for one or two agents in search of a single randomly moving target such that we maximize the probability of intercepting the target at some time in its trajectory. We assume the agents operate in a receding-horizon optimization framework with some finite planning horizon. We present and compare several search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
