Reference : A mixed integer linear programming approach to pursuit evasion problems with optional...
Scientific journals : Article
Engineering, computing & technology : Multidisciplinary, general & others
http://hdl.handle.net/10993/20604
A mixed integer linear programming approach to pursuit evasion problems with optional connectivity constraints
English
Thunberg, Johan mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
Ögren, P. mailto []
Nov-2011
Autonomous Robots
Springer Science & Business Media B.V.
31
4
333-343
Yes (verified by ORBilu)
0929-5593
1573-7527
[en] Pursuit evasion ; MILP ; Search
[en] 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 smaller MILPs are solved over shorter planning horizons. The proposed approach is implemented in Matlab/Cplex and illustrated by a number of solved examples.
http://hdl.handle.net/10993/20604

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
A mixed integer linear programming approach to pursuit evasion problems with optional connectivity constraints.pdfPublisher postprint575.31 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.