Home Page Icon
Home Page
Table of Contents for
Title Page
Close
Title Page
by Christophe Aubrun, Ye-Qiong Song, Daniel Simon
Co-design Approaches to Dependable Networked Control Systems
Cover
Title Page
Copyright
Foreword
Introduction and Problem Statement
I.1. Networked control systems and control design challenges
I.2. Control design: from continuous time to networked implementation
I.3. Timing parameter assignment
I.4. Control and task/message scheduling
I.5. Diagnosis and fault tolerance in NCS
I.6. Co-design approaches
I.7. Outline of the book
I.8. Bibliography
Chapter 1: Preliminary Notions and State of the Art
1.1. Overview
1.2. Preliminary notions on real-time scheduling
1.2.1. Some basic results on classic task model scheduling
1.2.1.1. Fixed priority scheduling
1.2.1.2. EDF scheduling
1.2.1.3. Discussion
1.2.2. (m, k)-firm model
1.3. Control aware computing
1.3.1. Off-line approaches
1.3.2. Quality of Service and flexible scheduling
1.4. Feedback-scheduling basics
1.4.1. Control of the computing resource
1.4.1.1. Control structure
1.4.1.2. Sensors and actuators
1.4.1.3. Control design and implementation
1.4.2. Examples
1.4.2.1. Feedback scheduling a web server
1.4.2.2. Optimal control-based feedback scheduling
1.4.2.3. Feasibility: feedback-scheduler implementation for robot control
1.4.2.3.1. Plant modeling and control structure
1.4.2.3.2. Scheduling controller design
1.4.2.3.3. Implementation of the feedback scheduler
1.5. Fault diagnosis of NCS with network-induced effects
1.5.1. Fault diagnosis of NCS with network-induced time delays
1.5.1.1. Low-pass post-filtering
1.5.1.2. Structure matrix of network-induced time delay
1.5.1.3. Robust deadbeat fault filter
1.5.1.4. Other work
1.5.2. Fault diagnosis of NCS with packet losses
1.5.2.1. Deterministic packet losses
1.5.2.2. Stochastic packet losses
1.5.3. Fault diagnosis of NCS with limited communication
1.5.4. Fault-tolerant control of NCS
1.6. Summary
1.7. Bibliography
Chapter 2: Computing-aware Control
2.1. Overview
2.2. Robust control w.r.t. computing and networking-induced latencies
2.2.1. Introduction
2.2.2. What happens when delays appear?
2.2.2.1. Initial conditions
2.2.2.2. Infinite dimensional systems
2.2.3. Delay models
2.2.4. Stability analysis of TDS using Lyapunov theory
2.2.4.1. The second method
2.2.4.2. The Lyapunov–Razumikhin approach
2.2.4.3. The Lyapunov–Krasovskii approach
2.2.5. Summary: time-delay systems and networking
2.3. Weakly hard constraints
2.3.1. Problem definition
2.3.2. Notion of accelerable control
2.3.3. Design of accelerable controllers
2.3.4. Accelerable LQR design for LTI systems
2.3.5. Kalman filtering and accelerability
2.3.6. Robustifying feedback scheduling using weakly hard scheduling concepts
2.3.7. Application to the attitude control of a quadrotor
2.4. LPV adaptive variable sampling
2.4.1. A polytopic discrete-plant model
2.4.2. Performance specification
2.4.3. LPV/H∞ control design
2.4.4. Experimental assessment
2.5. Summary
2.6. Bibliography
Chapter 3: QoC-aware Dynamic Network QoS Adaptation
3.1. Overview
3.2. Dynamic CAN message priority allocation according to the control application needs
3.2.1. Context of the study
3.2.1.1. The considered process control application
3.2.1.2. Control performance evaluation
3.2.1.3. The implementation through a network
3.2.1.3.1. Structure
3.2.1.3.2. Choice of the sampling period
3.2.1.3.3. Considering the network CAN
3.2.1.4. Evaluation of the influence of the network on the behavior of the process control application
3.2.1.4.1. Dedicated network CAN
3.2.1.4.2. Shared network CAN: considering static priorities and showing their inadequacy
3.2.1.5. Idea of hybrid priority schemes: general considerations
3.2.1.5.1. The identifier (ID) field and the scheduling execution
3.2.1.5.2. Cohabitation of flows with constant needs and flows of process control applications (variable needs)
3.2.1.5.3. Toward making dynamic priorities
3.2.2. Three hybrid priority schemes
3.2.2.1. hp scheme
3.2.2.2. (hp+sts) scheme
3.2.2.3. (hp+dts) scheme
3.2.2.3.1. Main ideas
3.2.2.3.2. Algorithm for computing the dynamic priority at any sampling instant tk
3.2.3. Study of the three schemes based on hybrid priorities
3.2.3.1. Study conditions
3.2.3.2. hp scheme
3.2.3.3. (hp+sts) scheme
3.2.3.4. (hp+dts) scheme
3.2.4. QoC visualization
3.2.5. Comment
3.3. Bandwidth allocation control for switched Ethernet networks
3.3.1. NCS performance analysis
3.3.2. NCS modeling
3.3.2.1. Introduction
3.3.2.2. Network modeling
3.3.2.3. System modeling
3.3.2.4. Controller modeling
3.3.3. Network adaptation mechanism
3.3.4. Example
3.3.4.1. Maximum delay computation
3.3.4.2. Results
3.4. Conclusion
3.5. Bibliography
Chapter 4: Plant-state-based Feedback Scheduling
4.1. Overview
4.2. Adaptive scheduling and varying sampling robust control
4.2.1. Extended elastic tasks controller
4.2.2. Case study
4.3. MPC-based integrated control and scheduling
4.3.1. Resource constrained systems
4.3.2. Optimal integrated control and scheduling of resource constrained systems
4.4. A convex optimization approach to feedback scheduling
4.4.1. Problem formulation
4.4.2. Cost function definition and approximation
4.4.2.1. Cost function definition
4.4.2.2. Introductory example: quadrotor attitude control
4.4.3. Optimal sampling period selection
4.4.3.1. Problem formulation
4.4.3.2. Problem solving
4.4.3.3. Feedback-scheduling algorithm deployment
4.4.4. Application to the attitude control of a quadrotor
4.5. Control and real-time scheduling co-design via a LPV approach
4.5.1. A LPV feedback scheduler sensible to the plant’s closed-loop performances
4.5.2. Application to a robot-arm control
4.5.2.1. Performance evaluation of the control tasks in view of optimal resource distribution
4.5.2.1.1. Discussion
4.5.2.2. Simulation with TrueTime
4.5.2.3. Feasibility and possible extensions
4.6. Summary
4.7. Bibliography
Chapter 5: Overload Management Through Selective Data Dropping
5.1. Introduction
5.1.1. System architecture
5.1.2. Problem statement
5.2. Scheduling under (m, k)-firm constraint
5.2.1. Dynamic scheduling policy under (m,k)-firm constraints
5.2.2. Static scheduling policy under (m,k)-firm constraints and schedulability issue
5.2.3. Static scheduling under (m, k)-constraints and mechanical words
5.2.4. Sufficient condition for schedulability assessment under (m,k)-pattern defined by a mechanical word
5.2.5. Systematic dropping policy in control applications
5.3. Stability analysis of a multidimensional system
5.3.1. Generic model
5.3.2. Example of multidimensional system
5.3.2.1. Sampling period definition
5.3.2.2. Controller parameters
5.3.3. Stability condition
5.4. Optimized control and scheduling co-design
5.4.1. Optimal control and individual cost function
5.4.2. Global optimization
5.4.3. Case study
5.4.3.1. Plants and controllers
5.4.3.2. Scheduling parameters
5.4.3.3. Optimal controller
5.4.3.4. Simulation scenario
5.4.3.5. Simulation results for hard real-time constraints
5.4.3.6. Simulation results for (m, k)-firm constraints
5.5. Plant-state-triggered control and scheduling adaptation and optimization
5.5.1. Closed-loop stability of switching systems
5.5.2. On-line plant state detection
5.5.3. Global optimization of control tasks taking into account the plant state
5.5.4. Case study
5.5.4.1. Simulation scenario
5.5.4.2. Observed performance
5.5.4.3. Summary
5.6. Conclusions
5.7. Bibliography
Chapter 6: Fault Detection and Isolation, Fault Tolerant Control
6.1. Introduction
6.2. FDI and FTC
6.2.1. Introduction to diagnosis
6.2.2. Quantitative model-based residuals
6.2.2.1. Parity relations
6.2.2.2. Observers bank
6.2.3. Example
6.2.3.1. The system-residual generation
6.2.3.2. Observer-based residuals
6.2.4. Diagnostic summary
6.2.5. Introduction to FTC
6.3. Networked-induced effects
6.3.1. Example of network-induced drawbacks
6.3.2. Modeling data dropouts
6.3.3. Modeling network delays
6.4. Pragmatic solutions
6.4.1. Data synchronization
6.4.1.1. Clock synchronization
6.4.1.2. Data reconstruction
6.4.1.3. Example
6.4.2. Data loss and diagnostic blocking
6.5. Advanced techniques
6.5.1. Residual generation with transmission delay
6.5.2. Adaptive thresholding
6.5.2.1. Optimization-based approach for threshold selection
6.5.2.2. Network calculus-based thresholding
6.5.3. Fault isolation filter design in the presence of packet dropouts
6.5.4. Estimation and diagnosis with data loss
6.5.4.1. Problem formulation
6.5.4.2. Kalman filter with partial data loss
6.6. Conclusion and perspectives
6.7. Bibliography
Glossary and Acronyms
List of Authors
Search in book...
Toggle Font Controls
Playlists
Add To
Create new playlist
Name your new playlist
Playlist description (optional)
Cancel
Create playlist
Sign In
Email address
Password
Forgot Password?
Create account
Login
or
Continue with Facebook
Continue with Google
Sign Up
Full Name
Email address
Confirm Email Address
Password
Login
Create account
or
Continue with Facebook
Continue with Google
Prev
Previous Chapter
Co-design Approaches for Dependable Networked Control Systems
Next
Next Chapter
Copyright
Add Highlight
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click
here
login for view all page.
Day Mode
Cloud Mode
Night Mode
Reset