A number of algorithms for mobile robot path have been described in the robotics control literature. This paper presents a comparative experimental study of the classical controllers for the path tracking 1-link robot. Dynamic model of the robot has been taken here and two types of controls i.e. PD and PID have been compared. Experiments have been done by using MATLAB. Gains for both the contro...

An appreciation of the many roles of "precision-weighting" (upping the gain on select populations of prediction error units) opens the door to better accounts of planning and "offline simulation," makes suggestive contact with large bodies of work on embodied and situated cognition, and offers new perspectives on the "active brain". Combined with the complex affordances of language and culture,...

In spoken dialog systems, statistical state tracking aims to improve robustness to speech recognition errors by tracking a posterior distribution over hidden dialog states. Current approaches based on generative or discriminative models have different but important shortcomings that limit their accuracy. In this paper we discuss these limitations and introduce a new approach for discriminative ...

In this paper we are proposing the use of Artificial Neural Networks (ANN'S) as an operator aid in the dynamic security assessment of power systems. The basic role of ANN's in this study is to provide assessment of the system's security based on training examples from off-line analysis. The ANN'S in this study are trained either by 1) randomly distributed data which facilitate the utilization o...

This paper proposes a new methodology for robotic offline programming (OLP) addressing the issue of automatic program generation directly from 3D CAD models and verification through online 3D reconstruction. Limitations of current OLP include manufacturing tolerances between CAD and workpieces and inaccuracies in workpiece placement and modelled work cell. These issues are addressed and demonst...

Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), exploits structured interaction to produce significant computational gains. Empirically, CSA exhibits very good anytime performance, but an error bound on the results has not been established. We reformulate the algorithm a...

Submission to NIPS*97, Category: Algorithms & Architectures, Preferred: Oral ”Boosting” is a general method for improving the performance of any learning algorithm that consistently generates classifiers which need to perform only slightly better than random guessing. A recently proposed and very promising boosting algorithm is AdaBoost [5]. It has been applied with great success to several ben...

A reduced basis finite element heterogeneous multiscale method (RB-FE-HMM) for a class of nonlinear homogenization elliptic problems of nonmonotone type is introduced. In this approach, the solutions of the micro problems needed to estimate the macroscopic data of the homogenized problem are selected by a Greedy algorithm and computed in an offline stage. It is shown that the use of reduced bas...

We consider the computation of averaged coefficients for the homogenization of elliptic partial differential equations. In this problem, like in many multiscale problems, a large number of similar computations parametrized by the macroscopic scale is required at the microscopic scale. This is a framework very much adapted to model order reduction attempts. The purpose of this work is to show ho...

Online near-infrared spectroscopy was used as a process analysis technique in the synthesis of 2-chloropropionate for the first time. Then, the partial least squares regression (PLSR) quantitative model of the product solution concentration was established and optimized. Correlation coefficient (R (2)) of partial least squares regression (PLSR) calibration model was 0.9944, and the root mean sq...