Persistent Visitation with Fuel Constraints

Fargeas, Jonathan Las; Hyun, Baro; Kabamba, Pierre T.; Girard, Anouck

doi:10.1016/j.sbspro.2012.09.819

Cited by 15 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The complexity class of the problem and applicable heuristics are investigated in [29]. Fuel was considered in [30] and an algorithm to provide a minimal cost path for the vehicle was provided. This work was extended to a base defense scenario where multiple UAVs were tasked with patrolling a road network connected to the base (using a revisit deadline framework) and intercepting intruders before they reach the base.…”

Section: Previous Workmentioning

confidence: 99%

“…As such, finding constraints that guarantee the existence of paths for a given set of revisit deadlines is very difficult and thus feasibility of a set of revisit deadlines is not addressed in this work. Heuristics such as the ones presented in [6], [29], and [30] can be used by the vehicles to satisfy the revisit deadlines or minimize the amount by which they are missed.…”

Section: B Feasibility Of Revisit Deadlinesmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Configuration of Alarm Sensors for Monitoring Mobile Ergodic Markov Phenomena on Arbitrary Graphs

2015

Self Cite

View full text Add to dashboard Cite

Motivated by persistent monitoring tasks, this paper considers the placement of alarm sensors incapable of long-distance communication on arbitrary graphs and the selection of the rates of their revisits (by an external agent) to monitor a mobile phenomenon whose movements occur on a graph and are modeled as an ergodic Markov chain. The alarm sensors can be placed on nodes and edges in the graph and act as both sensors and classifiers (i.e., they make a classification decision about the presence of the phenomenon based on a measurement of their surroundings). An approach to design the classifier for each alarm sensor is provided and methods to fuse the measurements of colocated alarm sensors are given. Sensor placement problems to optimize Fisher information, probability of misclassification, or the penalty incurred by poor detections, missed detections, and false alarms are formulated. Approaches to solve the formulated problems for the different optimization criteria are provided. Characteristics of these approaches are described and their merits are discussed. The sensors' revisit rates are selected by matching the recurrence times of the phenomenon at the sensor locations. The different approaches are illustrated through simulations.Index Terms-Sensor placement, Fisher information, probability of misclassification, revisit deadlines.

show abstract

Section: Previous Workmentioning

confidence: 99%

Section: B Feasibility Of Revisit Deadlinesmentioning

confidence: 99%

Optimal Configuration of Alarm Sensors for Monitoring Mobile Ergodic Markov Phenomena on Arbitrary Graphs

2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…Unlike the PVRP, the frequency for visiting each customer is determined as part of the problem solution due to constraints on information gathering needs. Fargeas et al study the persistent visitation problem, where the goal is to determine the rates at which customers should be patrolled, rather than to assign specific days, and is subject to limitations on the fuel available in the patrolling vehicles.…”

Section: Problem Variants and Extensionsmentioning

confidence: 99%

Forty years of periodic vehicle routing

2013

View full text Add to dashboard Cite

The periodic vehicle routing problem (PVRP) first appeared in 1974 in a paper about garbage collection (Beltrami and Bodin, Networks 4 (1974), 65–74). The wide applicability and versatility of the problem has led to a vast body of literature addressing both novel applications and solution methods. This article discusses the wide array of circumstances and settings in which the PVRP has been applied and describes the development of solution methods, both exact and heuristic, for the PVRP. As with many core research problems, many variants have been proposed. We will describe additional problem variants and extensions, as well as discuss the future of research for the PVRP. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 2–15 2014

show abstract

“…Hence, none of these problems consider the continuous monitoring requirement about the regularly repeated visit of customers (target areas). There are some recent works about persistent surveillance and persistent patrolling ( [11] and [13]), but they usually model the problem as a periodic information gathering via exploration and solve it in an offline fashion. Moreover, the most common objective is the minimization of an index cost (e.g., the total route time, the total route length, the fuel consumption, etc.…”

Section: Related Workmentioning

confidence: 99%

“…Equations (6), (11) and (12) can be merged in order to get a single hard path constraint for the UAV position ‫ݔ‬ሺ‫ݐ‬ሻ. This constraint is…”

Section: Environment Model and Constraintsmentioning

confidence: 99%

Agent-Based Design for UAV Mission Planning

Pascarella

Venticinque

Aversa

2013

2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

View full text Add to dashboard Cite

This paper investigates agent-based modelling and design of a mission planning module for an Unmanned Aerial Vehicle (UAV). Agents can act on behalf of remote human operators, who impose mission objectives, performing autonomous or supervised behaviours. The planning module is in charge to deliberate the strategic tasks to achieve mission objectives and to satisfy environment constraints (area of operations, aircraft performances, etc.). However agent's autonomy level should be variable because the remote pilot is able to carry out "all level" control (strategic, tactical or remote piloting control). Here we define a multi-objective model for implementing a goal-directed decision making support to the planning module. The statement of the problem and the related design concept are described.

show abstract

Persistent Visitation with Fuel Constraints

Cited by 15 publications

References 9 publications

Optimal Configuration of Alarm Sensors for Monitoring Mobile Ergodic Markov Phenomena on Arbitrary Graphs

Optimal Configuration of Alarm Sensors for Monitoring Mobile Ergodic Markov Phenomena on Arbitrary Graphs

Forty years of periodic vehicle routing

Agent-Based Design for UAV Mission Planning

Contact Info

Product

Resources

About