Wyniki wyszukiwania - BazTech

1

Evaluation of popular path planning algorithms

Kara Mehmet

International Journal of Electronics and Telecommunications

|

2024

|

Vol. 70, No. 1

13--22

EN

The navigation of mobile robots is a key element of autonomous systems, which allows robots to move effectively and securely in changing environments with greater autonomy and precision. This study aims to provide researchers with a comprehensive guide for selecting the best path-planning methods for their particular projects. We evaluate some popular algorithms that are regularly used in mobile robot navigation, in order to demonstrate their specifications and determine where they are most effective. For example, one algorithm is used to model the problem as a standard graph, and another algorithm is found to be the most suitable for highly dynamic and highly dimensional environments, due to its robust path-planning capabilities and efficient route construction. We also filter high-performance algorithms in terms of computational complexity, accuracy, and robustness. In conclusion, this study provides valuable information on its individual strengths and weaknesses, helping robotics and engineers make informed decisions when selecting the most appropriate algorithm for their specific applications.

2

Adding parallelism to sequential programs : a combined method

Daszczuk Wiktor B., Czejdo Danny B., Grześkowiak Wojciech

International Journal of Electronics and Telecommunications

|

2024

|

Vol. 70, No. 1

135--144

EN

The article outlines a contemporary method for creating software for multi-processor computers. It describes the identification of parallelizable sequential code structures. Three structures were found and then carefully examined. The algorithms used to determine whether or not certain parts of code may be parallelized result from static analysis. The techniques demonstrate how, if possible, existing sequential structures might be transformed into parallel-running programs. A dynamic evaluation is also a part of our process, and it can be used to assess the efficiency of the parallel programs that are developed. As a tool for sequential programs, the algorithms have been implemented in C#. All proposed methods were discussed using a common benchmark.

3

Optimization of daily operations in the marine industry using ant colony optimization (ACO)-An artificial intelligence (AI) approach

Sardar A., Anantharaman M., Garaniya V., Khan F.

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

|

2023

|

Vol. 17 No. 2

290--295

EN

The maritime industry plays a crucial role in the global economy, with roughly 90% of world trade being conducted through the use of merchant ships and more than a million seafarers. Despite recent efforts to improve reliability and ship structure, the heavy dependence on human performance has led to a high number of casualties in the industry. Decision errors are the primary cause of maritime accidents, with factors such as lack of situational awareness and attention deficit contributing to these errors. To address this issue, the study proposes an Ant Colony Optimization (ACO) based algorithm to design and validate a verified set of instructions for performing each daily operational task in a standardised manner. This AI-based approach can optimise the path for complex tasks, provide clear and sequential instructions, improve efficiency, and reduce the likelihood of human error by minimising personal preference and false assumptions. The proposed solution can be transformed into a globally accessible, standardised instructions manual, which can significantly contribute to minimising human error during daily operational tasks on ships.

4

Analiza porównawcza języków C oraz Python na podstawie czasu wykonania aplikacji realizujących wybrane algorytmy

Rysak Paweł

Journal of Computer Sciences Institute

|

2023

|

Vol. 26

93--99

PL

Artykuł dotyczy analizy porównawczej szybkości wykonywania kodu przez język C oraz Python. Jej podstawowym celem nie było szukanie prostej odpowiedzi na pytanie, który z języków będzie wydajniejszy, tylko jaka jest skala różnic w wydajności tych języków. W celu określenia wydajności języka kompilowanego oraz skryptowego dokonano zestawienia języków na przykładzie następujących algorytmów: algorytm rozwiązujący problem wieży Hanoi, algorytm kodowania Huffmana oraz algorytm zamiany liczb na tekst. Każdy z wymienionych algorytmów został zaimplementowany w obydwu językach. Następnie dokonano pomiaru czasu realizacji programów, którego wyniki pozwoliły na określenie skali różnic w szybkości ich wykonania. W języku C aplikacje wykonywałysię od 6 do 188 razy szybciej niż aplikacje w języku Python

EN

