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 studies the fault-tolerant cooperative control problem of agent groups in the context of multi-agent flocking tasks with second order linear dynamics. A distributed flocking algorithm with biconnected topology is proposed which is composed of two parts: motion strategy of biconnectivity and fault-tolerant flocking algorithm with bounded control input. The proposed algorithm handles the...
This paper focuses on the concept of multi-path virtual concatenation as a key enabling technology to support the requirements of spectrum bandwidth of link mapping in the process of virtual network embedding (VNE). A dynamic VNE_MP algorithm for distributed data centers inter-connecting is proposed. Based on the multi-path virtual concatenation mechanisms, a virtual link is split into multiple smaller...
A new model of time division duplex long term evolution (TD-LTE) system considering crossed time slot (CTS) interference is proposed in this paper because CTS interference may greatly affect system performance. An improved quantum evolutionary algorithm (QEA) is put forward to solve the model efficiently. The proposed QEA enhances the global search capability and has a good convergence due to the...
Breadth-First Search (BFS) is a basis for many graph traversal and analysis algorithms. In this paper, we present a direction-optimizing BFS implementation on CPU-GPU heterogeneous platforms to fully exploit the computing power of both the multi-core CPU and GPU. For each level of the BFS algorithm, we dynamically choose the best implementation from: a sequential top-down execution on CPU, a parallel...
Distributed camera networks represent an emerging trend for the incorporation of mobile smart cameras in next generation large-scale surveillance systems. To achieve the great benefits of mobile smart camera, two challenging issues, the limited computational capabilities of a smart camera and the energy constraints of its battery-powered mobile platform, should be faced. This paper investigates the...
Collision between robots and the global minimum point, which exist in the traditional artificial potential field (TAPF), seriously affect the formation of multi-robot system. The paper constructs a dynamic artificial potential field (DAPF) based on the local information to solve the problem of the TAPF. Collisions between robots are avoided by introducing the repulsion between robots. The problem...
Traveling Salesman Problem is a very classical optimization problem in the field of operations research, and often-used benchmark for new optimization techniques. This paper will to bring up multi-agent approach for solving the Traveling Salesman Problem based on data mining algorithm, for the extraction of knowledge from a large set of Traveling Salesman Problem. The proposed approach supports the...
The problem of computing a route for a mobile agent to local regions or specified nodes in a distributed sensor network is considered, both in a single region or multi-region cases. With all specified nodes visited, this paper formulates the route computation problem in terms of minimizing an objective function, which is directly proportional to the energy consumption and path loss. Further, we propose...
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.