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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Prédicats, sens, polylexicalité et figement : un parcours heuristique
    Predicates, Sense, Polylexicality, and Freezing: a heuristic path
    Autorzy:
    Mejri, Salah
    Powiązania:
    https://bibliotekanauki.pl/articles/31341264.pdf
    Data publikacji:
    2023
    Wydawca:
    Wydawnictwo Uniwersytetu Śląskiego
    Tematy:
    Gaston Gross
    Frozenes
    Polylexicality
    Semantic opacity
    Heuristic path
    Opis:
    Pour Gaston Gross, étudier rigoureusement la langue revient à en décrire, dans le cadre de la combinatoire libre, l’ensemble des emplois des unités lexicales moyennant l’établissement des paradigmes argumentaux impliqués dans les schémas d’arguments pour les prédicats et l’ensemble des prédicats appropriés pour les arguments. Cette démarche est complétée par la description des séquences figées dont la combinatoire interne est plus ou moins restreinte. L’auteur y consacre son ouvrage de 1996 et une partie de son manuel de 2012. Nous retenons dans cette contribution l’extrême richesse de la réflexion de l’auteur, notamment sur le plan heuristique, en partant des concepts de prédicat, de figement, de polylexicalité et d’opacité sémantique pour montrer combien les suggestions méthodologiques de Gaston Gross ont eu d’impact sur le développement de la discipline linguistique.
    For Gaston Gross, a rigorous study of the language means describing all the uses of lexical units of the language within the framework of free combinatorics, by determining the argumental paradigms involved in the schemes of arguments for predicates and all the appropriate predicates for arguments. This approach is complemented by a description of frozen sequences whose internal combinatoriality is more or less restricted. The author devotes his work of 1996 and part of his textbook of 2012 to this subject. Our contribution highlights the great richness of the author’s thoughts particularly from a heuristic point of view. We start from the concepts of predicate, frozeness, polylexicality and semantic opacity to show how much impact Gaston Gross’s methodological suggestions have had on the development of the discipline of linguistics.
    Źródło:
    Neophilologica; 2023, 35; 1-40
    0208-5550
    2353-088X
    Pojawia się w:
    Neophilologica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-strategy navigation for a mobile data acquisition platform using genetic algorithms
    Autorzy:
    Halal, F.
    Zaremba, M. B.
    Powiązania:
    https://bibliotekanauki.pl/articles/950950.pdf
    Data publikacji:
    2017
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    genetic algorithms
    path planning
    monitoring system
    remote sensing
    navigation control
    heuristic search
    Opis:
    Monitoring of biological and chemical pollutants in large bodies of water requires the acquisition of a large number of in-situ measurements by a mobile sensor platform. Critical to this problem is an efficient path planning method, easily adaptable to different control strategies that ensure the collection of data of the greatest value. This paper proposes a deliberative path planning algorithm, which features the use of waypoints for a ship navigation trajectory that are generated by Genetic Algorithm (GA) based procedures. The global search abilities of Genetic Algorithms are combined with the heuristic local search in order to implement a navigation behaviour suitable to the required data collection strategy. The adaptive search system operates on multi-layer maps generated from remote sensing data, and provides the capacity for dealing with multiple classes of water pollutants. A suitable objective function was proposed to handle different sampling strategies for the collection of samples from multiple water pollutant classes. A region-of-interest (ROI) component was introduced to deal effectively with the large scale of search environments by pushing the search towards ROI zones. This resulted in the reduction of the search time and the computing cost, as well as good convergence to an optimal solution. The global path planning performance was further improved by multipoint crossover operators running in each GA generation. The system was developed and tested for inland water monitoring and trajectory planning of a mobile sample acquisition platform using commercially available satellite data.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2017, 11, 1; 30-41
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Model–based energy efficient global path planning for a four–wheeled mobile robot
    Autorzy:
    Jaroszek, P.
    Trojnacki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206564.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    four-wheeled mobile robot
    global path planning
    robot dynamics model
    heuristic algorithm
    energy efficiency
    Opis:
    This paper concerns an energy efficient global path planning algorithm for a four-wheeled mobile robot (4WMR). First, the appropriate graph search methods for robot path planning are described. The A* heuristic algorithm is chosen to find an optimal path on a 2D tile-decomposed map. Various criteria of optimization in path planning, like mobility, distance, or energy are reviewed. The adequate terrain representation is introduced. Each cell in the map includes information about ground height and type. Tire-ground interface for every terrain type is characterized by coefficients of friction and rolling resistance. The goal of the elaborated algorithm is to find an energy minimizing route for the given environment, based on the robot dynamics, its motor characteristics, and power supply constraints. The cost is introduced as a function of electrical energy consumption of each motor and other robot devices. A simulation study was performed in order to investigate the power consumption level for diverse terrain. Two 1600 m2 test maps, representing field and urban environments, were decomposed into 20x20 equal-sized square-shaped elements. Several simulation experiments have been carried out to highlight the differences between energy consumption of the classic shortest path approach, where cost function is represented as the path length, and the energy efficient planning method, where cost is related to electrical energy consumed during robot motion.
    Źródło:
    Control and Cybernetics; 2014, 43, 2; 337-363
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
    Autorzy:
    Viattchenin, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/406450.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    project-network
    dominant path
    heuristic possibilistic clustering
    interval-valued data
    stationary clustering structure
    typical point
    Opis:
    This paper deals in a preliminary way with the problem of selecting the smallest possible number of dominant paths in a minimized project-network with given bounds on the permissible values of the durations of activities. For this purpose, a classification technique is proposed. This technique is based on a heuristic possibilistic clustering of interval-valued data. The basic concepts of heuristic possibilistic clustering are defined and methods for preprocessing interval-valued data are described. An illustrative example is considered in detail and some conclusions are formulated.
    Źródło:
    Operations Research and Decisions; 2015, 25, 4; 71-87
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    D* Extra Lite: A dynamic A* with search-tree cutting and frontier-gap repairing
    Autorzy:
    Przybylski, M.
    Putz, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/329769.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    shortest path planning
    incremental heuristic search
    mobile robot navigation
    video game
    planowanie najkrótszej ścieżki
    wyszukiwanie heurystyczne
    nawigacja robota mobilnego
    gra wideo
    Opis:
    Searching for the shortest-path in an unknown or changeable environment is a common problem in robotics and video games, in which agents need to update maps and to perform re-planning in order to complete their missions. D* Lite is a popular incremental heuristic search algorithm (i.e., it utilizes knowledge from previous searches). Its efficiency lies in the fact that it re-expands only those parts of the search-space that are relevant to registered changes and the current state of the agent. In this paper, we propose a new D* Extra Lite algorithm that is close to a regular A*, with reinitialization of the affected search-space achieved by search-tree branch cutting. The provided worst-case complexity analysis strongly suggests that D* Extra Lite’s method of reinitialization is faster than the focused approach to reinitialization used in D* Lite. In comprehensive tests on a large number of typical two-dimensional path-planning problems, D* Extra Lite was 1.08 to 1.94 times faster than the optimized version of D* Lite. Moreover, while demonstrating that it can be particularly suitable for difficult, dynamic problems, as the problem-complexity increased, D* Extra Lite’s performance further surpassed that of D*Lite. The source code of the algorithm is available on the open-source basis.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 273-290
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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