First, a class of higher order exponential type hybrid (α,β, γ, η, p, h(.,.), κ(., .), w(.,., .), ω(.,.,.), θ)-invexities is introduced, second, some parametrically sufficient efficiency conditions ba...First, a class of higher order exponential type hybrid (α,β, γ, η, p, h(.,.), κ(., .), w(.,., .), ω(.,.,.), θ)-invexities is introduced, second, some parametrically sufficient efficiency conditions based on the higher order exponential type hybrid invexities are established, and finally some parametrically sufficient efficiency results under the higher order exponential type hybrid (a,β, γ, ρ, h(.,.), k(.,-), w(-,., .), w(.,., .), 0)-invexities are investigated to the context of solving semiinfinite multiobjective fractional programming problems. The notions of the higher order exponential type hybrid (a, β, γ η, p, h(., .), n(., .), w(-,.,-), ω(.,.,.), 0)-invexities encompass most of the generalized invexities in the literature. To the best of our knowledge, the results on semiinfinite multiobjective fractional programming problems established in this communication are new and application-oriented toward multitime multi- objectve problems as well as multiobiective control problems.展开更多
In this paper, we present several parametric duality results under various generalized (a,v,p)-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (a,n, p)-V-invexity assumptions for a semiinfinite multiobjective fractional programmi...Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (a,n, p)-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.展开更多
An important concept proposed in the early stage of robot path planning field is the shrinking of a robot to a point and meanwhile the expanding of obstacles in the workspace as a set of new obstacles. The resulting g...An important concept proposed in the early stage of robot path planning field is the shrinking of a robot to a point and meanwhile the expanding of obstacles in the workspace as a set of new obstacles. The resulting grown obstacles are called the Configuration Space (Cspace) obstacles. The find-path problem is then transformed into that of finding a collision-free path for a point robot among the Cspace obstacles. However, the research experiences have shown that the Cspace transformation is very hard when the following situations occur: 1) both the robot and obstacles are not polygons, and 2) the robot is allowed to rotate. This situation gets even worse when the robot and obstacles are three dimensional (3D) objects with various shapes. For this reason, direct path planning approaches without the Cspace transformation is quite useful and expected. Motivated by the practical requirements of robot path planning, a generalized constrained optimization problem (GCOP) with not only logic AND but also logic OR relationships was proposed and a mathematical solution developed previously. This paper inherits the fundamental ideas of inequality and optimization techniques from the previous work, converts the obstacle avoidance problem into a semi-infinite constrained optimization problem with the help of the mathematical transformation, and proposes a direct path planning approach without Cspace calculation, which is quite different from traditional methods. To show its merits, simulation results in 3D space have been presented.展开更多
文摘First, a class of higher order exponential type hybrid (α,β, γ, η, p, h(.,.), κ(., .), w(.,., .), ω(.,.,.), θ)-invexities is introduced, second, some parametrically sufficient efficiency conditions based on the higher order exponential type hybrid invexities are established, and finally some parametrically sufficient efficiency results under the higher order exponential type hybrid (a,β, γ, ρ, h(.,.), k(.,-), w(-,., .), w(.,., .), 0)-invexities are investigated to the context of solving semiinfinite multiobjective fractional programming problems. The notions of the higher order exponential type hybrid (a, β, γ η, p, h(., .), n(., .), w(-,.,-), ω(.,.,.), 0)-invexities encompass most of the generalized invexities in the literature. To the best of our knowledge, the results on semiinfinite multiobjective fractional programming problems established in this communication are new and application-oriented toward multitime multi- objectve problems as well as multiobiective control problems.
文摘In this paper, we present several parametric duality results under various generalized (a,v,p)-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
文摘Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (a,n, p)-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.
文摘An important concept proposed in the early stage of robot path planning field is the shrinking of a robot to a point and meanwhile the expanding of obstacles in the workspace as a set of new obstacles. The resulting grown obstacles are called the Configuration Space (Cspace) obstacles. The find-path problem is then transformed into that of finding a collision-free path for a point robot among the Cspace obstacles. However, the research experiences have shown that the Cspace transformation is very hard when the following situations occur: 1) both the robot and obstacles are not polygons, and 2) the robot is allowed to rotate. This situation gets even worse when the robot and obstacles are three dimensional (3D) objects with various shapes. For this reason, direct path planning approaches without the Cspace transformation is quite useful and expected. Motivated by the practical requirements of robot path planning, a generalized constrained optimization problem (GCOP) with not only logic AND but also logic OR relationships was proposed and a mathematical solution developed previously. This paper inherits the fundamental ideas of inequality and optimization techniques from the previous work, converts the obstacle avoidance problem into a semi-infinite constrained optimization problem with the help of the mathematical transformation, and proposes a direct path planning approach without Cspace calculation, which is quite different from traditional methods. To show its merits, simulation results in 3D space have been presented.