The article deals with a comparative analysis of the speed of code execution written in the C language and Python. In order to determine whether a scripting language can match the performance of a compiled language, a comparison of the languages was made using the following algorithms: the algorithm for solving the Hanoi tower problem, the Huffman encoding algorithm and the algorithm for converting numbers into text. Each of the listed algorithms was implemented in both languages. Then the execution time of the programs was measured and the results were obtained, which prove that the C language achieves better performance in most cases.

5

Zaawansowana sztuczna inteligencja w aplikacjach przemysłowych

Dozór Techniczny

|

2023

|

z. 5

16--17

PL

Czy wkrótce nie tylko specjaliści będą w stanie serwisować specjalistyczne, przemysłowe urządzenia? Firma ABB i Microsoft pracują nad wdrożeniem generatywnej sztucznej inteligencji (GenAI) do przemysłu, która usprawni analizę danych i pomoże podjąć właściwą decyzję zapobiegającą awarii urządzeń.

6

Podsumowanie wyników projektu illuMINEation „Przemysłowa platforma IoT gwarantująca bezpieczne, zrównoważone i wydajne wydobycie” w zakresie rozwiązań sprzętowych i programowych

Paterek Marcin, Kobylańska Malwina

Cuprum : czasopismo naukowo-techniczne górnictwa rud

|

2023

|

nr 3-4

27--40

PL

W artykule przedstawiono rezultaty projektu illuMINEation „Przemysłowa platforma IoT gwarantująca bezpieczne, zrównoważone i wydajne wydobycie” („Bright concepts for a safe & sustainable digital mining future”), realizowanego w ramach programu Horyzont 2020 (Grant Agreement No. 869379). W projekcie tym postawiono sobie za cel stworzenie rozwiązań podnoszących bezpieczeństwo oraz efektywność procesów produkcji w górnictwie. Aby zrealizować te postanowienia, stworzono szereg rozwiązań zarówno sprzętowych, jak i algorytmów oraz oprogramowania. Projekty sprzętowe mają formę samodzielnych urządzeń i elementów zabudowywanych na maszynach górniczych, natomiast programowe mogą być samodzielną platformą IIoT, jak i algorytmami do zaimplementowania w obrębie istniejącej infrastruktury IT.

EN

The article presents the outcomes of the illuMINEation project "Bright concepts for a safe & sustainable digital mining future”, funded within the Horizon 2020 Programme (Grant Agreement No. 869379). This project aimed to create solutions that increase the safety and efficiency of production processes in mining. To implement these provisions, a number of hardware, software, and algorithm solutions were created. Hardware results take the form of stand-alone devices and elements built onto mining machines, while software projects may be stand-alone IIoT platform or algorithms to be implemented within the existing IT infrastructure.

7

Statistical procedures for determining of parameters for the evaluation of the condition and safety in logistic of military vehicles

Żółtowski Bogdan, Simiński Przemysław, Kosiuczenko Krzysztof

Systemy Logistyczne Wojsk

|

2022

|

Vol. 57, no. 2

143--159

EN

The use of technical condition assessment methods in the process of vehicle operation, which are the basis for automating the process of recognizing their current condition and safety, is synonymous with modernity. The purpose of this study is to present fragments of numerical procedures used for programmed studies of changes in the state, reliability, and safety of technical objects in use. The presented methodology, supported by elements of achievements in application of statistical methods, is the basis for a comprehensive assessment of supervised facilities, which are so important for innovative strategies for the operation of technical facilities. However, this requires optimization of the set of diagnostic parameters, development and optimization of condition control tests and optimization of genesis and prognosis methods. The solution to these tasks depends on many factors related to the degree of complexity of the objects, the quality of the operation process and the course of their aging and wear processes. The analysis and synthesis of the obtained research results should allow for the development of dedicated procedures and inference rules for the tested objects (vehicles) in the field of data acquisition and processing for the observation matrix, which is presented in the form of ready-made algorithms in this work. These are important procedures constituting the basis for more and more often built control and diagnostic systems introduced to facilities already at the stage of construction and production in modern technical facilities. Such systems are the basis for monitoring state changes, security threats, reliability, and supervision in the rational operation of technical facilities.

