Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower pri...Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.展开更多
A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; s...A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; secondly, select one of the critical paths of the partially clustered directed acyclic graph; thirdly, try to zero one of graph communication edges; fourthly, repeat above three processes until all edges are zeroed; finally, check the generated clusters to see if some of them can be further merged without increasing the parallel time. Comparisons of the previous algorithms with edge-zeroing based on dynamic critical paths show that the new algorithm has not only a low complexity but also a desired performance comparable or even better on average to much higher complexity heuristic algorithms.展开更多
Recovery is a crucial supporting process for carrier aircraft,where a reasonable landing scheduling is expected to guide the fleet landing safely and quickly.Currently,there is little research on this topic,and most o...Recovery is a crucial supporting process for carrier aircraft,where a reasonable landing scheduling is expected to guide the fleet landing safely and quickly.Currently,there is little research on this topic,and most of it neglects potential influence factors,leaving the corresponding supporting efficiency questionable.In this paper,we study the landing scheduling problem for carrier aircraft considering the effects of bolting and aerial refueling.Based on the analysis of recovery mode involving the above factors,two types of primary constraints(i.e.,fuel constraint and wake interval constraint)are first described.Then,taking the landing sequencing as decision variables,a combinatorial optimization model with a compound objective function is formulated.Aiming at an efficient solution,an improved firefly algorithm is designed by integrating multiple evolutionary operators.In addition,a dynamic replanning mechanism is introduced to deal with special situations(i.e.,the occurrence of bolting and fuel shortage),where the high efficiency of the designed algorithm facilitates the online scheduling adjustment within seconds.Finally,numerical simulations with sufficient and insufficient fuel cases are both carried out,highlighting the necessity to consider bolting and aerial refueling during the planning procedure.Simulation results reveal that a higher bolting probability,as well as extra aerial refueling operations caused by fuel shortage,will lead to longer recovery complete time.Meanwhile,due to the strong optimum-seeking capability and solution efficiency of the improved algorithm,adaptive scheduling can be generated within milliseconds to deal with special situations,significantly improving the safety and efficiency of the recovery process.An animation is accessible at bilibili.com/video/BV1QprKY2EwD.展开更多
基金supported by the National Natural Science Foundation of China (50421703)the National Key Laboratory of Electrical Engineering of Naval Engineering University
文摘Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.
文摘A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; secondly, select one of the critical paths of the partially clustered directed acyclic graph; thirdly, try to zero one of graph communication edges; fourthly, repeat above three processes until all edges are zeroed; finally, check the generated clusters to see if some of them can be further merged without increasing the parallel time. Comparisons of the previous algorithms with edge-zeroing based on dynamic critical paths show that the new algorithm has not only a low complexity but also a desired performance comparable or even better on average to much higher complexity heuristic algorithms.
基金the financial support of the National Natural Science Foundation of China(12102077,12161076)the Natural Science and Technology Program of Liaoning Province(2023-BS-061).
文摘Recovery is a crucial supporting process for carrier aircraft,where a reasonable landing scheduling is expected to guide the fleet landing safely and quickly.Currently,there is little research on this topic,and most of it neglects potential influence factors,leaving the corresponding supporting efficiency questionable.In this paper,we study the landing scheduling problem for carrier aircraft considering the effects of bolting and aerial refueling.Based on the analysis of recovery mode involving the above factors,two types of primary constraints(i.e.,fuel constraint and wake interval constraint)are first described.Then,taking the landing sequencing as decision variables,a combinatorial optimization model with a compound objective function is formulated.Aiming at an efficient solution,an improved firefly algorithm is designed by integrating multiple evolutionary operators.In addition,a dynamic replanning mechanism is introduced to deal with special situations(i.e.,the occurrence of bolting and fuel shortage),where the high efficiency of the designed algorithm facilitates the online scheduling adjustment within seconds.Finally,numerical simulations with sufficient and insufficient fuel cases are both carried out,highlighting the necessity to consider bolting and aerial refueling during the planning procedure.Simulation results reveal that a higher bolting probability,as well as extra aerial refueling operations caused by fuel shortage,will lead to longer recovery complete time.Meanwhile,due to the strong optimum-seeking capability and solution efficiency of the improved algorithm,adaptive scheduling can be generated within milliseconds to deal with special situations,significantly improving the safety and efficiency of the recovery process.An animation is accessible at bilibili.com/video/BV1QprKY2EwD.
