On Optimal Policies for Risk-Aware Sensor Data Collection by a Mobile Agent

Prasad, Amritha; Hudack, Jeffrey; Sundaram, Shreyas

doi:10.1016/j.ifacol.2019.12.175

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, it was shown that the solution to some team risk-aware OP problems have a matroid structure which allow for matroid optimization techniques [4]. However, if the problem introduces some cyclic behavior like a return depot, then the cycles can break the matroid structure and other optimization techniques are required [10]. The return depot formulation encompasses many real-world applications like search and rescue, sensor data collection, and package delivery.…”

Section: Introductionmentioning

confidence: 99%

Planning for Package Deliveries in Risky Environments Over Multiple Epochs

Wilson¹,

Hudack²,

Sundaram³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We study a risk-aware robot planning problem where a dispatcher must construct a package delivery plan that maximizes the expected reward for a robot delivering packages across multiple epochs. Each package has an associated reward for delivery and a risk of failure. If the robot fails while delivering a package, no future packages can be delivered and the cost of replacing the robot is incurred. The package delivery plan takes place over the course of either a finite or an infinite number of epochs, denoted as the finite horizon problem and infinite horizon problem, respectively. The dispatcher has to weigh the risk and reward of delivering packages during any given epoch against the potential loss of any future epoch's reward. By using the ratio between a package's reward and its risk of failure, we prove an optimal, greedy solution to both the infinite and finite horizon problems. The finite horizon problem can be solved optimally in O(Kn log n) time where K is the number of epochs and n is the number of packages. We show an isomorphism between the infinite horizon problem and Markov Decision Processes to prove an optimal O(n) time algorithm for the infinite horizon problem.

show abstract

Section: Introductionmentioning

confidence: 99%