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.
Safety and efficiency of carrier flight deck are two important factors that have great effects on the comprehensive performance of carrier. This paper studies on path planning algorithms for carrier aircraft on the deck in consideration of safety and efficiency requirements. Firstly, a kinematic model of the carrier aircraft, obstacle avoidance models and boundary constraints are proposed. Subsequently,...
We present an algorithm for solving the shortest (collision-free) path planning problem for an agent (e.g., wheeled vehicle, UAV) operating in a partially known environment. The agent has detailed knowledge of the environment and the obstacles only in the vicinity of its current position. Far away obstacles or the final destination are only partially known and may even change dynamically at each instant...
This paper proposed an improved algorithm that we call “D++” which can be applied to real-time and collision-free path -planning to solve some problems of common methods at present. D++ algorithm combines the Dijkstra's algorithm with sensor-based method so that D++ algorithm can deal with problems of unknown, large, complex, or dynamic environment, and need only local environmental information initially...
We present a construction-by-correction approach to solve the obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction problem. We build an obstacle-weighted spanning tree as a guidance to construct OARSMT on an escape graph. We use Dijkstra's algorithm for routing. A refinement of U- shaped removal is applied during the routing process to further reduce the wire length. Our experimental...
In the defence domain, weapons allocation is defined to be the reactive assignment of weapon systems to engage or counter identified threats. From a command perspective, this refers to the allocation of friendly and coalition force elements (e.g. fighter aircraft, frigates etc.) to engage or interdict adversaries which are posing threats, not only to themselves, but also to defended areas and high-value...
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.