A Mixed Integer Linear Programming approach to pursuit evasion problems with optional connectivity constraints
(2011) In Autonomous Robots 31(4). p.333-343- Abstract
In this paper, we address the multi pursuer version of the pursuit evasion problem in polygonal environments. By discretizing the problem, and applying a Mixed Integer Linear Programming (MILP) framework, we are able to address problems requiring so-called recontamination and also impose additional constraints, such as connectivity between the pursuers. The proposed MILP formulation is less conservative than solutions based on graph discretizations of the environment, but still somewhat more conservative than the original underlying problem. It is well known that MILPs, as well as multi pursuer pursuit evasion problems, are NP-hard. Therefore we apply an iterative Receding Horizon Control (RHC) scheme where a number of smallerMILPs are... (More)
In this paper, we address the multi pursuer version of the pursuit evasion problem in polygonal environments. By discretizing the problem, and applying a Mixed Integer Linear Programming (MILP) framework, we are able to address problems requiring so-called recontamination and also impose additional constraints, such as connectivity between the pursuers. The proposed MILP formulation is less conservative than solutions based on graph discretizations of the environment, but still somewhat more conservative than the original underlying problem. It is well known that MILPs, as well as multi pursuer pursuit evasion problems, are NP-hard. Therefore we apply an iterative Receding Horizon Control (RHC) scheme where a number of smallerMILPs are solved over shorter planning horizons. The proposed approach is implemented in Matlab/Cplex and illustrated by a number of solved examples.
(Less)
- author
- Thunberg, Johan LU and Ögren, Petter
- publishing date
- 2011-11
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- MILP, Pursuit evasion, Search
- in
- Autonomous Robots
- volume
- 31
- issue
- 4
- pages
- 11 pages
- publisher
- Springer
- external identifiers
-
- scopus:84655169261
- ISSN
- 0929-5593
- DOI
- 10.1007/s10514-011-9247-y
- language
- English
- LU publication?
- no
- id
- 79a62da2-894d-4ac9-93ee-55e86a9e63e0
- date added to LUP
- 2024-09-05 12:49:26
- date last changed
- 2024-09-23 15:12:46
@article{79a62da2-894d-4ac9-93ee-55e86a9e63e0,
abstract = {{<p>In this paper, we address the multi pursuer version of the pursuit evasion problem in polygonal environments. By discretizing the problem, and applying a Mixed Integer Linear Programming (MILP) framework, we are able to address problems requiring so-called recontamination and also impose additional constraints, such as connectivity between the pursuers. The proposed MILP formulation is less conservative than solutions based on graph discretizations of the environment, but still somewhat more conservative than the original underlying problem. It is well known that MILPs, as well as multi pursuer pursuit evasion problems, are NP-hard. Therefore we apply an iterative Receding Horizon Control (RHC) scheme where a number of smallerMILPs are solved over shorter planning horizons. The proposed approach is implemented in Matlab/Cplex and illustrated by a number of solved examples.</p>}},
author = {{Thunberg, Johan and Ögren, Petter}},
issn = {{0929-5593}},
keywords = {{MILP; Pursuit evasion; Search}},
language = {{eng}},
number = {{4}},
pages = {{333--343}},
publisher = {{Springer}},
series = {{Autonomous Robots}},
title = {{A Mixed Integer Linear Programming approach to pursuit evasion problems with optional connectivity constraints}},
url = {{http://dx.doi.org/10.1007/s10514-011-9247-y}},
doi = {{10.1007/s10514-011-9247-y}},
volume = {{31}},
year = {{2011}},
}