The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a new approach for robust pole assignment in second-order systems with proportional plus derivative state feedback. The desired closed-loop poles set locates in an arbitrarily specified circular region, and it can be easily taken as a part of the design parameters based on geometric principles. The object can be converted into a global dynamical optimization problem based on geometric...
There are a lot of typical statistical problems in discrete combination optimization, including integer linear programming, covering problem, knapsack problem, graph theory, network flow and dispatching. As for the NPC (Non-deterministic Polynomial complete) problems, many algorithms have been developed for the discrete optimization where the heuristic algorithm is one kind of the important and effective...
For the irregular nesting problem widely existing in modern manufacturing industry, this paper makes a research on it and presents an optimization algorithm based on no-fit polygon (NFP) method and hybrid heuristic strategy to solve it. The proposed algorithm first uses the composition method of trace line segment to calculate no-fit polygons (NFPs) between every two pieces in piece set, and extracts...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.