Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song
Evaluation Of Time-Varying Availability In Multi-Echelon Inventory System With Combat Damage, Hoong Chuin Lau, Huawei Song
Research Collection School Of Computing and Information Systems
The models for multi-echelon inventory systems in existing literatures predominantly address failures due to reliability in peacetime. In wartime or even peacetime operational scenarios, unexpected combat damage can cause a large number of systems to be heavily damaged, to the extent that they become irreparable. In this paper, we study a multi-echelon spare parts support system under combat damage, discuss the replenishment policy and propose an approximate method to evaluate the time-varying system performance operational availability considering the effect of passivation. Experiments show our model works well and efficiently against simulation.
Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe
Exploiting Belief Bounds: Practical Pomdps For Personal Assistant Agents, Pradeep Varakantham, Rajiv Maheswaran, Milind Tambe
Research Collection School Of Computing and Information Systems
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users themselves) and making periodic decisions based on such monitoring. POMDPs appear well suited to enable agents to address these challenges, given the uncertain environment and cost of actions, but optimal policy generation for POMDPs is computationally expensive. This paper introduces three key techniques to speedup POMDP policy generation that exploit the notion of progress or dynamics in personal assistant domains. Policy computation is restricted to the belief space polytope that remains …
A Multi-Agent Approach For Solving Optimization Problems Involving Expensive Resources, Hoong Chuin Lau, H. Wang
A Multi-Agent Approach For Solving Optimization Problems Involving Expensive Resources, Hoong Chuin Lau, H. Wang
Research Collection School Of Computing and Information Systems
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserably. More specifically, we study the class of bin-packing problems. Under our proposed Fine-Grained Agent System scheme, rational agents work both collaboratively and selfishly based on local search and mimic physics-motivated systems. We apply our approach to a generalization of bin-packing - the Inventory Routing Problem with Time Windows - which is an important logistics problem, and demonstrate the efficiency and effectiveness of our approach.
Robust Temporal Constraint Networks, Hoong Chuin Lau, Thomas Ou, Melvyn Sim
Robust Temporal Constraint Networks, Hoong Chuin Lau, Thomas Ou, Melvyn Sim
Research Collection School Of Computing and Information Systems
In this paper, we propose the Robust Temporal Constraint Network (RTCN) model for simple temporal constraint networks where activity durations are bounded by random variables. The problem is to determine whether such temporal network can be executed with failure probability less than a given 0 ≤ E ≤ 1 for each possible instantiation of the random variables, and if so. how one might find a feasible schedule with each given instantiation. The advantage of our model is that one can vary the value of ∊ to control the level of conservativeness of the solution. We present a computationally tractable and …