System upgrades in unmanned systems have made Unmanned Aerial Vehicle(UAV)-based patrolling and monitoring a preferred solution for ocean surveillance.However,dynamic environments and large-scale deployments pose sign...System upgrades in unmanned systems have made Unmanned Aerial Vehicle(UAV)-based patrolling and monitoring a preferred solution for ocean surveillance.However,dynamic environments and large-scale deployments pose significant challenges for efficient decision-making,necessitating a modular multiagent control system.Deep Reinforcement Learning(DRL)and Decision Tree(DT)have been utilized for these complex decision-making tasks,but each has its limitations:DRL is highly adaptive but lacks interpretability,while DT is inherently interpretable but has limited adaptability.To overcome these challenges,we propose the Adaptive Interpretable Decision Tree(AIDT),an evolutionary-based algorithm that is both adaptable to diverse environmental settings and highly interpretable in its decision-making processes.We first construct a Markov decision process(MDP)-based simulation environment using the Cooperative Submarine Search task as a representative scenario for training and testing the proposed method.Specifically,we use the heat map as a state variable to address the issue of multi-agent input state proliferation.Next,we introduce the curiosity-guiding intrinsic reward to encourage comprehensive exploration and enhance algorithm performance.Additionally,we incorporate decision tree size as an influence factor in the adaptation process to balance task completion with computational efficiency.To further improve the generalization capability of the decision tree,we apply a normalization method to ensure consistent processing of input states.Finally,we validate the proposed algorithm in different environmental settings,and the results demonstrate both its adaptability and interpretability.展开更多
This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapi...This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.展开更多
针对现有起重机路径规划效率低的问题,提出一种基于改进快速探索随机树(rapidly-exploring random tree,RRT)的起重机路径规划算法。将广义距离替代经典RRT中欧氏距离,解决多自由度(degree of freedom,DOF)下RRT中距离的定义不明确的问...针对现有起重机路径规划效率低的问题,提出一种基于改进快速探索随机树(rapidly-exploring random tree,RRT)的起重机路径规划算法。将广义距离替代经典RRT中欧氏距离,解决多自由度(degree of freedom,DOF)下RRT中距离的定义不明确的问题。基于降维概念的胞元法,将C构型空间(configuration space,C空间)划分为大小相等的单元格,解决经典RRT中最近邻搜索(nearest neighbor search,NNS)在计算时间和资源方面效率低的问题。实验结果表明:在相同实验条件下,改进的RRT算法比双向RRT算法计算时间减少89.5%,能提高计算时间效率和提升搜寻路径质量,具有一定的参考价值。展开更多
为提升高速公路合流区交通运行效率及驾乘人员舒适性,在保障安全的前提下,面向人工驾驶车辆(Human Driven Vehicles,HDV)和智能网联车辆(Connected and Autonomous Vehicles,CAV)混行的异质交通流环境,提出高速公路CAV合流次序优化与轨...为提升高速公路合流区交通运行效率及驾乘人员舒适性,在保障安全的前提下,面向人工驾驶车辆(Human Driven Vehicles,HDV)和智能网联车辆(Connected and Autonomous Vehicles,CAV)混行的异质交通流环境,提出高速公路CAV合流次序优化与轨迹规划方法.首先,以车辆通行时间和延误作为合流区交通运行效率表征指标,建立合流次序优化函数,采用并调整蒙特卡洛树搜索(Monte Carlo Tree Search,MCTS)算法,获得最优合流次序;其次,依据合流次序,建立最小化加速度和急动度的CAV合流轨迹规划(Minimize Acceleration and Jerk Trajectory Planning,MAJTP)函数,运用最优控制理论,求解车辆纵向最优轨迹解析解,进而形成高速公路合流区CAV协同控制方法;最后,联合运用SUMO软件和PYTHON库,对本文所提方法进行交通仿真验证.仿真结果表明:在CAV渗透率分别为0.2、0.4、0.6和0.8时,相较于先进先出(First In First Out,FIFO)算法,基于MCTS算法的合流次序优化方法累积延误分别降低5.75%、8.84%、12.24%和11.06%;相较于最小化加速度的车辆轨迹规划(Minimize Acceleration Trajectory Planning,MATP)方法,MAJTP方法平均急动度更趋近于零,驾乘人员舒适性有所提升,验证了方法的有效性.研究成果可为高速公路合流区交通运行管控研究提供理论支持.展开更多
文摘System upgrades in unmanned systems have made Unmanned Aerial Vehicle(UAV)-based patrolling and monitoring a preferred solution for ocean surveillance.However,dynamic environments and large-scale deployments pose significant challenges for efficient decision-making,necessitating a modular multiagent control system.Deep Reinforcement Learning(DRL)and Decision Tree(DT)have been utilized for these complex decision-making tasks,but each has its limitations:DRL is highly adaptive but lacks interpretability,while DT is inherently interpretable but has limited adaptability.To overcome these challenges,we propose the Adaptive Interpretable Decision Tree(AIDT),an evolutionary-based algorithm that is both adaptable to diverse environmental settings and highly interpretable in its decision-making processes.We first construct a Markov decision process(MDP)-based simulation environment using the Cooperative Submarine Search task as a representative scenario for training and testing the proposed method.Specifically,we use the heat map as a state variable to address the issue of multi-agent input state proliferation.Next,we introduce the curiosity-guiding intrinsic reward to encourage comprehensive exploration and enhance algorithm performance.Additionally,we incorporate decision tree size as an influence factor in the adaptation process to balance task completion with computational efficiency.To further improve the generalization capability of the decision tree,we apply a normalization method to ensure consistent processing of input states.Finally,we validate the proposed algorithm in different environmental settings,and the results demonstrate both its adaptability and interpretability.
基金the National Natural Science Foundation of China(Grant No.42274119)the Liaoning Revitalization Talents Program(Grant No.XLYC2002082)+1 种基金National Key Research and Development Plan Key Special Projects of Science and Technology Military Civil Integration(Grant No.2022YFF1400500)the Key Project of Science and Technology Commission of the Central Military Commission.
文摘This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.
文摘针对现有起重机路径规划效率低的问题,提出一种基于改进快速探索随机树(rapidly-exploring random tree,RRT)的起重机路径规划算法。将广义距离替代经典RRT中欧氏距离,解决多自由度(degree of freedom,DOF)下RRT中距离的定义不明确的问题。基于降维概念的胞元法,将C构型空间(configuration space,C空间)划分为大小相等的单元格,解决经典RRT中最近邻搜索(nearest neighbor search,NNS)在计算时间和资源方面效率低的问题。实验结果表明:在相同实验条件下,改进的RRT算法比双向RRT算法计算时间减少89.5%,能提高计算时间效率和提升搜寻路径质量,具有一定的参考价值。
文摘为提升高速公路合流区交通运行效率及驾乘人员舒适性,在保障安全的前提下,面向人工驾驶车辆(Human Driven Vehicles,HDV)和智能网联车辆(Connected and Autonomous Vehicles,CAV)混行的异质交通流环境,提出高速公路CAV合流次序优化与轨迹规划方法.首先,以车辆通行时间和延误作为合流区交通运行效率表征指标,建立合流次序优化函数,采用并调整蒙特卡洛树搜索(Monte Carlo Tree Search,MCTS)算法,获得最优合流次序;其次,依据合流次序,建立最小化加速度和急动度的CAV合流轨迹规划(Minimize Acceleration and Jerk Trajectory Planning,MAJTP)函数,运用最优控制理论,求解车辆纵向最优轨迹解析解,进而形成高速公路合流区CAV协同控制方法;最后,联合运用SUMO软件和PYTHON库,对本文所提方法进行交通仿真验证.仿真结果表明:在CAV渗透率分别为0.2、0.4、0.6和0.8时,相较于先进先出(First In First Out,FIFO)算法,基于MCTS算法的合流次序优化方法累积延误分别降低5.75%、8.84%、12.24%和11.06%;相较于最小化加速度的车辆轨迹规划(Minimize Acceleration Trajectory Planning,MATP)方法,MAJTP方法平均急动度更趋近于零,驾乘人员舒适性有所提升,验证了方法的有效性.研究成果可为高速公路合流区交通运行管控研究提供理论支持.
