Redirected Walking On Omnidirectional Treadmill.

Redirected walking (RDW) and omnidirectional treadmill (ODT) are two effective solutions to the natural locomotion interface in virtual reality. ODT fully compresses the physical space and can be used as the integration carrier of all kinds of devices. However, the user experience varies in different directions of ODT, and the premise of interaction between users and integrated devices is a good match between virtual and real objects. RDW technology uses visual cues to guide the user's location in physical space. Based on this principle, combining RDW technology with ODT to guide the user's walking direction through visual cues can effectively improve user experience on ODT and make full use of various devices integrated on ODT. This paper explores the novel prospects of combining RDW technology with ODT and formally puts forward the concept of O-RDW (ODT-based RDW). Two baseline algorithms, i.e., OS2MD (ODT-based steer to multi-direction), and OS2MT (ODT-based steer to multi-target), are proposed to combine the merits of both RDW and ODT. With the help of the simulation environment, this paper quantitatively analyzes the applicable scenarios of the two algorithms and the influence of several main factors on the performance. Based on the conclusions of the simulation experiments, the two O-RDW algorithms are successfully applied in the practical application case of multi-target haptic feedback. Combined with the user study, the practicability and effectiveness of O-RDW technology in practical use are further verified.

Strolling in Room-Scale VR: Hex-Core-MK1 Omnidirectional Treadmill.

The natural locomotion interface is critical to the development of many VR applications. For household VR applications, there are two basic requirements: natural immersive experience and minimized space occupation. The existing locomotion strategies generally do not simultaneously satisfy these two requirements well. This article presents a novel omnidirectional treadmill (ODT) system named Hex-Core-MK1 (HCMK1). By implementing two kinds of mirror-symmetrical spiral rollers to generate the omnidirectional velocity field, this proposed system is capable of providing real walking experiences with a full-degree of freedom in an area as small as 1.76 m 2, while delivering great advantages over several existing ODT systems in terms of weight, volume, latency and dynamic performance. Compared with the sizes of Infinadeck and HCP, the two best motor-driven ODTs so far, the 8 cm height of HCMK1 is only 20% of Infinadeck and 50% of HCP. In addition, HCMK1 is a lightweight device weighing only 110 kg, which provides possibilities for further expanding VR scenarios, such as terrain simulation. The system latency of HCMK1 is only 9ms. The experiments show that HCMK1 can deliver a starting acceleration of 16.00 m/s 2 and a braking acceleration of 30.00 m/s 2.

Linear controllability of two multi-link robotic systems with multiple unactuated joints.

We deal with the linear controllability of two underactuated multi-link robotic systems in this paper. First, for a general n-link inverted pendulum mounted on a cart in a vertical plane, we prove that it is linearly controllable around the equilibrium point with the cart in a desired position and each link of the pendulum in the upright position regardless of its physical parameters, if and only if the cart is actuated. Second, for an n-link underactuated planar robot with its first joint mounted on a fixed base in a horizontal plane, we prove that it is linearly controllable around the trajectory where each link of the robot stretches straight out and rotates with a constant angular velocity, if and only if its first joint is actuated, regardless of its physical parameters and regardless of the actuation or underactuation of its rest joints. We illustrate the above results via a quintuple pendulum-cart system and a four-link planar gymnastic robot in literature. We give new insights into the linear controllability around an equilibrium point or a trajectory of underactuated robotic planar systems with multiple unactuated joints.

Event-Triggered Adaptive Fault Tolerant Control for a Class of Uncertain Nonlinear Systems.

This paper considers an adaptive fault-tolerant control problem for a class of uncertain strict feedback nonlinear systems, in which the actuator has an unknown drift fault and the loss of effectiveness fault. Based on the event-triggered theory, the adaptive backstepping technique, and Lyapunov theory, a novel fault-tolerant control strategy is presented. It is shown that an appropriate comprise between the control performance and the sensor data real-time transmission consumption is made, and the fault-tolerant tracking control problem of the strict feedback nonlinear system with uncertain and unknown control direction is solved. The adaptive backstepping method is introduced to compensate the actuator faults. Moreover, a new adjustable event-triggered rule is designed to determine the sampling state instants. The overall control strategy guarantees that the output signal tracks the reference signal, and all the signals of the closed-loop systems are convergent. Finally, the fan speed control system is constructed to demonstrate the validity of the proposed strategy and the application of the general systems.

Three-dimensional trajectory design for horizontal well based on optimal switching algorithms.

This paper considers a three-dimensional trajectory design problem for horizontal well. The problem is formulated as an optimal control problem of switched systems with continuous state inequality constraints. Since the complexity of such constraints and the switching instants is unknown, it is difficult to solve the problem by standard optimization techniques. To overcome the difficulty, by a time-scaling transformation, a smoothing technique and a penalty function method, an efficient computational method is proposed for solving this problem. Convergence results show that, for a sufficiently large penalty parameter, any local optimal solution of the approximate problem is also a local optimal solution of the original problem. Two numerical examples are presented to illustrate the efficiency of the approach proposed.

Natural gradient learning algorithms for RBF networks.

Radial basis function (RBF) networks are one of the most widely used models for function approximation and classification. There are many strange behaviors in the learning process of RBF networks, such as slow learning speed and the existence of the plateaus. The natural gradient learning method can overcome these disadvantages effectively. It can accelerate the dynamics of learning and avoid plateaus. In this letter, we assume that the probability density function (pdf) of the input and the activation function are gaussian. First, we introduce natural gradient learning to the RBF networks and give the explicit forms of the Fisher information matrix and its inverse. Second, since it is difficult to calculate the Fisher information matrix and its inverse when the numbers of the hidden units and the dimensions of the input are large, we introduce the adaptive method to the natural gradient learning algorithms. Finally, we give an explicit form of the adaptive natural gradient learning algorithm and compare it to the conventional gradient descent method. Simulations show that the proposed adaptive natural gradient method, which can avoid the plateaus effectively, has a good performance when RBF networks are used for nonlinear functions approximation.

Optimal scheduling of multiple sensors in continuous time.

This paper considers an optimal sensor scheduling problem in continuous time. In order to make the model more close to the practical problems, suppose that the following conditions are satisfied: only one sensor may be active at any one time; an admissible sensor schedule is a piecewise constant function with a finite number of switches; and each sensor either doesn't operate or operates for a minimum non-negligible amount of time. However, the switching times are unknown, and the feasible region isn't connected. Thus, it's difficult to solve the problem by conventional optimization techniques. To overcome this difficulty, by combining a binary relaxation, a time-scaling transformation and an exact penalty function, an algorithm is developed for solving this problem. Numerical results show that the algorithm is effective.