PL

Stosowanie w procesie eksploatacji pojazdów metod oceny stanu technicznego, które są podstawą automatyzacji procesu rozpoznawania ich aktualnego stanu i bezpieczeństwa, jest synonimem nowoczesności. Celem tego opracowania jest przedstawienie fragmentów procedur numerycznych stosowanych do programowanych badań zmian stanu, niezawodności i bezpieczeństwa użytkowanych obiektów technicznych. Przedstawiona metodologia wsparta elementami dokonań z obszaru zastosowań metod statystycznych to podstawy całościowej oceny nadzorowanych obiektów, jakże ważnych dla innowacyjnych strategii eksploatacji obiektów technicznych. Wymaga to jednak optymalizacji zestawu parametrów diagnostycznych, opracowania i optymalizacji testów kontrolnych stanu oraz optymalizacji metod genezy i prognozowania. Rozwiązanie tych zadań zależy od wielu czynników związanych ze stopniem skomplikowania obiektów, jakością procesu eksploatacji oraz przebiegiem procesów ich starzenia i zużycia. Analiza i synteza uzyskanych wyników badań powinna pozwolić na opracowanie dedykowanych procedur i reguł wnioskowania dla badanych obiektów (pojazdów) w zakresie pozyskiwania i przetwarzania danych do macierzy obserwacji, która jest przedstawiona w postaci gotowych algorytmów w tym pracowaniu. To ważne procedury stanowiące podstawę dla coraz częściej budowanych systemów sterująco – diagnostycznych wprowadzanych do obiektów już na etapie konstruowania i wytwarzania w nowoczesnych obiektach technicznych. Systemy takie są podstawą monitorowania zmian stanu, zagrożenia bezpieczeństwa, niezawodności i nadzoru w racjonalnej eksploatacji obiektów technicznych.

8

Wildfires in terms of unmanned systems. Current methods and solution review

Fellner Andrzej, Zawistowski Maciej

Prace Naukowe Politechniki Warszawskiej. Transport

|

2022

|

z. 134

35--51

EN

The analysis of the literature shows that numerous factors, such as Climate change, more and more frequent and long-lasting droughts, and the growing trend of using forests for recreational purposes, cause a constant increase in the risk of forest fires. Poland, despite having numerous and vast forest areas in the form of national or landscape parks, is classified as having an average risk of fire compared to other European countries. Currently, our country is characterized by the emergence of a large number of forest fires within a small area. In 2019, there were almost 9,200 such events, which put Poland in third place in Europe (behind Spain and Portugal). It should be noted, however, that large-scale forest fires with an area of several hundred hectares have occurred and are still a threat in Poland. Therefore, it has been proposed to use a proactive method to limit or compensate for the effects of hazards caused by large-scale fires, which are of key safety, environmental and economic importance. In the article, the authors focused on the presentation of the currently used solutions and compensation for the effects of these threats and presented possible prospective solutions based on the conducted and planned scientific research on monitoring large-scale fires and the possibility of forecasting them during operational activities, based on unmanned systems and techniques and satellite technologies.

PL

Z analizy literatury wynika, że liczne czynniki jak m.in. zmiana klimatu, coraz częściej występujące i długotrwałe susze czy rosnący trend wykorzystywania lasów do celów rekreacyjnych powodują ciągłe zwiększanie się ryzyka występowania ich pożarów. Polska, pomimo posiadania licznych i rozległych obszarów leśnych w postaci parków narodowych czy krajobrazowych jest na tle państw Europejskich klasyfikowana do obszarów częściowo o średnim i wysokim zagrożeniu pożarowym lasów. Obecnie dla naszego kraju cechą charakterystyczną jest powstawanie dużej liczby pożarów lasów o małej powierzchni. W 2019 r. takich zdarzeń odnotowano prawie 9 200, co stawiało Polskę na trzecim miejscu w Europie (za Hiszpanią i Portugalią). Należy jednak zaznaczyć, że wielkoobszarowe pożary lasów o powierzchni kilkuset hektarów, występowały i nadal stanowią zagrożenie w Polsce. W związku z tym zaproponowano zastosowanie metody proaktywnej w celu ograniczenia lub kompensowania skutków zagrożeń spowodowanych pożarami wielkoobszarowymi, które mają kluczowe znaczenie w zakresie bezpieczeństwa, ochrony środowiska i ekonomii. W artykule autorzy skupili się na przedstawieniu obecnie stosowanych rozwiązań oraz kompensacji skutków wynikających z tych zagrożeń oraz zaprezentowali możliwe perspektywiczne rozwiązania, w oparciu o przeprowadzone i planowane badania naukowe dotyczące monitorowania pożarów wielkoobszarowych i możliwości ich prognozowania podczas działań operacyjnych, w oparciu o systemy bezzałogowe i techniki i technologie satelitarne.

