A comparative study between the augmented Lagrangian method and the complementarity approach for modeling the contact problem

The increasing demand for real-time high-fidelity multibody dynamics simulations in several modern fields such as robotics and computer game industries has motivated many researches to propose novel approaches to model multibody systems with several contacts. The possibility of different contact conditions in a system with several contacts yields a combinatorial problem of potentially large size. Rigid contact model which is the most common model used for real-time simulations yields a non-smooth dynamic formulation. The solution of such a system can be governed using different methods. In this paper a comparison between the complementarity approaches and the augmented Lagrangian based formulations to deal with non-smooth contact models is presented via numerical examples, and the advantages and shortcomings of each method are discussed.     

Robust Stability and Stabilization Of TCP‐Networked Control Systems with Multiple Delay System Modeling

This paper presents a new model for networked control systems (NCSs) under transmission control protocol (TCP) as a multiple‐delay system by considering both sensor to controller and controller to actuator delays. An analytical TCP model has been considered for the network part, and an active queue management (AQM) controller is designed to regulate the desired queue length, which ensures holding the network induced delay and its variation within their lower bounds. The model is assumed to possess structured uncertainties due to the stochastic nature of the network. Robust stability and stabilization conditions are derived in terms of linear matrix inequalities (LMIs) by applying the Lyapunov‐Krasovskii stability criterion. Illustrative examples are presented and it has been shown that the proposed method will obtain less conservative results compared to the existing approaches in the literature.     

Structural Properties of Networked Control Systems With Bandwidth Limitations and Delays

The structural properties of networked control systems with both bandwidth limitations and delays are investigated. Sufficient conditions are given for controllability (stabilizability) and reconstructibility (detectability). Our results enhance previous works by capturing bandwidth limitations and delays simultaneously. The adopted modeling framework could be readily used in control and estimation methods, including optimal and predictive schemes. It also facilitates the use of scheduling optimization algorithms in conjunction with the control scheme presented.     

Robust model predictive control of biped robots with adaptive on-line gait generation

International Journal of Control, Automation and Systems - In this paper, an on-line gait control scheme is proposed for the biped robots for walking up and down the stairs. In the proposed...     

Multi-objective optimization of laminated composite shells for minimum mass/cost and maximum buckling pressure with failure criteria under external hydrostatic pressure

In the present study, Multi-objective optimization of composite cylindrical shell under external hydrostatic pressure was investigated. Parameters of mass, cost and buckling pressure as fitness functions and failure criteria as optimization criterion were considered. The objective function of buckling has been used by performing the analytical energy equations and Tsai-Wu and Hashin failure criteria have been considered. Multi-objective optimization was performed by improving the evolutionary algorithm of NSGA-II. Also the kind of material, quantity of layers and fiber orientations have been considered as design variables. After optimizing, Pareto front and corresponding points to Pareto front are presented. Trade of points which have optimized mass and cost were selected by determining the specified pressure as design criteria. Finally, an optimized model of composite cylindrical shell with the optimum pattern of fiber orientations having appropriate cost and mass is presented which can tolerate the maximum external hydrostatic pressure.

     

Data-Driven Texture Rendering on an Electrostatic Tactile Display

In this article, we present a data-driven texture rendering method applied to a tactile display based on electrostatic attraction. The proposed method was examined in two steps. First, accelerations occurring due to sliding a tool on three different surfaces were measured, and then the collected data were replayed on an electrostatic tactile display. The proposed data-driven texture rendering method was evaluated against a conventional method in which a standard input such as a square wave was used for texture representation. Second, data from the Penn Haptic Texture Toolkit were used to generate virtual textures on the same tactile display. Psychophysical experiments were carried out for both steps, during which subjects rated similarities among the rendered virtual textures and the real samples. Confusion matrices were created, and multidimensional scaling (MDS) analysis was performed to create a perceptual space for further examination and to extract underlying dimensions of the textures. The results show that the virtual textures generated using the data-driven method were similar to the real textures. Roughness and stickiness were the primary dimensions of texture perception. Together with the supporting results from the MDS analysis, this study showed that the data-driven method is a viable solution for realistic texture rendering with electrostatic attraction.     

Finite time control of robotic manipulators with position output feedback

This paper deals with the robust finite time tracking of desired trajectories for a wide group of robotic manipulators in spite of unknown disturbances, uncertainties, and saturations of actuators while only manipulator's positions are available and its velocities are not measurable physically. A new form of chattering‐free second order fast nonsingular terminal sliding mode control scheme is introduced to design input torques for fulfilling the determined tracking objective in the adjustable total finite settling time. The proposed control algorithm is incorporated with two nonlinear observers to estimate disturbances and velocities of joints within finite settling times. The global finite time stability of the closed‐loop manipulator is analytically proved. Finally, a numerical simulation is carried out to verify the effectiveness of the designed input torques. Copyright © 2017 John Wiley & Sons, Ltd.     

On the robustness of Type-1 and Interval Type-2 fuzzy logic systems in modeling

Research on the robustness of fuzzy logic systems (FLSs), an imperative factor in the design process, is very limited in the literature. Specifically, when a system is subjected to small deviations of the sampling points (operating points), it is of great interest to find the maximum tolerance of the system, which we refer to as the system’s robustness. In this paper, we present a methodology for the robustness analysis of interval type-2 FLSs (IT2 FLSs) that also holds for T1 FLSs, hence, making it more general. A procedure for the design of robust IT2 FLSs with a guaranteed performance better than or equal to their T1 counterparts is then proposed. Several examples are performed to demonstrate the effectiveness of the proposed methodologies. It was concluded that both T1 and IT2 FLSs can be designed to achieve robust behavior in various applications, and preference one or the other, in general, is application-dependant. IT2 FLSs, having a more flexible structure than T1 FLSs, exhibited relatively small approximation errors in the several examples investigated. The methodologies presented in this paper lay the foundation for the design of FLSs with robust properties that will be very useful in many practical modeling and control applications.     

Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks

Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must be reduced for effective utilization of the available resources. If two nodes have the same coverage area in their active state, and if both the nodes are activated simultaneously, it leads to redundancy in network and wastage of precious sensor resources. In this paper, we address the problem of network coverage and connectivity and propose an efficient solution to maintain coverage, while preserving the connectivity of the network. The proposed solution aims to cover the area of interest (AOI), while minimizing the count of the active sensor nodes. The overlap region of two sensor nodes varies with the distance between the nodes. If the distance between two sensor nodes is maximized, the overall coverage area of these nodes will also be maximized. Also, to preserve the connectivity of the network, each sensor node must be in the communication range of at least one other node. Results of simulation of the proposed solution indicate up to 95% coverage of the area, while consuming very less energy of 9.44 J per unit time in the network, simulated in an area of 2500 m².     

SimClus: an effective algorithm for clustering with a lower bound on similarity

Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization, social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects, yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively used in an on-line setting.