Criteria and approximate methods for path-constrained moving-target search problems

Using multiple searchers in constrained-

Using multiple searchers in constrained-path, moving-target search problems

✍ Robert F. Dell; James N. Eagle; Gustavo Henrique Alves Martins; Almir Garnier Sa 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing a