This research focuses on detecting faults in flight vehicles with unstable subsystems operating asynchronously.By accounting for asynchronous switching,a switched model is established,and filters for fault detection(F...This research focuses on detecting faults in flight vehicles with unstable subsystems operating asynchronously.By accounting for asynchronous switching,a switched model is established,and filters for fault detection(FD)in unstable subsystems are developed.The FD challenge is then transformed into an H∞filtering issue.Utilizing the multiple discontinuous Lyapunov function(MDLF)approach and the mode-dependent average dwell time(MDADT)method,sufficient conditions are derived to ensure stability during both fast and slow switching.Furthermore,the existence and solutions for FD filters are provided through linear matrix inequalities(LMIs).The simulation outcomes demonstrated the excellent performance of the developed method in studied cases.展开更多
This paper presents partially asynchronous parallel simulation of continuous-system (PAPSoCS) and some approaches to the issues of its implementation on a multicomputer system. To guarantee the simulation results cor...This paper presents partially asynchronous parallel simulation of continuous-system (PAPSoCS) and some approaches to the issues of its implementation on a multicomputer system. To guarantee the simulation results correct and speedup the simulation, the scheme for efficient PAPSoCS is proposed and the virtual topology star is constructed to match the path of message passing for solving algorithm-architecture adequation problem. Under the circumstances that messages frequently passed inter-processor are much shorter, typically within several 4 bytes, asynchronous communication mode is employed to reduce the communication ratio. Experiment results show that asynchronous parallel simulation has much higher efficiency than its synchronous counterpart.展开更多
We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it f...We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it for synchronized or randomly activated implementation,which may create deadlocks in practice.In sharp contrast,we propose a fully asynchronous push-pull gradient(APPG) algorithm,where each node updates without waiting for any other node by using possibly delayed information from neighbors.Then,we construct two novel augmented networks to analyze asynchrony and delays,and quantify its convergence rate from the worst-case point of view.Particularly,all nodes of APPG converge to the same optimal solution at a linear rate of O(λ^(k)) if local functions have Lipschitz-continuous gradients and their sum satisfies the Polyak-?ojasiewicz condition(convexity is not required),where λ ∈(0,1) is explicitly given and the virtual counter k increases by one when any node updates.Finally,the advantage of APPG over the synchronous counterpart and its linear speedup efficiency are numerically validated via a logistic regression problem.展开更多
Many energy efficiency asynchronous duty-cycle MAC(media access control) protocols have been proposed in recent years.However,in these protocols,wireless sensor nodes almost choose their wakeup time randomly during th...Many energy efficiency asynchronous duty-cycle MAC(media access control) protocols have been proposed in recent years.However,in these protocols,wireless sensor nodes almost choose their wakeup time randomly during the operational cycle,which results in the packet delivery latency increased significantly on the multiple hops path.To reduce the packet delivery latency on multi-hop path and energy waste of the sender's idle listening,a new low latency routing-enhanced asynchronous duty-cycle MAC protocol was presented,called REA-MAC.In REA-MAC,each sensor node decided when it waked up to send the beacon based on cross-layer routing information.Furthermore,the sender adaptively waked up based on the relationship between the transmission request time and the wakeup time of its next hop node.The simulation results show that REA-MAC reduces delivery latency by 60% compared to RI-MAC and reduces 8.77% power consumption on average.Under heavy traffic,REA-MAC's throughput is 1.48 times of RI-MAC's.展开更多
基金the National Natural Science Foundation of China(Grant Nos.62303380,62176214,62101590,62003268)the Aeronautical Science Foundation of China(Grant No.201907053001).
文摘This research focuses on detecting faults in flight vehicles with unstable subsystems operating asynchronously.By accounting for asynchronous switching,a switched model is established,and filters for fault detection(FD)in unstable subsystems are developed.The FD challenge is then transformed into an H∞filtering issue.Utilizing the multiple discontinuous Lyapunov function(MDLF)approach and the mode-dependent average dwell time(MDADT)method,sufficient conditions are derived to ensure stability during both fast and slow switching.Furthermore,the existence and solutions for FD filters are provided through linear matrix inequalities(LMIs).The simulation outcomes demonstrated the excellent performance of the developed method in studied cases.
文摘This paper presents partially asynchronous parallel simulation of continuous-system (PAPSoCS) and some approaches to the issues of its implementation on a multicomputer system. To guarantee the simulation results correct and speedup the simulation, the scheme for efficient PAPSoCS is proposed and the virtual topology star is constructed to match the path of message passing for solving algorithm-architecture adequation problem. Under the circumstances that messages frequently passed inter-processor are much shorter, typically within several 4 bytes, asynchronous communication mode is employed to reduce the communication ratio. Experiment results show that asynchronous parallel simulation has much higher efficiency than its synchronous counterpart.
基金Supported by National Natural Science Foundation of China(62033006,62203254)。
文摘We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it for synchronized or randomly activated implementation,which may create deadlocks in practice.In sharp contrast,we propose a fully asynchronous push-pull gradient(APPG) algorithm,where each node updates without waiting for any other node by using possibly delayed information from neighbors.Then,we construct two novel augmented networks to analyze asynchrony and delays,and quantify its convergence rate from the worst-case point of view.Particularly,all nodes of APPG converge to the same optimal solution at a linear rate of O(λ^(k)) if local functions have Lipschitz-continuous gradients and their sum satisfies the Polyak-?ojasiewicz condition(convexity is not required),where λ ∈(0,1) is explicitly given and the virtual counter k increases by one when any node updates.Finally,the advantage of APPG over the synchronous counterpart and its linear speedup efficiency are numerically validated via a logistic regression problem.
基金Projects(61103011,61170261) supported by the National Natural Science Foundation of China
文摘Many energy efficiency asynchronous duty-cycle MAC(media access control) protocols have been proposed in recent years.However,in these protocols,wireless sensor nodes almost choose their wakeup time randomly during the operational cycle,which results in the packet delivery latency increased significantly on the multiple hops path.To reduce the packet delivery latency on multi-hop path and energy waste of the sender's idle listening,a new low latency routing-enhanced asynchronous duty-cycle MAC protocol was presented,called REA-MAC.In REA-MAC,each sensor node decided when it waked up to send the beacon based on cross-layer routing information.Furthermore,the sender adaptively waked up based on the relationship between the transmission request time and the wakeup time of its next hop node.The simulation results show that REA-MAC reduces delivery latency by 60% compared to RI-MAC and reduces 8.77% power consumption on average.Under heavy traffic,REA-MAC's throughput is 1.48 times of RI-MAC's.
