The Experts below are selected from a list of 285 Experts worldwide ranked by ideXlab platform

Andrew P. Ingersoll - One of the best experts on this subject based on the ideXlab platform.

  • On the Minimum Potential Energy State and the Eddy Size–Constrained APE Density
    Journal of Physical Oceanography, 2016
    Co-Authors: Andrew P. Ingersoll
    Abstract:

    AbstractExactly solving the absolute Minimum Potential Energy state (Lorenz reference state) is a difficult problem because of the nonlinear nature of the equation of state of seawater. This problem has been solved recently but the algorithm comes at a high computational cost. As the first part of this study, the authors develop an algorithm that is ~103–105 times faster, making it useful for Energy diagnosis in ocean models. The second part of this study shows that the global patterns of Lorenz available Potential Energy (APE) density are distinct from those of eddy kinetic Energy (EKE). This is because the Lorenz APE density is based on the entire domainwide parcel rearrangement, while mesoscale eddies, if related to baroclinic instability, are typically generated through local parcel rearrangement approximately around the eddy size. Inspired by this contrast, this study develops a locally defined APE framework: the eddy size–constrained APE density based on the strong constraint that the parcel rearran...

  • on the Minimum Potential Energy state and the eddy size constrained ape density
    Journal of Physical Oceanography, 2016
    Co-Authors: Andrew P. Ingersoll
    Abstract:

    AbstractExactly solving the absolute Minimum Potential Energy state (Lorenz reference state) is a difficult problem because of the nonlinear nature of the equation of state of seawater. This problem has been solved recently but the algorithm comes at a high computational cost. As the first part of this study, the authors develop an algorithm that is ~103–105 times faster, making it useful for Energy diagnosis in ocean models. The second part of this study shows that the global patterns of Lorenz available Potential Energy (APE) density are distinct from those of eddy kinetic Energy (EKE). This is because the Lorenz APE density is based on the entire domainwide parcel rearrangement, while mesoscale eddies, if related to baroclinic instability, are typically generated through local parcel rearrangement approximately around the eddy size. Inspired by this contrast, this study develops a locally defined APE framework: the eddy size–constrained APE density based on the strong constraint that the parcel rearran...

