• Corpus ID: 239024782

Planning for Package Deliveries in Risky Environments Over Multiple Epochs

  title={Planning for Package Deliveries in Risky Environments Over Multiple Epochs},
  author={Blake Wilson and Jeffrey Hudack and Shreyas Sundaram},
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… 


The Matroid Team Surviving Orienteers problem: Constrained routing of heterogeneous teams with risky traversal
An approximate greedy algorithm for selecting a feasible set of paths is proposed and it is proved that the value of the output is within a factor ps/ps + λ of the optimum, where ps is the per-robot survival probability threshold and 1/λ ≤ 1 is the approximation factor of an oracle routine for the well known orienteering problem.
Risk-Aware Planning for Sensor Data Collection
This dissertation presents a problem formulation that includes the risk of losing agents, the effect of those losses on the mission being executed, and provides anticipatory planning algorithms that consider risk, showing an improvement over traditional multi-agent planning methods as high as 500% on very large problem instances.
Submodular Optimization for Coupled Task Allocation and Intermittent Deployment Problems
In this letter, a formulation for optimizing coupled submodular maximization problems with provable sub-optimality bounds is demonstrated and a greedy algorithm for solving this class of problem is presented, along with sub- optimality guarantees.
On Optimal Policies for Risk-Aware Sensor Data Collection by a Mobile Agent
A scenario where a mobile agent is required to collect measurements from a geographically dispersed set of sensors and return them to a base is considered and several properties of the optimal policy for the agent are characterized based on a quantity that is termed the "reward-to-risk" ratio of the tasks.
A Multi-robot Control Policy for Information Gathering in the Presence of Unknown Hazards
A probabilistic model of the environment is formulated, under which recursive Bayesian filters are used to estimate the environment events and hazards online and Mutual information is shown to combine the competing incentives of avoiding failure and collecting informative measurements under a common objective.
Orienteering Problem: A survey of recent variants, solution approaches and applications
The most recent applications of the OP, such as the Tourist Trip Design Problem and the mobile-crowdsourcing problem are discussed.
Monitoring Over the Long Term: Intermittent Deployment and Sensing Strategies for Multi-Robot Teams
  • J. Liu, Ryan K. Williams
  • Computer Science
    2020 IEEE International Conference on Robotics and Automation (ICRA)
  • 2020
The intermittent deployment problem is formulated and solved, which yields strategies that couple when heterogeneous robots should sense an environmental process, with where a deployed team should sense in the environment, using the theories of submodular optimization and matroids and a greedy algorithm with bounds on sub-optimality.
Agent-based model of maritime traffic in piracy-affected waters
Contemporary maritime piracy presents a significant threat to global shipping industry, with annual costs estimated at up to US$7bn. To counter the threat, policymakers, shipping operators and navy
A Survey of Mobile Robots for Distribution Power Line Inspection
The purpose of this paper is to present the most important achievements in the field of distribution power line inspection by mobile robots. Stimulated by the need for fast, accurate, safe and
The selective travelling salesman problem
Abstract Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting a simple circuit of maximal total