Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "a* algorithm" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 62
Tytuł:
A new optimal algorithm for a time-dependent scheduling problem
Autorzy:
Kubale, M.
Ocetkiewicz, K. M.
Powiązania:
https://bibliotekanauki.pl/articles/969669.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
scheduling
single machine
deteriorating jobs
total completion time
algorithms
Opis:
In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1,...,jn, and the processing time pi of the i-th job is given by pi = 1 + biSi, where si is the starting time of the i-th job, i = 1,...n. If all jobs have different and non-zero deterioration rates and bi [wzór], where bmin = min{bi}, then an optimal schedule can be found in O(n log n) time. The conducted computational experiments show that the presented algorithm performs very well even on data not satisfying the assumed constraints.
Źródło:
Control and Cybernetics; 2009, 38, 3; 713-721
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
Autorzy:
Mahmood, A.
Powiązania:
https://bibliotekanauki.pl/articles/205582.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation
Opis:
The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
Źródło:
Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new heuristic algorithm of fuzzy clustering
Autorzy:
Viattchenin, D. A.
Powiązania:
https://bibliotekanauki.pl/articles/970349.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
grupowanie rozmyte
przydział
punkt typowy
fuzzy clustering
fuzzy tolerance
fuzzy cluster
membership degree
allotment
typical point
Opis:
This paper deals with a new method of fuzzy clustering. The basic concepts of the method are introduced as resulting from the consideration of the fundamental fuzzy clustering problem. The paper provides the description of the general plan of the algorithm and an illustrative example. An analysis of the experimental results of the method's application to the Anderson's Iris data is carried out. Some preliminary conclusions and the ways of prospective investigations are given.
Źródło:
Control and Cybernetics; 2004, 33, 2; 323-340
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant colony metaphor in a new clustering algorithm
Autorzy:
Boryczka, U.
Powiązania:
https://bibliotekanauki.pl/articles/969824.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
data mining
cluster analysis
ant clustering algorithm
Opis:
Among the many bio-inspired techniques, ant clustering algorithms have received special attention, especially because they still require much investigation to improve performance, stability and other key features that would make such algorithms mature tools for data mining. Clustering with swarm-based algorithms is emerging as an alternative to more conventional clustering methods, such as k-means algorithm. This proposed approach mimics the clustering behavior observed in real ant colonies. As a case study, this paper focuses on the behavior of clustering procedures in this new approach. The proposed algorithm is evaluated on a number of well-known benchmark data sets. Empirical results clearly show that the ant clustering algorithm (ACA) performs well when compared to other techniques.
Źródło:
Control and Cybernetics; 2010, 39, 2; 343-358
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A control algorithm applied to polarization states of light in the nonlinear optical resonator
Autorzy:
Wierzbicki, M.
Powiązania:
https://bibliotekanauki.pl/articles/206554.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
dwustabilność optyczna
układ nieliniowy
inverse modelling
nonlinear systems
optical bistability
Opis:
In this paper a control algorithm is presented for a nonlinear system defined by a nonlinear mapping F : R^n -> R^n of input states to output states of the system, for the problem of motion in the R^n space of output states along the given trajectory. The application of this algorithm in nonlinear optics is presented, for the control of light polarization transmitted through the Fabry-Perot resonator filled with a material with nonlinear optical properties. The calculated trajectory in the space of polarization states of output light leads to the phenomenon of optical bistability, i.e. sudden changes of output polarization induced by small variations of the input parameters, and the dependence of the current state of light polarization on the history of the system.
Źródło:
Control and Cybernetics; 2002, 31, 1; 129-139
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Design of a novel control algorithm for a 6 D.O.F. mobile manipulator based on a robust observer
Autorzy:
Bolandi, H.
Ehyaei, A. F.
Esmaeilzadeh, A. M.
Powiązania:
https://bibliotekanauki.pl/articles/970986.pdf
Data publikacji:
2005
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
robust control
mobile manipulator
generalized-α method
robust observer
Opis:
In this paper a control algorithm based on a design technique named "Robust Damping Control" is introduced. A robust observer is further shown to overcome the problem of using velocity sensors that may degrade the system performance. The proposed controller uses only position measurements and is capable of disturbance rejection in the presence of unknown bounded disturbances without requiring the knowledge of its bound. Moreover, we propose an accurate and fast time integration method to solve the dynamic equations of the mobile manipulator system. The simulation results of a 6 D.O.F. mobile manipulator illustrate the effectiveness of the presented algorithm.
Źródło:
Control and Cybernetics; 2005, 34, 4; 1057-1074
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A generalized varying-domain optimization method for fuzzy goal programming with priorities based on a genetic algorithm
Autorzy:
Li, S. Y.
Hu, C. F.
Teng, C. J.
Powiązania:
https://bibliotekanauki.pl/articles/970454.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
rozmyte programowanie celowe
priorytet
algorytm genetyczny
fuzzy goal programming
priorities
SQP
genetic algorithm
GENOCOP III
Opis:
This paper proposes a generalized domain optimization method for fuzzy goal programming with different priorities. According to the three possible styles of the objective function, the domain optimization method and its generalization are correspondingly proposed. This method can generate the results consistent with the decision-maker's priority expectations, according to which the goal with higher priority may have higher level of satisfaction. However, the reformulated optimization problem may be nonconvex for the reason of the nature of the original problem and the introduction of the varying-domain optimization method. It is possible to obtain a local optimal solution for nonconvex programming by the SQP algorithm. In order to get the global solution of the new programming problem, the co-evolutionary genetic algorithm, called GENOCOP III, is used instead of the SQP method. In this way the decision-maker can get. the optimum of the optimization problem. We demonstrate the power of this proposed method based on genetic algorithm by illustrative examples.
Źródło:
Control and Cybernetics; 2004, 33, 4; 633-652
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic control of a class of discrete event systems using a state reconstruction algorithm
Autorzy:
Martinelli, F.
Nicosia, S.
Valigi, P.
Powiązania:
https://bibliotekanauki.pl/articles/205600.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
discrete events systems
optymalizacja
sterowanie
teoria systemów
Kanbaal systems
optimization
ordinal optimization
production control
resource allocations
sample path analysis
Opis:
The problem of dynamic control of Discrete Event Dynamic Systems (DEDS) is addressed in this paper as a dynamic optimization problem : some resources must be allocated to the system in order to optimize a performance function which is assumed time-varying. The control scheme exploits a state reconstruction algorithm to compute an estimate of the performance for perturbed sample paths. The algorithm is based on the use of data extracted from the observation of the system and allows to accurately reconstruct its state behavior, for resource allocations different from the nominal one. The proposed control scheme is then used for dynamic allocation of buffer capacities in mamlfaeturing systems, such as Kanban systems. A parallel implementation of the whole algorithm is also mentioned.
Źródło:
Control and Cybernetics; 2000, 29, 1; 275-294
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A scaling out-of-kilter algorithm for minimum cost flow
Autorzy:
Ciupala, L.
Powiązania:
https://bibliotekanauki.pl/articles/970996.pdf
Data publikacji:
2005
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
network flow
minimum cost flow
shortest path
scaling technique
Opis:
The out-of-kilter algorithm is one of the basic algorithms that solve the minimum cost flow problem. Its drawback is that it can improve the objective function at each iteration by only a small value. Consequently, it runs in pseudo-polynomial time. In this paper, we describe a new out-of-kilter algorithm for minimum cost flow that runs in polynomial time. Our algorithm is a scaling algorithm and improves the objective function at each time by a "sufficiently large" value.
Źródło:
Control and Cybernetics; 2005, 34, 4; 1169-1174
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A primal-infeasible interior point algorithm for linearly constrained convex programming
Autorzy:
Wang, Y.
Fei, P.
Powiązania:
https://bibliotekanauki.pl/articles/969664.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linearly constrained convex programming
primal-infeasible interior point algorithm
polynomial complexity
Opis:
In this paper a primal-infeasible interior point algorithm is proposed for linearly constrained convex programming. A positive primal-infeasible dual-feasible point can be taken as the starting point of this algorithm in a large region. At each iterates it requires to solve approximately a nonlinear system. The polynomial complexity of the algorithm is obtained. It is shown that, after finite iterations a sufficiently good approximation to the optimal point is found, or there is no optimal point in a large region.
Źródło:
Control and Cybernetics; 2009, 38, 3; 687-704
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A differential motion planning algorithm for controlling multi-robot systems handling a common object
Autorzy:
Tzafestas, C.
Prokopiou, P.
Tzafestas, S.
Powiązania:
https://bibliotekanauki.pl/articles/205881.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
robot
cooperative robots
incremental robot motion planning
manipulator kinematic
master and two-slaves system
multi-robot kinematics
multi-robot systems
path planning
rigidity condition
Opis:
Multi-robot systems have substantially increased capabilities over single-robot systems and can handle very large or peculiar objects. This paper presents a differential (incremental) motion planning algorithm for an m-robot system (m >or=2) to cooperatively transfer an object from an initial to a desired final position / orientation by rigidly holding it at given respective points Q[sub 1], Q[sub 2],..., Q[sub m]. One of the robots plays the role of a "master" while other robots operate in the "slave" mode maintaining invariant their relative positions and orientations during the system motion. The method employs the differential displacements of the end-effector of each robot arm. Then, the differential displacements of the joints of the m robots are computed for the application of incremental motion control. The algorithm was tested on many examples. A representative of them is shown here, concerning the case of three STAUBLI RX-90L robots similar to 6-dof PUMA robots. The results obtained show the practicality and effectiveness of the method, which, however, needs particular care for completely eliminating the cumulative errors that may occur.
Źródło:
Control and Cybernetics; 2000, 29, 2; 567-584
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A fuzzy controller with a real-time tuning algorithm and its application to a steam generator water level control
Autorzy:
Jung, C.
Kwon, K.
Powiązania:
https://bibliotekanauki.pl/articles/205893.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sterowanie rozmyte
sterownik z logikami rozmytymi
fuzzy controller
instantaneous system performance
scaling factor
self-tuning
steam generator
Opis:
It is nesessary to tune the fuzzy rules and the scalling factors in real-time control of a large scale system, the steam generator of a nuclear power plant, as it is related to safety and availability of the plant. A novel real-time tuning algorithm of fuzzy controller based on the scaling factors is proposed and applied to the steam generator water level control system of the nuclear power plant. The new real-time tuning algorithm adopts a variable reference tuning index for a good system tuning response and an instantaneous system fuzzy performance for scaling factor tuning. For the fuzzy steam generator controller, an image signal of feedwater flow error at low power is proposed and pressure compensation rules and a gain scheduler of feedwater temperature are designed also. The fuzzy controller of the steam generator water level is simulated by the proposed method. The simulation results show that the improved performance of the steam generator water level controller by the proposed method.
Źródło:
Control and Cybernetics; 1998, 27, 4; 545-564
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal design of model following control with genetic algorithm
Autorzy:
Zhang, X.
Yamane, Y.
Powiązania:
https://bibliotekanauki.pl/articles/205732.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
model optymalny
sprzężenie do przodu
sprzężenie zwrotne
feedback
feedforward
genetic algorithm
model following control (MFC)
optimal design
Opis:
This paper presents a genetic algorithm for the optimal design of model following control in which there are nonlinear disturbance and unceratin parameters, where the output is regulated to follow the output of reference model. The effectiveness of the proposed algorithm is illustrated by numerical examples.
Źródło:
Control and Cybernetics; 2001, 30, 1; 71-79
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ł
Tytuł:
Convergence of Tolands critical points for sequences of D.C. functions and application to the resolution of semilinear elliptic problems
Autorzy:
Yassine, A.
Alaa, N.
Elhilali Alaoui, A.
Powiązania:
https://bibliotekanauki.pl/articles/206580.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm proksymalny
funkcje D.C.
optymalizacja niewypukła
punkt krytyczny Tolanda
semiliniowe zagadnienie eliptyczne
dc functions
non-convex optimization
normalized D.C. decomposition
proximal algorithm
semilinear elliptic problem
Toland's critical point
Opis:
We prove that if a sequence (fn)n of D.C. functions (Difference of two Convex functions) converges to a D.C. function f in some appropriate way and if un is a critical point of fn, in the sense described by Toland, and is such that (un)n converges to u, then a is a critical point of f, still in Toland's sense. We also build a new algorithm which searches for this critical point u and then apply it in order to compute the solution of a semilinear elliptic equation.
Źródło:
Control and Cybernetics; 2001, 30, 4; 405-417
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 62

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