9

Za dużo i za mało

Ziemnicki Paweł

Geodeta : magazyn geoinformacyjny

|

2022

|

nr 6

20--24

10

Algorithms and calculation scheme for planning the way of movement of trajectory point during maneuvering for anchoring

Surinov I.

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

|

2021

|

Vol. 15 No. 3

629--638

EN

The analysis of the historical aspect of the development of the maneuvering during anchoring shows that during the movement there is no time to control the position by technical means, due to the speed of the process of changing the parameters of movement. The main purpose of this research is to modify the methodological basis for the preparation of flight planning during anchoring with increased accuracy to determine the coordinates along which the ship will move. The methodology of this work is based on the calculation of trajectory points of the path in combination with the method of segments on the map using the characteristics of the maneuverability of the vessel. The method is based on determining the coordinate matrices of rectilinear and curvilinear sections through which the vessel passes during maneuvering for anchoring. The calculation program is developed in Excel, and allows without the help of a micro calculator that takes into account the maneuverability of the vessel in the automatic system. Thus, the control of the center of gravity of the vessel relative to a given path line is performed. A high-precision system for automatic determination of planned coordinates by trajectory points on track and traffic control during anchoring has been developed, which is based on recently developed algorithms, calculation schemes and methods at the Maritime University, which are based on the latest meaningful models of high-precision planning movement on them. This approach automates the process of controlling safe traffic, including the use of decision support systems, including stranding prevention and collisions with other vessels. The results of the research can be used on a ship for automated planning of coordinates on waypoints and control of traffic on them for safe maneuvering, as well as for training navigators on specialized simulators to perform trajectory planning, including limited conditions.

11

New characterizations of reproducing kernel Hilbert spaces and applications to metric geometry

Alpay Daniel, Jorgensen Palle E.T.

Opuscula Mathematica

|

2021

|

Vol. 41, no. 3

283--300

EN

We give two new global and algorithmic constructions of the reproducing kernel Hilbert space associated to a positive definite kernel. We further present a general positive definite kernel setting using bilinear forms, and we provide new examples. Our results cover the case of measurable positive definite kernels, and we give applications to both stochastic analysis and metric geometry and provide a number of examples.

12

An Overview of the Methods of Synthesis, Realization and Implementation of Orthogonal 3-D Rotation Filters and Possibilities of Further Research and Development

Poczekajło Paweł

International Journal of Electronics and Telecommunications

|

2021

|

Vol. 67, No. 2

295--300

EN

In the paper, an overview of the methods and algorithms of synthesis, realization and implementation used by the author to obtain orthogonal 3-D filters with a structure made of Givens rotations has been presented. The main advantage of orthogonal filters, which may have a lower sensitivity to quantization of the coefficients, was indicated. The author proposed a number of possible changes and modifications of individual stages, which may result in obtaining filters with even better parameters. The work will be the basis for the direction of further research.

13

Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction

Cassez Franck, Jensen Peter Gjøl, Guldstrand Larsen Kim

Fundamenta Informaticae

|

2021

|

Vol. 178, nr 1/2

31--57

EN

