Force sensor of a climbing robot derived from its own flexible structure

One of the most important design constraints of a climbing robot is its own weight. When links or legs are used as a locomotion system they tend to be composed of special lightweight materials, or four-bars-linkage mechanisms are designed to reduce the weight with small rigidity looses. In these cases, flexibility appears and undesirable effects, such as dynamics vibrations, must be avoided at least when the robot moves at low speeds. The knowledge of the real tip position requires the computation of its compliance or stiffness matrix and the external forces applied to the structure. Gravitational forces can be estimated, but external tip forces need to be measured. This paper proposes a strain gauge system which achieves the following tasks: (i) measurement of the external tip forces, and (ii) estimation of the real tip position (including flexibility effects). The main advantages of the proposed system are: (a) the use of external force sensors is avoided, and (b) a substantial reduction of the robot weight is achieved in comparison with other external force measurement systems. The proposed method is applied to a real symmetric climbing robot and experimental results are presented.

Dynamic control of a reconfigurable stair-climbing mobility system

Electric-powered wheelchairs improve the mobility of people with physical disabilities, but the problem to deal with certain architectural barriers has not been resolved satisfactorily. In order to solve this problem, a stair-climbing mobility system (SCMS) was developed. This paper presents a practical dynamic control system that allows the SCMS to exhibit a successful climbing process when faced with typical architectural barriers such as curbs, ramps, or staircases. The implemented control system depicts high simplicity, computational efficiency, and the possibility of an easy implementation in a microprocessor-/microcontroller-based system. Finally, experiments are included to support theoretical results.

Student academic performance stochastic simulator based on the Monte Carlo method

In this paper, a computer-based tool is developed to analyze student performance along a given curriculum. The proposed software makes use of historical data to compute passing/failing probabilities and simulates future student academic performance based on stochastic programming methods (MonteCarlo) according to the specific university regulations. This allows to compute the academic performance rates for the specific subjects of the curriculum for each semester, as well as the overall rates (the set of subjects in the semester), which are the efficiency rate and the success rate. Additionally, we compute the rates for the Bachelors degree, which are the graduation rate measured as the percentage of students who finish as scheduled or taking an extra year and the efficiency rate (measured as the percentage of credits of the curriculum with respect to the credits really taken). In Spain, these metrics have been defined by the National Quality Evaluation and Accreditation Agency (ANECA). Moreover, the sensitivity of the performance metrics to some of the parameters of the simulator is analyzed using statistical tools (Design of Experiments). The simulator has been adapted to the curriculum characteristics of the Bachelor in Engineering Technologies at the Technical University of Madrid(UPM).

Quality-optimization algorithm based on stochastic dynamic programming for MPEG DASH video streaming

In contrast to traditional push-based protocols, adaptive streaming techniques like Dynamic Adaptive Streaming over HTTP (DASH) fix attention on the client, who dynamically requests different-quality portions of the content to cope with a limited and variable bandwidth but aiming at maximizing the quality perceived by the user. Since DASH adaptation logic at the client is not covered by the standard, we propose a solution based on Stochastic Dynamic Programming (SDP) techniques to find the optimal request policies that guarantee the users' Quality of Experience (QoE). Our algorithm is evaluated in a simulated streaming session and is compared with other adaptation approaches. The results show that our proposal outperforms them in terms of QoE, requesting higher qualities on average.

Asymptotic optimality of RESTART estimators in highly dependable systems

Abstract We consider a wide class of models that includes the highly reliable Markovian systems (HRMS) often used to represent the evolution of multi-component systems in reliability settings. Repair times and component lifetimes are random variables that follow a general distribution, and the repair service adopts a priority repair rule based on system failure risk. Since crude simulation has proved to be inefficient for highly-dependable systems, the RESTART method is used for the estimation of steady-state unavailability and other reliability measures. In this method, a number of simulation retrials are performed when the process enters regions of the state space where the chance of occurrence of a rare event (e.g., a system failure) is higher. The main difficulty involved in applying this method is finding a suitable function, called the importance function, to define the regions. In this paper we introduce an importance function which, for unbalanced systems, represents a great improvement over the importance function used in previous papers. We also demonstrate the asymptotic optimality of RESTART estimators in these models. Several examples are presented to show the effectiveness of the new approach, and probabilities up to the order of 10-42 are accurately estimated with little computational effort.

Optimization methods for the operating room management under uncertainty: stochastic programming vs. decomposition approach

The operating theatres are the engine of the hospitals; proper management of the operating rooms and its staff represents a great challenge for managers and its results impact directly in the budget of the hospital. This work presents a MILP model for the efficient schedule of multiple surgeries in Operating Rooms (ORs) during a working day. This model considers multiple surgeons and ORs and different types of surgeries. Stochastic strategies are also implemented for taking into account the uncertain in surgery durations (pre-incision, incision, post-incision times). In addition, a heuristic-based methods and a MILP decomposition approach is proposed for solving large-scale ORs scheduling problems in computational efficient way. All these computer-aided strategies has been implemented in AIMMS, as an advanced modeling and optimization software, developing a user friendly solution tool for the operating room management under uncertainty.