Billiards Optimization Algorithm:A New Game-Based Metaheuristic Approach

Metaheuristic algorithms are one of themost widely used stochastic approaches in solving optimization problems.In this paper,a new metaheuristic algorithm entitled Billiards Optimization Algorithm(BOA)is proposed and designed to be used in optimization applications.The fundamental inspiration in BOA design is the behavior of the players and the rules of the billiards game.Various steps of BOA are described and then its mathematical model is thoroughly explained.The efficiency of BOA in dealing with optimization problems is evaluated through optimizing twenty-three standard benchmark functions of different types including unimodal,high-dimensional multimodal,and fixed-dimensionalmultimodal functions.In order to analyze the quality of the results obtained by BOA,the performance of the proposed approach is compared with ten well-known algorithms.The simulation results show that BOA,with its high exploration and exploitation abilities,achieves an impressive performance in providing solutions to objective functions and is superior and far more competitive compared to the ten competitor algorithms.

Play by Design:Developing Artificial Intelligence Literacy through Game-based Learning

The paper proposes an innovative approach aimed at fostering AI literacy through interactive gaming experiences.This paper designs a game-based prototype for preparing pre-service teachers to innovate teaching practices across disciplines.The simulation,Color Conquest,serves as a strategic game to encourage educators to reconsider their pedagogical practices.It allows teachers to use and develop various scenarios by customizing maps,giving students agency to engage in the complex decision-making process.Additionally,this engagement process provides teachers with an opportunity to develop students’skills in artificial intelligence literacy as students actively develop strategic thinking,problem-solving,and critical reasoning skills.

Target Vehicle Selection Algorithm for Adaptive Cruise Control Based on Lane-changing Intention of Preceding Vehicle

To improve the ride comfort and safety of a traditional adaptive cruise control(ACC)system when the preceding vehicle changes lanes,it proposes a target vehicle selection algorithm based on the prediction of the lane-changing intention for the preceding vehicle.First,the Next Generation Simulation dataset is used to train a lane-changing intention prediction algorithm based on a sliding window support vector machine,and the lane-changing intention of the preceding vehicle in the current lane is identified by lateral position offset.Second,according to the lane-changing intention and collision threat of the preceding vehicle,the target vehicle selection algorithm is studied under three different conditions:safe lane-changing,dangerous lane-changing,and lane-changing cancellation.Finally,the effectiveness of the proposed algorithm is verified in a co-simulation platform.The simulation results show that the target vehicle selection algorithm can ensure the smooth transfer of the target vehicle and effectively reduce the longitudinal acceleration fluctuation of the subject vehicle when the preceding vehicle changes lanes safely or cancels their lane change maneuver.In the case of a dangerous lane change,the target vehicle selection algorithm proposed in this paper can respond more rapidly to a dangerous lane change than the target vehicle selection method of the traditional ACC system;thus,it can effectively avoid collisions and improve the safety of the subject vehicle.

A new traffic model on compulsive lane-changing caused by off-ramp

In the field of traffic flow studies, compulsive lane-changing refers to lane-changing （LC） behaviors due to traffic rules or bad road conditions, while free LC happens when drivers change lanes to drive on a faster or less crowded lane. LC studies based on differential equation models accurately reveal LC influence on traffic environment. This paper presents a second-order partial differential equation （PDE） model that simulates both compulsive LC behavior and free LC behavior, with lane-changing source terms in the continuity equation and a lane-changing viscosity term in the momentum equation. A specific form of this model focusing on a typical compulsive LC behavior, the ＇off-ramp problem＇, is derived. Numerical simulations are given in several cases, which are consistent with real traffic phenomenon.

Modelling of vehicle interaction behavior during discretionary lane-changing preparation process on freeway

In order to increase the accuracy of microscopic traffic flow simulation,two acceleration models are presented to simulate car-following behaviors of the lane-changing vehicle and following putative vehicle during the discretionary lanechanging preparation( DLCP) process, respectively. The proposed acceleration models can reflect vehicle interaction characteristics. Samples used for describing the starting point and the ending point of DLCP are extracted from a real NGSIM vehicle trajectory data set. The acceleration model for a lanechanging vehicle is supposed to be a linear acceleration model.The acceleration model for the following putative vehicle is constructed by referring to the optimal velocity model,in which optimal velocity is defined as a linear function of the velocity of putative leading vehicle. Similar calibration,a hypothesis test and parameter sensitivity analysis were conducted on the acceleration model of the lane-changing vehicle and following putative vehicle,respectively. The validation results of the two proposed models suggest that the training and testing errors are acceptable compared with similar works on calibrations for car following models. The parameter sensitivity analysis shows that the subtle observed error does not lead to severe variations of car-following behaviors of the lane-changing vehicle and following putative vehicle.

