Fast algorithms for UAV tasking and routing

Ding, Huanyu; Castañón, David A.

doi:10.1109/cca.2016.7587859

Cited by 5 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An important class of problems related to the applications of these intelligent systems is the detection and localization of hidden objects of interest, known as search problems [1]- [7] in the operation research, statistics and control communities. Examples of search problems include localizing a lost submarine or plane in the ocean [2], determining faulty components in a system [8], discovering archaeological sites [9], [10], etc.…”

Section: Introductionmentioning

confidence: 99%

Multi-agent discrete search with limited visibility

Ding

Castañón

2017

2017 IEEE 56th Annual Conference on Decision and Control (CDC)

Self Cite

View full text Add to dashboard Cite

The problem of search by multiple agents to find and localize objects arises in many important applications. In this paper, we study a class of multi-agent search problems in which each agent can access only a subset of a discrete search space, with detection performance that depends only on the location. We show that this problem can be reformulated as a minimum cost network optimization problem, and develop a fast specialized algorithm for the solution. We prove that our algorithm is correct, and has worst case computation performance that is faster than general minimum cost flow algorithms. We also address the problem where detection performance depends on both location and agent, which is known to be NP-Hard. We reduce the problem to a submodular maximization problem over a matroid, and provide an approximate algorithm with guaranteed performance. We illustrate the performance of our algorithms with simulations of search problems and compare it with other min-cost flow algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%