We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using refinement of trace abstractions to solve both the reachability verification problem and the parameter synthesis problem for real-time programs. All of the algorithms proposed have been implemented and we have conducted a series of experiments, comparing the performance of our new approach to state-of-the-art tools in classical reachability, robustness analysis and parameter synthesis for timed systems. We show that our new method provides solutions to problems which are unsolvable by the current state-of-the-art tools.

14

Computing the Length of Sum of Squares and Pythagoras Element in a Global Field

Darkey-Mensah Mawunyo Kofi, Rothkege Beata

Fundamenta Informaticae

|

2021

|

Vol. 184, nr 4

297--306

EN

This paper presents algorithms for computing the length of a sum of squares and a Pythagoras element in a global field K of characteristic different from 2. In the first part of the paper, we present algorithms for computing the length in a non-dyadic and dyadic (if K is a number field) completion of K. These two algorithms serve as subsidiary steps for computing lengths in global fields. In the second part of the paper we present a procedure for constructing an element whose length equals the Pythagoras number of a global field, termed a Pythagoras element.

15

A Dynamical System Approach to Polyominoes Generation

Massazza Paolo

Fundamenta Informaticae

|

2021

|

Vol. 180, nr 3

251--273

EN

We describe a method which exploits discrete dynamical systems to generate suitable classes of polyominoes. We apply the method to design an algorithm that uses O(n) space to generate in constant amortized time all polyominoes corresponding to hole-free partially directed animals consisting of n sites on the square grid. By implementing the algorithm in C++ we have obtained a new sequence that does not appear in the On-Line Encyclopedia of Integer Sequences.

16

Układy FPGA jako sprzętowy analizator stanów pól komutacyjnych typu multi-log2N

Michalski Marek

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2020

|

nr 7-8

246--249, CD

PL

Niniejszy artykuł prezentuje system do symulacji i analizy stanu pól komutacyjnych. Główną cechą systemu jest to, że obliczenia saą realizowane w dedykowanych układach sprzętowych. Jako moduły obliczeniowe wykorzystane zostały moduł z programowalnym układem FPGA -Spartan-3 firmy Xilinx. Kilkanaście takich modułów zostało połączonych w szeregowy systemi pracuą˛pod kontrolą aplikacji www, która komunikuje się z węzłami obliczeniowymi za pośrednictwem Raspberry Pi, który to realizuje funkcjonalność proxy między typowym oprogramowaniem a programowalnymi układami sprzętowymi.

EN

In this paper there is presented a system for simulations realized in hardware. The subject are blocking states in optical switching fabrics. Model of such a fabric is presented, and the way of its analysis is described. FPGA Spartan-3 chips are used for fast calculations, Raspberry PI, small PC, is used as an interface between PC and electronic part of the system. System is dedicated for searching blocking states (which is realized in hardware) and their analysis (which is realized by GUI and software on PC). Main elements of system are:Web based GUI, scripts and database for storing results, subsystem for controlling FPGA chips (controller is realized on Raspberry PI and its GPIOs) and 18 (or more) FPGA modules as a calculating engines.

17

Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems

Wallace Richard J.

Fundamenta Informaticae

|

2020

|

Vol. 174, nr 3/4

311--344

EN

Algorithms based on singleton arc consistency (SAC) show considerable promise for improving backtrack search algorithms for constraint satisfaction problems (CSPs). The drawback is that even the most efficient of them is still comparatively expensive. Even when limited to preprocessing, they give overall improvement only when problems are quite difficult to solve with more typical procedures such as maintained arc consistency (MAC). The present work examines a form of partial SAC and neighbourhood SAC (NSAC) in which a subset of the variables in a CSP are chosen to be made SAC-consistent or neighbourhood-SAC-consistent. Such consistencies, despite their partial character, are still well-characterized in that algorithms have unique fixpoints. Heuristic strategies for choosing an effective subset of variables are described and tested, the best being choice by highest degree and a more complex strategy of choosing by constraint weight after random probing. Experimental results justify the claim that these methods can be nearly as effective as the corresponding full version of the algorithm in terms of values discarded or problems proven unsatisfiable, while significantly reducing the effort required to achieve this.

18

Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means

