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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    Tytuł:
    Non-cooperative game approach to multi-robot planning
    Autorzy:
    Gałuszka, A.
    Świerniak, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/908521.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    zagadnienie projektowe
    robot wielofunkcyjny
    gra niekooperatywna
    planowanie kompleksowe
    planning problems
    multi-robot environment
    STRIPS language
    non-cooperative games
    planning complexity
    Opis:
    A multi-robot environment with a STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS language (for instance, a Block World environment) with one initial state and a disjunction of goal states. If the STRIPS planning problem is invertible, then it is possible to apply the machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution to the original problem. In the paper a planning algorithm that solves the problem described above is proposed and its computational complexity is analyzed. To make the plan precise, non-cooperative strategies are used.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2005, 15, 3; 359-367
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On transformation of conditional, conformant and parallel planning to linear programming
    Autorzy:
    Galuszka, Adam
    Probierz, Eryka
    Powiązania:
    https://bibliotekanauki.pl/articles/1409385.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    planning
    conformant planning
    conditional planning
    parallel planning
    uncertainty
    linear programming
    computational complexity
    Opis:
    Classical planning in Artificial Intelligence is a computationally expensive problem of finding a sequence of actions that transforms a given initial state of the problem to a desired goal situation. Lack of information about the initial state leads to conditional and conformant planning that is more difficult than classical one. A parallel plan is the plan in which some actions can be executed in parallel, usually leading to decrease of the plan execution time but increase of the difficulty of finding the plan. This paper is focused on three planning problems which are computationally difficult: conditional, conformant and parallel conformant. To avoid these difficulties a set of transformations to Linear Programming Problem (LPP), illustrated by examples, is proposed. The results show that solving LPP corresponding to the planning problem can be computationally easier than solving the planning problem by exploring the problem state space. The cost is that not always the LPP solution can be interpreted directly as a plan.
    Źródło:
    Archives of Control Sciences; 2021, 31, 2; 375-399
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Military route planning in battlefield simulation: effectiveness problems and potential solutions
    Autorzy:
    Tarapata, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/309343.pdf
    Data publikacji:
    2003
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    battlefield simulation
    route planning
    shortest paths
    effectiveness problems
    computational complexity
    Opis:
    Path searching is challenging problem in many domains such as simulation war games, robotics, military mission planning, computer generated forces (CGF), etc. Effectiveness problems in military route planning are related both with terrain modelling and path planning algorithms. These problems may be considered from the point of view of many criterions. It seems that two criterions are the most important: quality of terrain reflection in the terrain model and computational complexity of the on(off)-line path planning algorithm. The paper deals with two above indicated problems of route planning effectiveness. Comparison of approaches used in route planning is presented. The hybrid, terrain merging-based and partial path planning, approach for route planning in dynamically changed environment during simulation is described. It significantly increase effectiveness of route planning process. The computational complexity of the method is given and some discussion for using the method in the battlefield simulation is conducted. In order to estimate how many times faster we can compute problem for finding shortest path in network with n big squares (b-nodes) with relation to problem for finding shortest path in the network with V small squares (s-nodes) acceleration function is defined and optimized.
    Źródło:
    Journal of Telecommunications and Information Technology; 2003, 4; 47-56
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the dual nature of urban planning system and its complexity
    Autorzy:
    Hoblyk, A.
    Suprun, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/370514.pdf
    Data publikacji:
    2016
    Wydawca:
    Zachodniopomorski Uniwersytet Technologiczny w Szczecinie. Wydawnictwo Uczelniane ZUT w Szczecinie
    Tematy:
    urban planning system
    dynamic nature
    duality
    complexity
    demo-ecological concept
    evolutionary-synergetic paradigm
    city complexity theory
    Opis:
    This article presents an analysis of scientific ideas of the followers of the Complexity Theories of Cities and representatives of the Ukrainian urban planning school pertaining to the structure of the urban planning system, its nature and complexity. The dual nature of the urban planning system is explained on the examples using I. Newton’s analog method.
    Źródło:
    Przestrzeń i Forma; 2016, 27; 111-116
    1895-3247
    2391-7725
    Pojawia się w:
    Przestrzeń i Forma
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On transformation of STRIPS planning to linear programming
    Autorzy:
    Galuszka, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/229963.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    planning
    problem solving
    block world
    uncertainty
    linear programming
    computational complexity
    Opis:
    STRIPS language is a convenient representation for artificial intelligence planning problems. Planning is a task of coming up with a sequence of actions that will achieve a goal. In this work a heuristic of polynomial transformation of STRIPS planning problem to linear programming problem (LP) is presented. This is done because planning problems are hard computational problems (PSPACE- complete in general case) and LP problems are known to be computational easy. Representation of STRIPS planning as a set of equalities and inequalities based on the transformation is also proposed. The exemplary simulation shows the computational efficiency of solving planning problem with proposed transformation.
    Źródło:
    Archives of Control Sciences; 2011, 21, 3; 243-267
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Limits of and Alternatives to Conventional Medicine in the Context of Terminal Illness (e.g., Palliative Care)
    Autorzy:
    Bastianello, Stefania
    Cattaneo, Daniela Antonella
    Powiązania:
    https://bibliotekanauki.pl/articles/29433352.pdf
    Data publikacji:
    2022
    Wydawca:
    Uniwersytet im. Adama Mickiewicza w Poznaniu
    Tematy:
    Defining palliative care
    not cure but care
    complexity
    advance care planning
    bioethics
    Opis:
    This paper aims at analysing the evolution of palliative care in the international context and their role in the path of care for the patient and the family. Method: born in 1967 by Cicely Saunder, palliative care were aimed at assisting the terminally ill, accommodating both the needs of the patient and the family. Not only to be cured or healed, but to be taken care of. The paper examines the definitions of palliative care provided by the World Helth Organization. We observe that palliative care is not only an effective and timely response to the clinical, psychological, social and spiritual needs of the sick person and their family in an advanced and terminal stage, but an integrated care to support specialist treatment in the presence of an advanced disease picture; a space for in-depth study for the sick person and the family so that the sick person can consciously and freely choose the available treatment proposals, their limits and their consequences. A treatment path in which the transparency of the proposals is a condition for building a shared consensus with the patient and adequate communication with the family. Palliative care has acquired its own identity, its own role in the path of care for the patient and the family, pursuing the proportionality of therapeutic options and the support of the patient and the family without discrimination, with equity and equality.
    Źródło:
    Ethics in Progress; 2022, 13, 2; 57-75
    2084-9257
    Pojawia się w:
    Ethics in Progress
    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ł:
    Application of 3D virtual city models in urban analyses of tall buildings : today practice and future challenges
    Autorzy:
    Czyńska, K.
    Rubinowicz, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/398625.pdf
    Data publikacji:
    2014
    Wydawca:
    Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
    Tematy:
    model 3D
    trójwymiarowy model miasta
    planowanie urbanistyczne
    miasto
    3D
    virtual city models
    tall buildings
    city complexity
    urban planning
    Opis:
    The complex geometry of the city structure and the increasing speed of ongoing urban transformations in large European cities, requires powerful tools for the analysis, design and management. Virtual 3D city models can be an important tool in urban planning, used to diagnose phenomena produced by tall buildings. In recent years, the issue has become a considerable challenge for the cohesion of the European urban landscape. This paper presents foundations of a research project under Polish-Norwegian financing mechanism called 2TaLL. The project examines possibilities and limitations of using virtual 3D models of cities to provide advanced urban analyses focused on simulating impact tall buildings have on landscapes of European cities. The research is an interdisciplinary combination of geo-information and urban planning and contributes to the development of theory & applications in the two fields of engineering science.
    Źródło:
    Architecturae et Artibus; 2014, 6, 1; 9-13
    2080-9638
    Pojawia się w:
    Architecturae et Artibus
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Synergia jako wytyczna do budowania struktury centrum miasta
    Synergy as a guideline for the city center structure building
    Autorzy:
    Gachowski, Marek
    Powiązania:
    https://bibliotekanauki.pl/articles/2064123.pdf
    Data publikacji:
    2021
    Wydawca:
    PWB MEDIA Zdziebłowski
    Tematy:
    struktura urbanistyczna
    złożoność
    zróżnicowanie
    sąsiedztwo
    synergia
    symbioza
    zastosowanie grafów
    projektowanie urbanistyczne
    urban structure
    complexity
    diversitivness
    neighbourhood
    synergy
    symbiosis
    graphs application
    urban planning
    Opis:
    Złożoność oraz zróżnicowanie przestrzeni miejskiej są wartością, decydują o jej jakości szczególnie w obszarach śródmiejskich i centralnych. Dzięki zróżnicowaniu możliwe jest zadziałanie mechanizmów synergii oraz symbiozy. Dla sukcesu projektowania urbanistycznego kluczowa jest pełna i weryfikowalna kwantyfikacja oraz waloryzacja złożoności i różnorodności, a więc warunków dla symbiozy oraz wystąpienia efektu synergii. Graficzny zapis relacji przestrzennych, typowy dla prac urbanistycznych z wykorzystaniem grafów, wydaje się obiecujący dla zobiektywizowania efektów.
    Complexity and diversitivness (“mixed-use” nowadays) of urban space are crucial for a quality of that, especially in downtowns and city centers. Synergy and symbiosis effects could be obtained only when complexity, complementarity and diversitivness are established in urban space. The successful urban planning is possible only in the case, complex, verifiable quantification and valorization of complexity and diversitivness, (condition “sine qua non” for symbiosis and synergy effects) is applicable. Graphic record of space relations surveying complexity and diversitivness, typical for urban designing works, done with elements of graph transcription seems to be successful.
    Źródło:
    Builder; 2021, 25, 10; 34--39
    1896-0642
    Pojawia się w:
    Builder
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      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