Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments

by   Jianhui Wu, et al.

Because an agents resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such as power or payload restrictions), the competing needs of other agents for the same resources, and the stochastic nature of the environment. Such agents can, in general, achieve more of their objectives if they can use --- and even create --- opportunities to change which resources they hold at various times. Driven by resource constraints, the agents could break their overall missions into an optimal series of phases, optimally reconfiguring their resources at each phase, and optimally using their assigned resources in each phase, given their knowledge of the stochastic environment. In this paper, we formally define and analyze this constrained, sequential optimization problem in both the single-agent and multi-agent contexts. We present a family of mixed integer linear programming (MILP) formulations of this problem that can optimally create phases (when phases are not predefined) accounting for costs and limitations in phase creation. Because our formulations multaneously also find the optimal allocations of resources at each phase and the optimal policies for using the allocated resources at each phase, they exploit structure across these coupled problems. This allows them to find solutions significantly faster(orders of magnitude faster in larger problems) than alternative solution techniques, as we demonstrate empirically.


page 1

page 2

page 3

page 4


Compact Mathematical Programs For DEC-MDPs With Structured Agent Interactions

To deal with the prohibitive complexity of calculating policies in Decen...

Hybrid Information-driven Multi-agent Reinforcement Learning

Information theoretic sensor management approaches are an ideal solution...

Information-Theoretic Abstractions for Resource-Constrained Agents via Mixed-Integer Linear Programming

In this paper, a mixed-integer linear programming formulation for the pr...

Resource Allocation Among Agents with MDP-Induced Preferences

Allocating scarce resources among agents to maximize global utility is, ...

Constrained Environment Optimization for Prioritized Multi-Agent Navigation

Traditional approaches to the design of multi-agent navigation algorithm...

A Survey of Phase Classification Techniques for Characterizing Variable Application Behavior

Adaptable computing is an increasingly important paradigm that specializ...

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

We present a novel anytime heuristic (ALMA), inspired by the human princ...

Please sign up or login with your details

Forgot password? Click here to reset