受限搜索移动目标

Proceedings of the 2005 International Symposium on Collaborative Technologies and Systems, 2005. Pub Date : 2005-05-15 DOI:10.1109/ISCST.2005.1553330

D. Grundel

{"title":"受限搜索移动目标","authors":"D. Grundel","doi":"10.1109/ISCST.2005.1553330","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 two search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets","PeriodicalId":283620,"journal":{"name":"Proceedings of the 2005 International Symposium on Collaborative Technologies and Systems, 2005.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Constrained search for a moving target\",\"authors\":\"D. Grundel\",\"doi\":\"10.1109/ISCST.2005.1553330\",\"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 two search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets\",\"PeriodicalId\":283620,\"journal\":{\"name\":\"Proceedings of the 2005 International Symposium on Collaborative Technologies and Systems, 2005.\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2005 International Symposium on Collaborative Technologies and Systems, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCST.2005.1553330\",\"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 of the 2005 International Symposium on Collaborative Technologies and Systems, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCST.2005.1553330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

我们考虑一个或两个智能体在寻找一个随机移动目标时的约束路径规划问题，使目标在其轨迹上的某一时刻被拦截的概率最大化。我们假设智能体在具有有限规划水平的后退水平优化框架中运行。提出并比较了两种搜索路径规划方法。这个问题特别适用于广域搜索弹药搜索和打击移动地面目标的情况

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

查看原文本刊更多论文

Constrained search for a moving target

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 two search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets

求助全文

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

来源期刊

Proceedings of the 2005 International Symposium on Collaborative Technologies and Systems, 2005.

自引率

0.00%

发文量