Constrained search for a moving target

被引：0

作者：

Grundel, DA ^{[1
]}

机构：

[1] USAF, AFRL, MNGN, Eglin AFB, FL 32542 USA

来源：

2005 INTERNATIONAL SYMPOSIUM ON COLLABORATIVE TECHNOLOGIES AND SYSTEMS, PROCEEDINGS | 2005年

关键词：

constrained search; moving target;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 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.

引用

页码：327 / 332

页数：6

共 16 条

[1] OPTIMAL SEARCH FOR A MOVING TARGET IN DISCRETE-TIME AND SPACE
BROWN, SS
[J]. OPERATIONS RESEARCH, 1980, 28 (06) : 1275 - 1289
[2] BROWN SS, 1979, SEARCH THEORY APPL, P221
[3] AN OPTIMAL BRANCH-AND-BOUND PROCEDURE FOR THE CONSTRAINED PATH, MOVING TARGET SEARCH PROBLEM
EAGLE, JN
YEE, JR
[J]. OPERATIONS RESEARCH, 1990, 38 (01) : 110 - 114
[4] THE OPTIMAL SEARCH FOR A MOVING TARGET WHEN THE SEARCH PATH IS CONSTRAINED
EAGLE, JN
[J]. OPERATIONS RESEARCH, 1984, 32 (05) : 1107 - 1115
[5] EAGLE JN, 1984, NPS5584009
[6] GRUNDEL DA, 2005, IEEE INT C NETW SENS
[7] KOOPMAN BO, 1980, SEARCH SCREENING
[8] KREUCHER C, 2003, UNPUB IEEE T SIG JUN
[9] A SIMPLE MODEL OF SEARCH FOR A MOVING TARGET
POLLOCK, SM
[J]. OPERATIONS RESEARCH, 1970, 18 (05) : 883 - &
[10] SEARCH FOR A MOVING TARGET WHEN SEARCHER MOTION IS RESTRICTED
STEWART, TJ
[J]. COMPUTERS & OPERATIONS RESEARCH, 1979, 6 (03) : 129 - 140

← 1 2 →