The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Three-dimension (3D) path planning is a core and fundamental component to achieve high levels of autonomy for unmanned aerial vehicles (UAVs). Most of the existing methods determine the optimal path based on a discrete representation of the environmental data, which may produce metrication errors. In order to remedy this problem, we present a novel 3D path plan method, based on the framework of fast...
In this paper we study the point-to-point optimal path problem for the fixed-wing UAV in obstacle environment. We first characterize the structure of the optimal path in the presence of stationary circular obstacles and provide a proof of the NP-hardness of the optimal path problem. To simplify the planning complexity, a rapid and efficient path planning algorithm is proposed in this paper. The novel...
The Local Minima (LM) is the main problem of well-known artificial potential field (APF) method in the scope of obstacle avoidance. In this paper, we prove the existence of the local minima, which causes the unavoidable collision. Furthermore the concept of relative angle is added in repulsion calculation which makes repulsion change with angle among destination, the robot and obstacles. In addition,...
In this paper a fast and templatable planning framework is proposed to solve the automatic spray trajectory generating problem on typical regular surfaces including planes, cylindrical surfaces, conical surfaces and spherical surfaces. The elliptical double-beta static coating growth rate model is selected as a reference model, and the corresponding static models for regular surfaces are established...
With the development of robot technology, home service robots are stepping into families. Localization and navigation are the important issues of the mobile robot research. In this paper, an intelligent vision localization system for obstacle avoidance and grasp task of an indoor service robot is developed. The system comprises of a ceiling camera which is placed overhead of the robot and the camera...
This paper presents a kind of multi-UAVs cooperatively mission area searching algorithm with no-fly zones constraints. According to the existing environment and the states of UAVs, the search cost function is designed, and quantified the standard of flight path selecting of the UAVs. The search cost guids the UAVs to search the area along the flight path which has minimum cost. The algorithm is designed...
This paper proposes a decentralized cooperative tracking strategy based on the theory of consistency for multiple unmanned aerial vehicles (UAVs) cooperative tracking multiple moving targets. To achieve the tracking missions, the strategy estimates a communication principle to share information and to improve the efficiency of communication. On this basis, a decentralized task allocation model based...
This paper presents a path planning algorithm named APF-IRP, which can be applied in complex dynamic environment for Unmanned Aerial Vehicles (UAVs). As is known to all, it is difficult for UAVs to have a clear understanding of the global environmental information before taking off. So the concept of rolling window is introduced to detect the dynamic and static obstacles within a certain range by...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.