Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "approximation of" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
Stability analysis of variational inequalities for bang-singular-bang controls
Autorzy:
Felgenhauer, U.
Powiązania:
https://bibliotekanauki.pl/articles/206215.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
parametric optimal control problems bang-singular control structure
approximation of extremals
Opis:
The paper is related to parameter dependent optimal control problems for control-affine systems. The case of scalar reference control with bang-singular-bang structure is considered. The analysis starts from a variational inequality (VI) formulation of Pontryagin’s Maximum Principle. In a first step, under appropriate higher-order sufficient optimality conditions, the existence of solutions for the linearized problem (LVI) is proven. In a second step, for a certain class of right-hand side perturbation, it is show that the controls from LVI have bang-singular-bang structure and, in L1 topology, depend Lipschitz continuously on the data. Applying finally a common fixed-point approach to VI, the results are brought together to obtain existence and structural stability results for extremals of the original control problem under parameter perturbation.
Źródło:
Control and Cybernetics; 2013, 42, 3; 557-592
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Toward interactive rough-granular computing
Autorzy:
Skowron, A.
Wasilewski, P.
Powiązania:
https://bibliotekanauki.pl/articles/206358.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
rough sets
granular computing
interactive computations
perception based computing
perception attributes
sensory attributes
action attributes
vague concepts
approximation of complex vague concepts
ontology approximation
Opis:
Computations in Rough-Granular Computing (RGC) are performed on (information) granules. The rough set approach is used in RGC for inducing granules approximating other granules about which imperfect knowledge is given only. For modeling of complex systems, it is important to extend the RGC approach to Interactive Rough-Granular Computing (IRGC) based on interactions of granules. In this paper, we discuss some fundamental issues for interaction of granules such as general scheme of interactions and the role of dynamic attributes and dynamic information systems in modeling interactive computations.
Źródło:
Control and Cybernetics; 2011, 40, 2; 213-235
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic Programming: an overview
Autorzy:
Sniedovich, M.
Powiązania:
https://bibliotekanauki.pl/articles/205819.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie dynamiczne
dynamic programming
principle of optimality
curse of dimensionality
successive approximation
push
pull
Opis:
Dynamic programing is one of the major problem-solving methodologies in a number of disciplines such as operations research and computer science. It is also a very important and powerful tool of thought. But not all is well on the dynamic programming front. There is definitely lack of commercial software support and the situation in the classroom is not as good as it should be. In this paper we take a bird's view of dynamic programming so as to identify ways to make it more accessible to students, academics and practitioners alike.
Źródło:
Control and Cybernetics; 2006, 35, 3; 513-533
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of linear interpolation and arctan approximation of one-dimensional monotonic utility functions based on experimental data
Autorzy:
Nikolova, N.
Tenekedjiev, K.
Dong, F.
Hirota, K.
Powiązania:
https://bibliotekanauki.pl/articles/969632.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
utility function
interpolation
approximation
weighted least square
goodness-of-fit
statistical tests
Opis:
Elicitation of utilities is among the most time consuming tasks in decision analysis. We search for ways to shorten this phase without compromising the quality of results. We use the results from an empirical experiment with 104 participants. They elicited 9 inner nodes from their one-dimensional utility function over monetary gains and losses using three elicitation techniques. A specific feature of the results is their interval character, as the elicitators are fuzzy rational individuals. The data is used to construct arctan-approximated and linearly interpolated utilities and to compare the results. We form partial samples with 3, 4 and 5 nodes for each participant and each elicitation method, and again interpolate/approximate the utilities. We introduce goodness-of-fit and deterioration measures to analyze the decrease in quality of the utility function due to reduced data nodes. The analysis, using paired-sample tests, leads to the following conclusions: 1) arctan-approximation is more adequate than linear interpolation over the whole samples; 2) 5 inner nodes are sufficient to construct a satisfactory arctan-approximation; 3) arctan-approximation and linear interpolation are almost equal in quality over the partial samples, but the local risk aversion of the linearly interpolated utility function is of poor quality unlike that of the arctan-approximated utility function.
Źródło:
Control and Cybernetics; 2009, 38, 3; 835-861
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dijkstras algorithm revisited: the dynamic programming connexion
Autorzy:
Sniedovich, M.
Powiązania:
https://bibliotekanauki.pl/articles/970872.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
programowanie dynamiczne
badania operacyjne
Dijkstra's algorithm
dynamic programming
greedy algorithm
principle of optimality
successive approximation
operations research
computer science
Opis:
Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is generally viewed and presented as a greedy algorithm. In this paper we attempt to change this perception by providing a dynamic programming perspective on the algorithm. In particular, we are reminded that this famous algorithm is strongly inspired by Bellman's Principle of Optimality and that both conceptually and technically it constitutes a dynamic programming successive approximation procedure par excellence. One of the immediate implications of this perspective is that this popular algorithm can be incorporated in the dynamic programming syllabus and in turn dynamic programming should be (at least) alluded to in a proper exposition/teaching of the algorithm.
Źródło:
Control and Cybernetics; 2006, 35, 3; 599-620
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies