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.
This paper presents a decentralized method to the problem of multiple unmanned aerial vehicles (UAVs) cooperative search of an unknown area. Firstly, based on search map model, the multiple UAVs cooperative search problem is posed as a receding horizon (RH) optimization decision problem, and a RH based UAV search decision process is proposed. Then, this centralized online optimization problem is partitioned...
This paper proposes an algorithm for seeking the shortest path between two nodes in city's road net according to the characteristics of the net. The algorithm takes advantage of the theories of bidirectional search, projection, minimum angle and binary tree. According to the algorithm analysis , the algorithm can reduce seeking space and raise seeking speed greatly, and its time complexity can not...
The coverage path planning algorithm can be defined as making integration the robot's footprint identical to that of the target region [Choset]. The spanning tree coverage which is one of the coverage path planning algorithm is proved to be optimal in the sense that there is no repetitive coverage [Gabriely]. But the online version of spanning tee coverage shows spiral moving pattern which can cause...
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.