scholarly journals On the Cluster Admission Problem for Cloud Computing

2021 ◽  
Vol 71 ◽  
pp. 1-40
Author(s):  
Ludwig Dierks ◽  
Ian Kash ◽  
Sven Seuken
Keyword(s):  
Cloud Computing ◽  
Substantial Improvement ◽  
Resource Usage ◽  
Threshold Policy ◽  
Admission Policies ◽  
Markov Decision ◽  
Threshold Policies ◽  
Information Elicitation ◽  
Low Efficiency ◽  
Partially Observable

Cloud computing providers face the problem of matching heterogeneous customer workloads to resources that will serve them. This is particularly challenging if customers, who are already running a job on a cluster, scale their resource usage up and down over time. The provider therefore has to continuously decide whether she can add additional workloads to a given cluster or if doing so would impact existing workloads’ ability to scale. Currently, this is often done using simple threshold policies to reserve large parts of each cluster, which leads to low efficiency (i.e., low average utilization of the cluster). We propose more sophisticated policies for controlling admission to a cluster and demonstrate that they significantly increase cluster utilization. We first introduce the cluster admission problem and formalize it as a constrained Partially Observable Markov Decision Process (POMDP). As it is infeasible to solve the POMDP optimally, we then systematically design admission policies that estimate moments of each workload’s distribution of future resource usage. Via extensive simulations grounded in a trace from Microsoft Azure, we show that our admission policies lead to a substantial improvement over the simple threshold policy. We then show that substantial further gains are possible if high-quality information is available about arriving workloads. Based on this, we propose an information elicitation approach to incentivize users to provide this information and simulate its effects.

Optimal adaptive inspection and maintenance for redundant systems

2021 ◽  
pp. 1748006X2110201
Author(s):  
Chaochao Lin ◽  
Matteo Pozzi
Keyword(s):  
Engineering Systems ◽  
Discounted Cost ◽  
Markov Decision ◽  
Inspection And Maintenance ◽  
And Performance ◽  
Partially Observable ◽  
Series Systems ◽  
Selection Of ◽  
Redundant Systems

Optimal exploration of engineering systems can be guided by the principle of Value of Information (VoI), which accounts for the topological important of components, their reliability and the management costs. For series systems, in most cases higher inspection priority should be given to unreliable components. For redundant systems such as parallel systems, analysis of one-shot decision problems shows that higher inspection priority should be given to more reliable components. This paper investigates the optimal exploration of redundant systems in long-term decision making with sequential inspection and repairing. When the expected, cumulated, discounted cost is considered, it may become more efficient to give higher inspection priority to less reliable components, in order to preserve system redundancy. To investigate this problem, we develop a Partially Observable Markov Decision Process (POMDP) framework for sequential inspection and maintenance of redundant systems, where the VoI analysis is embedded in the optimal selection of exploratory actions. We investigate the use of alternative approximate POMDP solvers for parallel and more general systems, compare their computation complexities and performance, and show how the inspection priorities depend on the economic discount factor, the degradation rate, the inspection precision, and the repair cost.

POMDP-Based Coding of Child–Robot Interaction within a Robot-Assisted ASD Diagnostic Protocol

2018 ◽  
Vol 15 (02) ◽  
pp. 1850011 ◽  
Author(s):  
Frano Petric ◽  
Damjan Miklić ◽  
Zdenko Kovačić
Keyword(s):  
Humanoid Robots ◽  
Autism Diagnostic Observation Schedule ◽  
Autism Spectrum ◽  
Diagnostic Process ◽  
Sequential Decision ◽  
Robot Assisted ◽  
Robot Interaction ◽  
Fine Grained ◽  
Markov Decision ◽  
Partially Observable

