为加快末端物流配送的效率,提出一种配送无人机的航迹规划问题。针对传统快速搜索随机树(rapidlysearch random tree,RRT)算法在航迹规划中存在的盲目性和路径不平滑等问题,将人工势场法(artificial potential field,APF)与Informed-RRT...为加快末端物流配送的效率,提出一种配送无人机的航迹规划问题。针对传统快速搜索随机树(rapidlysearch random tree,RRT)算法在航迹规划中存在的盲目性和路径不平滑等问题,将人工势场法(artificial potential field,APF)与Informed-RRT^(*)算法融合,提出一种自适应步长增长策略的改进APF-Informed-RRT^(*)算法。首先在选择新节点时,考虑到障碍物和目标点的影响,提出一种自适应步长增长策略来解决采样的盲目性;其次采用三次B样条对拐点处进行平滑处理;最后分别采用RRT^(*)算法、Informed-RRT^(*)算法和改进APF-Informed-RRT^(*)算法在两种环境中进行仿真实验。结果表明,改进APF-Informed-RRT^(*)算法相较于RRT^(*)算法和Informed-RRT^(*)算法,在运行时间、迭代次数以及路径平滑上都得到提升。展开更多
The estimation of the probability of informed trading(PIN)model and its extensions poses significant challenges owing to various computational problems.To address these issues,we propose a novel estimation method call...The estimation of the probability of informed trading(PIN)model and its extensions poses significant challenges owing to various computational problems.To address these issues,we propose a novel estimation method called the expectation-conditional-maximization(ECM)algorithm,which can serve as an alternative to the existing methods for estimating PIN models.Our method provides optimal estimates for the original PIN model as well as two of its extensions:the multilayer PIN model and the adjusted PIN model,along with its restricted versions.Our results indicate that estimations using the ECM algorithm are generally faster,more accurate,and more memory-efficient than the standard methods used in the literature,making it a robust alternative.More importantly,the ECM algorithm is not limited to the models discussed and can be easily adapted to estimate future extensions of the PIN model.展开更多
In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional R...In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.展开更多
文摘为加快末端物流配送的效率,提出一种配送无人机的航迹规划问题。针对传统快速搜索随机树(rapidlysearch random tree,RRT)算法在航迹规划中存在的盲目性和路径不平滑等问题,将人工势场法(artificial potential field,APF)与Informed-RRT^(*)算法融合,提出一种自适应步长增长策略的改进APF-Informed-RRT^(*)算法。首先在选择新节点时,考虑到障碍物和目标点的影响,提出一种自适应步长增长策略来解决采样的盲目性;其次采用三次B样条对拐点处进行平滑处理;最后分别采用RRT^(*)算法、Informed-RRT^(*)算法和改进APF-Informed-RRT^(*)算法在两种环境中进行仿真实验。结果表明,改进APF-Informed-RRT^(*)算法相较于RRT^(*)算法和Informed-RRT^(*)算法,在运行时间、迭代次数以及路径平滑上都得到提升。
基金supported by the Scientific and Technological Research Council of Turkey(TUBITAK)[grant no 122K637].
文摘The estimation of the probability of informed trading(PIN)model and its extensions poses significant challenges owing to various computational problems.To address these issues,we propose a novel estimation method called the expectation-conditional-maximization(ECM)algorithm,which can serve as an alternative to the existing methods for estimating PIN models.Our method provides optimal estimates for the original PIN model as well as two of its extensions:the multilayer PIN model and the adjusted PIN model,along with its restricted versions.Our results indicate that estimations using the ECM algorithm are generally faster,more accurate,and more memory-efficient than the standard methods used in the literature,making it a robust alternative.More importantly,the ECM algorithm is not limited to the models discussed and can be easily adapted to estimate future extensions of the PIN model.
基金supported by Gansu Provincial Science and Technology Program Project(No.23JRRA868)Lanzhou Municipal Talent Innovation and Entrepreneurship Project(No.2019-RC-103)。
文摘In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.