Berghammer Rudolf, Schnoor Henning, Winter Michael

Fundamenta Informaticae

|

2020

|

Vol. 177, nr 2

95--113

EN

Finite topological spaces and their dimensions have many applications in computer science, e.g., in digital topology, computer graphics and the analysis and synthesis of digital images. Georgiou et. al. [11] provided a polynomial algorithm for computing the covering dimension dim (X, 𝒯 ) of a finite topological space (X, 𝒯 ). In addition, they asked whether algorithms of the same complexity for computing the small inductive dimension ind (X, 𝒯 ) and the large inductive dimension Ind (X, 𝒯 ) can be developed. The first problem was solved in a previous paper [4]. Using results of the that paper, we also solve the second problem in this paper. We present a polynomial algorithm for Ind (X, 𝒯 ), so that there are now efficient algorithms for the three most important notions of a dimension in topology. Our solution reduces the computation of Ind (X, 𝒯 ), where the specialisation pre-order of (X, 𝒯 ) is taken as input, to the computation of the maximal height of a specific class of directed binary trees within the partially ordered set. For the latter an efficient algorithm is presented that is based on order- and graph-theoretic ideas. Also refinements and variants of the algorithm are discussed.

19

A Set-theoretic Approach to Reasoning Services for the Description Logic DL4,xD

Cantone Domenico, Nicolosi-Asmundo Marianna, Santamaria Daniele Francesco

Fundamenta Informaticae

|

2020

|

Vol. 176, nr 3/4

349--384

EN

In this paper we consider the most common TBox and ABox reasoning services for the description logic 𝒟ℒ〈4LQSR,x 〉(D) (𝒟 ℒD 4,×, for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment 4LQSR. 𝒟 ℒD 4,× is a very expressive description logic. It combines the high scalability and efficiency of rule languages such as the Semantic Web Rule Language (SWRL) with the expressivity of description logics. In fact, among other features, it supports Boolean operations on concepts and roles, role constructs such as the product of concepts and role chains on the left-hand side of inclusion axioms, role properties such as transitivity, symmetry, reflexivity, and irreflexivity, and data types. We further provide a KE-tableau-based procedure that allows one to reason on the main TBox and ABox reasoning tasks for the description logic 𝒟 ℒ D 4,× . Our algorithm is based on a variant of the KE-tableau system for sets of universally quantified clauses, where the KE-elimination rule is generalized in such a way as to incorporate the γ-rule. The novel system, called KEγ -tableau, turns out to be an improvement of the system introduced in [1] and of standard first-order KE-tableaux [2]. Suitable benchmark test sets executed on C++ implementations of the three mentioned systems show that in several cases the performances of the KEγ -tableau-based reasoner are up to about 400% better than the ones of the other two systems.

20

Wykorzystanie analizy wektorów do stworzenia algorytmów inteligentnego oprogramowania wspomagającego mikroskopowe badania jakościowe spoin

Padula Grzegorz, Jastrzębski Adam, Tuz Piotr, Kaczor Marek, Latała Zbigniew, Nowacki Jerzy, Cenin Mieczysław, Grozowska Edyta

Dozór Techniczny

|

2020

|

z. 5

22--30

PL

W artykule omówiono metody komputerowej analizy obrazów znane z celowników lotniczych (ukrywanej przez wojskowych naukowców ubiegłego wieku w psychologii i badaniach językowego opisu obrazu), analizy obrazu z kamery robota spawalniczego, komputerowego wspomagania badań mikroskopowych. W artykule do stworzenia algorytmów rozpoznawania struktur mikroskopowych stali wykorzystano znaną z językoznawstwa metodę zamiany metaforycznych wypowiedzi na wektory czyli na zapis matematyczny. W analizie wektorów uwzględniono odziedziczone i wyuczone typy zdolności. Wynik analizy, który jest identyczny dla algorytmów odpowiadających 3 typom zdolności daje pewność jednoznaczności. W innych przypadkach potrzebna jest dodatkowa wiedza dotycząca technologii powstawania badanych struktur mikroskopowych.