dr inż. Robert Ostrowski | Politechnika Gdańska

Treść strony

dr inż. Robert Ostrowski

Kontakt:

email:
robert.ostrowski@pg.edu.pl
strona:
https://mostwiedzy.pl/robert-ostrowski,692090-1

Zajmowane stanowiska:

Adiunkt

miejsce pracy:
Katedra Algorytmów i Modelowania Systemów
Budynek A Wydziału Elektroniki, Telekomunikacji i Informatyki, EA 209
telefon:
+48 58 347 19 56
dr inż. Robert Ostrowski

Publikacje:

  1. Publikacja

    - Rok 2024

    The work contains results regarding two problems posed to a group of mobile entities, called agents, and a survey of fields of research from which these problems originate. First, in the heterogeneous graph searching problem, the agents, also called searchers, are asked to find a fugitive in a graph with edges accessible only to specific types of agents. The rules of the edge searching problem are augmented by introducing labels...

    Pełny tekst do pobrania w portalu

  2. Publikacja

    - THEORETICAL COMPUTER SCIENCE - Rok 2021

    Every node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...

    Pełny tekst do pobrania w serwisie zewnętrznym

  3. In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...

    Pełny tekst do pobrania w serwisie zewnętrznym

  4. Publikacja

    - Rok 2019

    In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...

    Pełny tekst do pobrania w serwisie zewnętrznym

  5. Graph searching encompasses a variety of different models, many of which share a property that in optimal strategies fugitive can never access once searched regions. Monotonicity, as it is called, is vital in many established results in the field however its absence significantly impedes the analysis of a given problem. This survey attempts to gather non-monotone models, that are less researched in effort of summarizing the results...

dane pochodzą z portalu MOST Wiedzy otwiera się w nowej karcie MOST Wiedzy