Decision-making of connected and automated vehicles(CAV)includes a sequence of driving maneuvers that improve safety and efficiency,characterized by complex scenarios,strong uncertainty,and high real-time requirements...Decision-making of connected and automated vehicles(CAV)includes a sequence of driving maneuvers that improve safety and efficiency,characterized by complex scenarios,strong uncertainty,and high real-time requirements.Deep reinforcement learning(DRL)exhibits excellent capability of real-time decision-making and adaptability to complex scenarios,and generalization abilities.However,it is arduous to guarantee complete driving safety and efficiency under the constraints of training samples and costs.This paper proposes a Mixture of Expert method(MoE)based on Soft Actor-Critic(SAC),where the upper-level discriminator dynamically decides whether to activate the lower-level DRL expert or the heuristic expert based on the features of the input state.To further enhance the performance of the DRL expert,a buffer zone is introduced in the reward function,preemptively applying penalties before insecure situations occur.In order to minimize collision and off-road rates,the Intelligent Driver Model(IDM)and Minimizing Overall Braking Induced by Lane changes(MOBIL)strategy are designed by heuristic experts.Finally,tested in typical simulation scenarios,MOE shows a 13.75%improvement in driving efficiency compared with the traditional DRL method with continuous action space.It ensures high safety with zero collision and zero off-road rates while maintaining high adaptability.展开更多
Automated Program Repair(APR)techniques have shown significant potential in mitigating the cost and complexity associated with debugging by automatically generating corrective patches for software defects.Despite cons...Automated Program Repair(APR)techniques have shown significant potential in mitigating the cost and complexity associated with debugging by automatically generating corrective patches for software defects.Despite considerable progress in APR methodologies,existing approaches frequently lack contextual awareness of runtime behaviors and structural intricacies inherent in buggy source code.In this paper,we propose a novel APR approach that integrates attention mechanisms within an autoencoder-based framework,explicitly utilizing structural code affinity and execution context correlation derived from stack trace analysis.Our approach begins with an innovative preprocessing pipeline,where code segments and stack traces are transformed into tokenized representations.Subsequently,the BM25 ranking algorithm is employed to quantitatively measure structural code affinity and execution context correlation,identifying syntactically and semantically analogous buggy code snippets and relevant runtime error contexts from extensive repositories.These extracted features are then encoded via an attention-enhanced autoencoder model,specifically designed to capture significant patterns and correlations essential for effective patch generation.To assess the efficacy and generalizability of our proposed method,we conducted rigorous experimental comparisons against DeepFix,a state-of-the-art APR system,using a substantial dataset comprising 53,478 studentdeveloped C programs.Experimental outcomes indicate that our model achieves a notable bug repair success rate of approximately 62.36%,representing a statistically significant performance improvement of over 6%compared to the baseline.Furthermore,a thorough K-fold cross-validation reinforced the consistency,robustness,and reliability of our method across diverse subsets of the dataset.Our findings present the critical advantage of integrating attentionbased learning with code structural and execution context features in APR tasks,leading to improved accuracy and practical applicability.Future work aims to extend the model’s applicability across different programming languages,systematically optimize hyperparameters,and explore alternative feature representation methods to further enhance debugging efficiency and effectiveness.展开更多
Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm opt...Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.展开更多
Shared control schemes allow a human driver to work with an automated driving agent in driver-vehicle systems while retaining the driver’s abilities to control.The human driver,as an essential agent in the driver-veh...Shared control schemes allow a human driver to work with an automated driving agent in driver-vehicle systems while retaining the driver’s abilities to control.The human driver,as an essential agent in the driver-vehicle shared control systems,should be precisely modeled regarding their cognitive processes,control strategies,and decision-making processes.The interactive strategy design between drivers and automated driving agents brings an excellent challenge for human-centric driver assistance systems due to the inherent characteristics of humans.Many open-ended questions arise,such as what proper role of human drivers should act in a shared control scheme?How to make an intelligent decision capable of balancing the benefits of agents in shared control systems?Due to the advent of these attentions and questions,it is desirable to present a survey on the decision making between human drivers and highly automated vehicles,to understand their architectures,human driver modeling,and interaction strategies under the driver-vehicle shared schemes.Finally,we give a further discussion on the key future challenges and opportunities.They are likely to shape new potential research directions.展开更多
The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain inde...The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.展开更多
To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport req...To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport requests in this paper. Firstly, a workshop scheduling mechanism of AGV is analyzed and a mathematical model is established using Genetic Algorithm. According to several sets of transport priority of AGV, processes of FMS are encoded, and fitness function, selection, crossover, and variation methods are designed. The transport priority which has the least impact on scheduling results is determined based on the simulation analysis of Genetic Algorithm, and the makespan, the longest waiting time, and optimal route of the car are calculated. According to the actual processing situation of the workshop, feasibility of this method is verified successfully to provide an effective solution to the scheduling problem of single AGV.展开更多
The pharmaceutical industry is now paying increased attention to continuous manufacturing.While the revolution to continuous and automated manufacturing is deepening in most of the top pharma companies in the world,th...The pharmaceutical industry is now paying increased attention to continuous manufacturing.While the revolution to continuous and automated manufacturing is deepening in most of the top pharma companies in the world,the advancement of automated pharmaceutical continuous manufacturing in China is relatively slow due to some key challenges including the lack of knowledge on the related technologies and shortage of qualified personnels.In this review,emphasis is given to two of the crucial technologies in automated pharmaceutical continuous manufacturing,i.e.,process analytical technology(PAT)and self-optimizing algorithm.Research work published in recent 5 years employing advanced PAT tools and self-optimization algorithms is introduced,which represents the great progress that has been made in automated pharmaceutical continuous manufacturing.展开更多
With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path...With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path finding(MAPF) algorithm is urgently needed to ensure the efficiency and realizability of the whole system. The complex terrain of outdoor scenarios is fully considered by using different values of passage cost to quantify different terrain types. The objective of the MAPF problem is to minimize the cost of passage while the Manhattan distance of paths and the time of passage are also evaluated for a comprehensive comparison. The pre-path-planning and real-time-conflict based greedy(PRG) algorithm is proposed as the solution. Simulation is conducted and the proposed PRG algorithm is compared with waiting-stop A^(*) and conflict based search(CBS) algorithms. Results show that the PRG algorithm outperforms the waiting-stop A^(*) algorithm in all three performance indicators,and it is more applicable than the CBS algorithm when a large number of AGVs are working collaboratively with frequent collisions.展开更多
E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking d...E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.展开更多
This paper is to explore the problems of intelligent connected vehicles(ICVs)autonomous driving decision-making under a 5G-V2X structured road environment.Through literature review and interviews with autonomous drivi...This paper is to explore the problems of intelligent connected vehicles(ICVs)autonomous driving decision-making under a 5G-V2X structured road environment.Through literature review and interviews with autonomous driving practitioners,this paper firstly puts forward a logical framework for designing a cerebrum-like autonomous driving system.Secondly,situated on this framework,it builds a hierarchical finite state machine(HFSM)model as well as a TOPSIS-GRA algorithm for making ICV autonomous driving decisions by employing a data fusion approach between the entropy weight method(EWM)and analytic hierarchy process method(AHP)and by employing a model fusion approach between the technique for order preference by similarity to an ideal solution(TOPSIS)and grey relational analysis(GRA).The HFSM model is composed of two layers:the global FSM model and the local FSM model.The decision of the former acts as partial input information of the latter and the result of the latter is sent forward to the local pathplanning module,meanwhile pulsating feedback to the former as real-time refresh data.To identify different traffic scenarios in a cerebrum-like way,the global FSM model is designed as 7 driving behavior states and 17 driving characteristic events,and the local FSM model is designed as 16 states and 8 characteristic events.In respect to designing a cerebrum-like algorithm for state transition,this paper firstly fuses AHP weight and EWM weight at their output layer to generate a synthetic weight coefficient for each characteristic event;then,it further fuses TOPSIS method and GRA method at the model building layer to obtain the implementable order of state transition.To verify the feasibility,reliability,and safety of theHFSMmodel aswell as its TOPSISGRA state transition algorithm,this paper elaborates on a series of simulative experiments conducted on the PreScan8.50 platform.The results display that the accuracy of obstacle detection gets 98%,lane line prediction is beyond 70 m,the speed of collision avoidance is higher than 45 km/h,the distance of collision avoidance is less than 5 m,path planning time for obstacle avoidance is averagely less than 50 ms,and brake deceleration is controlled under 6 m/s2.These technical indexes support that the driving states set and characteristic events set for the HFSM model as well as its TOPSIS-GRA algorithm may bring about cerebrum-like decision-making effectiveness for ICV autonomous driving under 5G-V2X intelligent road infrastructure.展开更多
With the rapid advancement of medical artificial intelligence(AI)technology,particularly the widespread adoption of AI diagnostic systems,ethical challenges in medical decision-making have garnered increasing attentio...With the rapid advancement of medical artificial intelligence(AI)technology,particularly the widespread adoption of AI diagnostic systems,ethical challenges in medical decision-making have garnered increasing attention.This paper analyzes the limitations of algorithmic ethics in medical decision-making and explores accountability mechanisms,aiming to provide theoretical support for ethically informed medical practices.The study highlights how the opacity of AI algorithms complicates the definition of decision-making responsibility,undermines doctor-patient trust,and affects informed consent.By thoroughly investigating issues such as the algorithmic“black box”problem and data privacy protection,we develop accountability assessment models to address ethical concerns related to medical resource allocation.Furthermore,this research examines the effective implementation of AI diagnostic systems through case studies of both successful and unsuccessful applications,extracting lessons on accountability mechanisms and response strategies.Finally,we emphasize that establishing a transparent accountability framework is crucial for enhancing the ethical standards of medical AI systems and protecting patients’rights and interests.展开更多
Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources...Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources restrict direct application to large-scale inference tasks.Additionally,no quantum methods are currently available for multi-agent collaborative decision-making.To address these,we propose a hybrid quantum–classical multi-agent decision-making framework based on hierarchical Bayesian networks,comprising two novel methods.The first one is a hybrid quantum–classical inference method based on hierarchical Bayesian networks.It decomposes large-scale hierarchical Bayesian networks into modular subnetworks.The inference for each subnetwork can be performed on NISQ devices,and the intermediate results are converted into classical messages for cross-layer transmission.The second one is a multi-agent decision-making method using the variational quantum eigensolver(VQE)in the influence diagram.This method models the collaborative decision-making with the influence diagram and encodes the expected utility of diverse actions into a Hamiltonian and subsequently determines the intra-group optimal action efficiently.Experimental validation on the IonQ quantum simulator demonstrates that the hierarchical method outperforms the non-hierarchical method at the functional inference level,and the VQE method can obtain the optimal strategy exactly at the collaborative decision-making level.Our research not only extends the application of quantum computing to multi-agent decision-making but also provides a practical solution for the NISQ era.展开更多
Automated guided vehicles(AGVs)are key equipment in automated container terminals(ACTs),and their operational efficiency can be impacted by conflicts and battery swapping.Additionally,AGVs have bidirectional transport...Automated guided vehicles(AGVs)are key equipment in automated container terminals(ACTs),and their operational efficiency can be impacted by conflicts and battery swapping.Additionally,AGVs have bidirectional transportation capabilities,allowing them tomove in the opposite directionwithout turning around,which helps reduce transportation time.This paper aims at the problem of AGV scheduling and bidirectional conflict-free routing with battery swapping in automated terminals.A bi-level mixed integer programming(MIP)model is proposed,taking into account task assignment,bidirectional conflict-free routing,and battery swapping.The upper model focuses on container task assignment and AGV battery swapping planning,while the lower model ensures conflict-free movement of AGVs.A double-threshold battery swapping strategy is introduced,allowing AGVs to utilize waiting time for loading for battery swapping.An improved differential evolution variable neighborhood search(IDE-VNS)algorithm is developed to solve the bi-level MIP model,aiming to minimize the completion time of all jobs.Experimental results demonstrate that compared to the differential evolution(DE)algorithm and the genetic algorithm(GA),the IDEVNS algorithmreduces fitness values by 44.49% and 45.22%,though it does increase computation time by 56.28% and 62.03%,respectively.Bidirectional transportation reduces the fitness value by an average of 10.97% when the container scale is small.As the container scale increases,the fitness value of bidirectional transportation gradually approaches that of unidirectional transportation.The results further show that the double-threshold battery swapping strategy enhances AGV utilization and reduces the fitness value.展开更多
In this paper, we use the cellular automation model to imitate earthquake process and draw some conclusionsof general applicability. First, it is confirmed that earthquake process has some ordering characters, and it ...In this paper, we use the cellular automation model to imitate earthquake process and draw some conclusionsof general applicability. First, it is confirmed that earthquake process has some ordering characters, and it isshown that both the existence and their mutual arrangement of faults could obviously influence the overallcharacters of earthquake process. Then the characters of each stage of model evolution are explained withself-organized critical state theory. Finally, earthquake sequences produced by the models are analysed interms pf algorithmic complexity and the result shows that AC-values of algorithmic complexity could be usedto study earthquake process and evolution.展开更多
This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic r...This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic rules-based algorithm(HRA). In the OCA, the average speed of each vehicle is maximized. In the HRA, virtual vehicle and restriction of the command acceleration caused by the virtual vehicle are introduced. It is found that(i) capacity under the HRA(denoted as C_(H)) is smaller than capacity under the OCA;(ii) the travel delay is always smaller under the OCA, but driving is always much more comfortable under the HRA;(iii) when the inflow rate is smaller than C_(H), the HRA outperforms the OCA with respect to the fuel consumption and the monetary cost;(iv) when the inflow rate is larger than C_(H), the HRA initially performs better with respect to the fuel consumption and the monetary cost, but the OCA would become better after certain time. The spatiotemporal pattern and speed profile of traffic flow are presented, which explains the reason underlying the different performance. The study is expected to help for better understanding of the two different types of algorithm.展开更多
In the developmental dilemma of artificial intelligence(AI)-assisted judicial decision-making,the technical architecture of AI determines its inherent lack of transparency and interpretability,which is challenging to ...In the developmental dilemma of artificial intelligence(AI)-assisted judicial decision-making,the technical architecture of AI determines its inherent lack of transparency and interpretability,which is challenging to fundamentally improve.This can be considered a true challenge in the realm of AI-assisted judicial decision-making.By examining the court’s acceptance,integration,and trade-offs of AI technology embedded in the judicial field,the exploration of potential conflicts,interactions,and even mutual shaping between the two will not only reshape their conceptual connotations and intellectual boundaries but also strengthen the cognition and re-interpretation of the basic principles and core values of the judicial trial system.展开更多
The uninterrupted operation of the quay crane(QC)ensures that the large container ship can depart port within laytime,which effectively reduces the handling cost for the container terminal and ship owners.The QC waiti...The uninterrupted operation of the quay crane(QC)ensures that the large container ship can depart port within laytime,which effectively reduces the handling cost for the container terminal and ship owners.The QC waiting caused by automated guided vehicles(AGVs)delay in the uncertain environment can be alleviated by dynamic scheduling optimization.A dynamic scheduling process is introduced in this paper to solve the AGV scheduling and path planning problems,in which the scheduling scheme determines the starting and ending nodes of paths,and the choice of paths between nodes affects the scheduling of subsequent AGVs.This work proposes a two-stage mixed integer optimization model to minimize the transportation cost of AGVs under the constraint of laytime.A dynamic optimization algorithm,including the improved rule-based heuristic algorithm and the integration of the Dijkstra algorithm and the Q-Learning algorithm,is designed to solve the optimal AGV scheduling and path schemes.A new conflict avoidance strategy based on graph theory is also proposed to reduce the probability of path conflicts between AGVs.Numerical experiments are conducted to demonstrate the effectiveness of the proposed model and algorithm over existing methods.展开更多
Aiming at the intervention decision-making problem in manned/unmanned aerial vehicle（MAV/UAV） cooperative engagement, this paper carries out a research on allocation strategy of emergency discretion based on human f...Aiming at the intervention decision-making problem in manned/unmanned aerial vehicle（MAV/UAV） cooperative engagement, this paper carries out a research on allocation strategy of emergency discretion based on human factors engineering（HFE）.Firstly, based on the brief review of research status of HFE, it gives structural description to emergency in the process of cooperative engagement and analyzes intervention of commanders. After that,constraint conditions of intervention decision-making of commanders based on HFE（IDMCBHFE） are given, and the mathematical model, which takes the overall efficiency value of handling emergencies as the objective function, is established. Then, through combining K-best and variable neighborhood search（VNS） algorithm, a K-best optimization variable neighborhood search mixed algorithm（KBOVNSMA） is designed to solve the model. Finally,through three groups of simulation experiments, effectiveness and superiority of the proposed algorithm are verified.展开更多
For efficient use of value stream mapping(VSM)for multi-varieties and small batch production in a data-rich environment enabled by Industry 4.0 technologies,a systematic framework of VSM to rejuvenate traditional lean...For efficient use of value stream mapping(VSM)for multi-varieties and small batch production in a data-rich environment enabled by Industry 4.0 technologies,a systematic framework of VSM to rejuvenate traditional lean tools is proposed.It addresses the issue that traditional VSM requires intensive on-site investigation and replies on experience,which hinders decisionmaking efficiency in dynamic and complex environments.The proposed framework follows the data-information-knowledge hierarchy model,and demonstrates how data can be collected in a production workshop,processed into information,and then interpreted into knowledge.In this paper,the necessity and limitations of VSM in automated root cause analysis are first discussed,with a literature review on lean production tools,especially VSM and VSM-based decision making in Industry 4.0.An implementation case of a furniture manufacturer in China is presented,where decision tree algorithm was used for automated root cause analysis.The results indicate that automated VSM can make good use of production data to cater for multi-varieties and small batch production with timely on-site waste identification and analysis.The proposed framework is also suggested as a guideline to renew other lean tools for reliable and efficient decision-making.展开更多
基金Supported by National Key R&D Program of China(Grant No.2022YFB2503203)National Natural Science Foundation of China(Grant No.U1964206).
文摘Decision-making of connected and automated vehicles(CAV)includes a sequence of driving maneuvers that improve safety and efficiency,characterized by complex scenarios,strong uncertainty,and high real-time requirements.Deep reinforcement learning(DRL)exhibits excellent capability of real-time decision-making and adaptability to complex scenarios,and generalization abilities.However,it is arduous to guarantee complete driving safety and efficiency under the constraints of training samples and costs.This paper proposes a Mixture of Expert method(MoE)based on Soft Actor-Critic(SAC),where the upper-level discriminator dynamically decides whether to activate the lower-level DRL expert or the heuristic expert based on the features of the input state.To further enhance the performance of the DRL expert,a buffer zone is introduced in the reward function,preemptively applying penalties before insecure situations occur.In order to minimize collision and off-road rates,the Intelligent Driver Model(IDM)and Minimizing Overall Braking Induced by Lane changes(MOBIL)strategy are designed by heuristic experts.Finally,tested in typical simulation scenarios,MOE shows a 13.75%improvement in driving efficiency compared with the traditional DRL method with continuous action space.It ensures high safety with zero collision and zero off-road rates while maintaining high adaptability.
文摘Automated Program Repair(APR)techniques have shown significant potential in mitigating the cost and complexity associated with debugging by automatically generating corrective patches for software defects.Despite considerable progress in APR methodologies,existing approaches frequently lack contextual awareness of runtime behaviors and structural intricacies inherent in buggy source code.In this paper,we propose a novel APR approach that integrates attention mechanisms within an autoencoder-based framework,explicitly utilizing structural code affinity and execution context correlation derived from stack trace analysis.Our approach begins with an innovative preprocessing pipeline,where code segments and stack traces are transformed into tokenized representations.Subsequently,the BM25 ranking algorithm is employed to quantitatively measure structural code affinity and execution context correlation,identifying syntactically and semantically analogous buggy code snippets and relevant runtime error contexts from extensive repositories.These extracted features are then encoded via an attention-enhanced autoencoder model,specifically designed to capture significant patterns and correlations essential for effective patch generation.To assess the efficacy and generalizability of our proposed method,we conducted rigorous experimental comparisons against DeepFix,a state-of-the-art APR system,using a substantial dataset comprising 53,478 studentdeveloped C programs.Experimental outcomes indicate that our model achieves a notable bug repair success rate of approximately 62.36%,representing a statistically significant performance improvement of over 6%compared to the baseline.Furthermore,a thorough K-fold cross-validation reinforced the consistency,robustness,and reliability of our method across diverse subsets of the dataset.Our findings present the critical advantage of integrating attentionbased learning with code structural and execution context features in APR tasks,leading to improved accuracy and practical applicability.Future work aims to extend the model’s applicability across different programming languages,systematically optimize hyperparameters,and explore alternative feature representation methods to further enhance debugging efficiency and effectiveness.
文摘Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.
文摘Shared control schemes allow a human driver to work with an automated driving agent in driver-vehicle systems while retaining the driver’s abilities to control.The human driver,as an essential agent in the driver-vehicle shared control systems,should be precisely modeled regarding their cognitive processes,control strategies,and decision-making processes.The interactive strategy design between drivers and automated driving agents brings an excellent challenge for human-centric driver assistance systems due to the inherent characteristics of humans.Many open-ended questions arise,such as what proper role of human drivers should act in a shared control scheme?How to make an intelligent decision capable of balancing the benefits of agents in shared control systems?Due to the advent of these attentions and questions,it is desirable to present a survey on the decision making between human drivers and highly automated vehicles,to understand their architectures,human driver modeling,and interaction strategies under the driver-vehicle shared schemes.Finally,we give a further discussion on the key future challenges and opportunities.They are likely to shape new potential research directions.
文摘The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.
基金Supported by the National Natural Science Foundation of China(No.51765043)
文摘To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport requests in this paper. Firstly, a workshop scheduling mechanism of AGV is analyzed and a mathematical model is established using Genetic Algorithm. According to several sets of transport priority of AGV, processes of FMS are encoded, and fitness function, selection, crossover, and variation methods are designed. The transport priority which has the least impact on scheduling results is determined based on the simulation analysis of Genetic Algorithm, and the makespan, the longest waiting time, and optimal route of the car are calculated. According to the actual processing situation of the workshop, feasibility of this method is verified successfully to provide an effective solution to the scheduling problem of single AGV.
基金supported by the National Natural Science Foundation of China(Nos.21808059,21878088,and 21476077)Key Project of the Shanghai Science and Technology Committee(No.18DZ1112703)。
文摘The pharmaceutical industry is now paying increased attention to continuous manufacturing.While the revolution to continuous and automated manufacturing is deepening in most of the top pharma companies in the world,the advancement of automated pharmaceutical continuous manufacturing in China is relatively slow due to some key challenges including the lack of knowledge on the related technologies and shortage of qualified personnels.In this review,emphasis is given to two of the crucial technologies in automated pharmaceutical continuous manufacturing,i.e.,process analytical technology(PAT)and self-optimizing algorithm.Research work published in recent 5 years employing advanced PAT tools and self-optimization algorithms is introduced,which represents the great progress that has been made in automated pharmaceutical continuous manufacturing.
基金Supported by the National Key Research and Development Program of China(No.2020YFC1807904).
文摘With the wide application of automated guided vehicles(AGVs) in large scale outdoor scenarios with complex terrain,the collaborative work of a large number of AGVs becomes the main trend.The effective multi-agent path finding(MAPF) algorithm is urgently needed to ensure the efficiency and realizability of the whole system. The complex terrain of outdoor scenarios is fully considered by using different values of passage cost to quantify different terrain types. The objective of the MAPF problem is to minimize the cost of passage while the Manhattan distance of paths and the time of passage are also evaluated for a comprehensive comparison. The pre-path-planning and real-time-conflict based greedy(PRG) algorithm is proposed as the solution. Simulation is conducted and the proposed PRG algorithm is compared with waiting-stop A^(*) and conflict based search(CBS) algorithms. Results show that the PRG algorithm outperforms the waiting-stop A^(*) algorithm in all three performance indicators,and it is more applicable than the CBS algorithm when a large number of AGVs are working collaboratively with frequent collisions.
文摘E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.
基金funded by Chongqing Science and Technology Bureau (No.cstc2021jsyj-yzysbAX0008)Chongqing University of Arts and Sciences (No.P2021JG13)2021 Humanities and Social Sciences Program of Chongqing Education Commission (No.21SKGH227).
文摘This paper is to explore the problems of intelligent connected vehicles(ICVs)autonomous driving decision-making under a 5G-V2X structured road environment.Through literature review and interviews with autonomous driving practitioners,this paper firstly puts forward a logical framework for designing a cerebrum-like autonomous driving system.Secondly,situated on this framework,it builds a hierarchical finite state machine(HFSM)model as well as a TOPSIS-GRA algorithm for making ICV autonomous driving decisions by employing a data fusion approach between the entropy weight method(EWM)and analytic hierarchy process method(AHP)and by employing a model fusion approach between the technique for order preference by similarity to an ideal solution(TOPSIS)and grey relational analysis(GRA).The HFSM model is composed of two layers:the global FSM model and the local FSM model.The decision of the former acts as partial input information of the latter and the result of the latter is sent forward to the local pathplanning module,meanwhile pulsating feedback to the former as real-time refresh data.To identify different traffic scenarios in a cerebrum-like way,the global FSM model is designed as 7 driving behavior states and 17 driving characteristic events,and the local FSM model is designed as 16 states and 8 characteristic events.In respect to designing a cerebrum-like algorithm for state transition,this paper firstly fuses AHP weight and EWM weight at their output layer to generate a synthetic weight coefficient for each characteristic event;then,it further fuses TOPSIS method and GRA method at the model building layer to obtain the implementable order of state transition.To verify the feasibility,reliability,and safety of theHFSMmodel aswell as its TOPSISGRA state transition algorithm,this paper elaborates on a series of simulative experiments conducted on the PreScan8.50 platform.The results display that the accuracy of obstacle detection gets 98%,lane line prediction is beyond 70 m,the speed of collision avoidance is higher than 45 km/h,the distance of collision avoidance is less than 5 m,path planning time for obstacle avoidance is averagely less than 50 ms,and brake deceleration is controlled under 6 m/s2.These technical indexes support that the driving states set and characteristic events set for the HFSM model as well as its TOPSIS-GRA algorithm may bring about cerebrum-like decision-making effectiveness for ICV autonomous driving under 5G-V2X intelligent road infrastructure.
文摘With the rapid advancement of medical artificial intelligence(AI)technology,particularly the widespread adoption of AI diagnostic systems,ethical challenges in medical decision-making have garnered increasing attention.This paper analyzes the limitations of algorithmic ethics in medical decision-making and explores accountability mechanisms,aiming to provide theoretical support for ethically informed medical practices.The study highlights how the opacity of AI algorithms complicates the definition of decision-making responsibility,undermines doctor-patient trust,and affects informed consent.By thoroughly investigating issues such as the algorithmic“black box”problem and data privacy protection,we develop accountability assessment models to address ethical concerns related to medical resource allocation.Furthermore,this research examines the effective implementation of AI diagnostic systems through case studies of both successful and unsuccessful applications,extracting lessons on accountability mechanisms and response strategies.Finally,we emphasize that establishing a transparent accountability framework is crucial for enhancing the ethical standards of medical AI systems and protecting patients’rights and interests.
基金supported by the National Natural Science Foundation of China(Grant Nos.62473371 and 61673389)。
文摘Although quantum Bayesian networks provide a promising paradigm for multi-agent decision-making,their practical application faces two challenges in the noisy intermediate-scale quantum(NISQ)era.Limited qubit resources restrict direct application to large-scale inference tasks.Additionally,no quantum methods are currently available for multi-agent collaborative decision-making.To address these,we propose a hybrid quantum–classical multi-agent decision-making framework based on hierarchical Bayesian networks,comprising two novel methods.The first one is a hybrid quantum–classical inference method based on hierarchical Bayesian networks.It decomposes large-scale hierarchical Bayesian networks into modular subnetworks.The inference for each subnetwork can be performed on NISQ devices,and the intermediate results are converted into classical messages for cross-layer transmission.The second one is a multi-agent decision-making method using the variational quantum eigensolver(VQE)in the influence diagram.This method models the collaborative decision-making with the influence diagram and encodes the expected utility of diverse actions into a Hamiltonian and subsequently determines the intra-group optimal action efficiently.Experimental validation on the IonQ quantum simulator demonstrates that the hierarchical method outperforms the non-hierarchical method at the functional inference level,and the VQE method can obtain the optimal strategy exactly at the collaborative decision-making level.Our research not only extends the application of quantum computing to multi-agent decision-making but also provides a practical solution for the NISQ era.
基金supported by National Natural Science Foundation of China(No.62073212)Shanghai Science and Technology Commission(No.23ZR1426600).
文摘Automated guided vehicles(AGVs)are key equipment in automated container terminals(ACTs),and their operational efficiency can be impacted by conflicts and battery swapping.Additionally,AGVs have bidirectional transportation capabilities,allowing them tomove in the opposite directionwithout turning around,which helps reduce transportation time.This paper aims at the problem of AGV scheduling and bidirectional conflict-free routing with battery swapping in automated terminals.A bi-level mixed integer programming(MIP)model is proposed,taking into account task assignment,bidirectional conflict-free routing,and battery swapping.The upper model focuses on container task assignment and AGV battery swapping planning,while the lower model ensures conflict-free movement of AGVs.A double-threshold battery swapping strategy is introduced,allowing AGVs to utilize waiting time for loading for battery swapping.An improved differential evolution variable neighborhood search(IDE-VNS)algorithm is developed to solve the bi-level MIP model,aiming to minimize the completion time of all jobs.Experimental results demonstrate that compared to the differential evolution(DE)algorithm and the genetic algorithm(GA),the IDEVNS algorithmreduces fitness values by 44.49% and 45.22%,though it does increase computation time by 56.28% and 62.03%,respectively.Bidirectional transportation reduces the fitness value by an average of 10.97% when the container scale is small.As the container scale increases,the fitness value of bidirectional transportation gradually approaches that of unidirectional transportation.The results further show that the double-threshold battery swapping strategy enhances AGV utilization and reduces the fitness value.
文摘In this paper, we use the cellular automation model to imitate earthquake process and draw some conclusionsof general applicability. First, it is confirmed that earthquake process has some ordering characters, and it isshown that both the existence and their mutual arrangement of faults could obviously influence the overallcharacters of earthquake process. Then the characters of each stage of model evolution are explained withself-organized critical state theory. Finally, earthquake sequences produced by the models are analysed interms pf algorithmic complexity and the result shows that AC-values of algorithmic complexity could be usedto study earthquake process and evolution.
基金Project supported in part by the Fundamental Research Funds for the Central Universities (Grant No.2021JBZ107)the National Natural Science Foundation of China (Grant Nos.72288101 and 71931002)。
文摘This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic rules-based algorithm(HRA). In the OCA, the average speed of each vehicle is maximized. In the HRA, virtual vehicle and restriction of the command acceleration caused by the virtual vehicle are introduced. It is found that(i) capacity under the HRA(denoted as C_(H)) is smaller than capacity under the OCA;(ii) the travel delay is always smaller under the OCA, but driving is always much more comfortable under the HRA;(iii) when the inflow rate is smaller than C_(H), the HRA outperforms the OCA with respect to the fuel consumption and the monetary cost;(iv) when the inflow rate is larger than C_(H), the HRA initially performs better with respect to the fuel consumption and the monetary cost, but the OCA would become better after certain time. The spatiotemporal pattern and speed profile of traffic flow are presented, which explains the reason underlying the different performance. The study is expected to help for better understanding of the two different types of algorithm.
文摘In the developmental dilemma of artificial intelligence(AI)-assisted judicial decision-making,the technical architecture of AI determines its inherent lack of transparency and interpretability,which is challenging to fundamentally improve.This can be considered a true challenge in the realm of AI-assisted judicial decision-making.By examining the court’s acceptance,integration,and trade-offs of AI technology embedded in the judicial field,the exploration of potential conflicts,interactions,and even mutual shaping between the two will not only reshape their conceptual connotations and intellectual boundaries but also strengthen the cognition and re-interpretation of the basic principles and core values of the judicial trial system.
基金supported in part by the National Natural Science Foundation of China(61473053)the Science and Technology Innovation Foundation of Dalian,China(2020JJ26GX033)。
文摘The uninterrupted operation of the quay crane(QC)ensures that the large container ship can depart port within laytime,which effectively reduces the handling cost for the container terminal and ship owners.The QC waiting caused by automated guided vehicles(AGVs)delay in the uncertain environment can be alleviated by dynamic scheduling optimization.A dynamic scheduling process is introduced in this paper to solve the AGV scheduling and path planning problems,in which the scheduling scheme determines the starting and ending nodes of paths,and the choice of paths between nodes affects the scheduling of subsequent AGVs.This work proposes a two-stage mixed integer optimization model to minimize the transportation cost of AGVs under the constraint of laytime.A dynamic optimization algorithm,including the improved rule-based heuristic algorithm and the integration of the Dijkstra algorithm and the Q-Learning algorithm,is designed to solve the optimal AGV scheduling and path schemes.A new conflict avoidance strategy based on graph theory is also proposed to reduce the probability of path conflicts between AGVs.Numerical experiments are conducted to demonstrate the effectiveness of the proposed model and algorithm over existing methods.
基金supported by the National Natural Science Foundation of China(61573017)the Doctoral Foundation of Air Force Engineering University(KGD08101604)
文摘Aiming at the intervention decision-making problem in manned/unmanned aerial vehicle（MAV/UAV） cooperative engagement, this paper carries out a research on allocation strategy of emergency discretion based on human factors engineering（HFE）.Firstly, based on the brief review of research status of HFE, it gives structural description to emergency in the process of cooperative engagement and analyzes intervention of commanders. After that,constraint conditions of intervention decision-making of commanders based on HFE（IDMCBHFE） are given, and the mathematical model, which takes the overall efficiency value of handling emergencies as the objective function, is established. Then, through combining K-best and variable neighborhood search（VNS） algorithm, a K-best optimization variable neighborhood search mixed algorithm（KBOVNSMA） is designed to solve the model. Finally,through three groups of simulation experiments, effectiveness and superiority of the proposed algorithm are verified.
基金Project supported by the National Natural Science Foundation of China(Nos.72071179 and 51805479)the Natural Science Foundation of Zhejiang Province(No.LY19E050019)the Ministry of Industry and Information Technology of China(No.Z135060009002)。
文摘For efficient use of value stream mapping(VSM)for multi-varieties and small batch production in a data-rich environment enabled by Industry 4.0 technologies,a systematic framework of VSM to rejuvenate traditional lean tools is proposed.It addresses the issue that traditional VSM requires intensive on-site investigation and replies on experience,which hinders decisionmaking efficiency in dynamic and complex environments.The proposed framework follows the data-information-knowledge hierarchy model,and demonstrates how data can be collected in a production workshop,processed into information,and then interpreted into knowledge.In this paper,the necessity and limitations of VSM in automated root cause analysis are first discussed,with a literature review on lean production tools,especially VSM and VSM-based decision making in Industry 4.0.An implementation case of a furniture manufacturer in China is presented,where decision tree algorithm was used for automated root cause analysis.The results indicate that automated VSM can make good use of production data to cater for multi-varieties and small batch production with timely on-site waste identification and analysis.The proposed framework is also suggested as a guideline to renew other lean tools for reliable and efficient decision-making.
