Indoor positioning systems (IPSs) locate objects in closed structures such as office buildings, hospitals, stores, factories, and warehouses, where Global Positioning System devices generally do not work. Most available systems apply wireless concepts, optical tracking, and/or ultrasound. This paper presents a standalone IPS using radio frequency identification (RFID) technology. The concept is based on an object carrying an RFID reader module, which reads low-cost passive tags installed next to the object path. A positioning system using a Kalman filter is proposed. The inputs of the proposed algorithm are the measurements of the backscattered signal power propagated from nearby RFID tags and a tag-path position database. The proposed algorithm first estimates the location of the reader, neglecting tag-reader angle-path loss. Based on the location estimate, an iterative procedure is implemented, targeting the estimation of the tag-reader angle-path loss, where the latter is iteratively compensated from the received signal strength information measurement. Experimental results are presented, illustrating the high performance of the proposed positioning system.
The learning gain, for a selected learning algorithm, is derived based on minimizing the trace of the input error covariance matrix for linear time-varying systems. It is shown that, if the product of the input/output coupling matrices is a full-column rank, then the input error covariance matrix converges uniformly to zero in the presence of uncorrelated random disturbances. However, the state error covariance matrix converges uniformly to zero in presence of measurement noise. Moreover, it is shown that, if a certain condition is met, then the knowledge of the state coupling matrix is not needed to apply the proposed stochastic algorithm. The proposed algorithm is shown to suppress a class of nonlinear and repetitive state disturbance. The application of this algorithm to a class of nonlinear systems is also considered. A numerical example is included to illustrate the performance of the algorithm.
1 November 1994 in IEEE Transactions on Automatic Control
Sufficient conditions for the robustness and convergence of P-type learning control algorithms for a class of time-varying, nonlinear systems are presented. The authors prove the uniform boundedness of the system state and the input control with respect to the existence of errors of initialization, measurement noises, and fluctuations of system dynamics. Furthermore, the system output converges uniformly to the desired one in absence of all disturbances. Finally, specialization of the results to linear systems are presented.<>
10 March 2021 in IEEE Transactions on Industrial Electronics
Iterative learning control (ILC) has been well recognized for its output tracking ability in systems that perform repetitive tasks, such as robot manipulators. In practice, however, the application of ILC remains challenging as it generally requires the repetition of the initial settings and such industrial manipulators do not provide measurements of actual joint positions. This article presents a practical and fully automated implementation of ILC for industrial robot manipulators while assuming complete model uncertainty and the unavailability of joint velocity measurements. We propose the employment of a dedicated controller tasked only with bringing the arm back to its initial position while reducing the joint position reinitialization error after every iteration. We show that the convergence of the position tracking error is bounded by the initial mismatch. Finally, we provide experimental justification of the proposed approach on a 4-DOF commercial robot manipulator while only using the measurements of relative joint positions and show that our fully automated process outperforms two ILC algorithms with thorough manual homing.
1 August 1997 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
To date, most of the available results in learning control have been utilized in applications where a robot is required to execute the same motion over and over again, with a certain periodicity. This is due to the requirement that all learning algorithms assume that a desired output is given a priori over the time duration t in [0,T]. For applications where the desired outputs are assumed to change "slowly", we present a D-type, PD-type, and PID-type learning algorithms. At each iteration we assume that the system outputs and desired trajectories are contaminated with measurement noise, the system state contains disturbances, and errors are present during reinitialization. These algorithms are shown to be robust and convergent under certain conditions. In theory, the uniform convergence of learning algorithms is achieved as the number of iterations tends to infinity. However, in practice we desire to stop the process after a minimum number of iterations such that the trajectory errors are less than a desired tolerance bound. We present a methodology which is devoted to alleviate the difficulty of determining a priori the controller parameters such that the speed of convergence is improved. In particular, for systems with the property that the product matrix of the input and output coupling matrices, CB, is not full rank. Numerical examples are given to illustrate the results.