This article considers quadruped locomotion control in the presence of uncertainties. Two types of structured uncertainties are considered, namely, uncertain friction constraints and uncertain model dynamics. Then, a min-max optimization model is formulated based on robust optimization, and a robust min-max model predictive controller is proposed by recurrently solving the optimization model. We prove that the min-max optimization model is equivalent to a convex quadratic constrained quadratic program by exploiting the structure of uncertainties. Moreover, a two-stage optimization algorithm is proposed to solve the optimization problem efficiently, allowing for the deployment of the controller onto the real robot. The results show that the proposed optimization algorithm can improve solving frequency by $\sim$ 11× compared with Gurobi. The proposed controller is able to stabilize quadruped locomotion in challenging scenarios where the uncertainties are caused by significant disturbances and unknown environments.
26 September 2017 in IEEE Transactions on Medical Imaging
Myocardial contrast echocardiography (MCE) is an imaging technique that assesses left ventricle function and myocardial perfusion for the detection of coronary artery diseases. Automatic MCE perfusion quantification is challenging and requires accurate segmentation of the myocardium from noisy and time-varying images. Random forests (RF) have been successfully applied to many medical image segmentation tasks. However, the pixel-wise RF classifier ignores contextual relationships between label outputs of individual pixels. RF which only utilizes local appearance features is also susceptible to data suffering from large intensity variations. In this paper, we demonstrate how to overcome the above limitations of classic RF by presenting a fully automatic segmentation pipeline for myocardial segmentation in full-cycle 2D MCE data. Specifically, a statistical shape model is used to provide shape prior information that guide the RF segmentation in two ways. First, a novel shape model (SM) feature is incorporated into the RF framework to generate a more accurate RF probability map. Second, the shape model is fitted to the RF probability map to refine and constrain the final segmentation to plausible myocardial shapes. We further improve the performance by introducing a bounding box detection algorithm as a preprocessing step in the segmentation pipeline. Our approach on 2D image is further extended to 2D+t sequences which ensures temporal consistency in the final sequence segmentations. When evaluated on clinical MCE datasets, our proposed method achieves notable improvement in segmentation accuracy and outperforms other state-of-the-art methods including the classic RF and its variants, active shape model and image registration.
New Framework Unifies Capacitated Vehicle Routing Problem Under Risk and Ambiguity In the study titled “A Unifying Framework for the Capacitated Vehicle Routing Problem Under Risk and Ambiguity,” the authors propose a comprehensive and versatile framework that addresses the challenges posed by demand uncertainty in the capacitated vehicle routing problem (CVRP). This framework is able to consider and incorporate various risk measures, satisficing measures, and disutility functions, providing a unified approach to tackle different variants of the CVRP under uncertainty. By offering a unified treatment of the CVRP under risk and ambiguity, this framework enables decision makers to optimize routing decisions, accounting for the associated risks and uncertainties. One of the key advantages of this framework is its practicality for implementations. The authors demonstrate that an existing branch-and-cut algorithm can effectively solve all variants of the uncertainty-affected CVRP with minimal modifications. This scalability and adaptability make the framework applicable in practical settings.
1 May 2026 in Manufacturing & Service Operations Management
Problem definition: Motivated by the significance of side information in numerous operations management problems, this paper studies conditional stochastic optimization to enable more informed decisions. The side information constitutes observable exogenous covariates that alter the conditional probability distribution of the random problem parameters. Decision makers who adapt their decisions according to the observed side information solve a stochastic optimization problem where the objective function is specified by the conditional expectation of the random cost. If the joint probability distribution is unknown, then the conditional expectation can be approximated in a data-driven manner using kernel regression. Although this approximation scheme has found successful applications in diverse decision problems under uncertainty, it is largely unknown whether the scheme can provide any reasonable out-of-sample performance guarantees, and how such statistical guarantees can guide the decision-making process. Methodology/results: We employ the Nadaraya–Watson kernel regression for data-driven approximation of the conditional expectation and leverage moderate deviations theory to establish its performance guarantees. Our analysis and resultant statistical bounds motivate the use of a conditional standard deviation regularization scheme to enhance out-of-sample performances. As the designed regularization scheme leads to a nonconvex optimization problem, we further adopt ideas from distributionally robust optimization to obtain tractable formulations. We examine our proposed models on portfolio optimization, inventory management, and wind energy commitment problems. The numerical results demonstrate the effectiveness of our proposed regularization scheme. Managerial implications: Our paper illustrates the importance of side information in real-world decision-making problems. Incorporating side information through a regularized Nadaraya–Watson scheme offers managers a robust framework to enhance decision making under uncertainty. The theoretical guarantees provide guidance on the number of samples required to obtain high-quality solutions and how to optimally adjust the regularization parameter. For problem instances with high-dimensional covariates, we further present a simple dimensionality reduction procedure that helps improve the sample complexity of the scheme. All our proposed formulations are concise and straightforward for the operations manager to implement using any popular programming language interfaced with standard off-the-shelf solvers. Funding: Y. Wang was supported by the National Natural Science Foundation of China [Grant 72501204] and the Fundamental Research Funds for the Central Universities. G. A. Hanasusanto was funded by the National Science Foundation [Grants CCF-2343869 and ECCS-2404413]. C. P. Ho was supported by the Research Grants Council [General Research Fund 11508623] and the CityUHK Start-Up Grant [9610481]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.0997 .
As the computing industry enters the Cloud era, multicore architectures and virtualisation technologies are replacing traditional IT infrastructures. However, the complex relationship between applications and system resources in multicore virtualised environments is not well understood. Workloads such as web services and on-line financial applications have the requirement of high performance but benchmark analysis suggests that these applications do not optimally benefit from a higher number of cores. In this paper, we try to understand the scalability behaviour of network/CPU intensive applications running on multicore architectures. We begin by benchmarking the Petstore web application, noting the systematic imbalance that arises with respect to per-core workload. Having identified the reason for this phenomenon, we propose a queueing model which, when appropriately parametrised, reflects the trend in our benchmark results for up to 8 cores. Key to our approach is providing a fine-grained model which incorporates the idiosyncrasies of the operating system and the multiple CPU cores. Analysis of the model suggests a straightforward way to mitigate the observed bottleneck, which can be practically realised by the deployment of multiple virtual NICs within our VM. Next we make blind predictions to forecast performance with multiple virtual NICs. The validation results show that the model is able to predict the expected performance with relative errors ranging between 8 and 26%.