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


Tytuł:
Flight path management of an aircraft in emergency situation
Autorzy:
Majka, A.
Powiązania:
https://bibliotekanauki.pl/articles/248107.pdf
Data publikacji:
2014
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
general aviation
flight path optimization
flight safety
Opis:
A distress event i.e. loss of engine power, structural damage etc., creates a major emergency situation in General Aviation (GA) aircraft. It requires location of a safe-to-land runway within reach, and immediately planning and executing an effective flight path towards it. Currently, technological development in avionics allows creating a flight deck decision support tool for trajectory planning of GA aircraft in emergency situation. Principal part of the system constitutes flight path optimization module. The automated path-planning algorithm generates within seconds an optimized trajectory to be followed by the pilot to safe landing. The trajectory planning is formulated as an optimal control problem, with the aircraft kinematics and dynamics expressed by the state equations, and objective functional that may capture the time, length, energy loss, etc. Obstacles and restricted or prohibited zones are represented as constraints on the positional state variables. The purpose of the paper is to present the method of flight path optimization of an aircraft in emergency, after a distress event, which makes impossible continuation of the original flight. The methods allow determining optimal escape flight path from special protection areas (e.g. cities etc.) or danger zones, as well. The simplified realization of the Ritz-Galerkin method was used in this work, which uses an approximate solution to boundary value problems for determining the optimal flight trajectory. The method allows determining the optimal trajectory of the flight satisfying the initial/final conditions and control functions and path constrains for an aircraft.
Źródło:
Journal of KONES; 2014, 21, 4; 327-334
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Biologically Inspired Energy Efficient Routing Protocol in Disaster Situation
Autorzy:
Chavan, Shankar D.
Thorat, Amruta S.
Gunjal, Monica S.
Vibhute, Anup S.
Desai, Kamalakar R.
Powiązania:
https://bibliotekanauki.pl/articles/2202999.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
WSN
ACO
AAR
path optimization
efficient routing
Opis:
Wireless sensor network (WSN) plays a crucial role in many industrial, commercial, and social applications. However, increasing the number of nodes in a WSN increases network complexity, making it harder to acquire all relevant data in a timely way. By assuming the end node as a base station, we devised an Artificial Ant Routing (AAR) method that overcomes such network difficulties and finds an ideal routing that gives an easy way to reach the destination node in our situation. The goal of our research is to establish WSN parameters that are based on the biologically inspired Ant Colony Optimization (ACO) method. The proposed AAR provides the alternating path in case of congestion and high traffic requirement. In the event of node failures in a wireless network, the same algorithm enhances the efficiency of the routing path and acts as a multipath data transmission approach. We simulated network factors including Packet Delivery Ratio (PDR), Throughput, and Energy Consumption to achieve this. The major objective is to extend the network lifespan while data is being transferred by avoiding crowded areas and conserving energy by using a small number of nodes. The result shows that AAR is having improved performance parameters as compared to LEACH, LEACH-C, and FCM-DS-ACO.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 1; 163--168
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Machining performance optimization of Parallel Kinematic Machines tools with regard to their anisotropic behaviour
Autorzy:
Pateloup, S.
Bonnemains, T.
Chanal, H.
Bouzgarrou, B. C.
Duc, E.
Ray, P.
Powiązania:
https://bibliotekanauki.pl/articles/1429122.pdf
Data publikacji:
2008
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
parallel kinematic machine too
kinematic model
static model
tool path optimization
Opis:
Today, Parallel Kinematic Machines tools (PKMs) appear in automotive and aeronautic industries. These machines allow a benefit of productivity due to their higher kinematics performances than Serial Kinematic Machines tools (SKMs). However, their machining accuracy is lower. Moreover, the compensation of the defects which penalizes the machined parts quality is difficult due to their anisotropic behaviour. Thus, this article deals with the development of methods improving the machined parts quality and the productivity. In order to improve parts quality, the static behaviour of the machine structure is considered with a model taking into account joints and legs compliances. Then, it allows determining a static workspace. About the productivity, the improvement of kinematics performances is performed through an optimization work of the non productive tool path between cutting operations. The computed tool path must verify a minimum time constraint and avoid collisions between the tool and the machined part. All the methods are illustrated with the PKM Tripteor X7 developed by PCI.
Źródło:
Journal of Machine Engineering; 2008, 8, 4; 13-24
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient storage, retrieval and analysis of poker hands: An adaptive data framework
Autorzy:
Gorawski, M.
Lorek, M.
Powiązania:
https://bibliotekanauki.pl/articles/330018.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
big data
storage model design
data architecture
data access
path optimization
zbiór danych
architektura danych
udostępnianie danych
optymalizacja obszaru
Opis:
In online gambling, poker hands are one of the most popular and fundamental units of the game state and can be considered objects comprising all the events that pertain to the single hand played. In a situation where tens of millions of poker hands are produced daily and need to be stored and analysed quickly, the use of relational databases no longer provides high scalability and performance stability. The purpose of this paper is to present an efficient way of storing and retrieving poker hands in a big data environment. We propose a new, read-optimised storage model that offers significant data access improvements over traditional database systems as well as the existing Hadoop file formats such as ORC, RCFile or SequenceFile. Through index-oriented partition elimination, our file format allows reducing the number of file splits that needs to be accessed, and improves query response time up to three orders of magnitude in comparison with other approaches. In addition, our file format supports a range of new indexing structures to facilitate fast row retrieval at a split level. Both index types operate independently of the Hive execution context and allow other big data computational frameworks such as MapReduce or Spark to benefit from the optimized data access path to the hand information. Moreover, we present a detailed analysis of our storage model and its supporting index structures, and how they are organised in the overall data framework. We also describe in detail how predicate based expression trees are used to build effective file-level execution plans. Our experimental tests conducted on a production cluster, holding nearly 40 billion hands which span over 4000 partitions, show that multi-way partition pruning outperforms other existing file formats, resulting in faster query execution times and better cluster utilisation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 713-726
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Network routing method for ships and other moving objects using MATLAB
Autorzy:
Sakharov, Vladimir V.
Chertkov, Alexandr A.
Ariefjew, Igor B.
Powiązania:
https://bibliotekanauki.pl/articles/135140.pdf
Data publikacji:
2020
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
algorithm
path
optimization
transport
automation
moving object
Opis:
Task planning involves automating the creation of the routes for vessels with known coordinates in a confined space. The management of vessel release in a given area affects the time required for a vessel to complete its voyage, and maximizing vessel performance involves identifying the shortest route. A key issue in automating the generation of the optimal (shortest) routes is selecting the appropriate mathematical apparatus. This paper considers an optimization method based on a recursive algorithm using Bellman-Ford routing tasks for large dimensions. Unlike other optimization techniques, the proposed method enables the shortest path to be assessed in a network model with a complex topology, even if there are arcs with negative weights. The practical implementation of the modified Floyd algorithm was demonstrated using a sample automated build and using it to calculate a network model with a complex topology, using an iterative procedure for a program prepared in MATLAB. Implementation of the computer model is simple, and unlike existing models, it eliminates restrictions associated with the presence of negative weights and cycles on a network and automates search shortcuts in ground branch functional means in MATLAB. To confirm the accuracy of the obtained results, we performed an example calculation using the network. The proposed algorithm and recursive procedure are recommended for finding energy-efficient solutions during the management of mobile objects on waterways.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2020, 62 (134); 61-68
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Collision-free autonomous robot navigation in unknown environments utilizing PSO for path planning
Autorzy:
Krell, Evan
Sheta, Alaa
Balasubramanian, Arun Prassanth Ramaswamy
King, Scott A.
Powiązania:
https://bibliotekanauki.pl/articles/91555.pdf
Data publikacji:
2019
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
mobile robot
particle swarm optimization (PSO)
path planning
Opis:
The autonomous navigation of robots in unknown environments is a challenge since it needs the integration of a several subsystems to implement different functionality. It needs drawing a map of the environment, robot map localization, motion planning or path following, implementing the path in real-world, and many others; all have to be implemented simultaneously. Thus, the development of autonomous robot navigation (ARN) problem is essential for the growth of the robotics field of research. In this paper, we present a simulation of a swarm intelligence method is known as Particle Swarm Optimization (PSO) to develop an ARN system that can navigate in an unknown environment, reaching a pre-defined goal and become collision-free. The proposed system is built such that each subsystem manipulates a specific task which integrated to achieve the robot mission. PSO is used to optimize the robot path by providing several waypoints that minimize the robot traveling distance. The Gazebo simulator was used to test the response of the system under various envirvector representing a solution to the optimization problem.onmental conditions. The proposed ARN system maintained robust navigation and avoided the obstacles in different unknown environments. vector representing a solution to the optimization problem.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 4; 267-282
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal design of stationary flow problems by path-following interior-point methods
Autorzy:
Antil, H.
Hoppe, R. H.
Linsenmann, C.
Powiązania:
https://bibliotekanauki.pl/articles/970290.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
shape optimization
Stokes flow problems
path-following interior-point methods
Opis:
We consider the numerical solution of structural optimization problems in CFD where the state variables are supposed to satisfy a linear or nonlinear Stokes system and the design variables are subject to bilateral pointwise constraints. Within a primal-dual setting, we suggest an all-at-once approach based on interior-point methods. The discretization is taken care of by Taylor-Hood elements with respect to a simplicial triangulation of the computational domain. The efficient numerical solution of the discretized problem relies on path-following techniques, namely a continuation method with an adaptive choice of the continuation step size, a long-step path-following algorithm and a nonlinear version of Mehrotra's algorithm. The performance of the suggested methods is documented by several illustrative numerical examples.
Źródło:
Control and Cybernetics; 2008, 37, 4; 771-796
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Path Diversity Protection in Two-Layer Networks
Autorzy:
Dzida, M.
Śliwiński, T.
Zagożdżon, M.
Ogryczak, W.
Pióro, M.
Powiązania:
https://bibliotekanauki.pl/articles/308914.pdf
Data publikacji:
2009
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
link dimensioning
path diversity
resilient routing
two-layer network optimization
Opis:
The paper addresses an optimization problem related to dimensioning links in a resilient two-layer network. A particular version of the problem which assumes that links of the upper layer are supported by unique paths in the lower layer is considered. Two mixed-integer programming formulations of this problem are presented and discussed. Direct resolving of these formulations requirespre-selection of "good" candidate paths in the upper layer of the network. Thus, the paper presents an alternative approach which is based on decomposing the resolution process into two phases, resolved iteratively. The first phase subproblem is related to designing lower layer path flows that provide the capacities for the logical links of the upper layer. The second phase is related to designing the flow patterns in the upper layer with protection assured through diversity of paths. In this phase we take into account the failures of the logical links that result from the failures of the lower layer links (so called shared risk link groups).
Źródło:
Journal of Telecommunications and Information Technology; 2009, 3; 14-19
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant colony optimization for data acquisition mission planning
Autorzy:
Colmenares, G.
Halal, F.
Zaremba, M.B.
Powiązania:
https://bibliotekanauki.pl/articles/407293.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
path planning
environment monitoring
ant colony optimization
data acquisition
navigation control
satellite imagery
constraint-based optimization
Opis:
The probabilistic Ant Colony Optimization (ACO) approach is presented to solve the problem of designing an optimal trajectory for a mobile data acquisition platform. An ACO algorithm optimizes an objective function defined in terms of the value of the acquired data samples subject to different sets of constraints depending on the current data acquisition strategy. The analysis presented in this paper focuses on an environment monitoring system, which acquires in-situ data for precise calibration of a water quality monitoring system. The value of the sample is determined based on the concentration of the water pollutant, which in turn is obtained through processing of multi-spectral satellite imagery. Since our problem is defined in a continuous space of coordinates, and in some strategies each point is able to connect to any other point in the space, we adopted a hybrid model that involves a connection graph and also a spatial grid.
Źródło:
Management and Production Engineering Review; 2014, 5, 2; 3-11
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Paddle shape optimization for hole-flanging by paddle forming through the use of a predefined strain path in finite element analysis
Autorzy:
Besong, Lemopi Isidore
Buhl, Johannes
Bambach, Markus
Powiązania:
https://bibliotekanauki.pl/articles/99811.pdf
Data publikacji:
2019
Wydawca:
Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
Tematy:
paddle forming
paddle shape optimization
incremental hole-flanging
strain path mapping
Opis:
This research investigates a novel hole-flanging process by paddle forming through the use of finite element (FE) simulations. Paddles of different shapes rotating at high speeds were used to deform clamped sheets with predrilled holes at their centers. The results of the simulations show that the paddle shape determines the geometry and principal strains of the formed flanges. A convex-shaped paddle forms flanges with predominant strains in the left quadrant of the forming limit diagram (FLD). However, the convex paddle promotes unwanted bulge formation at the clamped end of the flange. A concave paddle forms flanges with no bulge but the principal strains of elements in the middle section of the flange are in the right quadrant of the FLD which indicates an increased probability for crack occurrence. An optimization of the paddle shape was conducted to prevent bulging at the clamped end while avoiding crack occurrence. The paddle shape was optimized by mapping the deformation of some elements along the flange length to a pre-defined strain path on the FLD while maintaining the bulge height within the desired geometric tolerance. The radii and lengths of the paddle edge were varied to obtain an optimum paddle shape.
Źródło:
Journal of Machine Engineering; 2019, 19, 2; 83-98
1895-7595
2391-8071
Pojawia się w:
Journal of Machine Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed asynchronous algorithms in the Internet - new routing and traffic control methods
Autorzy:
Karbowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/309014.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
computer networks
optimization
shortest path
traffic control
decomposition
distributed computations
asynchronous algorithms
Opis:
The paper presents several new algorithms concerning the third (network) and the fourth (transport) layer of ISO/OSI network model. For the third layer two classes of the shortest paths algorithms - label correcting and auction algorithms - are proposed. For the fourth layer an application of price decomposition to network optimization and Internet congestion control is suggested.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 29-36
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An ACO Path Planner Using a FIS for Path Selection Adjusted with a Simple Tuning Algorithm
Autorzy:
Porta-Garcia, M.
Montiel, O.
Sepulveda, R.
Powiązania:
https://bibliotekanauki.pl/articles/384490.pdf
Data publikacji:
2008
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
ant colony optimization
ACO
autonomous mobile robot
navigation
fuzzy logic
path planning
Opis:
This paper presents a path planner application for mobile robots based on Ant Colony Optimization (ACO). The selection of the optimal path relies in the criterion of a Fuzzy Inference System (FIS), which is adjusted using a Simple Tuning Algorithm (STA). The path planner can be executed in Mode I and Mode II. The first mode only works in the virtual environment of the interface, while Mode II embraces the wireless communication with a real robot; once the ACO algorithm finds the best route, the coordinates are sent to a mobile robot via Bluetooth communication; if the robot senses a new obstacle, the computer is notified and does a rerouting routine in order to avoid the obstacle and reach the goal. In other words, the application supports dynamic search spaces.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2008, 2, 1; 5-11
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization-based approach to path planning for closed chain robot systems
Autorzy:
Szynkiewicz, W.
Błaszczyk, J.
Powiązania:
https://bibliotekanauki.pl/articles/930153.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
łańcuch zamknięty
planowanie trajektorii
optymalizacja nieliniowa
closed chain
path planning
nonlinear optimization
Opis:
An application of advanced optimization techniques to solve the path planning problem for closed chain robot systems is proposed. The approach to path planning is formulated as a "quasi-dynamic" NonLinear Programming (NLP) problem with equality and inequality constraints in terms of the joint variables. The essence of the method is to find joint paths which satisfy the given constraints and minimize the proposed performance index. For numerical solution of the NLP problem, the IPOPT solver is used, which implements a nonlinear primal-dual interior-point method, one of the leading techniques for large-scale nonlinear optimization.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 4; 659-670
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Force mechanism and conceptual design of reinforced concrete short beam without web reinforcement
Autorzy:
Chen, Yi-Jun
Zhang, Hu-Zhi
Lu, Bei-Rong
Huang, Yao-Sen
Powiązania:
https://bibliotekanauki.pl/articles/2200825.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
reinforced concrete short beam
topology optimization
conceptual design
load-transfer path
Michell criterion
Opis:
Topology Optimization and Finite Element Analysis were carried out for reinforced concrete short beams to reveal the force mechanism. The results show that load-transfer paths for the beams can evolve from Bi-directional Evolutionary Structural Optimization and be mechanically supported by the Michell criterion. In the beams, the distribution of a high- -stress compression area appears as a truss under a concentrated load and a tie-arch under a uniform load. The beams do not have much higher bearing capacity but can consume many more materials. Consequently, new design ideas were recommended based on the load transfer paths obtained by Topology Optimization.
Źródło:
Journal of Theoretical and Applied Mechanics; 2022, 60, 4; 659--671
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
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ł

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