Most nonliner programming problems consist of functions which are sums of unary,convex functions of linear fuctions.In this paper.we derive the duality forms of the unary oonvex optimization, and these technuqucs are ...Most nonliner programming problems consist of functions which are sums of unary,convex functions of linear fuctions.In this paper.we derive the duality forms of the unary oonvex optimization, and these technuqucs are applied to the geometric programming and minimum discrimination information problems.展开更多
We introduce a novel strategy of designing a chaotic coverage path planner for the mobile robot based on the Che- byshev map for achieving special missions. The designed chaotic path planner consists of a two-dimensio...We introduce a novel strategy of designing a chaotic coverage path planner for the mobile robot based on the Che- byshev map for achieving special missions. The designed chaotic path planner consists of a two-dimensional Chebyshev map which is constructed by two one-dimensional Chebyshev maps. The performance of the time sequences which are generated by the planner is improved by arcsine transformation to enhance the chaotic characteristics and uniform distribution. Then the coverage rate and randomness for achieving the special missions of the robot are enhanced. The chaotic Chebyshev system is mapped into the feasible region of the robot workplace by affine transformation. Then a universal algorithm of coverage path planning is designed for environments with obstacles. Simulation results show that the constructed chaotic path planner can avoid detection of the obstacles and the workplace boundaries, and runs safely in the feasible areas. The designed strategy is able to satisfy the requirements of randomness, coverage, and high efficiency for special missions.展开更多
文摘Most nonliner programming problems consist of functions which are sums of unary,convex functions of linear fuctions.In this paper.we derive the duality forms of the unary oonvex optimization, and these technuqucs are applied to the geometric programming and minimum discrimination information problems.
基金Project supported by thc National Natural Science Foundation of China （Nos. 61473179, 61573213, and 61233014）, the Natural Sci- ence Foundation of Shandong Province, China （Nos. ZR2014FM007 and ZR2015CM016）, and the Key Research and Development Project of Shandong Province, China （No. 2016GGX101027）
文摘We introduce a novel strategy of designing a chaotic coverage path planner for the mobile robot based on the Che- byshev map for achieving special missions. The designed chaotic path planner consists of a two-dimensional Chebyshev map which is constructed by two one-dimensional Chebyshev maps. The performance of the time sequences which are generated by the planner is improved by arcsine transformation to enhance the chaotic characteristics and uniform distribution. Then the coverage rate and randomness for achieving the special missions of the robot are enhanced. The chaotic Chebyshev system is mapped into the feasible region of the robot workplace by affine transformation. Then a universal algorithm of coverage path planning is designed for environments with obstacles. Simulation results show that the constructed chaotic path planner can avoid detection of the obstacles and the workplace boundaries, and runs safely in the feasible areas. The designed strategy is able to satisfy the requirements of randomness, coverage, and high efficiency for special missions.