A new traffic model with a lane-changing viscosity term

In this paper, a new continuum traffic flow model is proposed, with a lane-changing source term in the continuity equation and a lane-changing viscosity term in the acceleration equation. Based on previous literature, the source term addresses the impact of speed difference and density difference between adjacent lanes, which provides better precision for free lane-changing simulation; the viscosity term turns lane-changing behavior to a ＂force＂ that may influence speed distribution. Using a flux-splitting scheme for the model discretization, two cases are investigated numerically. The case under a homogeneous initial condition shows that the numerical results by our model agree well with the analytical ones; the case with a small initial disturbance shows that our model can simulate the evolution of perturbation, including propagation,dissipation, cluster effect and stop-and-go phenomenon.

Effects of Potential Lane-Changing Probability on Uniform Flow

In this paper, we use the car-following model with the anticipation effect of the potential lane-changing probability （Acta Mech. Sin. 24 （2008） 399） to investigate the effects of the potential lane-changing probability on uniform flow. The analytical and numerical results show that the potential lane-changing probability can enhance the speed and flow of uniform flow and that their increments are related to the density.

Game-Based Learning for Competency Abilities in Blended Museum Contexts for Diverse Learners

Museums offer a lifelong edutainment environment with flexible choices for the public and provide fruitful interdisciplinary learning resources to support competency-based education.However,the lack of proper scaffolding and supports in museums negatively affect learner learning.Further,the individual differences need to be considered to effectively support the diverse learners learning in museums.In this study,an innovative learning model to support competency education for lifelong learning in museums is proposed.A game-based learning service named CoboFun that offers various types of problem-solving activities was developed to facilitate learners’interaction with exhibits and their peers in the museum.To examine the service design of CoboFun,learners’perceptions were evaluated and the differences in their cognitive styles were examined(Field Independent(FI)and Field Dependent(FD)).The results showed that both FI and FD learners enjoyed learning with CoboFun but that flexible learning tools needed to be provided to satisfy the different needs for the learners with different cognitive styles.

Game Selection Method for Game-Based History Learning

Games that are used in research on game-based learning and serious games that are used for education are usually exclusive,making it difficult for teachers to attempt new methods in education.According to the data published in 2009 by the European Schoolnet(EUN),a network of European Ministries of Education,most of the problems that teachers face when using games in class are related to game selection.Based on the aforementioned data,this study presents a set of criteria for selecting games in order to solve the inconvenience experienced by teachers.The games,which are used as teaching materials for game-based learning,have been replaced with commercial games that are easily purchased,rather than serious games that are difficult to obtain the licensing.Based on the criteria,two games were selected in this study and the classes were conducted at the educational site.Compared to the group trained with textbooks,it has been confirmed that the effect of game-based learning was sufficient.In addition,five out of ten problems that teachers face were resolved.

The characteristics of driver lane-changing behaviour in congested road environments

Lane-changing behaviour is one of the complex|driving behaviours.The lane-changing behaviour of drivers may exacerbate congestion,however driver behavioural characteristics are difficult to accurately acquire and quantify,and thus tend to be simplified or ignored in existing lane-changing models.In this paper,the Bik-means clustering algorithm is used to analyse the urban road congestion state discrimination method.Then,simulated driving tests were conducted for different traffic congestion conditions.Through the force feedback system and infrared camera,the data of driver lane-changing behaviours at different traffic congestion levels are obtained separately,and the definitions of the start and end points of a vehicle changing lanes are determined.Furthermore,statistical analysis and discussion of key feature parameters including driver lane-changing behaviour data and visual data under different levels of traffic congestion were conducted.It is found that the average lane-change intention times in each congestion state are 2 s,4 s,6 s and 7 s,while the turn-signal duration and the number of rear-view mirror observations have similar patterns of change to the data on lane-changing intention duration.Moreover,drivers’pupil diameters become smaller during the lane-changing intention phase,and then relatively enlarge during lane-changing;the range of pupil variation is roughly 3.5 mm to 4 mm.The frequency of observing the vehicle in front of the target lane increased as the level of congestion increased,and the frequency of observation in the driver’s mirrors while changing lanes approximately doubled compared to driving straight ahead,and this ratio increased as the level of congestion increased.

Human-like lane-changing trajectory planning algorithm for human-machine conflict mitigation

