An on-line path planning algorithm based on Bezier curves is presented for underwater vehicles. Aiming at the special requirements of underwater vehicles and 3D enviromnent, the algorithm consists of two steps ： the ...An on-line path planning algorithm based on Bezier curves is presented for underwater vehicles. Aiming at the special requirements of underwater vehicles and 3D enviromnent, the algorithm consists of two steps ： the generation of spatial path and the processing of some constraints. A path for underwater vehicles is planned, which satisfies the velocity constraint and the centripetal acceleration constraint of underwater vehicles. The proposed path planning method can be used for the vehicle＇ s locomotion and navigation control.展开更多
In this paper, Dynamic Relaxation Method is applied to study the postbuckling path of cylindrically curved panels of laminated composite materials during loading and unloading. The phenomenon that loading paths do not...In this paper, Dynamic Relaxation Method is applied to study the postbuckling path of cylindrically curved panels of laminated composite materials during loading and unloading. The phenomenon that loading paths do not coincide with unloading paths has been found. Numerical results are given for cylindrically curved cross-ply panels subjected to uniform uniaxial compression under two types of boundary conditions. The influence of the number of layers, the panels curvature and the initial imperfection on the postbuckling paths is discussed.展开更多
Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal gu...Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper.The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace,and the velocity field is obtained by utilizing the potential field of this workspace.Path optimization is implemented by curve evolution,during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field.The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness.Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.展开更多
Cubic algebraic hyperbolic （AH） Bezier curves and AH spline curves are defined with a positive parameter a in the space spanned by {1, t, sinht, cosht}. Modifying the value of a yields a family ofAH Bezier or spline...Cubic algebraic hyperbolic （AH） Bezier curves and AH spline curves are defined with a positive parameter a in the space spanned by {1, t, sinht, cosht}. Modifying the value of a yields a family ofAH Bezier or spline curves with the family parameter α. For a fixed point on the original curve, it will move on a defined curve called ＂path of AH curve＂ （AH Bezier and AH spline curves） when a changes. We describe the geometric effects of the paths and give a method to specify a curve passing through a given point.展开更多
Existing curve fitting algorithms of NC machining path mainly focus on the control of fitting error,but ignore the problem that the original discrete cutter position points are not enough in the high curvature area of...Existing curve fitting algorithms of NC machining path mainly focus on the control of fitting error,but ignore the problem that the original discrete cutter position points are not enough in the high curvature area of the tool path.It may cause a sudden change in the drive force of the feed axis,resulting in a large fluctuation in the feed speed.This paper proposes a new non-uniform rational B-spline(NURBS)curve fitting optimization method based on curvature smoothing preset point constraints.First,the short line segments generated by the CAM software are optimally divided into different segment regions,and then the curvature of the short line segments in each region is adjusted to make it smoother.Secondly,a set of characteristic points reflecting the change of the curvature of the fitted curve is constructed as the control apex of the fitted curve,and the curve is fitted using the NURBS curve fitting optimization method based on the curvature smoothing preset point constraint.Finally,the curve fitting error and curve volatility are analyzed with an example,which verifies that the method can significantly improve the curvature smoothness of the high-curvature tool path,reduce the fitting error,and improve the feed speed.展开更多
Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in thes...Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.展开更多
基金Supported by the National High Technology Research and Development Programme of China（No. 2006AAllZ225） and the National Natural Science Foundation of China （No. 60605026, 60635010）.
文摘An on-line path planning algorithm based on Bezier curves is presented for underwater vehicles. Aiming at the special requirements of underwater vehicles and 3D enviromnent, the algorithm consists of two steps ： the generation of spatial path and the processing of some constraints. A path for underwater vehicles is planned, which satisfies the velocity constraint and the centripetal acceleration constraint of underwater vehicles. The proposed path planning method can be used for the vehicle＇ s locomotion and navigation control.
文摘In this paper, Dynamic Relaxation Method is applied to study the postbuckling path of cylindrically curved panels of laminated composite materials during loading and unloading. The phenomenon that loading paths do not coincide with unloading paths has been found. Numerical results are given for cylindrically curved cross-ply panels subjected to uniform uniaxial compression under two types of boundary conditions. The influence of the number of layers, the panels curvature and the initial imperfection on the postbuckling paths is discussed.
基金supported by the financial support of the ship segmentation intelligent manufacturing equipment solution and key common technology research,High-tech Ship Research Project of the Chinese Ministry of Science and Technology and the project of Shandong Provincial Key R&D Program(No.2019GGX104035).
文摘Path planning is a key technique of autonomous navigation for robots,and the velocity field is an important part.Constructing velocity field in a complex workspace is still challenging.In this paper,an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper.The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace,and the velocity field is obtained by utilizing the potential field of this workspace.Path optimization is implemented by curve evolution,during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field.The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness.Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.
基金the National Natural Science Foundation of China (No. 60773179)the National Basic Research Program (973) of China (No. G2004CB318000)the School Scientific Research Foundation of Hangzhou Dianzi University (No. KYS091507070), China
文摘Cubic algebraic hyperbolic （AH） Bezier curves and AH spline curves are defined with a positive parameter a in the space spanned by {1, t, sinht, cosht}. Modifying the value of a yields a family ofAH Bezier or spline curves with the family parameter α. For a fixed point on the original curve, it will move on a defined curve called ＂path of AH curve＂ （AH Bezier and AH spline curves） when a changes. We describe the geometric effects of the paths and give a method to specify a curve passing through a given point.
基金the Open Foundation Project of Jiangsu Key Laboratory of Precision and Micro-manufacturing Technology Open Fund Project.
文摘Existing curve fitting algorithms of NC machining path mainly focus on the control of fitting error,but ignore the problem that the original discrete cutter position points are not enough in the high curvature area of the tool path.It may cause a sudden change in the drive force of the feed axis,resulting in a large fluctuation in the feed speed.This paper proposes a new non-uniform rational B-spline(NURBS)curve fitting optimization method based on curvature smoothing preset point constraints.First,the short line segments generated by the CAM software are optimally divided into different segment regions,and then the curvature of the short line segments in each region is adjusted to make it smoother.Secondly,a set of characteristic points reflecting the change of the curvature of the fitted curve is constructed as the control apex of the fitted curve,and the curve is fitted using the NURBS curve fitting optimization method based on the curvature smoothing preset point constraint.Finally,the curve fitting error and curve volatility are analyzed with an example,which verifies that the method can significantly improve the curvature smoothness of the high-curvature tool path,reduce the fitting error,and improve the feed speed.
基金Supported by the Natural Science Foundation of Jiangsu Province (BK20211037)the Science and Technology Development Fund of Wuxi (N20201011)the Nanjing University of Information Science and Technology Wuxi Campus District graduate innovation Project。
文摘Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.