S W E Earles - One of the best experts on this subject based on the ideXlab platform.

  • finding the 3d shortest path with visibility graph and Minimum Potential Energy
    Intelligent Robots and Systems, 1993
    Co-Authors: K Jiang, L S Seneviratne, S W E Earles
    Abstract:

    Finding a three dimensional shortest path is of importance in the development of automatic path planning for mobile robots and robot manipulators, and for practical implementation, the algorithms need to be efficient. Presented is a method for shortest path planning in three-dimensional space in the presence of convex polyhedra. It is based on the visibility graph approach, extended from two to three-dimensional space. A collineation is introduced for the identification of visible edges in the three-dimensional visibility graph. The principle of Minimum Potential Energy is adopted for finding a set of sub-shortest paths via different edge sequences, and from them the global shortest path is selected. The three dimensional visibility graph is constructed in O(n/sup 3/v/sup k/) time, where n is the number of vertices of the polyhedra, k is the number of obstacles and v is the largest number of vertices on any one obstacle. The process to determine the shortest path runs recursively in polynomial time. Results of a computer simulation are given, showing the versatility and efficiency of the approach.

  • IROS - Finding the 3D shortest path with visibility graph and Minimum Potential Energy
    Proceedings of 1993 IEEE RSJ International Conference on Intelligent Robots and Systems (IROS '93), 1
    Co-Authors: K Jiang, L S Seneviratne, S W E Earles
    Abstract:

    Finding a three dimensional shortest path is of importance in the development of automatic path planning for mobile robots and robot manipulators, and for practical implementation, the algorithms need to be efficient. Presented is a method for shortest path planning in three-dimensional space in the presence of convex polyhedra. It is based on the visibility graph approach, extended from two to three-dimensional space. A collineation is introduced for the identification of visible edges in the three-dimensional visibility graph. The principle of Minimum Potential Energy is adopted for finding a set of sub-shortest paths via different edge sequences, and from them the global shortest path is selected. The three dimensional visibility graph is constructed in O(n/sup 3/v/sup k/) time, where n is the number of vertices of the polyhedra, k is the number of obstacles and v is the largest number of vertices on any one obstacle. The process to determine the shortest path runs recursively in polynomial time. Results of a computer simulation are given, showing the versatility and efficiency of the approach.

K Jiang - One of the best experts on this subject based on the ideXlab platform.

  • finding the 3d shortest path with visibility graph and Minimum Potential Energy
    Intelligent Robots and Systems, 1993
    Co-Authors: K Jiang, L S Seneviratne, S W E Earles
    Abstract:

    Finding a three dimensional shortest path is of importance in the development of automatic path planning for mobile robots and robot manipulators, and for practical implementation, the algorithms need to be efficient. Presented is a method for shortest path planning in three-dimensional space in the presence of convex polyhedra. It is based on the visibility graph approach, extended from two to three-dimensional space. A collineation is introduced for the identification of visible edges in the three-dimensional visibility graph. The principle of Minimum Potential Energy is adopted for finding a set of sub-shortest paths via different edge sequences, and from them the global shortest path is selected. The three dimensional visibility graph is constructed in O(n/sup 3/v/sup k/) time, where n is the number of vertices of the polyhedra, k is the number of obstacles and v is the largest number of vertices on any one obstacle. The process to determine the shortest path runs recursively in polynomial time. Results of a computer simulation are given, showing the versatility and efficiency of the approach.

  • IROS - Finding the 3D shortest path with visibility graph and Minimum Potential Energy
    Proceedings of 1993 IEEE RSJ International Conference on Intelligent Robots and Systems (IROS '93), 1
    Co-Authors: K Jiang, L S Seneviratne, S W E Earles
    Abstract:

    Finding a three dimensional shortest path is of importance in the development of automatic path planning for mobile robots and robot manipulators, and for practical implementation, the algorithms need to be efficient. Presented is a method for shortest path planning in three-dimensional space in the presence of convex polyhedra. It is based on the visibility graph approach, extended from two to three-dimensional space. A collineation is introduced for the identification of visible edges in the three-dimensional visibility graph. The principle of Minimum Potential Energy is adopted for finding a set of sub-shortest paths via different edge sequences, and from them the global shortest path is selected. The three dimensional visibility graph is constructed in O(n/sup 3/v/sup k/) time, where n is the number of vertices of the polyhedra, k is the number of obstacles and v is the largest number of vertices on any one obstacle. The process to determine the shortest path runs recursively in polynomial time. Results of a computer simulation are given, showing the versatility and efficiency of the approach.

H.m. Liu - One of the best experts on this subject based on the ideXlab platform.

  • Springback variational principles of bending of straight beams with large deflection
    Journal of Materials Processing Technology, 2007
    Co-Authors: Y.j. Chen, H.m. Liu
    Abstract:

    Abstract All of molding materials after bending have large elastoplastic deformation. The final form of a part depends on the springback amount. The conceptions of forming springback anti-coupled systems and equations of bending of straight beam with large deflection are first introduced in present study. And then on the basis of the conceptions, the springback principle of the Minimum Potential Energy and the generalized springback principle of Potential Energy of bending of straight beams with large deflection are established. Finally according to the springback principle of Minimum Potential Energy, springback finite element method is derived and a numerical example is calculated.

L S Seneviratne - One of the best experts on this subject based on the ideXlab platform.

  • finding the 3d shortest path with visibility graph and Minimum Potential Energy
    Intelligent Robots and Systems, 1993
    Co-Authors: K Jiang, L S Seneviratne, S W E Earles
    Abstract:

    Finding a three dimensional shortest path is of importance in the development of automatic path planning for mobile robots and robot manipulators, and for practical implementation, the algorithms need to be efficient. Presented is a method for shortest path planning in three-dimensional space in the presence of convex polyhedra. It is based on the visibility graph approach, extended from two to three-dimensional space. A collineation is introduced for the identification of visible edges in the three-dimensional visibility graph. The principle of Minimum Potential Energy is adopted for finding a set of sub-shortest paths via different edge sequences, and from them the global shortest path is selected. The three dimensional visibility graph is constructed in O(n/sup 3/v/sup k/) time, where n is the number of vertices of the polyhedra, k is the number of obstacles and v is the largest number of vertices on any one obstacle. The process to determine the shortest path runs recursively in polynomial time. Results of a computer simulation are given, showing the versatility and efficiency of the approach.

  • IROS - Finding the 3D shortest path with visibility graph and Minimum Potential Energy
    Proceedings of 1993 IEEE RSJ International Conference on Intelligent Robots and Systems (IROS '93), 1
    Co-Authors: K Jiang, L S Seneviratne, S W E Earles
    Abstract:

    Finding a three dimensional shortest path is of importance in the development of automatic path planning for mobile robots and robot manipulators, and for practical implementation, the algorithms need to be efficient. Presented is a method for shortest path planning in three-dimensional space in the presence of convex polyhedra. It is based on the visibility graph approach, extended from two to three-dimensional space. A collineation is introduced for the identification of visible edges in the three-dimensional visibility graph. The principle of Minimum Potential Energy is adopted for finding a set of sub-shortest paths via different edge sequences, and from them the global shortest path is selected. The three dimensional visibility graph is constructed in O(n/sup 3/v/sup k/) time, where n is the number of vertices of the polyhedra, k is the number of obstacles and v is the largest number of vertices on any one obstacle. The process to determine the shortest path runs recursively in polynomial time. Results of a computer simulation are given, showing the versatility and efficiency of the approach.