The purpose of this paper is to alleviate the potential safety problems associated with the human driver and the automatic system competing for the right of way due to different objectives by mitigating the human-machine conflict phenomenon in human-machine shared driving(HMSD)technology from the automation system.Firstly,a basic lane-changing trajectory algorithm based on the quintic polynomial in the Frenet coordinate system is developed.Then,in order to make the planned trajectory close to human behavior,naturalistic driving data is collected,based on which some lane-changing performance features are selected and analyzed.There are three aspects have been taken into consideration for the human-like lane-changing trajectory:vehicle dynamic stability performance,driving cost optimization,and collision avoidance.Finally,the HMSD experiments are conducted with the driving simulator to test the potential of the human-like lane-changing trajectory planning algorithm.The results demonstrate that the lane-changing trajectory planning algorithm with the highest degree of personalization is highly consistent with human driver behavior and consequently would potentially mitigate the human-machine conflict with the HMSD application.Furthermore,it could be further employed as an empirical trajectory prediction result.The algorithm employs the distribution state of the historical trajectory for human-like processing,simplifying the operational process and ensuring the credibility,integrity,and interpretability of the results.Moreover,in terms of optimization processing,the form of optimization search followed by collision avoidance detection is adopted to in principle reduce the calculation difficulty.Additionally,a new convex polygon collision detection method,namely the vertex embedding method,is proposed for collision avoidance detection.

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game

Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.

Lane-changing trajectory prediction based on multi-task learning

As a complex driving behaviour,lane-changing(LC)behaviour has a great influence on traffic flow.Improper lane-changing behaviour often leads to traffic accidents.Numerous studies are currently being conducted to predict lane-change trajectories to minimize dangers.However,most of their models focus on how to optimize input variables without considering the interaction between output variables.This study proposes an LC trajectory prediction model based on a multi-task deep learning framework to improve driving safety.Concretely,in this work,the coupling effect of lateral and longitudinal movement is considered in the L.C process.Trajectory changes in two directions will be modelled separately,and the information interaction is completed under the multi-task learing framework.In addition,the trajectory fragents are clustered by the driving features,and trajectory type recognition is added to the trajectory prediction framework as an auxiliary task.Finally,the prediction process of lateral and longitudinal trajectory and LC style is completed by long short-term memory(LSTM).The model training and testing are conducted with the data collected by the driving simulator,and the proposed method expresses better performance in LC trjectory prediction compared with several traditional models.The results of this study can enhance the trajectory prediction accuracy of advanced driving assistance systems(ADASs)and reduce the traffic accidents caused by lane changes.

Mandatory lane-changing decision making and planning in emergency situations

By considering mandatory lane-changing as a collision avoidance measure,this paper presented the corresponding lane-change decision making and trajectory planning algorithm under an emergency scenario.Different from the traditional algorithm in which lane-change decision making and trajectory planning are separated,they are here coupled in a proposed algorithm and the related parameters are dynamically adjusted in the whole process.In addition to lane-change collision avoidance feasibility analysis,lanechange time instance and duration time are obtained by solving the constrained convex quadratic optimization programme.By taking lane-change time instance and duration time as inputs,the algorithm then proceeded to propose a kinematic model-based highorder polynomial lane change trajectory.By giving the simulation result compassion with the related algorithm,it is proved that the proposed algorithm has a good robustness and high efficiency.

Mandatory lane-changing modelling based on a game theoretic approach in traditional and connected environments

The paper proposes a model of mandatory lane-changing behaviour based on a non-cooperative game in a traditional environment and analyses its applicability in a connected environment.In order to solve the problem of traffic safety and traffic congestion caused by mandatory lane-changing on urban roads,this paper applies the non-cooperative game theory to describe the game behaviour of the two parties,the lane-changing vehicle and the vehicle behind the target lane,in the connected and traditional environments respectively,and constructs the model considering the safety gain,speed gain and lane-changing gain to obtain a game model and the Nash equilibrium solution.Themodel is calibrated and tested using NGSIM data,and the results of the study show that themodel has a good performance for the decision behaviour of lane-changing vehicles and lag vehicles for mandatory lane-changing behaviour on urban roads.

Lane-changing decision rule with the difference of traffic flow's variation in multi-lane highway for connected and autonomous vehicles

Drivers are not far-sighted when they execute lane-changing manipulation.To address this issue,this study proposes a rule to improve vehicles'lane-changing decisions with accurate information of surrounding vehicles(e.g.time headway)-More specifically,connected and autonomous vehicles(CAVs)change lanes in advance if they find severer flow reducing in the lanes,while CAVs should maintain the car-following state if the variations of traffc flow in all lanes have a similar trend.To ilustrate the idea,this study frst calibrates two classic car-following models and a lane-changing model,and then conducts numerical simulations to illustrate the short-sighted decision of drivers.The study incorporates the idea into a lane-changing decision rule by changing the lane-changing model's pa-rameter,and conducts numerical tests to evaluate the effectiveness of the lane-changing decision rule in a multi-lane highway with a bottleneck.The results of this study indicate that the new lane-changing decision rule can substantially improve the throughput of the traffic flow,especially when the inflow exceeds the remaining capacity of the road.The lane-changing rule and results can bring insights into the control of CAVs,as well as the driver assistance system in connected vehicles.

