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ę "programming" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 35
Tytuł:
A linear programming methodology for approximate dynamic programming
Autorzy:
Díaz, Henry
Sala, Antonio
Armesto, Leopoldo
Powiązania:
https://bibliotekanauki.pl/articles/330082.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
linear programming
approximate dynamic programming
control applications
neural network
programowanie liniowe
programowanie dynamiczne
sieć neuronowa
Opis:
The linear programming (LP) approach to solve the Bellman equation in dynamic programming is a well-known option for finite state and input spaces to obtain an exact solution. However, with function approximation or continuous state spaces, refinements are necessary. This paper presents a methodology to make approximate dynamic programming via LP work in practical control applications with continuous state and input spaces. There are some guidelines on data and regressor choices needed to obtain meaningful and well-conditioned value function estimates. The work discusses the introduction of terminal ingredients and computation of lower and upper bounds of the value function. An experimental inverted-pendulum application will be used to illustrate the proposal and carry out a suitable comparative analysis with alternative options in the literature.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 363-375
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel Dynamic Programming Algorithms : Multitransputer Systems
Autorzy:
Sadecki, J.
Powiązania:
https://bibliotekanauki.pl/articles/907983.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
dynamic programming
parallel computations
transputers
multitransputer systems
parallel optimization algorithms
Opis:
The present paper discusses real parallel computations. On the basis of a selected group of dynamic programming algorithms, a number of factors affecting the efficiency of parallel computations such as, e.g., the way of distributing tasks, the interconnection structure between particular elements of the parallel system or the way of organizing of interprocessor communication are analyzed. Computations were implemented in the parallel multitransputer SUPER NODE 1000 system using from 5 to 50 transputers.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 241-255
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Test Signal Design for Failure Detection: a Linear Programming Approach
Autorzy:
Scola, H. R.
Nikoukhah, R.
Delebecque, F.
Powiązania:
https://bibliotekanauki.pl/articles/908093.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
failure detection
large scale programming
failure isolation
bounded perturbations
active detection
Opis:
A new methodology for the design of filters that permits failure detection and isolation of dynamic systems is presented. Assuming that the normal and the faulty behavior of a process can be modeled by two linear systems subject to inequality bounded perturbations, a method for the on-line implementation of a test signal, guaranteeing failure detection, is proposed. To improve the fault detectability of the dynamic process, appropriate test signals are injected into the system. All the computations required by the proposed method are implemented as the solution of large sparse linear optimization problems. A simple numerical example is given to illustrate the proposed procedure.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 4; 515-526
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparative study on interval arithmetic operations with intuitionistic fuzzy numbers for solving an intuitionistic fuzzy multi-objective linear programming problem
Autorzy:
Vidhya, R.
Irene Hepzibah, R.
Powiązania:
https://bibliotekanauki.pl/articles/330813.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fuzzy number
fuzzy arithmetic
linear programming problem
liczba rozmyta
arytmetyka rozmyta
programowanie liniowe
Opis:
In a real world situation, whenever ambiguity exists in the modeling of intuitionistic fuzzy numbers (IFNs), interval valued intuitionistic fuzzy numbers (IVIFNs) are often used in order to represent a range of IFNs unstable from the most pessimistic evaluation to the most optimistic one. IVIFNs are a construction which helps us to avoid such a prohibitive complexity. This paper is focused on two types of arithmetic operations on interval valued intuitionistic fuzzy numbers (IVIFNs) to solve the interval valued intuitionistic fuzzy multi-objective linear programming problem with pentagonal intuitionistic fuzzy numbers (PIFNs) by assuming different α and β cut values in a comparative manner. The objective functions involved in the problem are ranked by the ratio ranking method and the problem is solved by the preemptive optimization method. An illustrative example with MATLAB outputs is presented in order to clarify the potential approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 563-573
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tikhonov regularization and constrained quadratic programming for magnetic coil design problems
Autorzy:
Garda, B.
Galias, Z.
Powiązania:
https://bibliotekanauki.pl/articles/330150.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
coil design problem
constrained quadratic programming
Tikhonov regularization
projektowanie cewki
programowanie kwadratowe
regularyzacja Tikhonova
Opis:
In this work, the problem of coil design is studied. It is assumed that the structure of the coil is known (i.e., the positions of simple circular coils are fixed) and the problem is to find current distribution to obtain the required magnetic field in a given region. The unconstrained version of the problem (arbitrary currents are allowed) can be formulated as a Least-SQuares (LSQ) problem. However, the results obtained by solving the LSQ problem are usually useless from the application point of view. Moreover, for higher dimensions the problem is ill-conditioned. To overcome these difficulties, a regularization term is sometimes added to the cost function, in order to make the solution smoother. The regularization technique, however, produces suboptimal solutions. In this work, we propose to solve the problem under study using the constrained Quadratic Programming (QP) method. The methods are compared in terms of the quality of the magnetic field obtained, and the power of the designed coil. Several 1D and 2D examples are considered. It is shown that for the same value of the maximum current the QP method provides solutions with a higher quality magnetic field than the regularization method.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 249-257
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An optimal path planning problem for heterogeneous multi-vehicle systems
Autorzy:
Klaučo, M.
Blažek, S.
Kvasnica, M.
Powiązania:
https://bibliotekanauki.pl/articles/330754.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
path planning
multi vehicle system
mixed-integer programming
planowanie ruchu
system wielopojazdowy
programowanie całkowitoliczbowe
Opis:
A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes that the order in which the waypoints are visited is known a priori. In such a case we show that the optimal path can be found by solving a mixed-integer second-order cone problem. The second version assumes that the order in which the waypoints are visited is not known a priori, but can be optimized so as to shorten the length of the path. Two approaches to solve this problem are presented and evaluated with respect to computational complexity.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 297-308
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonlinear analysis of vehicle control actuations based on controlled invariant sets
Autorzy:
Németh, B.
Gáspár, P.
Péni, T.
Powiązania:
https://bibliotekanauki.pl/articles/331245.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
vehicle dynamics
sum of squares programming
Lyapunov method
dynamika pojazdu
metoda Lapunowa
analiza nieliniowa
Opis:
In the paper, an analysis method is applied to the lateral stabilization problem of vehicle systems. The aim is to find the largest state-space region in which the lateral stability of the vehicle can be guaranteed by the peak-bounded control input. In the analysis, the nonlinear polynomial sum-of-squares programming method is applied. A practical computation technique is developed to calculate the maximum controlled invariant set of the system. The method calculates the maximum controlled invariant sets of the steering and braking control systems at various velocities and road conditions. Illustration examples show that, depending on the environments, different vehicle dynamic regions can be reached and stabilized by these controllers. The results can be applied to the theoretical basis of their interventions into the vehicle control system.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 31-43
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
Autorzy:
Różycki, R.
Waligóra, G.
Węglarz, J.
Powiązania:
https://bibliotekanauki.pl/articles/330888.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
machine scheduling
preemptable jobs
continuous resource
makespan
mathematical programming
szeregowanie zadań
zasób ciągły
programowanie matematyczne
Opis:
In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines) and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 693-706
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cooperative driving at isolated intersections based on the optimal minimization of the maximum exit time
Autorzy:
Wu, J.
Abbas-Turki, A.
Perronnet, F.
Powiązania:
https://bibliotekanauki.pl/articles/331216.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
cooperative driving
wireless communication
autonomous intersection management
dynamic programming
komunikacja bezprzewodowa
zarządzanie autonomiczne
programowanie dynamiczne
Opis:
Traditional traffic control systems based on traffic light have achieved a great success in reducing the average delay of vehicles or in improving the traffic capacity. The main idea of these systems is based on the optimization of the cycle time, the phase sequence, and the phase duration. The right-of-ways are assigned to vehicles of one or several movements for a specific time. With the emergence of cooperative driving, an innovative traffic control concept, Autonomous Intersection Management (AIM), has emerged. In the framework of AIM, the right-of-way is customized on the measurement of the vehicle state and the traffic control turns to determine the passing sequence of vehicles. Since each vehicle is considered individually, AIM faces a combinatorial optimization problem. This paper proposes a dynamic programming algorithm to find its optimal solution in polynomial time. Experimental results obtained by simulation show that the proper arrangement of the vehicle passing sequence can greatly improve traffic efficiency at intersections.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 773-785
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Emotion learning: solving a shortest path problem in an arbitrary deterministic environment in linear time with an emotional agent
Autorzy:
Petruseva, S.
Powiązania:
https://bibliotekanauki.pl/articles/907900.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
czynnik emocjonalny
złożoność
programowanie
sieć neuronowa
emotional agent
complexity
consequence programming
CAA neural network
planning
Opis:
The paper presents an algorithm which solves the shortest path problem in an arbitrary deterministic environment with n states with an emotional agent in linear time. The algorithm originates from an algorithm which in exponential time solves the same problem, and the agent architecture used for solving the problem is an NN-CAA architecture (neural network crossbar adaptive array). By implementing emotion learning, the linear time algorithm is obtained and the agent architecture is modified. The complexity of the algorithm without operations for initiation in general does not depend on the number of states n, but only on the length of the shortest path. Depending on the position of the goal state, the complexity can be at most O(n). It can be concluded that the choice of the function which evaluates the emotional state of the agent plays a decisive role in solving the problem efficiently. That function should give as detailed information as possible about the consequences of the agent’s actions, starting even from the initial state. In this way the function implements properties of human emotions.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 409-421
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach
Autorzy:
Yan, F.
Dridi, M.
El Moudni, A.
Powiązania:
https://bibliotekanauki.pl/articles/329874.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
autonomous vehicle
autonomous intersection management
genetic algorithm
dynamic programming
heuristics
pojazd autonomiczny
algorytm genetyczny
programowanie dynamiczne
Opis:
This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient vehicle passing sequence in a short time becomes a big challenge, especially for more than one intersection. In this paper, we present a technique for combining certain vehicles into some basic groups with reference to some properties discussed in our earlier works. A genetic algorithm based on these basic groups is designed to find an optimal or a near-optimal vehicle passing sequence for each intersection. Computational experiments verify that the proposed genetic algorithms can response quickly for several intersections. Simulations with continuous vehicles are carried out with application of the proposed algorithm or existing traffic control methods. The results show that the traffic condition can be significantly improved by our algorithm.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 1; 183-200
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics
Autorzy:
Rafajłowicz, E.
Styczeń, K.
Rafajłowicz, W.
Powiązania:
https://bibliotekanauki.pl/articles/331421.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
programowanie nieliniowe
sterowanie optymalne
równanie różniczkowe cząstkowe
filter approach
nonlinear programming
optimal control
partial differential equations
Opis:
Our aim is to adapt Fletcher's filter approach to solve optimal control problems for systems described by nonlinear Partial Differential Equations (PDEs) with state constraints. To this end, we propose a number of modifications of the filter approach, which are well suited for our purposes. Then, we discuss possible ways of cooperation between the filter method and a PDE solver, and one of them is selected and tested.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 313-326
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A family of model predictive control algorithms with artificial neural networks
Autorzy:
Ławryńczuk, M.
Powiązania:
https://bibliotekanauki.pl/articles/929631.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sterowanie predykcyjne
sieć neuronowa
optymalizacja
linearyzacja
programowanie kwadratowe
predictive control
neural networks
optimisation
linearisation
quadratic programming
Opis:
This paper details nonlinear Model-based Predictive Control (MPC) algorithms for MIMO processes modelled by means of neural networks of a feedforward structure. Two general MPC techniques are considered: the one with Nonlinear Optimisation (MPC-NO) and the one with Nonlinear Prediction and Linearisation (MPC-NPL). In the first case a nonlinear optimisation problem is solved in real time on-line. In order to reduce the computational burden, in the second case a neural model of the process is used on-line to determine local linearisation and a nonlinear free trajectory. Single-point and multi-point linearisation methods are discussed. The MPC-NPL structure is far more reliable and less computationally demanding in comparison with the MPC-NO one because it solves a quadratic programming problem, which can be done efficiently within a foreseeable time frame. At the same time, closed-loop performance of both algorithm classes is similar. Finally, a hybrid MPC algorithm with Nonlinear Prediction, Linearisation and Nonlinear optimisation (MPC-NPL-NO) is discussed.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 2; 217-232
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An SQP trust region method for solving the discrete-time linear quadratic control problem
Autorzy:
Mostafa, E. M. E.
Powiązania:
https://bibliotekanauki.pl/articles/331409.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
programowanie sekwencyjne
programowanie kwadratowe
system dyskretno-czasowy
output feedback control design
sequential quadratic programming
trust region method
Opis:
In this paper, a sequential quadratic programming method combined with a trust region globalization strategy is analyzed and studied for solving a certain nonlinear constrained optimization problem with matrix variables. The optimization problem is derived from the infinite-horizon linear quadratic control problem for discrete-time systems when a complete set of state variables is not available. Moreover, a parametrization approach is introduced that does not require starting a feasible solution to initiate the proposed SQP trust region method. To demonstrate the effectiveness of the method, some numerical results are presented in detail.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 353-363
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sensitivity of computer support game algorithms of safe ship control
Autorzy:
Lisowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/331390.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
differential game
positional game
matrix game
dual linear programming
gra różnicowa
gra pozycyjna
gra macierzowa
programowanie liniowe
Opis:
The paper investigates the sensitivity of safe ship control to inaccurate data from the ARPA anti-collision radar system and to changes in the process control parameters. The system structure of safe ship control in collision situations and computer support programmes exploring information from the ARPA anti-collision radar are presented. Sensitivity characteristics of the multistage positional non-cooperative and cooperative game and kinematics optimization control algorithms are determined through examples of navigational situations with restricted visibility at sea.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 2; 439-446
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 35

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