Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
This paper gives the complete mathematical model of multi-robot cooperative hunting behavior via tasks modeling and robot-environment interaction modeling. The macro mathematical model is formulated by rate equations. Each dynamic variable in the macro model corresponds to the average number of robots in that state. The evolution of robot collective behaviors represents the transition between different...
This paper presents an algorithm of complete coverage path planning (CCPP) for mobile robot in unknown environment based on the Finite State Machine (FSM) approach and rolling windows approach. The rolling window approach is used to detect the local environments. The robot only uses on-board sensors to acquire a limited range knowledge of the surroundings and construct the rolling windows. Then it...
An adaptive quantum-inspired evolutionary algorithm based on Hamming distance (HD-QEA) was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step (RAS) was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA,...
Broadcasting message via the social web, people always hope that the message goes through the most credible path, and would like to know trustworthiness on the most credible path and the least credible path. To solve these problems, this article defines the concepts related to the most credible path and the least credible path for single-source broadcast. Proposes algorithms on the most credible path...
Based on node influence, establishes a maximum spread model of single-source influence, defines concepts related to maximum spread of single-source influence, proposes the polynomial time algorithm of maximum influence on single-source, quantifies the largest node set influenced by single-source, computes the most influential node in a social network. Our algorithms significantly out-perform node...
Based on trustworthiness, defines a couple of concepts associated with trusted path, the most trusted path and the least trusted path. In order to look for the most trusted path and the least trusted path we propose two trusted path algorithms, which are proved to be really the most credible and the least credible; quantify the trustworthiness of the most trusted path and the least trusted path; and...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.