Lane changing analysis for two-lane traffic flow

In this paper, the two-lane traffic are studied by using the lane-changing rules in the car-following models. The simulation show that the frequent lane changing occurs when the lateral distance in car following activities is considered and it gives rise to oscillating waves. In contrast, if the lateral distance is not considered （or considered occasionally）, the lane changing appears infrequently and soliton waves occurs. This implies that the stabilization mechanism no longer functions when the lane changing is permitted. Since the oscillating and soliton waves correspond to the unstable and metastable flow regimes, respectively, our study verifies that a phase transition may occur as a result of the lane changing.

Modelling lane-changing execution behaviour in a connected environment:A grouped random parameters with heterogeneity-in-means approach

Lane-changing is performed either to follow the route to a planned destination(i.e.,mandatory lane-changing)or to achieve better driving conditions(i.e.,discretionary lane-changing).A connected environment is expected to assist during lane-changing manoeuvres,but it is not known well how driving aids in a connected environment assist lane-changing execution.As such,this study investigates the impact of a connected environment on lanechanging execution time during mandatory and discretionary lane-changing manoeuvres.To this end,this study designed an advanced driving simulator experiment where 78 drivers performed these manoeuvres on a simulated motorway in three randomised driving conditions.The conditions were baseline(without driving aids),a fully functioning connected environment with a perfect supply of driving aids,and an impaired connected environment with delayed driving aids.The lane-changing execution time has been modelled by a random parameters hazard-based duration modelling approach,which accounts for the panel nature of data and captures the unobserved heterogeneity.Results suggest that,compared to the baseline condition(i.e.,a non-connected environment),most of the drivers in the connected environment take more time to complete their lane-changing manoeuvres,indicating drivers’safer lane-changing execution behaviour in the connected environment.The communication delay driving condition has been found to have more deteriorating effects on mandatory lanechanging manoeuvres than discretionary lane-changing manoeuvres.This study concludes that(i)the connected environment increases safety margin during both lane-changing manoeuvres,and(ii)a higher magnitude of safety margin is observed during mandatory lane-changing manoeuvres whereby drivers have a higher need for assistance.

An enhanced eco-driving strategy based on reinforcement learning for connected electric vehicles:cooperative velocity and lane-changing control

Purpose–This study aims to propose an enhanced eco-driving strategy based on reinforcement learning(RL)to alleviate the mileage anxiety of electric vehicles(EVs)in the connected environment.Design/methodology/approach–In this paper,an enhanced eco-driving control strategy based on an advanced RL algorithm in hybrid action space(EEDC-HRL)is proposed for connected EVs.The EEDC-HRL simultaneously controls longitudinal velocity and lateral lane-changing maneuvers to achieve more potential eco-driving.Moreover,this study redesigns an all-purpose and efficient-training reward function with the aim to achieve energy-saving on the premise of ensuring other driving performance.Findings–To illustrate the performance for the EEDC-HRL,the controlled EV was trained and tested in various traffic flow states.The experimental results demonstrate that the proposed technique can effectively improve energy efficiency,without sacrificing travel efficiency,comfort,safety and lane-changing performance in different traffic flow states.Originality/value–In light of the aforementioned discussion,the contributions of this paper are two-fold.An enhanced eco-driving strategy based an advanced RL algorithm in hybrid action space(EEDC-HRL)is proposed to jointly optimize longitudinal velocity and lateral lane-changing for connected EVs.A full-scale reward function consisting of multiple sub-rewards with a safety control constraint is redesigned to achieve eco-driving while ensuring other driving performance.

Research on TDM approach of sharing BRT-lane supported by vehicle-infrastructure integration

In order to increase the availability of the part-time idle bus rapid transit lane(BRT-lane),a time division multiplexing(TDM) method to share BRT-lane with the vehicles besides BRT buses is proposed based on vehicle-road collaboration. The TDM control strategy is established under the circumstance of vehicle-infrastructure integration(VII). The algorithm is given to forecast the segmented BRT travel time. According to the real time traffic information,a comprehensive model is given to estimate the vehicles' lane-changing time from/to the BRTlane to/from its neighbor lane and determine the timing sequence for vehicles collaboration. Finally,the experiment demonstrates that the predicted value of the travel time and lane-changing time is much close to the true value. The control strategy of the vehicles collaboration could promise the non-BRT vehicles to share BRT-lane without disturbing BRT's priority.