We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponen...We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.展开更多
In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to st...In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to stochastic orderings.Performance measures of such a system are available explicitly,while their forms are cumbersome(these formulas include integrals of Laplace transform,solutions of functional equations,etc.).Therefore,they are not exploitable from the application point of view.To overcome these difficulties,we present stochastic comparison methods in order to get qualitative estimates of these measures.In particular,we prove the monotonicity of the transition operator of the embedded Markov chain.In addition,we establish conditions for which transition operators as well as stationary probabilities,associated with two embedded Markov chains,having the same structure but with different parameters,are comparable relative to the given stochastic orderings.Further,numerical examples are carried out to illustrate the theoretical results.展开更多
The integration of eco-driving and cooperative adaptive cruise control(CACC)with platoon cooperative control(eco-CACC)has emerged as a pivotal approach for improving vehicle energy efficiency.Nonetheless,the prevailin...The integration of eco-driving and cooperative adaptive cruise control(CACC)with platoon cooperative control(eco-CACC)has emerged as a pivotal approach for improving vehicle energy efficiency.Nonetheless,the prevailing eco-CACC implementations still exhibit limitations in fully harnessing the potential energy savings.This can be attributed to the intricate nature of the problem,characterized by its high nonlinearity and non-convexity,making it challenging for conventional solving methods to find solutions.In this paper,a novel strategy based on a decentralized model predictive control(MPC)framework,called predictive ecological cooperative control(PECC),is proposed for vehicle platoon control on hilly roads,aiming to maximize the overall energy efficiency of the platoon.Unlike most existing literature that focuses on suboptimal coordination under predefined leading vehicle trajectories,this strategy employs an approach based on the combination of a long short-term memory network(LSTM)and genetic algorithm(GA)optimization(GA-LSTM)to predict the future speed of the leading vehicle.Notably,a function named the NotchFilter function(NF(?))is introduced to transform the hard state constraints in the eco-CACC problem,thereby alleviating the burden of problem-solving.Finally,through simulation comparisons between PECC and a strategy based on the common eco-CACC modifications,the effectiveness of PECC in improving platoon energy efficiency is demonstrated.展开更多
车载网中platoon的稳定性直接决定了道路的安全性.对于platoon编组而言,"稳定"意味着在受到干扰时platoon的结构能保持相对稳定,并且干扰不会被放大.对此,研究platoon在受到干扰时的内部动态特性.通过分析可知,内部间距的变...车载网中platoon的稳定性直接决定了道路的安全性.对于platoon编组而言,"稳定"意味着在受到干扰时platoon的结构能保持相对稳定,并且干扰不会被放大.对此,研究platoon在受到干扰时的内部动态特性.通过分析可知,内部间距的变化符合阻尼运动,并采用SUMO(simulation of urban mobility)仿真软件做了大量实验以证实分析结论.此外,还讨论了不同加速度对欠阻尼的影响,总结出加速度与稳定性之间的关系.展开更多
In order to reduce average arterial vehicle delay, a novel distributed and coordinated traffic control algorithm is developed using the multiple agent system and the reinforce learning （RL）. The RL is used to minimi...In order to reduce average arterial vehicle delay, a novel distributed and coordinated traffic control algorithm is developed using the multiple agent system and the reinforce learning （RL）. The RL is used to minimize average delay of arterial vehicles by training the interaction ability between agents and exterior environments. The Robertson platoon dispersion model is embedded in the RL algorithm to precisely predict platoon movements on arteries and then the reward function is developed based on the dispersion model and delay equations cited by HCM2000. The performance of the algorithm is evaluated in a Matlab environment and comparisons between the algorithm and the conventional coordination algorithm are conducted in three different traffic load scenarios. Results show that the proposed algorithm outperforms the conventional algorithm in all the scenarios. Moreover, with the increase in saturation degree, the performance is improved more significantly. The results verify the feasibility and efficiency of the established algorithm.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.11971486)。
文摘We consider a single server constant retrial queue,in which a state-dependent service policy is used to control the service rate.Customer arrival follows Poisson process,while service time and retrial time are exponential distributions.Whenever the server is available,it admits the retrial customers into service based on a first-come first-served rule.The service rate adjusts in real-time based on the retrial queue length.An iterative algorithm is proposed to numerically solve the personal optimal problem in the fully observable scenario.Furthermore,we investigate the impact of parameters on the social optimal threshold.The effectiveness of the results is illustrated by two examples.
文摘In this paper,we introduce a qualitative analysis in order to study the monotonicity and comparability properties of a single-server retrial queueing model with Bernoulli feedback and negative customers,relative to stochastic orderings.Performance measures of such a system are available explicitly,while their forms are cumbersome(these formulas include integrals of Laplace transform,solutions of functional equations,etc.).Therefore,they are not exploitable from the application point of view.To overcome these difficulties,we present stochastic comparison methods in order to get qualitative estimates of these measures.In particular,we prove the monotonicity of the transition operator of the embedded Markov chain.In addition,we establish conditions for which transition operators as well as stationary probabilities,associated with two embedded Markov chains,having the same structure but with different parameters,are comparable relative to the given stochastic orderings.Further,numerical examples are carried out to illustrate the theoretical results.
基金Supported by National Natural Science Foundation of China(Grant Nos.52172383,51805081)Jiangsu Provincial Postgraduate Research&Practice Innovation Program(Grant No.KYCX22_0196)。
文摘The integration of eco-driving and cooperative adaptive cruise control(CACC)with platoon cooperative control(eco-CACC)has emerged as a pivotal approach for improving vehicle energy efficiency.Nonetheless,the prevailing eco-CACC implementations still exhibit limitations in fully harnessing the potential energy savings.This can be attributed to the intricate nature of the problem,characterized by its high nonlinearity and non-convexity,making it challenging for conventional solving methods to find solutions.In this paper,a novel strategy based on a decentralized model predictive control(MPC)framework,called predictive ecological cooperative control(PECC),is proposed for vehicle platoon control on hilly roads,aiming to maximize the overall energy efficiency of the platoon.Unlike most existing literature that focuses on suboptimal coordination under predefined leading vehicle trajectories,this strategy employs an approach based on the combination of a long short-term memory network(LSTM)and genetic algorithm(GA)optimization(GA-LSTM)to predict the future speed of the leading vehicle.Notably,a function named the NotchFilter function(NF(?))is introduced to transform the hard state constraints in the eco-CACC problem,thereby alleviating the burden of problem-solving.Finally,through simulation comparisons between PECC and a strategy based on the common eco-CACC modifications,the effectiveness of PECC in improving platoon energy efficiency is demonstrated.
文摘车载网中platoon的稳定性直接决定了道路的安全性.对于platoon编组而言,"稳定"意味着在受到干扰时platoon的结构能保持相对稳定,并且干扰不会被放大.对此,研究platoon在受到干扰时的内部动态特性.通过分析可知,内部间距的变化符合阻尼运动,并采用SUMO(simulation of urban mobility)仿真软件做了大量实验以证实分析结论.此外,还讨论了不同加速度对欠阻尼的影响,总结出加速度与稳定性之间的关系.
基金The National Key Technology R&D Program during the 11th Five-Year Plan Period of China (No. 2009BAG17B02)the National High Technology Research and Development Program of China (863 Program) (No. 2011AA110304)the National Natural Science Foundation of China (No. 50908100)
文摘In order to reduce average arterial vehicle delay, a novel distributed and coordinated traffic control algorithm is developed using the multiple agent system and the reinforce learning （RL）. The RL is used to minimize average delay of arterial vehicles by training the interaction ability between agents and exterior environments. The Robertson platoon dispersion model is embedded in the RL algorithm to precisely predict platoon movements on arteries and then the reward function is developed based on the dispersion model and delay equations cited by HCM2000. The performance of the algorithm is evaluated in a Matlab environment and comparisons between the algorithm and the conventional coordination algorithm are conducted in three different traffic load scenarios. Results show that the proposed algorithm outperforms the conventional algorithm in all the scenarios. Moreover, with the increase in saturation degree, the performance is improved more significantly. The results verify the feasibility and efficiency of the established algorithm.