The existing procedures for autism spectrum disorder (ASD) diagnosis are often time consuming and tiresome both for highly-trained human evaluators and children, which may be alleviated by using humanoid robots in the diagnostic process. Hence, this paper proposes a framework for robot-assisted ASD evaluation based on partially observable Markov decision process (POMDP) modeling, specifically POMDPs with mixed observability (MOMDPs). POMDP is broadly used for modeling optimal sequential decision making tasks under uncertainty. Spurred by the widely accepted autism diagnostic observation schedule (ADOS), we emulate ADOS through four tasks, whose models incorporate observations of multiple social cues such as eye contact, gestures and utterances. Relying only on those observations, the robot provides an assessment of the child’s ASD-relevant functioning level (which is partially observable) within a particular task and provides human evaluators with readable information by partitioning its belief space. Finally, we evaluate the proposed MOMDP task models and demonstrate that chaining the tasks provides fine-grained outcome quantification, which could also increase the appeal of robot-assisted diagnostic protocols in the future.

scholarly journals Towards a balancing safety against performance approach in human–robot co-manipulation for door-closing emergencies

2021 ◽  
Author(s):  
Chuande Liu ◽  
Chuang Yu ◽  
Bingtuan Gao ◽  
Syed Awais Ali Shah ◽  
Adriana Tapus
Keyword(s):  
Loop Control ◽  
Risk Levels ◽  
Human In The Loop ◽  
Planning And Control ◽  
Power Stations ◽  
Markov Decision ◽  
Partially Observable ◽  
And Control ◽  
Self Protection ◽  
Balance Mechanism

AbstractTelemanipulation in power stations commonly require robots first to open doors and then gain access to a new workspace. However, the opened doors can easily close by disturbances, interrupt the operations, and potentially lead to collision damages. Although existing telemanipulation is a highly efficient master–slave work pattern due to human-in-the-loop control, it is not trivial for a user to specify the optimal measures to guarantee safety. This paper investigates the safety-critical motion planning and control problem to balance robotic safety against manipulation performance during work emergencies. Based on a dynamic workspace released by door-closing, the interactions between the workspace and robot are analyzed using a partially observable Markov decision process, thereby making the balance mechanism executed as belief tree planning. To act the planning, apart from telemanipulation actions, we clarify other three safety-guaranteed actions: on guard, defense and escape for self-protection by estimating collision risk levels to trigger them. Besides, our experiments show that the proposed method is capable of determining multiple solutions for balancing robotic safety and work efficiency during telemanipulation tasks.

A Hybrid Decentralized Coordinated Approach for Multi-Robot Exploration Task

2018 ◽  
Vol 62 (9) ◽  
pp. 1284-1300 ◽  
Author(s):  
Khalil Mohamed ◽  
Ayman El Shenawy ◽  
Hany Harb
Keyword(s):  
Task Assignment ◽  
Target Cells ◽  
Local Data ◽  
Networked Robots ◽  
Exploration Process ◽  
Robot Systems ◽  
Markov Decision ◽  
Partially Observable ◽  
Assignment Approach ◽  
Multi Robot

Abstract Exploring the environment using multi-robot systems is a fundamental process that most automated applications depend on. This paper presents a hybrid decentralized task assignment approach based on Partially Observable Semi-Markov Decision Processes called HDec-POSMDPs, which are general models for multi-robot coordination and exploration problems in which robots can make their own decisions according to its local data with limited communication between the robot team. In this paper, a variety of multi-robot exploration algorithms and their comparison have been tackled. These algorithms, which have been taken into consideration, are dependent on different parameters. Collectively, there are five metrics maximize the total exploration percentage, minimize overall mission time, reduce the number of hops in the networked robots, reduce the energy consumed by each robot and minimize the number of turns in the path from the start pose cells to the target cells. Therefore, a team of identical mobile robots is used to perform coordination and exploration process in an unknown cell-based environment. The performance of the task depends on the strategy of coordination among the robots involved in the team. Therefore, the proposed approach is implemented, tested and evaluated in MRESim computer simulator, and its performance is compared with different coordinated exploration strategies for different environments and different team sizes. The experimental results demonstrate a good performance of the proposed approach compared to the four existing approaches.

Sign in / Sign up

Export Citation Format

Share Document