A LOW COST ERROR CONTROL SCHEME FOR HARD REAL-TIME MESSAGES ON WIRELESS LANS

Author(s):  
JUNGHOON LEE ◽  
YOONJOON LEE ◽  
SIN KIM
Author(s):  
Afef Hfaiedh ◽  
Ahmed Chemori ◽  
Afef Abdelkrim

In this paper, the control problem of a class I of underactuated mechanical systems (UMSs) is addressed. The considered class includes nonlinear UMSs with two degrees of freedom and one control input. Firstly, we propose the design of a robust integral of the sign of the error (RISE) control law, adequate for this special class. Based on a change of coordinates, the dynamics is transformed into a strict-feedback (SF) form. A Lyapunov-based technique is then employed to prove the asymptotic stability of the resulting closed-loop system. Numerical simulation results show the robustness and performance of the original RISE toward parametric uncertainties and disturbance rejection. A comparative study with a conventional sliding mode control reveals a significant robustness improvement with the proposed original RISE controller. However, in real-time experiments, the amplification of the measurement noise is a major problem. It has an impact on the behaviour of the motor and reduces the performance of the system. To deal with this issue, we propose to estimate the velocity using the robust Levant differentiator instead of the numerical derivative. Real-time experiments were performed on the testbed of the inertia wheel inverted pendulum to demonstrate the relevance of the proposed observer-based RISE control scheme. The obtained real-time experimental results and the obtained evaluation indices show clearly a better performance of the proposed observer-based RISE approach compared to the sliding mode and the original RISE controllers.


Some real-time systems that need to be associated with operating system services with a hard real-time system. Since these real-time systems that need to be extremely responsive to the outside world have no simple and low-cost operating system assistance. This paper deals with the application on a Linux-based operating system of the priority-based preemptive real-time scheduling algorithm that will suffice these firm applications in real-time. Typically, the algorithms regarded for these hard real-time systems are preemptive scheduling based on priorities. Based on the priority, by meeting the deadline, this algorithm can produce a feasible schedule for the dynamic tasks to be performed on the processor. It is feasible to schedule tasks on a processor as long as preemption is permitted and tasks do not compete for resources. In this scheduling algorithm, the task in the running queue that is waiting for the execution will be placed in the priority queue that is ready to execute in the available processor. This algorithm is deployed in the Linux kernel with the patch file and the kernel is built in the multi core system to execute an application


Author(s):  
Junghoon Lee ◽  
Mikyung Kang ◽  
Gyungleen Park ◽  
Hanil Kim ◽  
Choelmin Kim ◽  
...  

2018 ◽  
Vol 27 (2) ◽  
pp. 406-418 ◽  
Author(s):  
Andrés M. González-Vargas ◽  
Juan M. Serna-Ramirez ◽  
Carlos Fory-Aguirre ◽  
Alejandro Ojeda-Misses ◽  
John M. Cardona-Ordoñez ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document