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.
The trajectory planning of Unmanned Aerial Vehicle (UAV) and Aerial Robots generally refers to a series of optimization problems. This paper presents a method of trajectory planning and design for UAV based on the A* algorithm. Using grids to process the trajectory path planning of UAV under the environment with presence of obstacles, and then search the shortest path from the initial point to the...
This paper presents a method of trajectory planning and design for Unmanned Aerial Vehicle (UAV) based on the A∗ algorithm. Using grids to process the trajectory path planning of UAV under the environment with presence of obstacles, and then find the shortest path from the initial point to the target point based on rasterized environment using A∗ algorithm. The simulation of trajectory planning is...
Iris location is an essential module in iris recognition. Traditional iris location methods involve a large range of search, which is computation wasting and sensitive to noise. And these methods adopt circular template to locate the pupillary boundary. It may not accurately describe the pupillary actual boundary and bring the error for the following feature extraction and recognition. To address...
In this paper, a new nonlinear structure called Nettree is proposed. A Nettree is different from a tree in that a node may have more than one parent. An algorithm, named Nettree for pattern Matching with flexible wildcard Constraints (NAMEIC), based on Nettree is designed to solve pattern matching with flexible wildcard constraints. The problem is exponential with regard to the pattern length m. We...
Wireless Sensor Network (WSN) nodes are powered by limited battery and communication consumes most of the energy. Therefore, it's not appropriate to transmit data directly in the networks while compressing data before sending is an effective method to save energy for nodes. According to the need for fully recovering the compressed numerical data, based on the LZW (Lempel-Ziv-Welch) algorithm, this...
Previous algorithms mine the complete set of sequential patterns in large database efficiently, but when mining long sequential patterns in dense databases or using low minimum supports, it may produce many redundant patterns and some uninterested patterns. In this paper, a novel weighted closed sequential pattern mining algorithm (WCSpan) is presented, which implements the closed sequential pattern...
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.