The reentry trajectory planning for hypersonic vehicles is critical and challenging in the presence of numerous nonlinear equations of motion and path constraints, as well as guaranteed satisfaction of accuracy in mee...The reentry trajectory planning for hypersonic vehicles is critical and challenging in the presence of numerous nonlinear equations of motion and path constraints, as well as guaranteed satisfaction of accuracy in meeting all the specified boundary conditions. In the last ten years, many researchers have investigated various strategies to generate a feasible or optimal constrained reentry trajectory for hypersonic vehicles. This paper briefly reviews the new research efforts to promote the capability of reentry trajectory planning. The progress of the onboard reentry trajectory planning, reentry trajectory optimization, and landing footprint is summarized. The main challenges of reentry trajectory planning for hypersonic vehicles are analyzed, focusing on the rapid reentry trajectory optimization, complex geographic constraints, and coop- erative strategies.展开更多
This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-gu...This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-guided bombs. First, this problem is formulated as a variant of the traveling salesman problem （TSP）, called the dynamic-constrained TSP with neighborhoods （DCT- SPN）. Then, a hierarchical hybrid approach, which partitions the planning algorithm into a roadmap planning layer and an optimal control layer, is proposed to solve the DCTSPN. In the roadmap planning layer, a novel algorithm based on an updatable proba- bilistic roadmap （PRM） is presented, which operates by randomly sampling a finite set of vehicle states from continuous state space in order to reduce the complicated trajectory planning problem to planning on a finite directed graph. In the optimal control layer, a collision-free state-to-state trajectory planner based on the Gauss pseudospectral method is developed, which can generate both dynamically feasible and optimal flight trajectories. The entire process of solving a DCTSPN consists of two phases. First, in the offline preprocessing phase, the algorithm constructs a PRM, and then converts the original problem into a standard asymmet- ric TSP （ATSP）. Second, in the online querying phase, the costs of directed edges in PRM are updated first, and a fast heuristic searching algorithm is then used to solve the ATSP. Numerical experiments indicate that the algorithm proposed in this paper can generate both feasible and near-optimal solutions quickly for online purposes.展开更多
Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a ki...Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a kind of multi-objective optimization problem.Being different from traditional ways of transforming the multi-objective optimization into a single objective optimization by weighting factors,this work applies an improved non-dominated sorting genetic algorithm Ⅱ(NSGA Ⅱ) to solve it directly by means of optimizing multi-objective functions simultaneously.In the improved NSGA Ⅱ,the chaos initialization and a crowding distance based population trimming method were introduced to overcome the prematurity of population,the penalty function was used in handling constraints,and the optimal solution was selected according to the method of fuzzy set theory.Simulation results of three different schemes designed according to various practical engineering requirements show that the improved NSGA Ⅱ can effectively obtain the Pareto optimal solution set under different weighting with outstanding convergence and stability,and provide a new train of thoughts to design homing trajectory of parafoil system.展开更多
An optimal midcourse trajectory planning approach that considers the capture region（CR） of the terminal guidance is proposed in this article based on the Gauss pseudospectral method（GPM）. Firstly, the planar CR of...An optimal midcourse trajectory planning approach that considers the capture region（CR） of the terminal guidance is proposed in this article based on the Gauss pseudospectral method（GPM）. Firstly, the planar CR of the proportional navigation in terminal guidance is analyzed and innovatively introduced in the midcourse trajectory planning problems, with the collision triangle（CT） serving as the ideal terminal states parameters of the midcourse phase, and the CR area serving as the robustness against target maneuvers. Secondly, the midcourse trajectory planning problem that considers the path, terminal and control constraints is formulated and the well-developed GPM is used to generate the nominal trajectory that meets the CR demands. The interceptor will reshape the trajectory only when the former CR fails to cover the target, which has loosened the critical demand for frequent trajectory modification. Finally, the simulations of four different scenarios are carried out and the results prove the effectiveness and optimality of the proposed method.展开更多
Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Car-tesian space mainly through increasing the number of knots on the path and the number of the path′s segments, which res...Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Car-tesian space mainly through increasing the number of knots on the path and the number of the path′s segments, which results in the heavier online computational burden for the robot controller. Aiming at overcoming this drawback, the authors propose a new kind of real-time accurate hand path tracking and joint trajectory planning method. Through selecting some extra knots on the specified hand path by a certain rule and introducing a sinusoidal function to the joint displacement equation of each segment, this method can greatly raise the path tracking accuracy of robot′s hand and does not change the number of the path′s segments. It also does not increase markedly the computational burden of robot controller. The result of simulation indicates that this method is very effective, and has important value in increasing the application of industrial robots.展开更多
Based on trajectory planning with maximum velocity and acceleration constraints, a novel high-quality trajectory planning method was proposed for heterogeneous individuals in crowd simulation. The proposed method ensu...Based on trajectory planning with maximum velocity and acceleration constraints, a novel high-quality trajectory planning method was proposed for heterogeneous individuals in crowd simulation. The proposed method ensured that the individual’s path was smooth and its velocity was continuous. Based on the physiological constraints of humans with maximum velocity and acceleration, time-optimal trajectory and feasible region were derived by solving kinodynamic planning problem. Subsequently, a high-quality trajectory planning algorithm was designed to compute the trajectory with appropriate variation of velocity. The simulation results demonstrate that the proposed trajectory planning method has more authenticities and can generate high-quality trajectories for virtual humans in crowd simulation.展开更多
To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm i...To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm is introduced.Firstly,a formation controller based on prescribed performance theory is designed to control the transient and steady formation configuration,as well as the formation forming time,which not only can form the designated formation configuration but also can guarantee collision avoidance and terrain avoidance theoretically.Next,considering the constraints caused by formation controller on trajectory planning such as the safe distance,turn angle and step length,as well as the constraint of formation shape,a leader trajectory planning method based on sparse A^(*)algorithm is proposed.Simulation results show that the UAV formation can arrive at the destination safely with a short trajectory no matter keeping the formation or encountering formation transformation.展开更多
Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Cartesian space mainly through increasing the number of knots on the path and the segments of the path. But, this method res...Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Cartesian space mainly through increasing the number of knots on the path and the segments of the path. But, this method resulted in the heavier on line computational burden for the robot controller. In this paper, aiming at this drawback, the authors propose a new kind of real time accurate hand path tracking and joint trajectory planning method for robots. Through selecting some extra knots on the specified hand path by a certain rule, which enables the number of knots on each segment to increase from two to four, and through introducing a sinusoidal function and a cosinoidal function to the joint displacement equation of each segment, this method can raise the path tracking accuracy of robot′s hand greatly but does not increase the computational burden of robot controller markedly.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission ...Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission was adjusted or the environment varied.Taking the typical formation reconfiguration from a triangular penetrating formation to a circular tracking formation for example,a path planning method based on Dubins trajectory and particle swarm optimization(PSO)algorithm is presented in this paper.The mathematic model of multiple UAVs formation reconfiguration was built firstly.According to the kinematic model of aerial vehicles,a process of dimensionality reduction was carried out to simplify the model based on Dubins trajectory.The PSO algorithm was adopted to resolve the optimization problem of formation reconfiguration path planning.Finally,the simulation and vehicles flight experiment are executed.Results show that the path planning method based on the Dubins trajectory and the PSO algorithm can generate feasible paths for vehicles on time,to guarantee the rapidity and effectiveness of formation reconfigurations.Furthermore,from the simulation results,the method is universal and could be extended easily to the path planning problem for different kinds of formation reconfigurations.展开更多
A trajectory shaping guidance law based on virtua angle （TSGLBVA） is proposed for a re-entry vehicle with the constraints of terminal impact angles and their time derivatives. In the view of differential properties ...A trajectory shaping guidance law based on virtua angle （TSGLBVA） is proposed for a re-entry vehicle with the constraints of terminal impact angles and their time derivatives. In the view of differential properties of the maneuvering trajectory, a virtual angle and a virtual radius are defined. Also, the shaping trajectory of the vehicle is established by the polynomials of the virtual angle. Then, four optimized parameters are selected according to the theorem of parameters transformation presented in this paper. Finally, a convergent variant of the Nelder-Mead algorithm is adopted to obtain the reference trajectory, and a trajectory feedback tracking guidance law is designed. The simulation results demonstrate that the TSGLBVA ensures the re-entry vehicle to impact a target precisely from a specified direction with smal terminal load factor command, as well as to obtain a maximum or constrained terminal velocity according to various requirements.展开更多
Compared with traditional feedback control,predictive control can eliminate the lag of pose control and avoid the snakelike motion of shield machines.Therefore,a shield pose prediction model was proposed based on dyna...Compared with traditional feedback control,predictive control can eliminate the lag of pose control and avoid the snakelike motion of shield machines.Therefore,a shield pose prediction model was proposed based on dynamic modeling.Firstly,the dynamic equations of shield thrust system were established to clarify the relationship between force and movement of shield machine.Secondly,an analytical model was proposed to predict future multistep pose of the shield machine.Finally,a virtual prototype model was developed to simulate the dynamic behavior of the shield machine and validate the accuracy of the proposed pose prediction method.Results reveal that the model proposed can predict the shield pose with high accuracy,which can provide a decision basis whether for manual or automatic control of shield pose.展开更多
巷道断面成形是煤矿掘进过程中的重要工序,但目前的巷道断面成形作业多为人工控制掘进机进行往复式截割,制约了煤矿掘进工作面的智能化发展。为此,针对断面成形轨迹规划未考虑煤岩特征、优化目标单一的问题,提出了一种基于改进灰狼优化(...巷道断面成形是煤矿掘进过程中的重要工序,但目前的巷道断面成形作业多为人工控制掘进机进行往复式截割,制约了煤矿掘进工作面的智能化发展。为此,针对断面成形轨迹规划未考虑煤岩特征、优化目标单一的问题,提出了一种基于改进灰狼优化(grey wolf optimizer, GWO)算法的掘进机断面成形轨迹规划方法。首先,根据夹矸位置将待截割断面环境分为4种情况,对相应断面进行栅格化处理并建立栅格地图,同时采用二值膨胀法对不规则夹矸进行膨胀化处理。然后,对GWO算法进行了改进,以提升其寻优性能和收敛速度。接着,开展了仿真实验,利用改进GWO算法实现了4种环境下掘进机断面成形轨迹的规划。最后,利用掘进机样机开展了断面截割实验。仿真结果表明:相较于传统的GWO算法,改进GWO算法的收敛速度更快且收敛精度更高;在4种断面环境下,基于改进GWO算法规划的断面成形轨迹长度最短,欠挖面积最小,转向次数最少,更容易实现高精度、高效率的轨迹跟踪控制,保证了巷道断面的成形质量。实验结果表明,基于改进GWO算法规划的断面成形轨迹既能提高掘进机的截割效率,又能满足巷道断面成形的质量要求。研究结果可为煤矿井下智能掘进技术的发展提供新的思路和方法。展开更多
基金supported by the National Natural Science Foundation of China(6127334961203223+1 种基金61175109)the Innovation Foundation of BUAA for Ph.D.Graduates(YWF-14-YJSY-013)
文摘The reentry trajectory planning for hypersonic vehicles is critical and challenging in the presence of numerous nonlinear equations of motion and path constraints, as well as guaranteed satisfaction of accuracy in meeting all the specified boundary conditions. In the last ten years, many researchers have investigated various strategies to generate a feasible or optimal constrained reentry trajectory for hypersonic vehicles. This paper briefly reviews the new research efforts to promote the capability of reentry trajectory planning. The progress of the onboard reentry trajectory planning, reentry trajectory optimization, and landing footprint is summarized. The main challenges of reentry trajectory planning for hypersonic vehicles are analyzed, focusing on the rapid reentry trajectory optimization, complex geographic constraints, and coop- erative strategies.
文摘This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-guided bombs. First, this problem is formulated as a variant of the traveling salesman problem （TSP）, called the dynamic-constrained TSP with neighborhoods （DCT- SPN）. Then, a hierarchical hybrid approach, which partitions the planning algorithm into a roadmap planning layer and an optimal control layer, is proposed to solve the DCTSPN. In the roadmap planning layer, a novel algorithm based on an updatable proba- bilistic roadmap （PRM） is presented, which operates by randomly sampling a finite set of vehicle states from continuous state space in order to reduce the complicated trajectory planning problem to planning on a finite directed graph. In the optimal control layer, a collision-free state-to-state trajectory planner based on the Gauss pseudospectral method is developed, which can generate both dynamically feasible and optimal flight trajectories. The entire process of solving a DCTSPN consists of two phases. First, in the offline preprocessing phase, the algorithm constructs a PRM, and then converts the original problem into a standard asymmet- ric TSP （ATSP）. Second, in the online querying phase, the costs of directed edges in PRM are updated first, and a fast heuristic searching algorithm is then used to solve the ATSP. Numerical experiments indicate that the algorithm proposed in this paper can generate both feasible and near-optimal solutions quickly for online purposes.
基金Project(61273138)supported by the National Natural Science Foundation of ChinaProject(14JCZDJC39300)supported by the Key Fund of Tianjin,China
文摘Homing trajectory planning is a core task of autonomous homing of parafoil system.This work analyzes and establishes a simplified kinematic mathematical model,and regards the homing trajectory planning problem as a kind of multi-objective optimization problem.Being different from traditional ways of transforming the multi-objective optimization into a single objective optimization by weighting factors,this work applies an improved non-dominated sorting genetic algorithm Ⅱ(NSGA Ⅱ) to solve it directly by means of optimizing multi-objective functions simultaneously.In the improved NSGA Ⅱ,the chaos initialization and a crowding distance based population trimming method were introduced to overcome the prematurity of population,the penalty function was used in handling constraints,and the optimal solution was selected according to the method of fuzzy set theory.Simulation results of three different schemes designed according to various practical engineering requirements show that the improved NSGA Ⅱ can effectively obtain the Pareto optimal solution set under different weighting with outstanding convergence and stability,and provide a new train of thoughts to design homing trajectory of parafoil system.
基金supported by the National Natural Science Foundation of China(6157337461503408)
文摘An optimal midcourse trajectory planning approach that considers the capture region（CR） of the terminal guidance is proposed in this article based on the Gauss pseudospectral method（GPM）. Firstly, the planar CR of the proportional navigation in terminal guidance is analyzed and innovatively introduced in the midcourse trajectory planning problems, with the collision triangle（CT） serving as the ideal terminal states parameters of the midcourse phase, and the CR area serving as the robustness against target maneuvers. Secondly, the midcourse trajectory planning problem that considers the path, terminal and control constraints is formulated and the well-developed GPM is used to generate the nominal trajectory that meets the CR demands. The interceptor will reshape the trajectory only when the former CR fails to cover the target, which has loosened the critical demand for frequent trajectory modification. Finally, the simulations of four different scenarios are carried out and the results prove the effectiveness and optimality of the proposed method.
基金Supported by National Natural Science Foundation of China （61325017, 11372144）, and the National Science and Technology Pillar Program of China （2013BAF07B03）
基金Supported by National Basic Research Program of China （973 Program） （2010CB731800）, Key Project of Natural Science Fouudation of China （60934003）, National Natural Science Foundation of China （61074065, 60974018）, Natural Science Foundation of Hebei Province（F2012203119）, and the Science Foundation of Yanshan University for the Excellent Ph. D. Students （201204） The authors thank Chen Cai-Lian of the Shanghai Jiao Tong University for her comments on English polishing and problem formulation.
基金Foundation of the Robotics Laboratory, Chinese Academy of Sciences (No: RL200002)
文摘Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Car-tesian space mainly through increasing the number of knots on the path and the number of the path′s segments, which results in the heavier online computational burden for the robot controller. Aiming at overcoming this drawback, the authors propose a new kind of real-time accurate hand path tracking and joint trajectory planning method. Through selecting some extra knots on the specified hand path by a certain rule and introducing a sinusoidal function to the joint displacement equation of each segment, this method can greatly raise the path tracking accuracy of robot′s hand and does not change the number of the path′s segments. It also does not increase markedly the computational burden of robot controller. The result of simulation indicates that this method is very effective, and has important value in increasing the application of industrial robots.
基金Project(1708085QF158)supported by the Natural Science Foundation of Anhui Province,China
文摘Based on trajectory planning with maximum velocity and acceleration constraints, a novel high-quality trajectory planning method was proposed for heterogeneous individuals in crowd simulation. The proposed method ensured that the individual’s path was smooth and its velocity was continuous. Based on the physiological constraints of humans with maximum velocity and acceleration, time-optimal trajectory and feasible region were derived by solving kinodynamic planning problem. Subsequently, a high-quality trajectory planning algorithm was designed to compute the trajectory with appropriate variation of velocity. The simulation results demonstrate that the proposed trajectory planning method has more authenticities and can generate high-quality trajectories for virtual humans in crowd simulation.
基金supported by the National Natural Science Foundation of China(11502019).
文摘To ensure safe flight of multiple fixed-wing unmanned aerial vehicles(UAVs)formation,considering trajectory planning and formation control together,a leader trajectory planning method based on the sparse A*algorithm is introduced.Firstly,a formation controller based on prescribed performance theory is designed to control the transient and steady formation configuration,as well as the formation forming time,which not only can form the designated formation configuration but also can guarantee collision avoidance and terrain avoidance theoretically.Next,considering the constraints caused by formation controller on trajectory planning such as the safe distance,turn angle and step length,as well as the constraint of formation shape,a leader trajectory planning method based on sparse A^(*)algorithm is proposed.Simulation results show that the UAV formation can arrive at the destination safely with a short trajectory no matter keeping the formation or encountering formation transformation.
基金FoundationoftheRoboticsLaboratoryChineseAcademyofSciences (No :RL2 0 0 0 0 2 )
文摘Previously, researchers raised the accuracy for a robot′s hand to track a specified path in Cartesian space mainly through increasing the number of knots on the path and the segments of the path. But, this method resulted in the heavier on line computational burden for the robot controller. In this paper, aiming at this drawback, the authors propose a new kind of real time accurate hand path tracking and joint trajectory planning method for robots. Through selecting some extra knots on the specified hand path by a certain rule, which enables the number of knots on each segment to increase from two to four, and through introducing a sinusoidal function and a cosinoidal function to the joint displacement equation of each segment, this method can raise the path tracking accuracy of robot′s hand greatly but does not increase the computational burden of robot controller markedly.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
基金Project (61703414) supported by the National Natural Science Foundation of ChinaProject (3101047) supported by the Defense Science and Technology Foundation of China+1 种基金Project (2017JJ3366) supported by the Natural Science Foundation of Hunan ChinaProject (2015M582881) supported by the China Postdoctoral Science Foundation
文摘Multiple UAVs are usually deployed to provide robustness through redundancy and to accomplish surveillance,search,attack and rescue missions.Formation reconfiguration was inevitable during the flight when the mission was adjusted or the environment varied.Taking the typical formation reconfiguration from a triangular penetrating formation to a circular tracking formation for example,a path planning method based on Dubins trajectory and particle swarm optimization(PSO)algorithm is presented in this paper.The mathematic model of multiple UAVs formation reconfiguration was built firstly.According to the kinematic model of aerial vehicles,a process of dimensionality reduction was carried out to simplify the model based on Dubins trajectory.The PSO algorithm was adopted to resolve the optimization problem of formation reconfiguration path planning.Finally,the simulation and vehicles flight experiment are executed.Results show that the path planning method based on the Dubins trajectory and the PSO algorithm can generate feasible paths for vehicles on time,to guarantee the rapidity and effectiveness of formation reconfigurations.Furthermore,from the simulation results,the method is universal and could be extended easily to the path planning problem for different kinds of formation reconfigurations.
文摘A trajectory shaping guidance law based on virtua angle （TSGLBVA） is proposed for a re-entry vehicle with the constraints of terminal impact angles and their time derivatives. In the view of differential properties of the maneuvering trajectory, a virtual angle and a virtual radius are defined. Also, the shaping trajectory of the vehicle is established by the polynomials of the virtual angle. Then, four optimized parameters are selected according to the theorem of parameters transformation presented in this paper. Finally, a convergent variant of the Nelder-Mead algorithm is adopted to obtain the reference trajectory, and a trajectory feedback tracking guidance law is designed. The simulation results demonstrate that the TSGLBVA ensures the re-entry vehicle to impact a target precisely from a specified direction with smal terminal load factor command, as well as to obtain a maximum or constrained terminal velocity according to various requirements.
基金Project(2023JBZY030)supported by the Fundamental Research Funds for the Central Universities,ChinaProject(U1834208)supported by the National Natural Science Foundation of China。
文摘Compared with traditional feedback control,predictive control can eliminate the lag of pose control and avoid the snakelike motion of shield machines.Therefore,a shield pose prediction model was proposed based on dynamic modeling.Firstly,the dynamic equations of shield thrust system were established to clarify the relationship between force and movement of shield machine.Secondly,an analytical model was proposed to predict future multistep pose of the shield machine.Finally,a virtual prototype model was developed to simulate the dynamic behavior of the shield machine and validate the accuracy of the proposed pose prediction method.Results reveal that the model proposed can predict the shield pose with high accuracy,which can provide a decision basis whether for manual or automatic control of shield pose.
文摘巷道断面成形是煤矿掘进过程中的重要工序,但目前的巷道断面成形作业多为人工控制掘进机进行往复式截割,制约了煤矿掘进工作面的智能化发展。为此,针对断面成形轨迹规划未考虑煤岩特征、优化目标单一的问题,提出了一种基于改进灰狼优化(grey wolf optimizer, GWO)算法的掘进机断面成形轨迹规划方法。首先,根据夹矸位置将待截割断面环境分为4种情况,对相应断面进行栅格化处理并建立栅格地图,同时采用二值膨胀法对不规则夹矸进行膨胀化处理。然后,对GWO算法进行了改进,以提升其寻优性能和收敛速度。接着,开展了仿真实验,利用改进GWO算法实现了4种环境下掘进机断面成形轨迹的规划。最后,利用掘进机样机开展了断面截割实验。仿真结果表明:相较于传统的GWO算法,改进GWO算法的收敛速度更快且收敛精度更高;在4种断面环境下,基于改进GWO算法规划的断面成形轨迹长度最短,欠挖面积最小,转向次数最少,更容易实现高精度、高效率的轨迹跟踪控制,保证了巷道断面的成形质量。实验结果表明,基于改进GWO算法规划的断面成形轨迹既能提高掘进机的截割效率,又能满足巷道断面成形的质量要求。研究结果可为煤矿井下智能掘进技术的发展提供新的思路和方法。
