2014 American Control Conference 2014
DOI: 10.1109/acc.2014.6859306
|View full text |Cite
|
Sign up to set email alerts
|

Optimal perimeter patrol via max-plus probability

Abstract: This paper addresses a perimeter patrol problem involving control of unmanned air vehicles. Around the perimeter of a protected area are placed a number of unmanned ground stations. These stations send alert signals which are investigated by the unmanned air vehicles. We present an approach to optimization of vehicle tasking based on max-plus probabilistic models and computational schemes.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…They utilized shared information to calculate expected idleness to solve decision conflicts. Fitzpatrick et al [11] addressed a perimeter patrol problem with heterogeneous agents involving unmanned ground stations and unmanned air vehicles and presented an optimization approach built on max-plus probability. Farinelli et al [12] presented a greedy baseline approach and a market-basedapproach based on sequential auction algorithms to tackle on-line coordination in the multi-robot system.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…They utilized shared information to calculate expected idleness to solve decision conflicts. Fitzpatrick et al [11] addressed a perimeter patrol problem with heterogeneous agents involving unmanned ground stations and unmanned air vehicles and presented an optimization approach built on max-plus probability. Farinelli et al [12] presented a greedy baseline approach and a market-basedapproach based on sequential auction algorithms to tackle on-line coordination in the multi-robot system.…”
Section: Related Workmentioning
confidence: 99%
“…They have to return to the mother ship and recharge before the next patrol. In every patrol, the constraint expressed by Equations (11) and (12) ensure that the USV starts from the mother ship before patrolling and return to the mother ship after completing a patrol. The constraint in Equation (13) guarantees that the number of arrivals and departures at a target are the same.…”
Section: Problem Formulationmentioning
confidence: 99%